An optimum iterative method for solving any linear system with a square matrix
- 1 March 1988
- journal article
- research article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 28 (1) , 163-178
- https://doi.org/10.1007/bf01934703
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- On the application of orthogonal polynomials to the iterative solution of linear systems of equations with indefinite or non-Hermitian matricesLinear Algebra and its Applications, 1987
- A Hybrid Chebyshev Krylov Subspace Algorithm for Solving Nonsymmetric Systems of Linear EquationsSIAM Journal on Scientific and Statistical Computing, 1986
- A study of semiiterative methods for nonsymmetric systems of linear equationsNumerische Mathematik, 1985
- On Generating Orthogonal PolynomialsSIAM Journal on Scientific and Statistical Computing, 1982
- Extremal Polynomials with Application to Richardson Iteration for Indefinite Linear SystemsSIAM Journal on Scientific and Statistical Computing, 1982
- Efficient Implementation of a Class of Preconditioned Conjugate Gradient MethodsSIAM Journal on Scientific and Statistical Computing, 1981
- A class of first order factorization methodsBIT Numerical Mathematics, 1978
- Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iterationNumerische Mathematik, 1978
- The Tchebychev iteration for nonsymmetric linear systemsNumerische Mathematik, 1977
- Calculation of Gauss quadrature rulesMathematics of Computation, 1969