A Divide and Conquer method for the symmetric tridiagonal eigenproblem
From MaRDI portal
Publication:1138346
DOI10.1007/BF01396757zbMath0431.65022OpenAlexW2054188927MaRDI QIDQ1138346
Publication date: 1981
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/132696
Analysis of algorithms and problem complexity (68Q25) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Related Items
Orthogonal similarity transformation of a symmetric matrix into a diagonal-plus-semiseparable one with free choice of the diagonal, Eigenvalues of a symmetric tridiagonal matrix: A divide-and-conquer approach, SuperDC: Superfast Divide-And-Conquer Eigenvalue Decomposition With Improved Stability for Rank-Structured Matrices, An approximate inverse matrix technique for arrowhead matrices, Fast algorithms using orthogonal polynomials, On computing accurate singular values and eigenvalues of matrices with acyclic graphs, The symmetric tridigonal eigenproblem on a shared memory multiprocessor. I, An algorithm for the generalized symmetric tridiagonal eigenvalue problem, Linear algebra on high performance computers, The use of a refined error bound when updating eigenvalues of tridiagonals, Flows generating nonlinear eigenfunctions, Computations with quasiseparable polynomials and matrices, Parallel homotopy algorithm for symmetric large sparse eigenproblems, The Singular Value Decomposition: Anatomy of Optimizing an Algorithm for Extreme Scale, Restricted rank modification of the symmetric eigenvalue problem: Theoretical considerations, Schur complements and the Weinstein-Aronszajn theory for modified matrix eigenvalue problems, Stability robustness of perturbed structured systems, The modified bordering method to evaluate eigenvalues and eigenvectors of normal 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, Efficient computation of tridiagonal matrices largest eigenvalue, Forward stable eigenvalue decomposition of rank-one modifications of diagonal matrices, An algorithm for computing the eigenvalues of block companion matrices, Performance and accuracy of the basic closure algorithm of quadrature-based moment methods, 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 mathematical biography of Danny C. Sorensen, Solution of the \(k\)-th eigenvalue problem in large-scale electronic structure calculations, On the approximation of spectra of linear operators on Hilbert spaces, ELSI: a unified software interface for Kohn-Sham electronic structure solvers, GPU-acceleration of the ELPA2 distributed eigensolver for dense symmetric and Hermitian eigenproblems, A Parallel Algorithm for Computing the Eigenvalues of a Symmetric Tridiagonal Matrix, Fast optimization of viscosities for frequency‐weighted damping of second‐order systems, Computing a matrix function for exponential integrators., Parallel block tridiagonalization of real symmetric matrices, Numerical solution of linear eigenvalue problems, EFFICIENT NUMERICAL DIAGONALIZATION OF HERMITIAN 3 × 3 MATRICES, Localization in Matrix Computations: Theory and Applications, A divide and conquer method for polynomial zeros, Extreme eigenvalues of real symmetric Toeplitz matrices, A divide and conquer method for unitary and orthogonal eigenproblems, Hypergraph edge elimination -- a symbolic phase for Hermitian eigensolvers based on rank-1 modifications, Accurate eigenvalue decomposition of real symmetric arrowhead matrices and applications, Eigenvalue perturbation bounds for Hermitian block tridiagonal matrices, A unifying convergence analysis of second-order methods for secular equations, On eigenvalue perturbation bounds for Hermitian block tridiagonal matrices, On Computing Eigenvectors of Symmetric Tridiagonal Matrices, Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices, A quantum eigensolver for symmetric tridiagonal matrices, Analysis of third-order methods for secular equations, Modified Cholesky algorithms: A catalog with new approaches, Practical improvement of the divide-and-conquer eigenvalue algorithms, A new vector field method for eigen-decomposition of symmetric matrices, A case against a divide and conquer approach to the nonsymmetric eigenvalue problem, Solving secular and polynomial equations: a multiprecision algorithm, General polynomial roots and their multiplicities inO(N)memory andO(N2)Time∗, Computation of Gauss-type quadrature formulas, POD-Galerkin reduced order methods for combined Navier-Stokes transport equations based on a hybrid FV-FE solver, Computable eigenvalue bounds for rank-\(k\) perturbations, An improved divide-and-conquer algorithm for the banded matrices with narrow bandwidths, Restructuring the Tridiagonal and Bidiagonal QR Algorithms for Performance, The symmetric tridiagonal eigenproblem on a shared memory multiprocessor. II, A uniform object-oriented solution to the eigenvalue problem for real symmetric and Hermitian matrices, Divide and conquer algorithms for computing the eigendecomposition of symmetric diagonal-plus-semiseparable matrices, On the convergence properties of the orthogonal similarity transformations to tridiagonal and semiseparable (plus diagonal) form, Structured Eigenvalue Problems, An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures, Homotopy-Determinant Algorithm for Solving Nonsymmetric Eigenvalue Problems, Superfast Divide-and-Conquer Method and Perturbation Analysis for Structured Eigenvalue Solutions, A projected gradient method for optimization over density matrices, Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices, A secular equation for the eigenvalues of a diagonal matrix perturbation, The numerically stable reconstruction of Jacobi matrices from spectral data, An efficient numerical method for the symmetric positive definite second-order cone linear complementarity problem, Spectral functions for real symmetric Toeplitz matrices, Eigenvalue computation in the 20th century, Exponentials of symmetric matrices through tridiagonal reductions, A divide and conquer algorithm on the double dimensional inverse eigenvalue problem for Jacobi matrices, Deflation for the Symmetric Arrowhead and Diagonal-Plus-Rank-One Eigenvalue Problems, Some algorithms for maximum volume and cross approximation of symmetric semidefinite matrices, A parallel iterative method for solving symmetric tridiagonal extreme eigenpair problems
Uses Software
Cites Work
