A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem

DOI10.1137/0908018zbMATH Open0627.65033OpenAlexW2058221770MaRDI QIDQ3763473FDOQ3763473

Authors: Jack Dongarra, Danny C. Sorensen 

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

Recommendations

• scientific article; zbMATH DE number 434520
• scientific article; zbMATH DE number 1330403
• A Parallel Divide and Conquer Algorithm for the Symmetric Eigenvalue Problem on Distributed Memory Architectures
• A parallel algorithm for the dense symmetric eigenvalue problem on a transputer array
• Publication:4721525

zbMATH Keywords

eigenvalue problemparallel computationreal symmetric matrixdivide and conquer techniquetridiagonal symmetric matrixHouseholder reductionrank-one updating

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Cited In (57)

• Randomized low-rank approximation methods for projection-based model order reduction of large nonlinear dynamical problems
• SuperDC: superfast divide-and-conquer eigenvalue decomposition with improved stability for rank-structured matrices
• A Parallel Eigensolver for Dense Symmetric Matrices Based on Multiple Relatively Robust Representations
• Forward stable eigenvalue decomposition of rank-one modifications of diagonal matrices
• A fully parallel method for the singular eigenvalue problem
• Analysis of third-order methods for secular equations
• Restricted rank modification of the symmetric eigenvalue problem: Theoretical considerations
• A case against a divide and conquer approach to the nonsymmetric eigenvalue problem
• Hypergraph edge elimination -- a symbolic phase for Hermitian eigensolvers based on rank-1 modifications
• Superfast divide-and-conquer method and perturbation analysis for structured eigenvalue solutions
• PARALLEL ALGORITHMS TO COMPUTE THE EIGENVALUES AND EIGENVECTORS OFSYMMETRIC TOEPLITZ MATRICES∗
• A divide and conquer method for polynomial zeros
• A note on bounds to the variation of eigenvalues in symmetric matrix perturbation of rank one
• Efficient solution of symmetric/Hermitian eigenvalue problems on parallel arrays of vector processors
• Gaussian quadrature for matrix valued functions on the real line
• New software for large dense symmetric generalized eigenvalue problems using secondary storage
• A mathematical biography of Danny C. Sorensen
• Schur complements and the Weinstein-Aronszajn theory for modified matrix eigenvalue problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Homotopy-Determinant Algorithm for Solving Nonsymmetric Eigenvalue Problems
• Deflation for the symmetric arrowhead and diagonal-plus-rank-one eigenvalue problems
• An overview of parallel algorithms for the singular value and symmetric eigenvalue problems
• Parallel block tridiagonalization of real symmetric matrices
• Computation of minimum eigenvalue through minimization of rayleigh's quotient for large sparse matrices using vector computer:
• A divide-and-conquer method for the tridiagonal generalized eigenvalue problem
• Numerical solution of linear eigenvalue problems
• Block reduction of matrices to condensed forms for eigenvalue computations
• Eigenvalue computation in the 20th century
• Parallel homotopy algorithm for symmetric large sparse eigenproblems
• The spectrum of a modified linear pencil
• A Schur-based algorithm for computing bounds to the smallest eigenvalue of a symmetric positive definite Toeplitz matrix
• Title not available (Why is that?)
• A Parallel Algorithm for Computing the Eigenvalues of a Symmetric Tridiagonal Matrix
• Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
• A parallel iterative method for solving symmetric tridiagonal extreme eigenpair problems
• Parallel algorithms for reduction of a general matrix to upper Hessenberg form on a shared memory multiprocessor
• Accurate eigenvalue decomposition of real symmetric arrowhead matrices and applications
• An algorithm for computing the eigenvalues of block companion matrices
• On computing accurate singular values and eigenvalues of matrices with acyclic graphs
• Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices
• Practical improvement of the divide-and-conquer eigenvalue algorithms
• Efficient computation of tridiagonal matrices largest eigenvalue
• Parallel algorithms for reduction of a symmetric matrix to tridiagonal form on a shared memory multiprocessor
• Note on a rank-one modification of the singular value decomposition
• A parallel algorithm for the dense symmetric eigenvalue problem on a transputer array
• Title not available (Why is that?)
• Tridiagonalization of band symmetric matrices for vector computers
• The symmetric tridiagonal eigenproblem on a shared memory multiprocessor. II
• Circumscribed ellipsoid algorithm for fixed-point problems
• The symmetric tridigonal eigenproblem on a shared memory multiprocessor. I
• Parallel implementation of semiempirical quantum methods for the Intel platforms
• A unifying convergence analysis of second-order methods for secular equations
• A quantum eigensolver for symmetric tridiagonal matrices
• An algorithm for the generalized symmetric tridiagonal eigenvalue problem
• A numerical comparison of methods for solving secular equations
• Globally and Rapidly Convergent Algorithms for Symmetric Eigenproblems

Uses Software

• EISPACK

This page was built for publication: A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3763473)