article Open AccessTop 1% cited
An iterative solution method for linear systems of which the coefficient matrix is a symmetric ๐-matrix
Mathematics of Computation ยท 1977 ยท Vol. 31(137) ยท pp. 148โ162
Abstract
A particular class of regular splittings of not necessarily symmetric <italic>M</italic>-matrices is proposed. If the matrix is symmetric, this splitting is combined with the conjugate-gradient method to provide a fast iterative solution algorithm. Comparisons have been made with other well-known methods. In all test problems the new combination was faster than the other methods.
Matrix Theory and AlgorithmsAdvanced Optimization Algorithms ResearchStatistical and numerical algorithmsMathematicsConjugate gradient methodCoefficient matrixIterative methodMatrix (chemical analysis)Matrix splittingSymmetric matrixApplied mathematicsDerivation of the conjugate gradient methodClass (philosophy)
Citations
1,410
FWCI
19.83
field-weighted impact
References
13
Percentile
100%
vs. same field & year
Citations per year
Cited by
Electrostatics and diffusion of molecules in solution: simulations with the University of Houston Brownian Dynamics program
Computer Physics Communications ยท 1995 ยท 807 citations
References
Matrix Iterative Analysis
Mathematics of Computation ยท 1963 ยท 4,153 citations
The Algebraic Eigenvalue Problem
Mathematics of Computation ยท 1966 ยท 5,208 citations
Citation Network
How this paper connects to the literature. Drag to explore, click any node to open that paper.