Rank-one modification of the symmetric eigenproblem
From MaRDI portal
Publication:1243105
DOI10.1007/BF01396012zbMath0369.65007WikidataQ56567283 ScholiaQ56567283MaRDI QIDQ1243105
Danny C. Sorensen, James R. Bunch, Christopher P. Nielsen
Publication date: 1978
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/132565
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
Related Items
Choosing among imputation techniques for incomplete multivariate data: a simulation study, Analysis of third-order methods for secular equations, [https://portal.mardi4nfdi.de/wiki/Software:4721738 Effiziente Erdbebenberechnung einfacher Sekund�rstrukturen in gro�en Bauwerken], A Parallel Algorithm for Computing the Eigenvalues of a Symmetric Tridiagonal Matrix, A unifying convergence analysis of second-order methods for secular equations, Updating the singular value decomposition, The spectrum of a modified linear pencil, A case against a divide and conquer approach to the nonsymmetric eigenvalue problem, Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices, The numerically stable reconstruction of Jacobi matrices from spectral data, On the condition of nearly singular matrices under rank-1 perturbations, Linear algebra on high performance computers, The use of a refined error bound when updating eigenvalues of tridiagonals, Restricted rank modification of the symmetric eigenvalue problem: Theoretical considerations, Schur complements and the Weinstein-Aronszajn theory for modified matrix eigenvalue problems, A Divide and Conquer method for the symmetric tridiagonal eigenproblem, Einschliessung der Eigenwerte modifizierter gedaempfter Schwingungssysteme, Adaptive Lanczos methods for recursive condition estimation, Practical improvement of the divide-and-conquer eigenvalue algorithms, Eigenvalue perturbation and generalized Krylov subspace method, Kron's method for symmetric eigenvalue problems, Spectral functions for real symmetric Toeplitz matrices, Generalized updating problems and computation of the eigenvalues of rational Toeplitz matrices, A divide-and-conquer method for the tridiagonal generalized eigenvalue problem, A numerical comparison of methods for solving secular equations, Enclosing clusters of zeros of polynomials, A uniqueness result concerning a robust regularized least-squares solution, The symmetric tridiagonal eigenproblem on a shared memory multiprocessor. II, Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations, Positive definite Toeplitz matrices, the Arnoldi process for isometric operators, and Gaussian quadrature on the unit circle, A secular equation for the eigenvalues of a diagonal matrix perturbation, The symmetric tridigonal eigenproblem on a shared memory multiprocessor. I, The modified bordering method to evaluate eigenvalues and eigenvectors of normal matrices, Gaussian quadrature for matrix valued functions on the real line, Perturbation bounds for polynomials, Divide and conquer algorithms for computing the eigendecomposition of symmetric diagonal-plus-semiseparable matrices, Construction of real symmetric and per-antisymmetric matrices with prescribed spectrum data, Extreme eigenvalues of real symmetric Toeplitz matrices, A note on bounds to the variation of eigenvalues in symmetric matrix perturbation of rank one
Cites Work
