On the generation of Krylov subspace bases
From MaRDI portal
Publication:436007
DOI10.1016/J.APNUM.2010.12.009zbMATH Open1253.65049OpenAlexW1970524119MaRDI QIDQ436007FDOQ436007
Authors: Bernard Philippe, Lothar Reichel 
Publication date: 13 July 2012
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apnum.2010.12.009
Recommendations
- On Optimal Short Recurrences for Generating Orthogonal Krylov Subspace Bases
- An efficient algorithm to construct an orthonormal basis for the extended Krylov subspace
- scientific article; zbMATH DE number 697754
- Krylov Subspace Methods
- scientific article; zbMATH DE number 16954
- Krylov type subspace methods for matrix polynomials
- Krylov Subspace Methods for Linear Systems
- scientific article; zbMATH DE number 1070443
- Condition number of the Krylov bases and subspaces
convergencenumerical examplesChebyshev polynomialsgeneralized minimal residual methoditerative methodcondition numbersArnoldi processeigenvalue computationsevaluation of matrix functionsKrylov subspace basisNewton polynomials
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Numerical computation of matrix exponential and similar matrix functions (65F60)
Cites Work
- Large-scale computation of pseudospectra using ARPACK and eigs
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Parallel iterative methods for sparse linear systems
- Matrix algorithms. Vol. 2: Eigensystems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A parallel GMRES version for general sparse matrices
- Title not available (Why is that?)
- An adaptive Chebyshev iterative method for nonsymmetric linear systems based on modified moments
- Further analysis of the Arnoldi process for eigenvalue problems
- Lebesgue constants for Leja points
- Error Estimates and Evaluation of Matrix Functions via the Faber Transform
- Analysis of Some Krylov Subspace Approximations to the Matrix Exponential Operator
- A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations
- Sur certaines suites liées aux ensembles plans et leur application à la représentation conforme
- Least Squares Polynomials in the Complex Plane and Their Use for Solving Nonsymmetric Linear Systems
- A Hybrid GMRES Algorithm for Nonsymmetric Linear Systems
- The Condition of Polynomials in Power Form
- A Newton basis GMRES implementation
- A Hybrid Chebyshev Krylov Subspace Algorithm for Solving Nonsymmetric Systems of Linear Equations
- Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration
- A stable Richardson iteration method for complex linear systems
- The Tchebychev iteration for nonsymmetric linear systems
- The Chebyshev iteration revisited
- A study of semiiterative methods for nonsymmetric systems of linear equations
- Fields of values and iterative methods
- Fast Leja points
- On hybrid iterative methods for nonsymmetric systems of linear equations
- Fitting parametric curves and surfaces by \(l_\infty\) distance regression
- Title not available (Why is that?)
- On Polynomial Approximation in the Complex Plane with Application to Conformal Mapping
- Parallelizable restarted iterative methods for nonsymmetric linear systems. part I: Theory
- Parallelizable restarted iterative methods for nonsymmetric linear systems. II: parallel implementation
- Alternatives for parallel Krylov subspace basis computation
- Title not available (Why is that?)
- Calculation of Pseudospectra by the Arnoldi Iteration
- Modified Gram-Schmidt (MGS), Least Squares, and Backward Stability of MGS-GMRES
- The Condition of Orthogonal Polynomials
- Newton interpolation at Leja points
Cited In (26)
- Fast computation of orthonormal basis for RBF spaces through Krylov space methods
- Fast and accurate randomized algorithms for linear systems and eigenvalue problems
- Krylov Subspace Methods on Supercomputers
- Randomized Sketching for Krylov Approximations of Large-Scale Matrix Functions
- Title not available (Why is that?)
- A sketch-and-select Arnoldi process
- The Adaptive $s$-Step Conjugate Gradient Method
- Chebyshev approximation via polynomial mappings and the convergence behaviour of Krylov subspace methods
- Krylov subspaces and the analytic grade
- A restarted induced dimension reduction method to approximate eigenpairs of large unsymmetric matrices
- 3-D rolling processing analysis by fast multipole boundary element method
- Orthogonal Hessenberg Reduction and Orthogonal Krylov Subspace Bases
- Title not available (Why is that?)
- A numerically stable communication-avoiding \(s\)-step GMRES algorithm
- Accuracy of the $s$-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision
- Exploiting the composite step strategy to the biconjugate \(A\)-orthogonal residual method for non-Hermitian linear systems
- An adaptive \(s\)-step conjugate gradient algorithm with dynamic basis updating.
- Communication lower bounds and optimal algorithms for numerical linear algebra
- Some properties of range restricted GMRES methods
- Polynomial Preconditioned GMRES and GMRES-DR
- Krylov subspace recycling with randomized sketching for matrix functions
- On the cost of iterative computations
- Tridiagonal Toeplitz matrices: properties and novel applications
- Varying the \(s\) in your \(s\)-step GMRES
- GMRES algorithms over 35 years
- On Optimal Short Recurrences for Generating Orthogonal Krylov Subspace Bases
Uses Software
This page was built for publication: On the generation of Krylov subspace bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436007)
