Chebyshev acceleration of iterative refinement

DOI10.1007/S11075-013-9750-7MaRDI QIDQ398602zbMATH OpenOpenAlexWikidataFDO

Authors M. Arioli, J. A. Scott

Publication date 15 August 2014

Published in Numerical Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s11075-013-9750-7

zbMATH Keywords

Chebyshev methoderror analysisflexible inner-outer preconditioned generalized minimal residual algorithmGaussian eliminationiterative refinementnumerical stabilitynumerical testsparse matrices

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Iterative numerical methods for linear systems (65F10) Computational methods for sparse matrices (65F50)

Recommendations

• The Chebyshev iteration revisited
• Inner and Outer Iterations for the Chebyshev Algorithm
• scientific article; zbMATH DE number 48351
• A new analysis of iterative refinement and its application to accurate solution of ill-conditioned sparse linear systems
• An improved algorithm for the iterative refinement method

Cites work

• A fast and robust mixed-precision solver for the solution of sparse symmetric linear systems
• A Flexible Inner-Outer Preconditioned GMRES Algorithm
• A Note on GMRES Preconditioned by a Perturbed L D L^T Decomposition with Static Pivoting
• Accuracy and Stability of Numerical Algorithms
• Accuracy of two three-term and three two-term recurrences for Krylov space solvers
• Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration
• scientific article; zbMATH DE number 439948 (Why is no real title available?)
• scientific article; zbMATH DE number 4213315 (Why is no real title available?)
• scientific article; zbMATH DE number 3720254 (Why is no real title available?)
• Iterative Refinement Implies Numerical Stability for Gaussian Elimination
• Solving Sparse Linear Systems with Sparse Backward Error
• The Chebyshev iteration revisited
• The Tchebychev iteration for nonsymmetric linear systems
• The University of Florida sparse matrix collection
• Using FGMRES to obtain backward stability in mixed precision

Cited in

(12)

• A preconditioned hybrid SVD method for accurately computing singular triplets of large matrices
• scientific article; zbMATH DE number 567659 (Why is no real title available?)
• Accelerating the solution of linear systems by iterative refinement in three precisions
• Accelerated gossip in networks of given dimension using Jacobi polynomial iterations
• DESTRESS: Computation-Optimal and Communication-Efficient Decentralized Nonconvex Finite-Sum Optimization
• scientific article; zbMATH DE number 7307473 (Why is no real title available?)
• Optimal convergence rates for convex distributed optimization in networks
• Chebyshev acceleration for SOR-like method
• A note on Chebyshev accelerated PMHSS iteration method for block two-by-two linear systems
• Average-case optimization analysis for distributed consensus algorithms on regular graphs
• Generalized Chebyshev acceleration
• Using FGMRES to obtain backward stability in mixed precision

Describes a project that uses

Uses Software

• mctoolbox
• SparseMatrix
• HSL_MA97

This page was built for publication: Chebyshev acceleration of iterative refinement

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