Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices
From MaRDI portal
Publication:753416
DOI10.1016/0021-9991(90)90177-3zbMath0716.65033OpenAlexW2006399983MaRDI QIDQ753416
Dianne P. O'Leary, G. W. Stewart
Publication date: 1990
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://zenodo.org/record/1253916
eigenvalueseigenvectorstime complexitysecant methodsymmetric arrowhead matricesinterval bisectionrounding-error analysis
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Roundoff error (65G50) Parallel numerical computation (65Y05)
Related Items
SuperDC: Superfast Divide-And-Conquer Eigenvalue Decomposition With Improved Stability for Rank-Structured Matrices, An approximate inverse matrix technique for arrowhead matrices, What is relative measurement! The ratio scale phantom, On computing accurate singular values and eigenvalues of matrices with acyclic graphs, A hub matrix theory and applications to wireless communications, High performance inverse preconditioning, A graph-theoretic model of symmetric Givens operations and its implications, The modified bordering method to evaluate eigenvalues and eigenvectors of normal matrices, Progressively Type-II censored competing risks data from the linear exponential distribution, Linear open quantum systems with passive Hamiltonians and a single local dissipative process, Forward stable eigenvalue decomposition of rank-one modifications of diagonal matrices, Cramér-von-Mises tests for the distribution of the excess over a confidence level, Explicit approximate inverse preconditioning techniques, 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, Explicit preconditioned domain decomposition schemes for solving nonlinear boundary value problems., Accurate eigenvalue decomposition of real symmetric arrowhead matrices and applications, Least squares solutions of the matrix equation \(AXB+CYD=E\) with the least norm for symmetric arrowhead matrices, A fast and reliable numerical solver for general bordered \(k\)-tridiagonal matrix linear equations, Iterative algorithms for least-squares solutions of a quaternion matrix equation, Polaritons and excitons: Hamiltonian design for enhanced coherence, A case against a divide and conquer approach to the nonsymmetric eigenvalue problem, Computable eigenvalue bounds for rank-\(k\) perturbations, A numerical solver for general bordered tridiagonal matrix equations, Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations, Eigengaps for hub-dominant matrices, An explicit formula for the inverse of arrowhead and doubly arrow matrices, Finite sample approximation results for principal component analysis: A matrix perturbation approach, A parallel Davidson-type algorithm for several eigenvalues, 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A Divide and Conquer method for the symmetric tridiagonal eigenproblem
- Matrix eigensystem routines - EISPACK guide. 2nd ed
- Rank-one modification of the symmetric eigenproblem
- A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
- The Rotation of Eigenvectors by a Perturbation. III
- Some Modified Matrix Eigenvalue Problems
