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
Related Items
Projected Wasserstein Gradient Descent for High-Dimensional Bayesian Inference, Improving the condition number of a simple eigenvalue by a rank one matrix, SuperDC: Superfast Divide-And-Conquer Eigenvalue Decomposition With Improved Stability for Rank-Structured Matrices, Fast algorithms using orthogonal polynomials, The symmetric tridigonal eigenproblem on a shared memory multiprocessor. I, A Hybrid LSMR Algorithm for Large-Scale Tikhonov Regularization, Linear algebra on high performance computers, The use of a refined error bound when updating eigenvalues of tridiagonals, Choosing among imputation techniques for incomplete multivariate data: a simulation study, Hydrodynamic singular regimes in \(1+1\) kinetic models and spectral numerical methods, Restricted rank modification of the symmetric eigenvalue problem: Theoretical considerations, Boosted optimal weighted least-squares, On Efficiently Computing the Eigenvalues of Limited-Memory Quasi-Newton Matrices, Schur complements and the Weinstein-Aronszajn theory for modified matrix eigenvalue problems, Cubic overestimation and secant updating for unconstrained optimization ofC2, 1functions, The modified bordering method to evaluate eigenvalues and eigenvectors of normal matrices, An improved upper bound for the number of distinct eigenvalues of a matrix after perturbation, Generalized updating problems and computation of the eigenvalues of rational Toeplitz matrices, The spectrum of a modified linear pencil, Gaussian quadrature for matrix valued functions on the real line, A divide-and-conquer method for the tridiagonal generalized eigenvalue problem, A numerical comparison of methods for solving secular equations, Recursive transformed component statistical analysis for incipient fault detection, A note on bounds to the variation of eigenvalues in symmetric matrix perturbation of rank one, Forward stable eigenvalue decomposition of rank-one modifications of diagonal matrices, Inequalities for the eigenvectors associated to extremal eigenvalues in rank one perturbations of symmetric matrices, A Divide and Conquer method for the symmetric tridiagonal eigenproblem, Orthogonal Cauchy-like matrices, On the spectra of token graphs of cycles and other graphs, 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, Spectral properties of anti-heptadiagonal persymmetric Hankel matrices, A mathematical biography of Danny C. Sorensen, Kaczmarz's anomaly: a surprising feature of Kaczmarz's method, A Parallel Algorithm for Computing the Eigenvalues of a Symmetric Tridiagonal Matrix, Asymptotic estimations of a perturbed symmetric eigenproblem, Einschliessung der Eigenwerte modifizierter gedaempfter Schwingungssysteme, Generalized Hybrid Iterative Methods for Large-Scale Bayesian Inverse Problems, Extreme eigenvalues of real symmetric Toeplitz matrices, The bounds of the smallest and largest eigenvalues for rank-one modification of the Hermitian eigenvalue problem, Performance-oriented communication topology design for distributed control of interconnected systems, Hypergraph edge elimination -- a symbolic phase for Hermitian eigensolvers based on rank-1 modifications, Accurate eigenvalue decomposition of real symmetric arrowhead matrices and applications, A unifying convergence analysis of second-order methods for secular equations, Approximate eigensolution of Laplacian matrices for locally modified graph products, A geometric approach to subspace updates and orthogonal matrix decompositions under rank-one modifications, Refined bounds on the number of distinct eigenvalues of a matrix after low-rank update, Adaptive Lanczos methods for recursive condition estimation, Lower bounds for the largest eigenvalue of a symmetric matrix under perturbations of rank one, Analysis of third-order methods for secular equations, Updating the singular value decomposition, Practical improvement of the divide-and-conquer eigenvalue algorithms, Confounder Detection in High-Dimensional Linear Models Using First Moments of Spectral Measures, Stability margin of undirected homogeneous relative sensing networks: a geometric perspective, Unnamed Item, Circumscribed ellipsoid algorithm for fixed-point problems, A case against a divide and conquer approach to the nonsymmetric eigenvalue problem, On anti-pentadiagonal persymmetric Hankel matrices with perturbed corners, The eigenvalues and eigenvectors of finite, low rank perturbations of large random matrices, Perturbation bounds for polynomials, Fast subspace tracking algorithm based on the constrained projection approximation, Computable eigenvalue bounds for rank-\(k\) perturbations, An improved divide-and-conquer algorithm for the banded matrices with narrow bandwidths, The symmetric tridiagonal eigenproblem on a shared memory multiprocessor. II, Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations, Divide and conquer algorithms for computing the eigendecomposition of symmetric diagonal-plus-semiseparable matrices, On the modification of an eigenvalue problem that preserves an eigenspace, An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures, Unnamed Item, Superfast Divide-and-Conquer Method and Perturbation Analysis for Structured Eigenvalue Solutions, The Number of Distinct Eigenvalues of a Matrix After Perturbation, Positive definite Toeplitz matrices, the Arnoldi process for isometric operators, and Gaussian quadrature on the unit circle, DESIGNING RELEVANT FEATURES FOR CONTINUOUS DATA SETS USING ICA, Trust-region and other regularisations of linear least-squares problems, Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices, An Accelerated Greedy Missing Point Estimation Procedure, A secular equation for the eigenvalues of a diagonal matrix perturbation, [https://portal.mardi4nfdi.de/wiki/Publication:4721738 Effiziente Erdbebenberechnung einfacher Sekund�rstrukturen in gro�en Bauwerken], The numerically stable reconstruction of Jacobi matrices from spectral data, The bounds of the eigenvalues for rank-one modification of Hermitian matrix, Symmetric Rank-One Updates from Partial Spectrum with an Application to Out-of-Sample Extension, An efficient numerical method for the symmetric positive definite second-order cone linear complementarity problem, A Distributed and Incremental SVD Algorithm for Agglomerative Data Analysis on Large Networks, Eigenvalue perturbation and generalized Krylov subspace method, Construction of real symmetric and per-antisymmetric matrices with prescribed spectrum data, Kron's method for symmetric eigenvalue problems, Spectral functions for real symmetric Toeplitz matrices, On the spectral properties of real antitridiagonal Hankel matrices, A uniqueness result concerning a robust regularized least-squares solution, On the condition of nearly singular matrices under rank-1 perturbations
Cites Work
