scientific article; zbMATH DE number 663833

MaRDI QIDQ4309408zbMATH OpenFDO

Authors B. Fischer, Gene H. Golub

Publication date 18 October 1994

zbMATH Keywords

Chebyshev iterationconjugate gradient methoderror computationGaussian quadraturemodified momentsnumerical examplesperformancepolynomial iteration schemes

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Recommendations

• Matrices, moments and quadrature. II: How to compute the norm of the error iterative methods
• scientific article; zbMATH DE number 48348
• The Chebyshev iteration revisited
• An iterative method with error estimators
• Error Analysis of Krylov Methods In a Nutshell

Cited in

(13)

• A comparison of methods for terminating polynomial iterations
• Matrices, moments and quadrature. II: How to compute the norm of the error iterative methods
• On Koetter's algorithm and the computation of error values
• On computing quadrature-based bounds for the A-norm of the error in conjugate gradients
• Approximating the extreme Ritz values and upper bounds for the \(A\)-norm of the error in CG
• A strategy for detecting extreme eigenvalues bounding gaps in the discrete spectrum of self-adjoint operators
• Recent computational developments in Krylov subspace methods for linear systems
• scientific article; zbMATH DE number 3904491 (Why is no real title available?)
• scientific article; zbMATH DE number 1977309 (Why is no real title available?)
• scientific article; zbMATH DE number 911331 (Why is no real title available?)
• scientific article; zbMATH DE number 915209 (Why is no real title available?)
• The Chebyshev iteration revisited
• Running error analysis of evaluation algorithms for bivariate polynomials in barycentric Bernstein form

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4309408)