On Optimal Short Recurrences for Generating Orthogonal Krylov Subspace Bases
From MaRDI portal
Recommendations
Cited in
(18)- On orthogonal reduction to Hessenberg form with small bandwidth
- Fitting large-scale structured additive regression models using Krylov subspace methods
- An improved condition for a graph to be determined by its generalized spectrum
- On the Smith normal form of walk matrices
- Inverse eigenvalue problems for extended Hessenberg and extended tridiagonal matrices
- Revisiting \((k,\ell)\)-step methods
- Necessary and sufficient conditions for orthogonal similarity transformations to obtain the Arnoli(Lanczos)-Ritz values
- On investigating GMRES convergence using unitary matrices
- The Arnoldi process, short recursions, and displacement ranks
- On the generation of Krylov subspace bases
- On an economic Arnoldi method for \(BML\)-matrices
- Conjugate gradients for symmetric positive semidefinite least-squares problems
- Reliability investigation of BiCGStab and IDR solvers for the advection-diffusion-reaction equation
- Multiple recurrences and the associated matrix structures stemming from normal matrices
- Orthogonal Hessenberg Reduction and Orthogonal Krylov Subspace Bases
- Complex wedge-shaped matrices: a generalization of Jacobi matrices
- Fast computation of orthonormal basis for RBF spaces through Krylov space methods
- A condition for the nonsymmetric saddle point matrix being diagonalizable and having real and positive eigenvalues
This page was built for publication: On Optimal Short Recurrences for Generating Orthogonal Krylov Subspace Bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522877)