On the generation of Krylov subspace bases
From MaRDI portal
Publication:436007
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
Cites work
- scientific article; zbMATH DE number 434530 (Why is no real title available?)
- scientific article; zbMATH DE number 3179593 (Why is no real title available?)
- scientific article; zbMATH DE number 592765 (Why is no real title available?)
- scientific article; zbMATH DE number 749845 (Why is no real title available?)
- scientific article; zbMATH DE number 1862742 (Why is no real title available?)
- scientific article; zbMATH DE number 2212009 (Why is no real title available?)
- A Hybrid Chebyshev Krylov Subspace Algorithm for Solving Nonsymmetric Systems of Linear Equations
- A Hybrid GMRES Algorithm for Nonsymmetric Linear Systems
- A Newton basis GMRES implementation
- A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations
- A parallel GMRES version for general sparse matrices
- A stable Richardson iteration method for complex linear systems
- A study of semiiterative methods for nonsymmetric systems of linear equations
- Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration
- Alternatives for parallel Krylov subspace basis computation
- An adaptive Chebyshev iterative method for nonsymmetric linear systems based on modified moments
- Analysis of Some Krylov Subspace Approximations to the Matrix Exponential Operator
- Calculation of Pseudospectra by the Arnoldi Iteration
- Error Estimates and Evaluation of Matrix Functions via the Faber Transform
- Fast Leja points
- Fields of values and iterative methods
- Fitting parametric curves and surfaces by \(l_\infty\) distance regression
- Further analysis of the Arnoldi process for eigenvalue problems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Large-scale computation of pseudospectra using ARPACK and eigs
- Least Squares Polynomials in the Complex Plane and Their Use for Solving Nonsymmetric Linear Systems
- Lebesgue constants for Leja points
- Matrix algorithms. Vol. 2: Eigensystems
- Modified Gram-Schmidt (MGS), Least Squares, and Backward Stability of MGS-GMRES
- Newton interpolation at Leja points
- On Polynomial Approximation in the Complex Plane with Application to Conformal Mapping
- On hybrid iterative methods for nonsymmetric systems of linear equations
- Parallel iterative methods for sparse linear systems
- Parallelizable restarted iterative methods for nonsymmetric linear systems. II: parallel implementation
- Parallelizable restarted iterative methods for nonsymmetric linear systems. part I: Theory
- Sur certaines suites liées aux ensembles plans et leur application à la représentation conforme
- The Chebyshev iteration revisited
- The Condition of Orthogonal Polynomials
- The Condition of Polynomials in Power Form
- The Tchebychev iteration for nonsymmetric linear systems
Cited in
(26)- Exploiting the composite step strategy to the biconjugate \(A\)-orthogonal residual method for non-Hermitian linear systems
- Some properties of range restricted GMRES methods
- An adaptive \(s\)-step conjugate gradient algorithm with dynamic basis updating.
- Chebyshev approximation via polynomial mappings and the convergence behaviour of Krylov subspace methods
- scientific article; zbMATH DE number 697754 (Why is no real title available?)
- Varying the \(s\) in your \(s\)-step GMRES
- Krylov subspaces and the analytic grade
- Fast computation of orthonormal basis for RBF spaces through Krylov space methods
- The adaptive \(s\)-step conjugate gradient method
- A restarted induced dimension reduction method to approximate eigenpairs of large unsymmetric matrices
- Polynomial Preconditioned GMRES and GMRES-DR
- Communication lower bounds and optimal algorithms for numerical linear algebra
- scientific article; zbMATH DE number 697769 (Why is no real title available?)
- On Optimal Short Recurrences for Generating Orthogonal Krylov Subspace Bases
- A numerically stable communication-avoiding \(s\)-step GMRES algorithm
- GMRES algorithms over 35 years
- 3-D rolling processing analysis by fast multipole boundary element method
- Tridiagonal Toeplitz matrices: properties and novel applications
- Krylov Subspace Methods on Supercomputers
- Orthogonal Hessenberg Reduction and Orthogonal Krylov Subspace Bases
- On the cost of iterative computations
- A sketch-and-select Arnoldi process
- Fast and accurate randomized algorithms for linear systems and eigenvalue problems
- Krylov subspace recycling with randomized sketching for matrix functions
- Accuracy of the $s$-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision
- Randomized Sketching for Krylov Approximations of Large-Scale Matrix Functions
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)
