Convergence of algorithms of decomposition type for the eigenvalue problem
From MaRDI portal
Publication:749154
Recommendations
- Convergence of algorithms for finding eigenvectors
- Convergence of Methods for Nonlinear Eigenvalue Problems
- scientific article; zbMATH DE number 4166728
- scientific article; zbMATH DE number 1078184
- scientific article; zbMATH DE number 3936392
- Convergence results on greedy algorithms for high-dimensional eigenvalue problems
- Convergence of approximate eigenvectors in Jacobi methods
- On the rate of convergence of projection methods in the eigenvalue problem
- scientific article; zbMATH DE number 713697
- Decomplexification of eigenvalue and coneigenvalue problems
Cites work
- scientific article; zbMATH DE number 3872553 (Why is no real title available?)
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 4149460 (Why is no real title available?)
- scientific article; zbMATH DE number 3678541 (Why is no real title available?)
- scientific article; zbMATH DE number 3328675 (Why is no real title available?)
- scientific article; zbMATH DE number 3349178 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- scientific article; zbMATH DE number 3199190 (Why is no real title available?)
- A Geometric Theory for the $QR$, $LU$ and Power Iterations
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- A symplectic QR like algorithm for the solution of the real algebraic Riccati equation
- An analysis of the HR algorithm for computing the eigenvalues of a matrix
- Chasing Algorithms for the Eigenvalue Problem
- Das Verfahren der Treppeniteration und verwandte Verfahren zur Lösung algebraischer Eigenwertprobleme
- Eigenvalues of Ax=lambdaBx for real symmetric matrices A and B computed by reduction to a pseudosymmetric form and the HR process
- Global Convergence of the Basic QR Algorithm On Hessenberg Matrices
- Numerical Methods for Computing Angles Between Linear Subspaces
- Numerical linear algorithms and group theory
- ON A BLOCK IMPLEMENTATION OF HESSENBERG MULTISHIFT QR ITERATION
- On Modern Matrix Iteration Processes of Bernoulli and Graeffe Type
- On some algebraic problems in connection with general eigenvalue algorithms
- Rayleigh quotient iteration fails for nonsymmetric matrices
- The ELR Method for Computing the Eigenvalues of a General Matrix
- The condition numbers of the matrix eigenvalue problem
- Understanding the $QR$ Algorithm
Cited in
(37)- Computing a Hurwitz factorization of a polynomial
- Some remarks on the complex \(J\)-symmetric eigenproblem
- A Wilkinson-like multishift QR algorithm for symmetric eigenvalue problems and its global convergence
- Rational functions, Toda flows, and LR-like algorithms
- The transmission of shifts and shift blurring in the QR algorithm
- A real triple dqds algorithm for the nonsymmetric tridiagonal eigenvalue problem
- Implicit QR algorithms for palindromic and even eigenvalue problems
- On the convergence properties of the orthogonal similarity transformations to tridiagonal and semiseparable (plus diagonal) form
- Convergence of the shifted \(QR\) algorithm on \(3\times{} 3\) normal matrices
- \(SR\) and \(SZ\) algorithms for the symplectic (butterfly) eigenproblem
- A-posteriori residual bounds for Arnoldi's methods for nonsymmetric eigenvalue problems
- Lie algebra representations, nilpotent matrices, and the \(C\)-numerical range
- A note on the double-shift \(QL\) algorithm
- Two connections between the \(SR\) and \(HR\) eigenvalue algorithms
- Rational \(QR\)-iteration without inversion
- \(QR\)-like algorithms for eigenvalue problems
- Diagonalization of complex symmetric matrices: generalized Householder reflections, iterative deflation and implicit shifts
- The parameterized \(SR\) algorithm for symplectic (butterfly) matrices
- Nearly optimal scaling in the SR decomposition
- Polynomial root computation by means of the LR algorithm
- scientific article; zbMATH DE number 1078184 (Why is no real title available?)
- Super-linear convergence in the p -adic QR-algorithm
- An algorithm for the single-input partial pole assignment problem
- scientific article; zbMATH DE number 2217312 (Why is no real title available?)
- A multishift QR iteration without computation of the shifts
- The LR Cholesky algorithm for symmetric hierarchical matrices
- A block Chebyshev-Davidson method with inner-outer restart for large eigenvalue problems
- The symplectic eigenvalue problem, the butterfly form, the SR algorithm, and the Lanczos method
- On matrix differential equations and abstract FG algorithm
- Convergence of algorithms for finding eigenvectors
- On the convergence of the \(QR\) algorithm with multishifts
- Convergence theory of exact interpolation scheme for computing several eigenvectors
- A QR-method for computing the singular values via semiseparable matrices
- scientific article; zbMATH DE number 17465 (Why is no real title available?)
- Convergence of the shifted $QR$ algorithm for unitary Hessenberg matrices
- Skew-Symmetric Differential qd Algorithm
- Matrix Bruhat decompositions with a remark on the QR(GR) algorithm
This page was built for publication: Convergence of algorithms of decomposition type for the eigenvalue problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q749154)
