An Incomplete Cholesky Factorization for Dense Symmetric Positive Definite Matrices
نویسنده
چکیده
In this paper, we study the use of an incomplete Cholesky factorization (ICF) as a preconditioner for solving dense symmetric positive definite linear systems. This method is suitable for situations where matrices cannot be explicitly stored but each column can be easily computed. Analysis and implementation of this preconditioner are discussed. We test the proposed ICF on randomly generated systems and large matrices from two practical applications: semidefinite programming and support vector machines. Numerical comparison with the diagonal preconditioner is also presented. AMS subject classification: 46N10, 65F10.
منابع مشابه
CIMGS: An Incomplete Orthogonal FactorizationPreconditioner
A new preconditioner for symmetric positive definite systems is proposed, analyzed, and tested. The preconditioner, compressed incomplete modified Gram–Schmidt (CIMGS), is based on an incomplete orthogonal factorization. CIMGS is robust both theoretically and empirically, existing (in exact arithmetic) for any full rank matrix. Numerically it is more robust than an incomplete Cholesky factoriza...
متن کاملDirect and Incomplete Cholesky Factorizations with Static Supernodes
Introduction Incomplete factorizations of sparse symmetric positive definite (SSPD) matrices have been used to generate preconditioners for various iterative solvers. These solvers generally use preconditioners derived from the matrix system, , in order to reduce the total number of iterations until convergence. In this report, we investigate the findings of ref. [1] on their method for computi...
متن کامل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 ...
متن کاملModified Incomplete Cholesky Factorization Preconditioners for a Symmetric Positive Definite Matrix
We propose variants of the modified incomplete Cholesky factorization preconditioner for a symmetric positive definite (SPD) matrix. Spectral properties of these preconditioners are discussed, and then numerical results of the preconditioned CG (PCG) method using these preconditioners are provided to see the effectiveness of the preconditioners.
متن کاملA robust incomplete factorization preconditioner for positive definite matrices
We describe a novel technique for computing a sparse incomplete factorization of a general symmetric positive de nite matrix A. The factorization is not based on the Cholesky algorithm (or Gaussian elimination), but on A-orthogonalization. Thus, the incomplete factorization always exists and can be computed without any diagonal modi cation. When used in conjunction with the conjugate gradient a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002