On the cost of iterative computations
From MaRDI portal
Publication:4993500
DOI10.1098/rsta.2019.0050zbMath1462.65034OpenAlexW2999777638WikidataQ92754310 ScholiaQ92754310MaRDI QIDQ4993500
Zdeněk Strakoš, Erin Claire Carson
Publication date: 15 June 2021
Published in: Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)
Full work available at URL: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7015299
iterative methodscomputational mathematicsMathematical modellinghigh performance computingmatrix computationscomputer modelling and simulation
Iterative numerical methods for linear systems (65F10) Numerical algorithms for specific classes of architectures (65Y10)
Related Items (4)
GMRES algorithms over 35 years ⋮ A Comparison of Limited-memory Krylov Methods for Stieltjes Functions of Hermitian Matrices ⋮ Sensitivity of computational fluid dynamics simulations against soft errors ⋮ Three-Precision GMRES-Based Iterative Refinement for Least Squares Problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the generation of Krylov subspace bases
- Composite convergence bounds based on Chebyshev polynomials and finite precision conjugate gradient computations
- On the real convergence rate of the conjugate gradient method
- Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences
- Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem
- Comparison of splittings used with the conjugate gradient algorithm
- Krylov sequences of maximal length and convergence of GMRES
- Iterative solution of large sparse systems of equations. Transl. from the German
- Estimates in quadratic formulas
- On the efficient implementation of preconditioned s-step conjugate gradient methods on multiprocessors with memory hierarchy
- The worst-case GMRES for normal matrices
- On error estimation in the conjugate gradient method and why it works in finite precision computations
- Superlinear CG convergence for special right-hand sides
- Communication lower bounds for distributed-memory matrix multiplication
- Reducing the effect of global communication in \(\text{GMRES} (m)\) and CG on parallel distributed memory computers
- Reliable updated residuals in hybrid Bi-CG methods
- A parallel GMRES version for general sparse matrices
- Accuracy of Two Three-term and Three Two-term Recurrences for Krylov Space Solvers
- Condition
- A Residual Replacement Strategy for Improving the Maximum Attainable Accuracy of $s$-Step Krylov Subspace Methods
- The university of Florida sparse matrix collection
- An Augmented Stability Result for the Lanczos Hermitian Matrix Tridiagonalization Process
- John von Neumann's Analysis of Gaussian Elimination and the Origins of Modern Numerical Analysis
- Minimizing Communication in Numerical Linear Algebra
- The Lanczos and conjugate gradient algorithms in finite precision arithmetic
- Characterizing Computers and Optimizing the FACR(l) Poisson-Solver on Parallel Unicomputers
- Practical Use of Polynomial Preconditionings for the Conjugate Gradient Method
- Predicting the Behavior of Finite Precision Lanczos and Conjugate Gradient Computations
- Parallelizable restarted iterative methods for nonsymmetric linear systems. part I: Theory
- What should be a rate of convergence ?
- A Newton basis GMRES implementation
- Estimating the Attainable Accuracy of Recursively Computed Residual Methods
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing
- A Note on Preconditioning for Indefinite Linear Systems
- Residual Replacement Strategies for Krylov Subspace Iterative Methods for the Convergence of True Residuals
- The Numerical Stability Analysis of Pipelined Conjugate Gradient Methods: Historical Context and Methodology
- A New Analysis of Iterative Refinement and Its Application to Accurate Solution of Ill-Conditioned Sparse Linear Systems
- Pták's nondiscrete induction and its application to matrix iterations
- Iterative Krylov Methods for Large Linear Systems
- Any Nonincreasing Convergence Curve is Possible for GMRES
- Hiding Global Communication Latency in the GMRES Algorithm on Massively Parallel Machines
- A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF
- Accuracy of the Lanczos Process for the Eigenproblem and Solution of Equations
- Laplacian Preconditioning of Elliptic PDEs: Localization of the Eigenvalues of the Discretized Operator
- Preconditioning and the Conjugate Gradient Method in the Context of Solving PDEs
- Accuracy of the $s$-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision
- Analyzing the Effect of Local Rounding Error Propagation on the Maximal Attainable Accuracy of the Pipelined Conjugate Gradient Method
- Parallelism in random access machines
- The Conjugate Gradient Method for Linear and Nonlinear Operator Equations
- Probabilistic analyses of condition numbers
- Methods of conjugate gradients for solving linear systems
This page was built for publication: On the cost of iterative computations
