Numerical methods for general and structured eigenvalue problems.

DOI10.1007/3-540-28502-4zbMath1079.65041OpenAlexW1987753018MaRDI QIDQ2484097

Publication date: 2 August 2005

Published in: Lecture Notes in Computational Science and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-28502-4

zbMATH Keywords

convergence error estimates eigenvalues textbook round-off error Arnoldi method block algorithms QR algorithm QZ algorithm deflation techniques Krylov subspace type methods

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02)

Related Items (45)

Linearizations of matrix polynomials in Bernstein bases ⋮ Two-scale and three-scale asymptotic computations of the Neumann-type eigenvalue problems for hierarchically perforated materials ⋮ Optimal direct velocity feedback ⋮ ON THE MULTIPLE SHOOTING CONTINUATION OF PERIODIC ORBITS BY NEWTON–KRYLOV METHODS ⋮ Model order reduction for linear and nonlinear systems: a system-theoretic perspective ⋮ On Efficiently Computing the Eigenvalues of Limited-Memory Quasi-Newton Matrices ⋮ Computation of the target state and feedback controls for time optimal consensus in multi-agent systems ⋮ An extended Hamiltonian QR algorithm ⋮ A Note on Perturbation Estimates for Invariant Subspaces of Hessenberg Matrices ⋮ Fast iterative solution of the Bethe-Salpeter eigenvalue problem using low-rank and QTT tensor approximation ⋮ Scalable semiparametric spatio-temporal regression for large data analysis ⋮ Optimization of Hopf Bifurcation Points ⋮ Unnamed Item ⋮ On generating Sobolev orthogonal polynomials ⋮ The kinetic energy partition method applied to a confined quantum harmonic oscillator in a one-dimensional Box ⋮ A DC programming approach for solving the symmetric eigenvalue complementarity problem ⋮ Perturbation analysis on matrix pencils for two specified eigenpairs of a semisimple eigenvalue with multiplicity two ⋮ Simultaneous band reduction of two symmetric matrices ⋮ Numerical solution of linear eigenvalue problems ⋮ Verified error bounds for real eigenvalues of real symmetric and persymmetric matrices ⋮ An algorithm for curve identification in the presence of curve intersections ⋮ Parallel reduction of four matrices to condensed form for a generalized matrix eigenvalue algorithm ⋮ A DRBEM approximation of the Steklov eigenvalue problem ⋮ Efficient and accurate algorithms for solving the Bethe-Salpeter eigenvalue problem for crystalline systems ⋮ An iterative method for solving the stable subspace of a matrix pencil and its application ⋮ Multi-scale asymptotic analysis and computation of the elliptic eigenvalue problems in curvilinear coordinates ⋮ Backward error analysis and inverse eigenvalue problems for Hankel and symmetric-Toeplitz structures ⋮ Unnamed Item ⋮ Dashnic-Zusmanovich type matrices: a new subclass of nonsingular \(H\)-matrices ⋮ Simultaneous similarity reductions for a pair of matrices to condensed forms ⋮ Perturbation, extraction and refinement of invariant pairs for matrix polynomials ⋮ Rational invariants of even ternary forms under the orthogonal group ⋮ On solving periodic Riccati equations ⋮ A thick-restart Lanczos type method for Hermitian \(J\)-symmetric eigenvalue problems ⋮ A robust numerical method for the \(\gamma\)-iteration in \(H_{\infty}\) control ⋮ ON A PERTURBATION THEORY OF HAMILTONIAN SYSTEMS WITH PERIODIC COEFFICIENTS ⋮ Multi-scale modal analysis for axisymmetric and spherical symmetric structures with periodic configurations ⋮ A new block method for computing the Hamiltonian Schur form ⋮ Implicit QR algorithms for palindromic and even eigenvalue problems ⋮ A Rational QZ Method ⋮ A randomized multivariate matrix pencil method for superresolution microscopy ⋮ Optimally packed chains of bulges in multishift QR algorithms ⋮ Alternating implicit and semi-implicit iterations in the periodic QZ algorithm ⋮ A Recursive Eigenspace Computation for the Canonical Polyadic Decomposition ⋮ Computing Symplectic Eigenpairs of Symmetric Positive-Definite Matrices via Trace Minimization and Riemannian Optimization

Uses Software

This page was built for publication: Numerical methods for general and structured eigenvalue problems.