An iterative solution method for linear systems of which the coefficient matrix is a symmetric -matrix
Explore this paper's citation graph
Summary
A particular class of regular splittings of not necessarily symmetric M-matrices is proposed, if the matrix is symmetric, this splitting is combined with the conjugate-gradient method to provide a fast iterative solution algorithm.
- Type
- article
- Published
- 1977-01-01
- Cited by
- 1,764
- References
- 10
- Access
- Open access
- OpenAlex
- https://openalex.org/W1992208469
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:45774810
Keywords
Mathematics, Conjugate gradient method, Coefficient matrix, Iterative method, Matrix (chemical analysis)
References
- Handbook for Automatic Computation
- The Use of Conjugate Gradients for Systems of Linear Equations Possessing “Property A”
- Direct methods in reservoir simulation
- ITERATIVE SOLUTION OF IMPLICIT APPROXIMATIONS OF MULTIDIMENSIONAL PARTIAL DIFFERENTIAL EQUATIONS
- Note on Matrices
- Matrix Iterative Analysis
- The Conjugate Gradient Method for Linear and Nonlinear Operator Equations
- NOTE ON M -MATRICES
- Linear algebra
- The algebraic eigenvalue problem
- Matrix Iterative Analysis
- Linear Algebra
- The algebraic eigenvalue problem
Cited by
- EFFICIENT DEFLATION METHODS APPLIED TO 3-D BUBBLY FLOW PROBLEMS
- Syllabus Numerieke Analyse I en II
- Avant-Garde Matrix Splitting for the Solution of Sparse Non-symmetric Linear Systems
- A numerical solution for the diffusion equation in hydrogeologic systems
- Preconditioned techniques for large eigenvalue problems
- Semi-Toeplitz preconditioning for linearized boundary layer problems
- High-efficiency improved symmetric successive over-relaxation preconditioned conjugate gradient method for solving large-scale finite element linear equations
- Параллельные варианты метода неполного треугольного разложения второго порядка сопряженных градиентов на основе использования специального переупорядочения матрицы коэффициентов
- Experiments with sparse preconditioning of dense problems from electromagnetic applications
- Adaptation of the C.H.A.D. computer library to nuclear simulations
- A comparison of iterative methods for a model coupled system of elliptic equations
- A VARIABLE PRECONDITIONING USING THE SOR METHOD FOR GCR-LIKE METHODS
- A Semi-Implicit, Three-Dimensional Model for Estuarine Circulation
- Construction and application of hierarchical matrix preconditioners
- Parallel Performance of Block ILU Preconditioners for a Block-tridiagonal Matrix
- An Adaptive CGNR Algorithm for Solving Large Linear Systems
- Preconditioning sparse matrices for computing eigenvalues and solving linear systems of equations
- Optimal Shape Design Of Aerodynamic Configurations: A Newton-Krylov Approach
- Two classes of preconditioners computed using block matrix factorization techniques
- Block ILU Preconditioners for a Nonsymmetric Block-Tridiagonal M-Matrix
Related papers
- Modified Conjugate Gradient Method with Global Convergence Property
- A mixed conjugate gradient method
- Global convergence of a new class nonlinear conjugate gradient method with exact line search
- New modification of the Hestenes-Stiefel with strong Wolfe line search
- Convergence properties of a class of nonlinear conjugate gradient methods
- A Mixed Conjugate Gradient Method under a New Linear Search
- A Mixed Conjugate Gradient Method for Unconstrained Optimization
- Restrictively preconditioned conjugate gradient methods for systems of linear equations
- A Self Correcting Conjugate Gradient Algorithm