A Stable and Efficient Algorithm for the Rank-One Modification of the Symmetric Eigenproblem
From MaRDI portal
Publication:4313377
DOI10.1137/S089547989223924XzbMath0807.65029WikidataQ56560612 ScholiaQ56560612MaRDI QIDQ4313377
Publication date: 16 November 1994
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
algorithmeigenvalueseigenvectorseigendecompositionsymmetric rank-one modification of a symmetric matrix
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Complexity and performance of numerical algorithms (65Y20)
Related Items
SuperDC: Superfast Divide-And-Conquer Eigenvalue Decomposition With Improved Stability for Rank-Structured Matrices, Fast algorithms using orthogonal polynomials, On the distribution of the sample autocorrelation coefficients, The Singular Value Decomposition: Anatomy of Optimizing an Algorithm for Extreme Scale, Evaluation of small elements of the eigenvectors of certain symmetric tridiagonal matrices with high relative accuracy, An Accelerated Divide-and-Conquer Algorithm for the Bidiagonal SVD Problem, A divide-and-conquer method for the tridiagonal generalized eigenvalue problem, A numerical comparison of methods for solving secular equations, Efficient computation of tridiagonal matrices largest eigenvalue, Forward stable eigenvalue decomposition of rank-one modifications of diagonal matrices, Online Principal Component Analysis in High Dimension: Which Algorithm to Choose?, New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem, Note on a rank-one modification of the singular value decomposition, Enclosing clusters of zeros of polynomials, A new method to improve the efficiency and accuracy of incremental singular value decomposition, A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems, Fast algorithms for spherical harmonic expansions. II., Parallel block tridiagonalization of real symmetric matrices, Hypergraph edge elimination -- a symbolic phase for Hermitian eigensolvers based on rank-1 modifications, A unifying convergence analysis of second-order methods for secular equations, A geometric approach to subspace updates and orthogonal matrix decompositions under rank-one modifications, Analysis of third-order methods for secular equations, Circumscribed ellipsoid algorithm for fixed-point problems, On anti-pentadiagonal persymmetric Hankel matrices with perturbed corners, Recovering nonuniform planted partitions via iterated projection, Fast maximum likelihood estimation of very large spatial autoregressive models: a characteristic polynomial approach., Fast estimation of the median covariation matrix with application to online robust principal components analysis, Divide and conquer algorithms for computing the eigendecomposition of symmetric diagonal-plus-semiseparable matrices, Computing the confidence levels for a root-mean-square test of goodness-of-fit, Sequential Optimal Design of Neurophysiology Experiments, The Fast Cauchy Transform and Faster Robust Linear Regression, An Accelerated Greedy Missing Point Estimation Procedure, The bounds of the eigenvalues for rank-one modification of Hermitian matrix, A Distributed and Incremental SVD Algorithm for Agglomerative Data Analysis on Large Networks, Fast diagonalization of evolving matrices: application to spin-fermion models, Recurrence relations and fast algorithms, Eigenvectors from eigenvalues: A survey of a basic identity in linear algebra, Deflation for the Symmetric Arrowhead and Diagonal-Plus-Rank-One Eigenvalue Problems, Low-dimensional tracking of association structures in categorical data
