Reliable updated residuals in hybrid Bi-CG methods
From MaRDI portal
Publication:1909599
DOI10.1007/BF02309342zbMath0842.65018OpenAlexW1496910322MaRDI QIDQ1909599
Henk A. van der Vorst, Gerard L. G. Sleijpen
Publication date: 5 August 1996
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02309342
Related Items
Numerical methods for the QCDd overlap operator. I: Sign-function and error bounds, Variants of the groupwise update strategy for short-recurrence Krylov subspace methods, An extended basis inexact shift-invert Lanczos for the efficient solution of large-scale generalized eigenproblems, Minimizing synchronizations in sparse iterative solvers for distributed supercomputers, The Numerical Stability Analysis of Pipelined Conjugate Gradient Methods: Historical Context and Methodology, Maintaining convergence properties of BiCGStab methods in finite precision arithmetic, VPAStab\((J,L)\): an iterative method with look-ahead for the solution of large sparse linear systems, BiCGStab, VPAStab and an adaptation to mildly nonlinear systems, A theoretical overview of Krylov subspace methods, An overview of approaches for the stable computation of hybrid BiCG methods, Generalized conjugate gradient squared, Bi-CGSTAB as an induced dimension reduction method, Reliability Investigation of BiCGStab and IDR Solvers for the Advection-Diffusion-Reaction Equation, Cross-Interactive Residual Smoothing for Global and Block Lanczos-Type Solvers for Linear Systems with Multiple Right-Hand Sides, Estimating the effect of indices compression in the CSR-like data storage formats for matrix-vector multiplications and solving linear systems, Communication-hiding pipelined BiCGSafe methods for solving large linear systems, Analyzing the Effect of Local Rounding Error Propagation on the Maximal Attainable Accuracy of the Pipelined Conjugate Gradient Method, Finite-element-wise domain decomposition iterative solvers with polynomial preconditioning, A Hessian-free Newton-Raphson method for the configuration of physics systems featured by numerically asymmetric force field, Lossy compression for PDE-constrained optimization: adaptive error control, A variant of IDRstab with reliable update strategies for solving sparse linear systems, ML(\(n\))BiCGStabt: a ML(\(n\))BiCGStab variant with \(\mathbf A\)-transpose, Solving lattice QCD systems of equations using mixed precision solvers on GPUs, A new fully coupled method for computing turbulent flows, Frequency and time domain electromagnetic scattering simulations employing higher order edge elements, Variants of residual smoothing with a small residual gap, Communication lower bounds and optimal algorithms for numerical linear algebra, Particle-resolved direct numerical simulation of homogeneous isotropic turbulence modified by small fixed spheres, On the cost of iterative computations, An adaptive \(s\)-step conjugate gradient algorithm with dynamic basis updating., Efficient and reliable iterative methods for linear systems, Large-scale weakly nonlinear perturbations of convective magnetic dynamos in a rotating layer
Uses Software
Cites Work
- Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences
- Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- BiCGstab(\(l\)) and other hybrid Bi-CG methods
- BiCGstab(\(l\)) for linear equations involving unsymmetric matrices with complex spectrum
- Maintaining convergence properties of BiCGStab methods in finite precision arithmetic
- Generalized conjugate gradient squared
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Error Analysis of the Lanczos Algorithm for the Nonsymmetric Eigenvalue Problem
- Residual Smoothing Techniques for Iterative Methods
- Estimating the Attainable Accuracy of Recursively Computed Residual Methods
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
