The Matrix Eigenvalue Problem
From MaRDI portal
Publication:5440996
DOI10.1137/1.9780898717808zbMath1142.65038OpenAlexW4236077070MaRDI QIDQ5440996
Publication date: 6 February 2008
Full work available at URL: https://doi.org/10.1137/1.9780898717808
convergencetextbookKrylov subspace methodLanczos algorithmArnoldi algorithmmatrix eigenvalue problemssparse problemsgeneralized eigenvalue problemsSR algorithmHR algorithmGR method, QR algorithm
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18) Iterative numerical methods for linear systems (65F10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to numerical analysis (65-01)
Related Items
Structured backward errors in linearizations ⋮ Adaptive computation of smallest eigenvalues of self-adjoint elliptic partial differential equations ⋮ Backward error analysis of the shift-and-invert Arnoldi algorithm ⋮ Data Driven Modal Decompositions: Analysis and Enhancements ⋮ On Gauss-type quadrature formulas with prescribed nodes anywhere on the real line ⋮ Jordan structures of alternating matrix polynomials ⋮ Computational Methods for Linear Matrix Equations ⋮ The $QR$ Steps with Perfect Shifts ⋮ A periodic qd-type reduction for computing eigenvalues of structured matrix products to high relative accuracy ⋮ A new extrapolation method for PageRank computations ⋮ Polynomial matrices, splitting subspaces and Krylov subspaces over finite fields ⋮ Weak stability bounds for approximations of invariant measures with applications to queueing ⋮ An extended Hamiltonian QR algorithm ⋮ Computationally enhanced projection methods for symmetric Sylvester and Lyapunov matrix equations ⋮ A unitary similarity transform of a normal matrix to complex symmetric form ⋮ Stable and Efficient Computation of Generalized Polar Decompositions ⋮ The LR Cholesky algorithm for symmetric hierarchical matrices ⋮ Fast and Backward Stable Computation of Roots of Polynomials, Part II: Backward Error Analysis; Companion Matrix and Companion Pencil ⋮ A new framework for implicit restarting of the Krylov-Schur algorithm ⋮ Multiscale modal analysis of fully-loaded spent nuclear fuel canisters ⋮ A compact heart iteration for low-rank approximations of large matrices ⋮ Complexity of path-following methods for the eigenvalue problem ⋮ A Structure-Preserving Divide-and-Conquer Method for Pseudosymmetric Matrices ⋮ Schur complement-based domain decomposition preconditioners with low-rank corrections ⋮ A reflection on the implicitly restarted Arnoldi method for computing eigenvalues near a vertical line ⋮ Iterative and doubling algorithms for Riccati‐type matrix equations: A comparative introduction ⋮ Computing the Jordan Structure of an Eigenvalue ⋮ A new shift strategy for the implicitly restarted refined harmonic Lanczos method ⋮ Wavelets on graphs via spectral graph theory ⋮ A real QZ algorithm for structured companion pencils ⋮ Rational QZ steps with perfect shifts ⋮ Reduction of Matrix Polynomials to Simpler Forms ⋮ A Wilkinson-like multishift QR algorithm for symmetric eigenvalue problems and its global convergence ⋮ Simultaneous band reduction of two symmetric matrices ⋮ An upper \(J\)-Hessenberg reduction of a matrix through symplectic Householder transformations ⋮ Fast structured matrix computations: tensor rank and Cohn-Umans method ⋮ Numerical solution of linear eigenvalue problems ⋮ Computing the smallest singular triplets of a large matrix ⋮ A unification of unitary similarity transforms to compressed representations ⋮ On pole-swapping algorithms for the eigenvalue problem ⋮ 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 ⋮ Efficient and accurate algorithms for solving the Bethe-Salpeter eigenvalue problem for crystalline systems ⋮ A weak perturbation theory for approximations of invariant measures in M/G/1 model ⋮ A structural classification of candidate oscillatory and multistationary biochemical systems ⋮ Cucheb: a GPU implementation of the filtered Lanczos procedure ⋮ Unnamed Item ⋮ Computing eigenvalues of normal matrices via complex symmetric matrices ⋮ Inverse eigenvalue problems for extended Hessenberg and extended tridiagonal matrices ⋮ A Hamiltonian Krylov-Schur-type method based on the symplectic Lanczos process ⋮ On tridiagonal matrices unitarily equivalent to normal matrices ⋮ On some classes of structured matrices with algebraic trigonometric eigenvalues ⋮ New progress in real and complex polynomial root-finding ⋮ Sampling the eigenvalues of random orthogonal and unitary matrices ⋮ Pole-swapping algorithms for alternating and palindromic eigenvalue problems ⋮ Fast and backward stable computation of eigenvalues and eigenvectors of matrix polynomials ⋮ Bifurcations in periodic integrodifference equations in \(C(\Omega)\). I: Analytical results and applications. ⋮ On iterative QR pre-processing in the parallel block-Jacobi SVD algorithm ⋮ The numerical rank of Krylov matrices ⋮ Restarted Q-Arnoldi-type methods exploiting symmetry in quadratic eigenvalue problems ⋮ ON A PERTURBATION THEORY OF HAMILTONIAN SYSTEMS WITH PERIODIC COEFFICIENTS ⋮ Fast QR iterations for unitary plus low rank matrices ⋮ A cross-product approach for low-rank approximations of large matrices ⋮ Unnamed Item ⋮ Krylov Subspace Methods in Dynamical Sampling ⋮ Fast subspace approximation via greedy least-squares ⋮ Periodic Eigendecomposition and Its Application to Kuramoto--Sivashinsky System ⋮ A new block method for computing the Hamiltonian Schur form ⋮ Krylov-Subspace Recycling via the POD-Augmented Conjugate-Gradient Method ⋮ A treatment of breakdowns and near breakdowns in a reduction of a matrix to upper \(J\)-Hessenberg form and related topics ⋮ Rayleigh quotient algorithms for nonsymmetric matrix pencils ⋮ Implicit QR algorithms for palindromic and even eigenvalue problems ⋮ A Rational QZ Method ⋮ Asymptotic comparison of the solutions of linear time-delay systems with point and distributed lags with those of their limiting equations ⋮ Weighted and deflated global GMRES algorithms for solving large Sylvester matrix equations ⋮ Iterative algorithms for the post-processing of high-dimensional data ⋮ A Multishift, Multipole Rational QZ Method with Aggressive Early Deflation ⋮ An extrapolation iteration and its lumped type iteration for computing PageRank ⋮ Optimally packed chains of bulges in multishift QR algorithms ⋮ Rank-Structured QR for Chebyshev Rootfinding ⋮ Fast and Backward Stable Computation of Roots of Polynomials ⋮ Computing Symplectic Eigenpairs of Symmetric Positive-Definite Matrices via Trace Minimization and Riemannian Optimization ⋮ Computing interior eigenvalues of large sparse symmetric matrices ⋮ Real polynomial root-finding by means of matrix and polynomial iterations
Uses Software
This page was built for publication: The Matrix Eigenvalue Problem
