In this paper, finite element discretizations of the degenerated operator -ω²(y) u_xx-ω²(x)u_yy=g in the unit square are investigated, where the weight function satisfies ω(ξ)=ξ^α with α ≥ 0. We propose two multi-level methods in order to solve the resulting system of linear algebraic equations. The first method is a multi-grid algorithm with line-smoother. A proof of the smoothing property is given. The second method is a BPX-like preconditioner which we call MTS-BPX preconditioner. We show that the upper eigenvalue bound of the MTS-BPX preconditioned system matrix grows proportionally to the level number.

In the adaptive finite element method, the solution of a p.d.e. is approximated from finer and finer meshes, which are controlled by error estimators. So, starting from a given coarse mesh, some elements are subdivided a couple of times. We investigate the question of avoiding instabilities which limit this process from the fact that nodal coordinates of one element coincide in more and more leading digits. In a previous paper the stable calculation of the Jacobian matrices of the element mapping was given for straight line triangles, quadrilaterals and hexahedrons. Here, we generalize this ideas to linear and quadratic triangles on curved boundaries.

In this thesis we have studied several aspects of the minimal realization problem for descriptor systems. These aspects include purely theoretical questions such as that about the order of a minimal realization of a general improper rational matrix and problems of a numerical nature, like rounding error analysis of the computing a minimal realization from a nonminimal one. We have also treated the minimal partial realization problem for general descriptor systems with application to model reduction and to generalised eigenvalue problems.

The presented thesis deals with the multi-dimensional reconstruction of the earth's conductivity distribution based on DC resistivity data. This task represents a nonlinear and ill-posed minimization problem with many degrees of freedom. In this work, techniques for regularization and controlling of this problem are depicted and classified. Particularly, it is concentrated on explicit regularization types, which impose constraints onto the model. The system of equations as resulting from the application of the Gauss-Newton minimization can be solved efficiently. Furthermore, it is shown how the regularization strength can be controlled. The method of non-linear resolution analysis plays a central role in the thesis. It represents a powerful tool to estimate the quality of inversion results. Furthermore, the derived resolution measures provide the basis for the optimization of experimental design concerning information content and efficiency. Methods of error estimation, forward modeling and the calculation of the Jacobian matrix for DC resistivity data are developed. Procedures for appropriate parameterization and inversion control are pointed out by studies of synthetic models. Different inversion and regularization methods are examined in detail. A linearized study is used to compare different data sets considering their efficiency. Moreover, a triplegrid-technique for the incorporation of topography into three-dimensional inversion is presented. Finally the inversion methods are applied to field data. The depicted optimization strategies are realized in practice, which increases the economic relevance of threedimensional data acquisition. The structure of the subsurface is imaged in detail for several applications in the fields of cavity detection, archaeology and the investigation of ground falls. The resolution analysis is successfully established to appraise the obtained results.

This paper deals with a connection between two decision problems for recognizable trace languages: the star problem and the finite power property problem. Due to a theorem by Richomme from 1994 [26, 28], we know that both problems are decidable in trace monoids which do not contain a C4 submonoid. It is not known, whether the star problem or the finite power property are decidable in the C4 or in trace monoids containing a C4. In this paper, we show a new connection between these problems. Assume a trace monoid IM (Σ, I) which is isomorphic to the Cartesian Product of two disjoint trace monoids IM (Σ1, I1) and IM (Σ2, I2). Assume further a recognizable language L in IM (Σ, I) such that every trace in L contains at least one letter in Σ1 and at least in one letter in Σ2. Then, the main theorem of this paper asserts that L* is recognizable iff L has the finite power property.

