On preconditioning of penalized matrices
Given a symmetric positive definite matrix \(A\in \mathbb R^{n\times n}\) and a vector \(b\in \mathbb R^n\), a quadratic functional born by \(A\) and \(b\) is to be minimized on a subspace \(V\) of \(\mathbb R^n\). To get rid of constraints, a system \(Bx=b\), \(B\equiv A+\rho C^TC,\) where \(\rho >0\) and \(C\in \mathbb R^{m\times n}\), is solved on \(\mathbb R^n\). A full matrix \(C\) defines \(V\) through \(V=\operatorname {Ker}(C)\). NEWLINENEWLINENEWLINEProving the existence of a gap in the spectrum of \(B\) if \(\rho \) is sufficiently large, the author suggests to use an incomplete factorization of \(A\) as a preconditioner for \(B\), and then to apply the conjugate gradient method. NEWLINENEWLINENEWLINEBounds for the convergence rate of the method independent of \(\rho\) and rank \(C\) are derived. The efficiency of the algorithm is illustrated by numerical experiments. NEWLINENEWLINENEWLINEThe paper is short and refers to other works. The reader keen to know more about the background and more details will probably need to consult some of them as the book of \textit{O.~Axelsson} [Iterative solution methods, Cambridge University Press (1994; Zbl 0795.65014)] for example. NEWLINENEWLINENEWLINEThe interpretation of equality (3.1) seems to be somewhat inaccurate. The parameter \(\varepsilon \) in (3.1) should be read as the upper bound of the relative error.
- Quadratically constrained least squares and quadratic problems
- A note on preconditioners and scalar products in Krylov subspace methods for self-adjoint problems in Hilbert space
- Estimation of spectral bounds in gradient algorithms
- scientific article; zbMATH DE number 3992791
- An Optimal Algorithm for Minimization of Quadratic Functions with Bounded Spectrum Subject to Separable Convex Inequality and Linear Equality Constraints
- Positive definite constrained least-squares estimation of matrices
- Analysis of iterative methods for saddle point problems: A unified approach
- A multilevel iterative method for symmetric, positive definite linear complementarity problems
- A Storage-Efficient Algorithm for Finding the Regularized Solution of a Large, Inconsistent System of Equations
- Quadratic programming problems with M-matrices and box constraints
- Bounds for the entries of matrix functions with applications to preconditioning
- FETI based algorithms for contact problems: Scalability, large displacements and 3D Coulomb friction
- Solution of contact problems by FETI domain decomposition with natural coarse space projections
- Scalability and FETI based algorithm for large discretized variational inequalities
- Optimal rank matrix algebras preconditioners
- A contact algorithm for voxel-based meshes using an implicit boundary representation
- On R-linear convergence of semi-monotonic inexact augmented Lagrangians for saddle point problems
- An optimal algorithm for a class of equality constrained quadratic programming problems with bounded spectrum
- FETI-based algorithms for modelling of fibrous composite materials with debonding
- Mixed constraint preconditioning in computational contact mechanics
- Semi-monotonic inexact augmented Lagrangians for quadratic programing with equality constraints
- Optimal iterative QP and QPQC algorithms
- Preconditioning Reduced Matrices
- Duality-based domain decomposition with natural coarse-space for variational inequalities
- An optimal algorithm for bound and equality constrained quadratic programming problems with bounded spectrum
- Theoretically supported scalable BETI method for variational inequalities
This page was built for publication: On preconditioning of penalized matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2760344)
