Spelling suggestions: "subject:"saddle point matrix"" "subject:"paddle point matrix""
1 |
Analysis and Implementation of Preconditioners for Prestressed Elasticity Problems : Advances and EnhancementsDorostkar, Ali January 2017 (has links)
In this work, prestressed elasticity problem as a model of the so-called glacial isostatic adjustment (GIA) process is studied. The model problem is described by a set of partial differential equations (PDE) and discretized with a mixed finite element (FE) formulation. In the presence of prestress the so-constructed system of equations is non-symmetric and indefinite. Moreover, the resulting system of equations is of the saddle point form. We focus on a robust and efficient block lower-triangular preconditioning method, where the lower diagonal block is and approximation of the so-called Schur complement. The Schur complement is approximated by the so-called element-wise Schur complement. The element-wise Schur complement is constructed by assembling exact local Schur complements on the cell elements and distributing the resulting local matrices to the global preconditioner matrix. We analyse the properties of the element-wise Schur complement for the symmetric indefinite system matrix and provide proof of its quality. We show that the spectral radius of the element-wise Schur complement is bounded by the exact Schur complement and that the quality of the approximation is not affected by the domain shape. The diagonal blocks of the lower-triangular preconditioner are combined with inner iterative schemes accelerated by (numerically) optimal and robust algebraic multigrid (AMG) preconditioner. We observe that on distributed memory systems, the top pivot block of the preconditioner is not scaling satisfactorily. The implementation of the methods is further studied using a general profiling tool, designed for clusters. For nonsymmetric matrices we use the theory of Generalized Locally Toeplitz (GLT) matrices and show the spectral behavior of the element-wise Schur complement, compared to the exact Schur complement. Moreover, we use the properties of the GLT matrices to construct a more efficient AMG preconditioner. Numerical experiments show that the so-constructed methods are robust and optimal.
|
2 |
Numerické algoritmy pro analýzu hybridních dynamických systémů / Numerical Optimization Methods for the Falsification of Hybrid Dynamical SystemsKuřátko, Jan January 2020 (has links)
Title: Numerical Optimization Methods for the Falsification of Hybrid Dynamical Systems Author: Jan Kuřátko Department: Department of Numerical Mathematics Supervisor: Stefan Ratschan, Institute of Computer Science, The Czech Academy of Sciences Abstract: This thesis consists of three published papers that contribute to the finding of error trajectories of hybrid dynamical systems. A hybrid dynamical system is a dynamical system that has both discrete and continuous state. For example, one can use it as a model for a thermostat in a room: Such a thermostat may have two discrete states, one where the heating is off, and another one, where the heating is on. Its continuous state is the temperature in the room. For such a model one may be interested in finding an error trajectory, that is, an evolution of the system that reaches an unsafe state that is to be avoided. Industry is in need of methods for automatized testing and verification of safety conditions in order to identify flaws in the design of systems. The thesis contains several contributions to finding error trajectories that are based on numerical optimization. Keywords: optimization, dynamical systems, saddle-point matrix
|
3 |
Robust Preconditioners Based on the Finite Element FrameworkBängtsson, Erik January 2007 (has links)
Robust preconditioners on block-triangular and block-factorized form for three types of linear systems of two-by-two block form are studied in this thesis. The first type of linear systems, which are dense, arise from a boundary element type of discretization of crack propagation problems. Numerical experiment show that simple algebraic preconditioning strategies results in iterative schemes that are highly competitive with a direct solution method. The second type of algebraic systems, which are sparse, indefinite and nonsymmetric, arise from a finite element (FE) discretization of the partial differential equations (PDE) that describe (visco)elastic glacial isostatic adjustment (GIA). The Schur complement approximation in the block preconditioners is constructed by assembly of local, exactly computed Schur matrices. The quality of the approximation is verified in numerical experiments. When the block preconditioners for the indefinite problem are combined with an inner iterative scheme preconditioned by a (nearly) optimal multilevel preconditioner, the resulting preconditioner is (nearly) optimal and robust with respect to problem size, material parameters, number of space dimensions, and coefficient jumps. Two approaches to mathematically formulate the PDEs for GIA are compared. In the first approach the equations are formulated in their full complexity, whereas in the second their formulation is confined to the features and restrictions of the employed FE package. Different solution methods for the algebraic problem are used in the two approaches. Analysis and numerical experiments reveal that the first strategy is more accurate and efficient than the latter. The block structure in the third type of algebraic systems is due to a fine-coarse splitting of the unknowns. The inverse of the pivot block is approximated by a sparse matrix which is assembled from local, exactly inverted matrices. Numerical experiments and analysis of the approximation show that it is robust with respect to problem size and coefficient jumps.
|
Page generated in 0.0663 seconds