An interactive method for the eigenvalue problem for matrices
From MaRDI portal
Let A be a positive definite matrix. By applying a sequence of Householder reflections some eigenvalue of A can be determined. This eigenvalue is the largest if A is a full positive definite matrix. It is emphasized that the procedure is appropriate for dealing with parallel computation. Finally, the system of differential equations which corresponds to the method proposed is investigated.
Recommendations
- A parallel processed scheme for the eigenproblem of positive definite matrices
- A direct method for completing eigenproblem solutions on a parallel computer
- scientific article; zbMATH DE number 1150470
- Multi-level method in eigenvalue problem
- Some parallel procedures for computing the eigenvalues of a real symmetric matrix
Cites work
- A New Algorithm for Diagonalizing a Real Symmetric Matrix
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- Finitely many mass points on the line under the influence of an exponential potential -- an integrable system
- Ordinary Differential Equations and the Symmetric Eigenvalue Problem
- The QR algorithm and scattering for the finite nonperiodic Toda lattice
- The Toda lattice. II. Existence of integrals
Cited in
(5)- On an integrable discretization of the Rayleigh quotient gradient system and the power method with a shift
- A parallel processed scheme for the eigenproblem of positive definite matrices
- Jacobi algorithm for symmetric eigenvalue problem and integrable gradient system of Lax form
- A shifted method for solving symmetric eigenvalue problems
- scientific article; zbMATH DE number 604921 (Why is no real title available?)
This page was built for publication: An interactive method for the eigenvalue problem for matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911225)