Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices
The authors consider the eigenvalue problem for a symmetric real matrix A having all elements equal to zero except those in the main diagonal and one (last) column and one (last) row of A. In some physical applications the order n of such a matrix A may be in thousands. Instead of reducing such a matrix into tridiagonal form (that needs \(O(n^ 3)\) time and \(O(n^ 2)\) storage), the authors show that the eigenvalues may be obtained with \(O(n^ 2)\) time complexity and O(n) storage by solving a nonlinear (rational) equation closely related to the secular equation of the matrix A. This equation may be solved using a combination of the secant method and interval bisection (such a procedure is usually available in library subroutine packages). The formulae for eigenvectors of such a matrix are also derived and their exactness for obtained estimations of eigenvalues is analyzed. A general Wilkinson-style rounding-error analysis is also done. The calculations for one eigenvalue/eigenvector are completely independent of those for another, so the algorithm may be completely parallelized.
- scientific article; zbMATH DE number 2206802
- scientific article; zbMATH DE number 3930234
- Computational Science and Its Applications – ICCSA 2004
- Computation of an eigenvector of a symmetric tridiagonal matrix
- On Computing Eigenvectors of Symmetric Tridiagonal Matrices
- Computing the eigenvalues of skew-symmetric matrices
- Computing the eigenvalues of modified symmetric matrices
- Calculation of the eigenstructure of symmetric matrices
- Computing all or some eigenvalues of symmetric \(\mathcal{H}_{\ell}\)-matrices
- Computing eigenvalues of normal matrices via complex symmetric matrices
- A Divide and Conquer method for the symmetric tridiagonal eigenproblem
- A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
- scientific article; zbMATH DE number 3473182 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- Matrix eigensystem routines - EISPACK guide. 2nd ed
- Rank-one modification of the symmetric eigenproblem
- Some Modified Matrix Eigenvalue Problems
- The Rotation of Eigenvectors by a Perturbation. III
- Finite sample approximation results for principal component analysis: A matrix perturbation approach
- A parallel Davidson-type algorithm for several eigenvalues
- A graph-theoretic model of symmetric Givens operations and its implications
- Explicit approximate inverse preconditioning techniques
- Explicit preconditioned domain decomposition schemes for solving nonlinear boundary value problems.
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- An explicit formula for the inverse of arrowhead and doubly arrow matrices
- The modified bordering method to evaluate eigenvalues and eigenvectors of normal matrices
- A numerical solver for general bordered tridiagonal matrix equations
- Least-squares solutions of the matrix equations A X B + C Y D = H and A X B + C X D = H for symmetric arrowhead matrices and associated approximation problems
- Global stability and exact solution of an arbitrary-solute nonlinear cellular mass transport system
- An efficient method for computing the inverse of arrowhead matrices
- What is relative measurement! The ratio scale phantom
- On computing accurate singular values and eigenvalues of matrices with acyclic graphs
- Linear open quantum systems with passive Hamiltonians and a single local dissipative process
- The eigenvalue problem for ‘‘arrow’’ matrices
- An approximate inverse matrix technique for arrowhead matrices
- Accurate eigenvalue decomposition of real symmetric arrowhead matrices and applications
- Sturm sequence analysis of a diagonally bordered matrix
- SuperDC: superfast divide-and-conquer eigenvalue decomposition with improved stability for rank-structured matrices
- Least squares solutions of the matrix equation AXB+CYD=E with the least norm for symmetric arrowhead matrices
- Linear systems of differential equations in arrowhead form
- A fast and reliable numerical solver for general bordered \(k\)-tridiagonal matrix linear equations
- Progressively Type-II censored competing risks data from the linear exponential distribution
- Iterative algorithms for least-squares solutions of a quaternion matrix equation
- Polaritons and excitons: Hamiltonian design for enhanced coherence
- Eigengaps for hub-dominant matrices
- Computational Science and Its Applications – ICCSA 2004
- Deflation for the symmetric arrowhead and diagonal-plus-rank-one eigenvalue problems
- Cramér-von-Mises tests for the distribution of the excess over a confidence level
- A new method to improve the efficiency and accuracy of incremental singular value decomposition
- Can shallow quantum circuits scramble local noise into global white noise?
- Tridiagonal maximum-entropy sampling and tridiagonal masks
- A case against a divide and conquer approach to the nonsymmetric eigenvalue problem
- An improved shifted CholeskyQR based on columns
- Inverse spectral problems for a special acyclic matrix
- Rank-one matrix completion via high-rank matrices in sum-of-squares relaxations
- Best low rank approximations are a special case of best DCD-matrix approximations
- A hub matrix theory and applications to wireless communications
- High performance inverse preconditioning
- Forward stable eigenvalue decomposition of rank-one modifications of diagonal matrices
- Computable eigenvalue bounds for rank-\(k\) perturbations
- Bounds for eigenvalues of arrowhead matrices and their applications to hub matrices and wireless communications
This page was built for publication: Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q753416)
