A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
From MaRDI portal
Publication:3763473
DOI10.1137/0908018zbMath0627.65033MaRDI 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 problem; parallel computation; real symmetric matrix; divide and conquer technique; tridiagonal symmetric matrix; Householder reduction; rank-one updating
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
65Y05: Parallel numerical computation
Related Items
Analysis of third-order methods for secular equations, Numerical solution of linear eigenvalue problems, SuperDC: Superfast Divide-And-Conquer Eigenvalue Decomposition With Improved Stability for Rank-Structured Matrices, A Parallel Algorithm for Computing the Eigenvalues of a Symmetric Tridiagonal Matrix, A unifying convergence analysis of second-order methods for secular equations, Deflation for the Symmetric Arrowhead and Diagonal-Plus-Rank-One Eigenvalue Problems, Note on a rank-one modification of the singular value decomposition, A mathematical biography of Danny C. Sorensen, Parallel block tridiagonalization of real symmetric matrices, Accurate eigenvalue decomposition of real symmetric arrowhead matrices and applications, The spectrum of a modified linear pencil, A quantum eigensolver for symmetric tridiagonal matrices, A case against a divide and conquer approach to the nonsymmetric eigenvalue problem, Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices, Forward stable eigenvalue decomposition of rank-one modifications of diagonal matrices, A divide and conquer method for polynomial zeros, Tridiagonalization of band symmetric matrices for vector computers, New software for large dense symmetric generalized eigenvalue problems using secondary storage, Restricted rank modification of the symmetric eigenvalue problem: Theoretical considerations, Schur complements and the Weinstein-Aronszajn theory for modified matrix eigenvalue problems, An overview of parallel algorithms for the singular value and symmetric eigenvalue problems, Practical improvement of the divide-and-conquer eigenvalue algorithms, A parallel iterative method for solving symmetric tridiagonal extreme eigenpair problems, An algorithm for the generalized symmetric tridiagonal eigenvalue problem, Parallel implementation of semiempirical quantum methods for the Intel platforms, A divide-and-conquer method for the tridiagonal generalized eigenvalue problem, A numerical comparison of methods for solving secular equations, Eigenvalue computation in the 20th century, Efficient computation of tridiagonal matrices largest eigenvalue, 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, Block reduction of matrices to condensed forms for eigenvalue computations, The symmetric tridigonal eigenproblem on a shared memory multiprocessor. I, Parallel homotopy algorithm for symmetric large sparse eigenproblems, Gaussian quadrature for matrix valued functions on the real line, An algorithm for computing the eigenvalues of block companion matrices, Hypergraph edge elimination -- a symbolic phase for Hermitian eigensolvers based on rank-1 modifications, On computing accurate singular values and eigenvalues of matrices with acyclic graphs, A fully parallel method for the singular eigenvalue problem, A Schur-based algorithm for computing bounds to the smallest eigenvalue of a symmetric positive definite Toeplitz matrix, Parallel algorithms for reduction of a symmetric matrix to tridiagonal form on a shared memory multiprocessor, Superfast Divide-and-Conquer Method and Perturbation Analysis for Structured Eigenvalue Solutions, Circumscribed ellipsoid algorithm for fixed-point problems, Computation of minimum eigenvalue through minimization of rayleigh's quotient for large sparse matrices using vector computer:, A note on bounds to the variation of eigenvalues in symmetric matrix perturbation of rank one, Homotopy-Determinant Algorithm for Solving Nonsymmetric Eigenvalue Problems
Uses Software
