On a new variant of Arnoldi method for approximation of eigenpairs
From MaRDI portal
(Redirected from Publication:2229927)
Recommendations
- A new variant of Arnoldi method for approximation of eigenpairs
- scientific article; zbMATH DE number 903123
- A refined Arnoldi type method for large scale eigenvalue problems
- Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems
- A variant on harmonic Arnoldi method
Cites work
- A modified harmonic block Arnoldi algorithm with adaptive shifts for large interior eigen\-problems
- A new variant of Arnoldi method for approximation of eigenpairs
- A partitioned model order reduction approach to rationalise computational expenses in nonlinear fracture mechanics
- A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems
- An adaptive domain-based POD/ECM hyper-reduced modeling framework without offline training
- An analysis of the Rayleigh-Ritz method for approximating eigenspaces
- An iterative block Arnoldi algorithm with modified approximate eigenvectors for large unsymmetric eigenvalue problems
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- Automatised selection of load paths to construct reduced-order models in computational damage micromechanics: from dissipation-driven random selection to Bayesian optimization
- Computing interior eigenvalues of large matrices
- Harmonic projection methods for large non-symmetric eigenvalue problems
- scientific article; zbMATH DE number 1507134 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Matrix algorithms. Vol. 2: Eigensystems
- Numerical methods for large eigenvalue problems
- Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems
- Templates for the Solution of Algebraic Eigenvalue Problems
- The convergence of harmonic Ritz vectors and harmonic Ritz values, revisited
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices
- Thick-restart Lanczos method for large symmetric eigenvalue problems
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
Cited in
(4)
This page was built for publication: On a new variant of Arnoldi method for approximation of eigenpairs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2229927)