Computational methods for sparse matrices
- 30 September 1980
- journal article
- Published by Elsevier in Computer Physics Communications
- Vol. 20 (1) , 7-10
- https://doi.org/10.1016/0010-4655(80)90100-9
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Some Convergence Properties of the Conjugate Gradient Method in Hilbert SpaceSIAM Journal on Numerical Analysis, 1979
- Direct Solution of Sets of Linear Equations whose Matrix is Sparse, Symmetric and IndefiniteIMA Journal of Applied Mathematics, 1979
- Odd-Even Reduction for Banded Linear EquationsJournal of the ACM, 1979
- Algorithms for sparse Gaussian elimination with partial pivotingACM Transactions on Mathematical Software, 1978
- Algorithms for Matrix Partitioning and the Numerical Solution of Finite Element SystemsSIAM Journal on Numerical Analysis, 1978
- Accelerated overrelaxation methodMathematics of Computation, 1978
- The incomplete Cholesky—conjugate gradient method for the iterative solution of systems of linear equationsJournal of Computational Physics, 1978
- On Permutations to Block Triangular FormIMA Journal of Applied Mathematics, 1977
- A Method for Finding the Optimum Successive Over-Relaxation ParameterThe Computer Journal, 1966
- Methods of conjugate gradients for solving linear systemsJournal of Research of the National Bureau of Standards, 1952