Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems
From MaRDI portal
(Redirected from Publication:1326401)
Recommendations
Cites work
- scientific article; zbMATH DE number 3671573 (Why is no real title available?)
- A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices
- Bounds for iterates, inverses, spectral variation and fields of values of non-normal matrices
- Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems
- Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
- On the Automatic Scaling of Matrices for Gaussian Elimination
- Sparse matrix test problems
- Tchebychev acceleration technique for large scale nonsymmetric matrices
- The Davidson Method
- The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
Cited in
(34)- scientific article; zbMATH DE number 5524926 (Why is no real title available?)
- Deflated block Krylov subspace methods for large scale eigenvalue problems
- Generalized Preconditioned Locally Harmonic Residual Method for Non-Hermitian Eigenproblems
- A Filtered-Davidson Method for Large Symmetric Eigenvalue Problems
- On block minimal residual methods
- Efficient solution of the simplified \(P_N\) equations
- Shape optimization towards stability in constrained hydrodynamic systems
- A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems
- scientific article; zbMATH DE number 4070184 (Why is no real title available?)
- A block incomplete orthogonalization method for large nonsymmetric eigenproblems
- Convergence properties of some block Krylov subspace methods for multiple linear systems
- Low complexity matrix projections preserving actions on vectors
- A fully adaptive rational global Arnoldi method for the model-order reduction of second-order MIMO systems with proportional damping
- On flexible block Chebyshev-Davidson method for solving symmetric generalized eigenvalue problems
- Stein implicit Runge-Kutta methods with high stage order for large-scale ordinary differential equations
- The Riccati algorithm for eigenvalues and invariant subspaces of matrices with inexpensive action
- Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
- BACKWARD PERTURBATION ANALYSIS AND RELATIVE ALGORITHMS FOR NONSYMMETRIC LINEAR SYSTEMS WITH MULTIPLE RIGHT-HAND SIDES
- A subspace preconditioning algorithm for eigenvector/eigenvalue computation
- A variation on the block Arnoldi method for large unsymmetric matrix eigenproblems
- Projection methods for large Lyapunov matrix equations
- Use of near-breakdowns in the block Arnoldi method for solving large Sylvester equations
- Smoothing iterative block methods for linear systems with multiple right-hand sides
- A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems
- Arnoldi-Riccati method for large eigenvalue problems
- An iterative block Arnoldi algorithm with modified approximate eigenvectors for large unsymmetric eigenvalue problems
- Block Krylov-Schur method for large symmetric eigenvalue problems
- Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices
- Convergence properties of block GMRES and matrix polynomials
- A block varaint of the GMRES method for unsymmetric linear systems
- GMRES with multiple preconditioners
- scientific article; zbMATH DE number 238289 (Why is no real title available?)
- A modified harmonic block Arnoldi algorithm with adaptive shifts for large interior eigen\-problems
- Block Gram-Schmidt algorithms and their stability properties
This page was built for publication: Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1326401)