Wir betrachten die Detektion und Lokalisation von plötzlichen Änderungen in der Kovarianzstruktur hochdimensionaler zufälliger Daten. Diese Arbeit schlägt zwei neuartige Ansätze für dieses Problem vor. Die Vorgehensweise beinhaltet im Wesentlichen Verfahren zum Test von Hypothesen, welche ihrerseits die Wahl geeigneter kritischer Werte erfordern. Dafür werden Kalibrierungsschemata vorgeschlagen, die auf unterschiedlichen Nichtstandard-Bootstrap-Verfahren beruhen. Der eine der beiden Ansätze verwendet Techniken zum Schätzen inverser Kovarianzmatrizen und ist durch Anwendungen in der neurowissenschaftlichen Bildgebung motiviert. Eine Beschränkung dieses Ansatzes besteht in der für die Schätzung der „Precision matrix“ wesentlichen Voraussetzung ihrer schwachen Besetztheit. Diese Bedingung ist im zweiten Ansatz nicht erforderlich. Die Beschreibung beider Ansätze wird gefolgt durch ihre theoretische Untersuchung, welche unter schwachen Voraussetzungen die vorgeschlagenen Kalibrierungsschemata rechtfertigt und die Detektion von Änderungen der Kovarianzstruktur gewährleistet. Die theoretischen Resultate für den ersten Ansatz basieren auf den Eigenschaften der Verfahren zum Schätzen der Präzisionsmatrix. Wir können daher die adaptiven Schätzverfahren für die Präzisionsmatrix streng rechtfertigen. Alle Resultate beziehen sich auf eine echt hochdimensionale Situation (Dimensionalität p >> n) mit endlichem Stichprobenumfang. Die theoretischen Ergebnisse werden durch Simulationsstudien untermauert, die durch reale Daten aus den Neurowissenschaften oder dem Finanzwesen inspiriert sind. / We consider the detection and localization of an abrupt break in the covariance structure of high-dimensional random data. The study proposes two novel approaches for this problem. The approaches are essentially hypothesis testing procedures which requires a proper choice of a critical level. In that regard calibration schemes, which are in turn different non-standard bootstrap procedures, are proposed. One of the approaches relies on techniques of inverse covariance matrix estimation, which is motivated by applications in neuroimaging. A limitation of the approach is a sparsity assumption crucial for precision matrix estimation which the second approach does not rely on. The description of the approaches are followed by a formal theoretical study justifying the proposed calibration schemes under mild assumptions and providing the guaranties for the break detection. Theoretical results for the first approach rely on the guaranties for inference of precision matrix procedures. Therefore, we rigorously justify adaptive inference procedures for precision matrices. All the results are obtained in a truly high-dimensional (dimensionality p >> n) finite-sample setting. The theoretical results are supported by simulation studies, most of which are inspired by either real-world neuroimaging or financial data.

“Origami-mathematics lessons” (Boakes, 2006) blend the ancient art of paper folding with the teaching of mathematics. Though a plethora of publications can be easily found advocating the benefits of Origami in the teaching of mathematics, little research exist to quantify the impact Origami has on the learning and building of mathematical skills. The research presented in this paper targets this common claim focusing on how Origamimathematics lessons taught over an extended period of time impact students’ knowledge of geometry and their spatial visualization abilities. The paper begins with a brief overview of Origami as it relates to teaching mathematics followed by a summary of research done with two age groups: middle school children and college students. Gathered data in these two studies suggest that Origami-mathematics lessons are as beneficial as traditional instructional methods in teaching mathematics.

This paper addresses the idea that the successful of mathematics reform demands the support of the full educational community including school principals, parents, and students. One of the most important group that affect mathematics reform is school principals. A project related to modifying UAE principals’ perceptions of mathematics is presented. This project consists three steps. In the first step, principals’ perceptions of the nature of Mathematics and its learning and teaching were examined. Results showed that those principals possess many improper perceptions related to Mathematics. In the second step, a professional training program for promoting school principals\'' understanding of the new vision of teaching and learning mathematics has developed. This training program comprises two integrated phases: Clarification and conviction, and implementations for principal’s role. It includes a package of paper documents, videotapes, discussion sessions, and group and individual activities. In the third step, the training program is applied on eight principals in UAE. An initial analysis of the qualitative data showed many positive improvements in principals’ perceptions of mathematics education.

Students today need to be taught not only the real life context of their mathematics lessons but also the historical context of the theory behind their mathematics lessons. Using history to teach mathematics, makes your lessons not only interesting but more meaningful to a large percentage of your students as they are interested in knowing the who, how and why about certain rules, theorems, formulas that they use everyday in class. Students are captivated by learning the history behind mathematicians, rules, etc. and therefore can link the lesson to something in history and a concept. Even learning the mathematics behind historical events motivates and interests them. They cannot get enough!

The results of a questionnaire that should reveal students’ knowledge about the use of computers in mathematics and the relevance of applications of mathematics in our society clearly show that current math teaching does not provide adequate ideas about the importance of computers. We describe the results and give examples of mathematical activities that are suitable to both foster mathematical concepts and widen the mathematical view. Possible changes in the curriculum are discussed.