On large-scale generalized inverses in solving two-by-two block linear systems
In large scale nonsymmetric saddle-point problems, one has to solve a linear system whose matrix is of the form \[ \left[\begin{matrix} A&B_1^T\cr B_2&-C\end{matrix}\right] \] with \(A\) and \(C\) square. A projected Schur complement method (PSCM) is used (see [\textit{J.~Haslinger} et al., Numer.\ Linear Algebra Appl. 14, No.~9, 713--739 (2007; Zbl 1199.65102)]). This paper discusses the role of the generalized inverse in the Schur complement of \(A\) when \(A\) is singular. The key point is that a generalized inverse with prescribed range and null space (e.g.\ the Moore-Penrose inverse) can be obtained by choosing appropriate projectors. This is a generalization of \textit{R.~Kučera} et al. [``On the Moore-Penrose inverse in solving saddle-point systems with singular diagonal blocks, ibid. 19, No.~4, 677--699 (2012)]. Since in practice not the generalized inverse but its action on a vector is needed, an algorithm is described to compute that. Here, also a regularization method is proposed in the case where the null space is known. It causes only little fill-in and avoids the need to check for zero pivots. Numerical examples illustrate the method proposed.
- Semi-convergence of the parameterized inexact Uzawa method for singular saddle point problems
- scientific article; zbMATH DE number 7339296
- The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part I
- The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part II
- Conjugate gradient method for computing the Moore-Penrose inverse and rank of a matrix
- Singular Value Decomposition and the Moore–Penrose Inverse of Bordered Matrices
- Stochastic Matrices and Lp Norms : New Algorithms for Solving Ill-conditioned Linear Systems of Equations
- Comment on `Preconditioning of matrices partitioned in 2 2 block form: Eigenvalue estimates and Schwarz DD for mixed FEM' by Owe Axelsson, Radim Blaheta.
- Projection method for eigenvalue problems of linear nonsquare matrix pencils
- A scalable TFETI based algorithm for 2D and 3D frictionless contact problems
- Algorithm 837
- An algorithm for profile and wavefront reduction of sparse matrices
- An integrated geometric-algebraic method for solving semi-definite problems in structural mechanics.
- Cholesky decomposition of a positive semidefinite matrix with known kernel
- Cholesky decomposition with fixing nodes to stable computation of a generalized inverse of the stiffness matrix of a floating structure
- FETI-DP: A dual-prime unified FETI method. I: A faster alternative to the two-level FETI method
- Fictitious domain formulations of unilateral problems: analysis and algorithms
- Generalized Inverses of Linear Transformations
- Generalized inverses. Theory and applications.
- scientific article; zbMATH DE number 3816913 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Numerical algorithms for the Moore-Penrose inverse of a matrix: direct methods
- Numerical solution of saddle point problems
- On the general solution by a direct method of a large-scale singular system of linear equations: application to the analysis of floating structures
- On the Moore–Penrose inverse in solving saddle‐point systems with singular diagonal blocks
- On the relation between Moore's and Penrose's conditions
- Projected Schur complement method for solving non-symmetric systems arising from a smooth fictitious domain approach
- Total FETI-an easier implementable variant of the FETI method for numerical solution of elliptic PDE
- A TFETI domain decomposition solver for elastoplastic problems
- A general Uzawa-type method for a class of \(2\times 2\) block structure linear system
- The R-linear convergence rate of an algorithm arising from the semi-smooth Newton method applied to 2D contact problems with friction
- Efficient implementation of total FETI solver for graphic processing units using Schur complement
- Stable computations of generalized inverses of positive semidefinite matrices
- The HTFETI method variant gluing cluster subdomains by kernel matrices representing the rigid body motions
- Treatment of singular matrices in the hybrid total FETI method
- On the use of graph centralities to compute generalized inverse of singular finite element operators: Applications to the analysis of floating substructures
- Massively parallel solution of elastoplasticity problems with tens of millions of unknowns using permoncube and FLLOP packages
This page was built for publication: On large-scale generalized inverses in solving two-by-two block linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1940097)
