Construction and efficient implementation of implicit preconditioning methods. I
From MaRDI portal
Publication:1325450
DOI10.1007/BF01098600zbMath0792.65016MaRDI QIDQ1325450
I. N. Molchanov, V. E. Ryabtsev, A. S. Trigub
Publication date: 5 July 1994
Published in: Journal of Soviet Mathematics (Search for Journal in Brave)
65F50: Computational methods for sparse matrices
65F10: Iterative numerical methods for linear systems
65F35: Numerical computation of matrix norms, conditioning, scaling
65Y20: Complexity and performance of numerical algorithms
65Y10: Numerical algorithms for specific classes of architectures
Cites Work
- Unnamed Item
- Guidelines for the usage of incomplete decompositions in solving sets of linear equations as they occur in practical problems
- Comparison of splittings used with the conjugate gradient algorithm
- Polynomial Preconditioners for Conjugate Gradient Calculations
- An Incomplete Factorization Technique for Positive Definite Linear Systems
- Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients
- On the Convergence of Some Generalized Preconditioned Iterative Methods
- A generalized SSOR method