A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
From MaRDI portal
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
Cited in
(58)- Forward stable eigenvalue decomposition of rank-one modifications of diagonal matrices
- A fully parallel method for the singular eigenvalue problem
- A Parallel Eigensolver for Dense Symmetric Matrices Based on Multiple Relatively Robust Representations
- Analysis of third-order methods for secular equations
- Randomized low-rank approximation methods for projection-based model order reduction of large nonlinear dynamical problems
- A case against a divide and conquer approach to the nonsymmetric eigenvalue problem
- Restricted rank modification of the symmetric eigenvalue problem: Theoretical considerations
- 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∗
- SuperDC: superfast divide-and-conquer eigenvalue decomposition with improved stability for rank-structured 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
- scientific article; zbMATH DE number 4070183 (Why is no real title available?)
- scientific article; zbMATH DE number 819138 (Why is no real title available?)
- Homotopy-Determinant Algorithm for Solving Nonsymmetric Eigenvalue Problems
- An overview of parallel algorithms for the singular value and symmetric eigenvalue problems
- Parallel block tridiagonalization of real symmetric matrices
- Deflation for the symmetric arrowhead and diagonal-plus-rank-one eigenvalue problems
- 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
- Block reduction of matrices to condensed forms for eigenvalue computations
- Numerical solution of linear eigenvalue problems
- 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
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- scientific article; zbMATH DE number 434520 (Why is no real title available?)
- 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
- A Parallel Algorithm for Computing the Eigenvalues of a Symmetric Tridiagonal Matrix
- Accurate eigenvalue decomposition of real symmetric arrowhead matrices and applications
- An algorithm for computing the eigenvalues of block companion matrices
- Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices
- On computing accurate singular values and eigenvalues of matrices with acyclic graphs
- Practical improvement of the divide-and-conquer eigenvalue algorithms
- Efficient computation of tridiagonal matrices largest eigenvalue
- The eigenvalue decomposition of normal matrices by the skew-symmetric part
- A parallel algorithm for the dense symmetric eigenvalue problem on a transputer array
- 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
- Tridiagonalization of band symmetric matrices for vector computers
- scientific article; zbMATH DE number 1760072 (Why is no real title available?)
- The symmetric tridiagonal eigenproblem on a shared memory multiprocessor. II
- The symmetric tridigonal eigenproblem on a shared memory multiprocessor. I
- Circumscribed ellipsoid algorithm for fixed-point problems
- 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
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)
