Parallelizable restarted iterative methods for nonsymmetric linear systems. part I: Theory
From MaRDI portal
algorithmscacheChebyshev polynomialsconjugate gradient type methodconvection diffusion equationfinite differenceGMRES/Chebyshev basis algorithmHessenberg matrixiterative methodKrylov spacenonsymmetric matrixNumerical testsorthominparallel
Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Finite difference methods for boundary value problems involving PDEs (65N06) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Parallel numerical computation (65Y05)
Recommendations
- scientific article; zbMATH DE number 1748480
- A Robust GMRES-Based Adaptive Polynomial Preconditioning Algorithm for Nonsymmetric Linear Systems
- Parallelizable restarted iterative methods for nonsymmetric linear systems. II: parallel implementation
- A parallel implementation of the restarted GMRES iterative algorithm for nonsymmetric systems of linear equations
- scientific article; zbMATH DE number 88927
Cites work
- A parallel element-by-element solution scheme
- A Taxonomy for Conjugate Gradient Methods
- Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration
- Basis function selection and preconditioning high degree finite element and spectral methods
- Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 3179593 (Why is no real title available?)
- scientific article; zbMATH DE number 3716684 (Why is no real title available?)
- scientific article; zbMATH DE number 3720254 (Why is no real title available?)
- scientific article; zbMATH DE number 3257775 (Why is no real title available?)
- Implementation of the GMRES Method Using Householder Transformations
- Implementations of the GMRES method
- Leapfrog variants of iterative methods for linear algebraic equations
- Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method
- Necessary and sufficient conditions for the simplification of generalized conjugate-gradient algorithms
- On the condition number of some Gram matrices arising from least squares approximation in the complex plane
- Orthogonal Error Methods
- The Tchebychev iteration for nonsymmetric linear systems
- Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
Cited in
(25)- An adaptive Chebyshev iterative method for nonsymmetric linear systems based on modified moments
- Varying the \(s\) in your \(s\)-step GMRES
- A parallel implementation of the restarted GMRES iterative algorithm for nonsymmetric systems of linear equations
- Adaptive \(k\)-step iterative methods for nonsymmetric systems of linear equations
- GMRES algorithms over 35 years
- scientific article; zbMATH DE number 434538 (Why is no real title available?)
- The stability of block variants of classical Gram-Schmidt
- Polynomial Preconditioned GMRES and GMRES-DR
- On IOM(q): The Incomplete Orthogonalization Method for Large Unsymmetric Linear Systems
- On the generation of Krylov subspace bases
- Communication lower bounds and optimal algorithms for numerical linear algebra
- On the cost of iterative computations
- Accuracy of the s-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision
- Tridiagonal Toeplitz matrices: properties and novel applications
- The Chebyshev iteration revisited
- Randomized Sketching for Krylov Approximations of Large-Scale Matrix Functions
- Developing variable s-step CGNE and CGNR algorithms for non-symmetric linear systems
- Finding solution of linear systems via new forms of BiCG, BiCGstab and CGS algorithms
- A numerically stable communication-avoiding s-step GMRES algorithm
- Krylov subspace recycling with randomized sketching for matrix functions
- On the backward stability of s-step GMRES
- Efficient image reconstruction via regularized variable s-step conjugate gradient method for Sylvester matrix equations
- Gram decay, intrinsic information dimension, and backward stability of s-step GMRES
- An adaptive \(s\)-step conjugate gradient algorithm with dynamic basis updating.
- A restarted induced dimension reduction method to approximate eigenpairs of large unsymmetric matrices
This page was built for publication: Parallelizable restarted iterative methods for nonsymmetric linear systems. part I: Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4021069)
