A Matrix-Free Preconditioner for Sparse Symmetric Positive Definite Systems and Least-Squares Problems
نویسندگان
چکیده
منابع مشابه
A Matrix-Free Preconditioner for Sparse Symmetric Positive Definite Systems and Least-Squares Problems
We analyze and discuss matrix-free and limited-memory preconditioners (LMP) for sparse symmetric positive definite systems and normal equations of large and sparse least-squares problems. The preconditioners are based on a partial Cholesky factorization and can be coupled with a deflation strategy. The construction of the preconditioners requires only matrix-vector products, is breakdown-free, ...
متن کاملA Sparse Approximate Inverse Preconditioner for Nonsymmetric Positive Definite Matrices
We develop an algorithm for computing a sparse approximate inverse for a nonsymmetric positive definite matrix based upon the FFAPINV algorithm. The sparse approximate inverse is computed in the factored form and used to work with some Krylov subspace methods. The preconditioner is breakdown free and, when used in conjunction with Krylovsubspace-based iterative solvers such as the GMRES algorit...
متن کاملDykstra's algorithm for constrained least-squares doubly symmetric matrix problems
In this work we apply Dykstra’s alternating projection algorithm for minimizing ‖AX − B‖ where ‖ · ‖ is the Frobenius norm and A ∈ Rm×n, B ∈ Rm×n and X ∈ Rn×n are doubly symmetric positive definite matrices with entries within prescribed intervals. We first solve the constrained least-squares matrix problem by using the special structure properties of doubly symmetric matrices, and then use the...
متن کاملA Multilevel Block Incomplete Cholesky Preconditioner for Solving Rectangular Sparse Matrices from Linear Least Squares Problems
An incomplete factorization method for preconditioning symmetric positive definite matrices is introduced to solve normal equations. The normal equations are formed as a means to solve rectangular matrices from linear least squares problems. The procedure is based on a block incomplete Cholesky factorization and a multilevel recursive strategy with an approximate Schur complement matrix formed ...
متن کاملA Robust Preconditioner with Low Memory Requirements for Large Sparse Least Squares Problems
This paper describes a technique for constructing robust preconditioners for the CGLS method applied to the solution of large and sparse least squares problems. The algorithm computes an incomplete LDLT factorization of the normal equations matrix without the need to form the normal matrix itself. The preconditioner is reliable (pivot breakdowns cannot occur) and has low intermediate storage re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2013
ISSN: 1064-8275,1095-7197
DOI: 10.1137/110840819