Accuracy and effectiveness of preconditioned conjugate gradient algorithms for large and ill-conditioned problems
- 30 November 1993
- journal article
- Published by Elsevier in Computer Methods in Applied Mechanics and Engineering
- Vol. 109 (3-4) , 219-232
- https://doi.org/10.1016/0045-7825(93)90079-d
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Improving the efficiency of incomplete Choleski preconditioningsCommunications in Applied Numerical Methods, 1991
- The rate of convergence of Conjugate GradientsNumerische Mathematik, 1986
- On the rate of convergence of the preconditioned conjugate gradient methodNumerische Mathematik, 1986
- A robust incomplete Choleski‐conjugate gradient algorithmInternational Journal for Numerical Methods in Engineering, 1984
- Guidelines for the usage of incomplete decompositions in solving sets of linear equations as they occur in practical problemsJournal of Computational Physics, 1981
- Iterative refinement implies numerical stability for Gaussian eliminationMathematics of Computation, 1980
- Iterative refinement implies numerical stabilityBIT Numerical Mathematics, 1977
- Influence of the Eigenvalue Spectrum on the Convergence Rate of the Conjugate Gradient MethodIMA Journal of Applied Mathematics, 1977
- On numerical error in the finite element methodComputer Methods in Applied Mechanics and Engineering, 1976
- Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sidesNumerische Mathematik, 1964