AbstractIn the existing Lanczos algorithms for solving systems of linear equations,the estimate for the residual is effective for well-conditioned systems. However, in actual implementation on a computer we find that the estimate is no longer reliable for ill-conditioned cases. We first analyze in theory this observation, then develop an improved Lanczos algorithm. Numerical examples are also given to demonstrate the effectiveness of the present algorithm
A new stable and efficient implementation of the Lanczos algorithm is presented. The algorithm is a ...
Includes bibliographical references (p. 70-74)We are interested in computing eigenvalues and eigenve...
The L\ue1nczos method for solving systems of linear equations is based on formal orthogonal polynomi...
Lanczos-type algorithms are efficient and easy to implement. Unfortunately they breakdown frequently...
Various recurrence relations between formal orthogonal polynomials can be used to derive Lanczos-typ...
AbstractThis paper is concerned with the solution of underdetermined linear systems of equations wit...
There are numerous algorithms for the solution of systems of linear equations and eigenvalue problem...
AbstractSimple versions of the conjugate gradient algorithm and the Lanczos method are discussed, an...
A new method to treat the inherent instability of Lanczos-type algorithms is introduced. It enables ...
This paper is concerned with the solution of underdetermined linear systems of equations with a very...
Many real applications give rise to the solution of underdetermined linear systems of equations with...
Among the iterative methods for solving large linear systems with a sparse (or, possibly, structured...
Lanczos-type algorithms are prone to breaking down before convergence to an acceptable solution is a...
Lanczos-type algorithms are mostly derived using recurrence relationships between formal orthogonal ...
Lanczos-type algorithms are an iterative methods for solving sym-metric and unsymmetric systems of l...
A new stable and efficient implementation of the Lanczos algorithm is presented. The algorithm is a ...
Includes bibliographical references (p. 70-74)We are interested in computing eigenvalues and eigenve...
The L\ue1nczos method for solving systems of linear equations is based on formal orthogonal polynomi...
Lanczos-type algorithms are efficient and easy to implement. Unfortunately they breakdown frequently...
Various recurrence relations between formal orthogonal polynomials can be used to derive Lanczos-typ...
AbstractThis paper is concerned with the solution of underdetermined linear systems of equations wit...
There are numerous algorithms for the solution of systems of linear equations and eigenvalue problem...
AbstractSimple versions of the conjugate gradient algorithm and the Lanczos method are discussed, an...
A new method to treat the inherent instability of Lanczos-type algorithms is introduced. It enables ...
This paper is concerned with the solution of underdetermined linear systems of equations with a very...
Many real applications give rise to the solution of underdetermined linear systems of equations with...
Among the iterative methods for solving large linear systems with a sparse (or, possibly, structured...
Lanczos-type algorithms are prone to breaking down before convergence to an acceptable solution is a...
Lanczos-type algorithms are mostly derived using recurrence relationships between formal orthogonal ...
Lanczos-type algorithms are an iterative methods for solving sym-metric and unsymmetric systems of l...
A new stable and efficient implementation of the Lanczos algorithm is presented. The algorithm is a ...
Includes bibliographical references (p. 70-74)We are interested in computing eigenvalues and eigenve...
The L\ue1nczos method for solving systems of linear equations is based on formal orthogonal polynomi...