Recycling BiCGSTAB with an application to parametric model order reduction
From MaRDI portal
Abstract: Krylov subspace recycling is a process for accelerating the convergence of sequences of linear systems. Based on this technique, the recycling BiCG algorithm has been developed recently. Here, we now generalize and extend this recycling theory to BiCGSTAB. Recycling BiCG focuses on efficiently solving sequences of dual linear systems, while the focus here is on efficiently solving sequences of single linear systems (assuming non-symmetric matrices for both recycling BiCG and recycling BiCGSTAB). As compared with other methods for solving sequences of single linear systems with non-symmetric matrices (e.g., recycling variants of GMRES), BiCG based recycling algorithms, like recycling BiCGSTAB, have the advantage that they involve a short-term recurrence, and hence, do not suffer from storage issues and are also cheaper with respect to the orthogonalizations. We modify the BiCGSTAB algorithm to use a recycle space, which is built from left and right approximate invariant subspaces. Using our algorithm for a parametric model order reduction example gives good results. We show about 40% savings in the number of matrix-vector products and about 35% savings in runtime.
Recommendations
- Recycling BICG with an application to model reduction
- Recycling Krylov Subspaces for Sequences of Linear Systems
- Mstab: stabilized induced dimension reduction for Krylov subspace recycling
- Krylov-subspace recycling via the POD-augmented conjugate-gradient method
- Subspace recycling accelerates the parametric macro-modeling of MEMS
Cites work
- A Robust Algorithm for Parametric Model Order Reduction Based on Implicit Moment Matching
- A survey of projection-based model reduction methods for parametric dynamical systems
- An analysis of the composite step biconjugate gradient method
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
- Avoiding breakdown in variants of the BI-CGSTAB algorithm
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- BiCGstab(\(l\)) for linear equations involving unsymmetric matrices with complex spectrum
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Deflated and augmented Krylov subspace methods: A framework for deflated BiCG and related solvers
- Extending the eigCG algorithm to nonsymmetric Lanczos for linear systems with multiple right-hand sides.
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- GPBi-CG: Generalized Product-type Methods Based on Bi-CG for Solving Nonsymmetric Linear Systems
- scientific article; zbMATH DE number 3655296 (Why is no real title available?)
- scientific article; zbMATH DE number 1049350 (Why is no real title available?)
- scientific article; zbMATH DE number 1069613 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- IDR(s): A family of simple and fast algorithms for solving large nonsymmetric systems of linear equations
- Interpolatory projection methods for parameterized model reduction
- Recycling BICG with an application to model reduction
- Recycling Krylov subspaces for efficient large-scale electrical impedance tomography
- Recycling Krylov Subspaces for Sequences of Linear Systems
- Recycling Subspace Information for Diffuse Optical Tomography
- Restarting the nonsymmetric Lanczos algorithm for eigenvalues and linear equations including multiple right-hand sides
- Subspace recycling accelerates the parametric macro-modeling of MEMS
- Variants of BICGSTAB for Matrices with Complex Spectrum
Cited in
(23)- Sylvester-based preconditioning for the waveguide eigenvalue problem
- An automatic Krylov subspaces recycling technique for the construction of a global solution basis of non-affine parametric linear systems
- Revisiting IRKA: connections with pole placement and backward stability
- Conjugate direction methods for multiple solution of SLAEs
- Efficient variants of the CMRH method for solving a sequence of multi-shifted non-Hermitian linear systems simultaneously
- Recycling Krylov subspaces for CFD applications and a new hybrid recycling solver
- Krylov subspace recycling for evolving structures
- An accelerated subspaces recycling strategy for the deflation of parametric linear systems based on model order reduction
- On an integrated Krylov-ADI solver for large-scale Lyapunov equations
- Subspace recycling accelerates the parametric macro-modeling of MEMS
- Recycling BICG with an application to model reduction
- Parallel solver for shifted systems in a hybrid CPU-GPU framework
- Mstab: stabilized induced dimension reduction for Krylov subspace recycling
- Hybrid projection methods with recycling for inverse problems
- Preconditioning parametrized linear systems
- Efficient Krylov subspace techniques for model order reduction of automotive structures in vibroacoustic applications
- Reliability investigation of BiCGStab and IDR solvers for the advection-diffusion-reaction equation
- Hybrid Projection Methods with Recycling for Inverse Problems
- Projections, deflation, and multigrid for nonsymmetric matrices
- Computing reduced order models via inner-outer Krylov recycling in diffuse optical tomography
- A survey of subspace recycling iterative methods
- An efficient iterative penalization method using recycled Krylov subspaces and its application to impulsively started flows
- Two-grid deflated Krylov methods for linear equations
This page was built for publication: Recycling BiCGSTAB with an application to parametric model order reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3449791)
