Optimal quotients for solving large eigenvalue problems
Publication:1731607
DOI10.1007/s10543-018-0725-xzbMath1454.65023OpenAlexW2890146710WikidataQ129280578 ScholiaQ129280578MaRDI QIDQ1731607
Publication date: 13 March 2019
Published in: BIT (Search for Journal in Brave)
Full work available at URL: http://urn.fi/urn:nbn:fi-fe201902195449
Rayleigh quotientiterative methodsgeneralized eigenvalue problemArnoldi methodcubic convergencefield of valueoptimal quotient
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Magnetohydrodynamics and electrohydrodynamics (76W05) Matrix pencils (15A22)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On different definitions of numerical range
- The ratio field of values
- Numerical range and accretivity of operator products
- \(C^*\)-algebras and numerical linear algebra
- Numerical range of linear pencils
- Eigenvalue computation in the 20th century
- Numerical Methods for Large Eigenvalue Problems
- Numerical methods for large eigenvalue problems
- The Rayleigh Quotient Iteration and Some Generalizations for Nonnormal Matrices
- Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
- Using Generalized Cayley Transformations within an Inexact Rational Krylov Sequence Method
- Line search algorithms with guaranteed sufficient decrease
- Rational Krylov: A Practical Algorithm for Large Sparse Nonsymmetric Matrix Pencils
- Exploiting negative curvature directions in linesearch methods for unconstrained optimization
- Templates for the Solution of Algebraic Eigenvalue Problems
- Matrix intersection problems for conditioning
- Canonical Forms for Hermitian Matrix Pairs under Strict Equivalence and Congruence
- Convergence of Polynomial Restart Krylov Methods for Eigenvalue Computations
This page was built for publication: Optimal quotients for solving large eigenvalue problems