Analysis and practical use of flexible biCGStab
From MaRDI portal
Publication:2399204
DOI10.1007/s10915-015-0159-4zbMath1372.65097OpenAlexW2239244950MaRDI QIDQ2399204
Jie Chen, Hong Zhang, Lois Curfman McInnes
Publication date: 22 August 2017
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-015-0159-4
Iterative numerical methods for linear systems (65F10) Preconditioners for iterative methods (65F08)
Related Items
Immersed Boundary Projection Methods ⋮ A mixed discontinuous Galerkin method without interior penalty for time-dependent fourth order problems ⋮ A Parallel Implementation of the Mortar Element Method in 2D and 3D ⋮ Matrix iteration algorithms for solving the generalized Lyapunov matrix equation ⋮ A fast immersed boundary method for external incompressible viscous flows using lattice Green's functions ⋮ Efficient, positive, and energy stable schemes for multi-d Poisson-Nernst-Planck systems ⋮ Iterative Approximation of Preconditioning Matrices Through Krylov-Type Solver Iterations ⋮ A robust meta-heuristic adaptive Bi-CGSTAB algorithm to online estimation of a three DoF state–space model in the presence of disturbance and uncertainty
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bi-CGSTAB as an induced dimension reduction method
- s-step iterative methods for symmetric linear systems
- Reducing the effect of global communication in \(\text{GMRES} (m)\) and CG on parallel distributed memory computers
- Flexible BiCG and flexible Bi-CGSTAB for nonsymmetric linear systems
- Flexible Conjugate Gradients
- An efficient hierarchical preconditioner for quadratic discretizations of finite element problems
- Flexible and multi-shift induced dimension reduction algorithms for solving large sparse linear systems
- Exploiting BiCGstab($\ell$) Strategies to Induce Dimension Reduction
- IDR(s): A Family of Simple and Fast Algorithms for Solving Large Nonsymmetric Systems of Linear Equations
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- A Black Box Generalized Conjugate Gradient Solver with Inner Iterations and Variable-Step Preconditioning
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Inner and Outer Iterations for the Chebyshev Algorithm
- Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing
- Flexible Inner-Outer Krylov Subspace Methods
- Inexact Preconditioned Conjugate Gradient Method with Inner-Outer Iteration
- Inexact Krylov Subspace Methods for Linear Systems
- GMRESR: a family of nested GMRES methods
- Hiding Global Communication Latency in the GMRES Algorithm on Massively Parallel Machines
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- Inexact Matrix-Vector Products in Krylov Methods for Solving Linear Systems: A Relaxation Strategy
- FQMR: A Flexible Quasi-Minimal Residual Method with Inexact Preconditioning
