A High-Quality Preconditioning Technique for Multi-Length-Scale Symmetric Positive Definite Linear Systems
نویسندگان
چکیده
We study preconditioning techniques used in conjunction with the conjugate gradient method for solving multi-length-scale symmetric positive definite linear systems originating from the quantum Monte Carlo simulation of electron interaction of correlated materials. Existing preconditioning techniques are not designed to be adaptive to varying numerical properties of the multi-length-scale systems. In this paper, we propose a hybrid incomplete Cholesky (HIC) preconditioner and demonstrate its adaptivity to the multi-length-scale systems. In addition, we propose an extension of the compressed sparse column with row access (CSCR) sparse matrix storage format to efficiently accommodate the data access pattern to compute the HIC preconditioner. We show that for moderately correlated materials, the HIC preconditioner achieves the optimal linear scaling of the simulation. The development of a linear-scaling preconditioner for strongly correlated materials remains an open topic. AMS subject classifications: 65F08, 65F10, 65F50, 81-08
منابع مشابه
Graph Partitioning Using Matrix Values for Preconditioning Symmetric Positive Definite Systems
Prior to the parallel solution of a large linear system, it is required to perform a partitioning of its equations/unknowns. Standard partitioning algorithms are designed using the considerations of the efficiency of the parallel matrix-vector multiplication, and typically disregard the information on the coefficients of the matrix. This information, however, may have a significant impact on th...
متن کاملDECOMPOSITION METHOD FOR SOLVING FULLY FUZZY LINEAR SYSTEMS
In this paper, we investigate the existence of a positive solution of fully fuzzy linear equation systems. This paper mainly to discuss a new decomposition of a nonsingular fuzzy matrix, the symmetric times triangular (ST) decomposition. By this decomposition, every nonsingular fuzzy matrix can be represented as a product of a fuzzy symmetric matrix S and a fuzzy triangular matrix T.
متن کاملA matrix-free approach to build band preconditioners for large-scale bound-constrained optimization
We propose a procedure for building symmetric positive definite band preconditioners for large-scale symmetric, possibly indefinite, linear systems, when the coefficient matrix is not explicitly available, but matrix-vector products involving it can be computed. We focus on linear systems arising in Newton-type iterations within matrix-free versions of projected methods for bound-constrained no...
متن کاملA Preconditioned Gmres Method for Nonsymmetric or Indefinite Problems
A preconditioning technique is proposed for nonsymmetric or indefinite linear systems of equations. The main idea in our theory, roughly speaking, is first to use some "coarser mesh" space to correct the nonpositive portion of the eigenvalues of the underlying operator and then switch to use a symmetric positive definite preconditioner. The generality of our theory allows us to apply any known ...
متن کاملResidual iterative schemes for large-scale nonsymmetric positive definite linear systems
A new iterative scheme that uses the residual vector as search direction is proposed and analyzed for solving large-scale nonsymmetric linear systems, whose matrix has a positive (or negative) definite symmetric part. It is closely related to Richardson’s method, although the stepsize and some other new features are inspired by the success of recently proposed residual methods for nonlinear sys...
متن کامل