Geometrical inverse preconditioning for symmetric positive definite matrices
From MaRDI portal
Publication:515461
Abstract: We focus on inverse preconditioners based on minimizing , where is the preconditioned matrix and is symmetric and positive definite. We present and analyze gradient-type methods to minimize on a suitable compact set. For that we use the geometrical properties of the non-polyhedral cone of symmetric and positive definite matrices, and also the special properties of on the feasible set. Preliminary and encouraging numerical results are also presented in which dense and sparse approximations are included.
Recommendations
- Orthogonal Projections of the Identity: Spectral Analysis and Applications to Approximate Inverse Preconditioning
- Approximate Inverse Preconditioners via Sparse-Sparse Iterations
- Optimal preconditioners of a given sparsity pattern
- A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
- A sparse-sparse iteration for computing a sparse incomplete factorization of the inverse of an SPD matrix
Cites work
- A Block Constant Approximate Inverse for Preconditioning Large Linear Systems
- A comparative study of sparse approximate inverse preconditioners
- An analysis of sparse approximate inverse preconditioners for boundary integral equations
- An element-based spectrally optimized approximate inverse preconditioner for the Euler equations
- An iterative method for computing the approximate inverse of a square matrix and the Moore-Penrose inverse of a non-square matrix
- Approximate Inverse Preconditioners via Sparse-Sparse Iterations
- Approximate Inverse Techniques for Block-Partitioned Matrices
- Approximate inverse computation using Frobenius inner product
- Approximate inverse preconditioners for some large dense random electrostatic interaction matrices
- Approximate inverse preconditionings for sparse linear systems
- Eigenvalue estimates for symmetric matrices
- Experimental study of ILU preconditioners for indefinite matrices
- Factorized Sparse Approximate Inverse Preconditionings I. Theory
- Geometrical properties of the Frobenius condition number for positive definite matrices
- High quality preconditioning of a general symmetric positive definite matrix based on its \(U^T U + U^T R + R^T U\)-decomposition
- Matrix Preconditioning Techniques and Applications
- On a fast iterative method for approximate inverse of matrices
- On pairs of vectors achieving the maximal angle of a convex cone
- On the cone of positive semidefinite matrices
- On the geometrical structure of symmetric matrices
- Optimal regularized low rank inverse approximation
- Orthogonal Projections of the Identity: Spectral Analysis and Applications to Approximate Inverse Preconditioning
- Preconditioned conjugate gradient method for finding minimal energy surfaces on Powell-Sabin triangulations
- Pseudoinverse preconditioners and iterative methods for large dense linear least-squares problems
- Sparse Approximate-Inverse Preconditioners Using Norm-Minimization Techniques
- Sparse approximate inverse preconditioners on high performance GPU platforms
Cited in
(5)- A geometric theory for preconditioned inverse iteration. I: Extrema of Rayleigh quotient
- Geometrical inverse matrix approximation for least-squares problems and acceleration strategies
- Sparse approximations of matrix functions via numerical integration of ODEs
- Geometry-aware principal component analysis for symmetric positive definite matrices
- A geometric theory for preconditioned inverse iteration IV: On the fastest convergence cases
This page was built for publication: Geometrical inverse preconditioning for symmetric positive definite matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q515461)
