A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
From MaRDI portal
Publication:3763473
DOI10.1137/0908018zbMath0627.65033OpenAlexW2058221770MaRDI QIDQ3763473
Danny C. Sorensen, Jack J. Dongarra
Publication date: 1987
Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/bc766153496e535421b467f65a1af23cb066306c
eigenvalue problemparallel computationreal symmetric matrixdivide and conquer techniquetridiagonal symmetric matrixHouseholder reductionrank-one updating
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05)
Related Items
SuperDC: Superfast Divide-And-Conquer Eigenvalue Decomposition With Improved Stability for Rank-Structured Matrices, 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, Parallel homotopy algorithm for symmetric large sparse eigenproblems, New software for large dense symmetric generalized eigenvalue problems using secondary storage, A fully parallel method for the singular eigenvalue problem, Parallel implementation of semiempirical quantum methods for the Intel platforms, Restricted rank modification of the symmetric eigenvalue problem: Theoretical considerations, Schur complements and the Weinstein-Aronszajn theory for modified matrix eigenvalue problems, 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, An overview of parallel algorithms for the singular value and symmetric eigenvalue problems, Computation of minimum eigenvalue through minimization of rayleigh's quotient for large sparse matrices using vector computer:, Efficient computation of tridiagonal matrices largest eigenvalue, 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, An algorithm for computing the eigenvalues of block companion matrices, Note on a rank-one modification of the singular value decomposition, A mathematical biography of Danny C. Sorensen, A Parallel Algorithm for Computing the Eigenvalues of a Symmetric Tridiagonal Matrix, Parallel block tridiagonalization of real symmetric matrices, Numerical solution of linear eigenvalue problems, A divide and conquer method for polynomial zeros, Tridiagonalization of band symmetric matrices for vector computers, 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, A quantum eigensolver for symmetric tridiagonal matrices, A Schur-based algorithm for computing bounds to the smallest eigenvalue of a symmetric positive definite Toeplitz matrix, Analysis of third-order methods for secular equations, Practical improvement of the divide-and-conquer eigenvalue algorithms, Circumscribed ellipsoid algorithm for fixed-point problems, A case against a divide and conquer approach to the nonsymmetric eigenvalue problem, The symmetric tridiagonal eigenproblem on a shared memory multiprocessor. II, Parallel algorithms for reduction of a general matrix to upper Hessenberg form on a shared memory multiprocessor, Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations, Homotopy-Determinant Algorithm for Solving Nonsymmetric Eigenvalue Problems, Superfast Divide-and-Conquer Method and Perturbation Analysis for Structured Eigenvalue Solutions, Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices, Block reduction of matrices to condensed forms for eigenvalue computations, Parallel algorithms for reduction of a symmetric matrix to tridiagonal form on a shared memory multiprocessor, Eigenvalue computation in the 20th century, Deflation for the Symmetric Arrowhead and Diagonal-Plus-Rank-One Eigenvalue Problems, A parallel iterative method for solving symmetric tridiagonal extreme eigenpair problems
Uses Software
