The Matrix Eigenvalue Problem
From MaRDI portal
Arnoldi algorithmconvergencegeneralized eigenvalue problemsGR method, QR algorithmHR algorithmKrylov subspace methodLanczos algorithmmatrix eigenvalue problemssparse problemsSR algorithmtextbook
Eigenvalues, singular values, and eigenvectors (15A18) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to numerical analysis (65-01) Iterative numerical methods for linear systems (65F10) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Computational methods for sparse matrices (65F50)
Recommendations
Cited in
(only showing first 100 items - show all)- A new block method for computing the Hamiltonian Schur form
- Rayleigh quotient algorithms for nonsymmetric matrix pencils
- Implicit QR algorithms for palindromic and even eigenvalue problems
- Asymptotic comparison of the solutions of linear time-delay systems with point and distributed lags with those of their limiting equations
- Eigenvalue perturbation and generalized Krylov subspace method
- A periodic qd-type reduction for computing eigenvalues of structured matrix products to high relative accuracy
- An extended Hamiltonian QR algorithm
- Computationally enhanced projection methods for symmetric Sylvester and Lyapunov matrix equations
- A new shift strategy for the implicitly restarted refined harmonic Lanczos method
- A real QZ algorithm for structured companion pencils
- Fast structured matrix computations: tensor rank and Cohn-Umans method
- Cucheb: a GPU implementation of the filtered Lanczos procedure
- The numerical rank of Krylov matrices
- Krylov subspace methods for eigenvalues with special properties and their analysis for normal matrices
- Sampling the eigenvalues of random orthogonal and unitary matrices
- Pole-swapping algorithms for alternating and palindromic eigenvalue problems
- Bifurcations in periodic integrodifference equations in \(C(\Omega)\). I: Analytical results and applications.
- An extrapolation iteration and its lumped type iteration for computing PageRank
- Computing interior eigenvalues of large sparse symmetric matrices
- Polynomial matrices, splitting subspaces and Krylov subspaces over finite fields
- Weak stability bounds for approximations of invariant measures with applications to queueing
- Multiscale modal analysis of fully-loaded spent nuclear fuel canisters
- Simultaneous band reduction of two symmetric matrices
- An upper \(J\)-Hessenberg reduction of a matrix through symplectic Householder transformations
- Computing the smallest singular triplets of a large matrix
- On pole-swapping algorithms for the eigenvalue problem
- Efficient and accurate algorithms for solving the Bethe-Salpeter eigenvalue problem for crystalline systems
- Computing eigenvalues of normal matrices via complex symmetric matrices
- Inverse eigenvalue problems for extended Hessenberg and extended tridiagonal matrices
- Fast QR iterations for unitary plus low rank matrices
- A cross-product approach for low-rank approximations of large matrices
- A treatment of breakdowns and near breakdowns in a reduction of a matrix to upper \(J\)-Hessenberg form and related topics
- Weighted and deflated global GMRES algorithms for solving large Sylvester matrix equations
- Real polynomial root-finding by means of matrix and polynomial iterations
- On Gauss-type quadrature formulas with prescribed nodes anywhere on the real line
- Equivalence between modified symplectic Gram-Schmidt and Householder SR algorithms
- Fast computation of eigenvalues of companion, comrade, and related matrices
- Symmetric spaces and Lie triple systems in numerical analysis of differential equations
- Stability of rootfinding for barycentric Lagrange interpolants
- Numerical methods for general and structured eigenvalue problems.
- Matrix algorithms. Vol. 2: Eigensystems
- Numerical methods for large eigenvalue problems
- Periodic eigendecomposition and its application to Kuramoto-Sivashinsky system
- Krylov-subspace recycling via the POD-augmented conjugate-gradient method
- Adaptive computation of smallest eigenvalues of self-adjoint elliptic partial differential equations.
- A new framework for implicit restarting of the Krylov-Schur algorithm.
- Schur complement-based domain decomposition preconditioners with low-rank corrections.
- Numerical methods for eigenvalue problems.
- Numerical methods for large eigenvalue problems
- Backward error analysis of the shift-and-invert Arnoldi algorithm
- scientific article; zbMATH DE number 432500 (Why is no real title available?)
- Data Driven Modal Decompositions: Analysis and Enhancements
- Computational Methods for Linear Matrix Equations
- A new extrapolation method for PageRank computations
- The LR Cholesky algorithm for symmetric hierarchical matrices
- Complexity of path-following methods for the eigenvalue problem
- A reflection on the implicitly restarted Arnoldi method for computing eigenvalues near a vertical line
- A Wilkinson-like multishift QR algorithm for symmetric eigenvalue problems and its global convergence
- The QR steps with perfect shifts
- A stochastic variance reduction method for PCA by an exact penalty approach
- Fast and backward stable computation of roots of polynomials. II: Backward error analysis; companion matrix and companion pencil
- Reduction of Matrix Polynomials to Simpler Forms
- Numerical solution of linear eigenvalue problems
- Krylov subspace methods in dynamical sampling
- A weak perturbation theory for approximations of invariant measures in M/G/1 model
- Fast and backward stable computation of eigenvalues and eigenvectors of matrix polynomials
- A structural classification of candidate oscillatory and multistationary biochemical systems
- A multishift, multipole rational QZ method with aggressive early deflation
- Rank-Structured QR for Chebyshev Rootfinding
- Computing symplectic eigenpairs of symmetric positive-definite matrices via trace minimization and Riemannian optimization
- scientific article; zbMATH DE number 7626764 (Why is no real title available?)
- Stable and efficient computation of generalized polar decompositions
- On a perturbation theory of Hamiltonian systems with periodic coefficients
- A rational QZ method
- Fast and Backward Stable Computation of Roots of Polynomials
- Product Eigenvalue Problems
- Computing the Jordan structure of an eigenvalue
- A Hamiltonian Krylov-Schur-type method based on the symplectic Lanczos process
- On some classes of structured matrices with algebraic trigonometric eigenvalues
- Optimally packed chains of bulges in multishift QR algorithms
- New progress in real and complex polynomial root-finding
- A compact heart iteration for low-rank approximations of large matrices
- A Structure-Preserving Divide-and-Conquer Method for Pseudosymmetric Matrices
- A unitary similarity transform of a normal matrix to complex symmetric form
- Iterative and doubling algorithms for Riccati‐type matrix equations: A comparative introduction
- Rational QZ steps with perfect shifts
- Wavelets on graphs via spectral graph theory
- A unification of unitary similarity transforms to compressed representations
- Higher order stable generalized isogeometric analysis for interface problems
- VDR decomposition of Chebyshev-Vandermonde matrices with the Arnoldi Process
- Reduced projection method for photonic moiré lattices
- Computing eigenvalues for products of two classes of sign regular matrices to high relative accuracy
- On computing the zeros of a class of Sobolev orthogonal polynomials
- Global convergence of Hessenberg shifted QR. I: Exact arithmetic
- Systematic many-fermion Hamiltonian input scheme and spectral calculations on quantum computers
- Using the Krylov subspace formulation to improve regularisation and interpretation in partial least squares regression
- Subspace profiles over finite fields and q-Whittaker expansions of symmetric functions
- Restarted Q-Arnoldi-type methods exploiting symmetry in quadratic eigenvalue problems
- Residual-based Chebyshev filtered subspace iteration for Hermitian eigenvalue problems tolerant to inexact matrix-vector products
- Fast subspace approximation via greedy least-squares
This page was built for publication: The Matrix Eigenvalue Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5440996)
