A Multiprocessor Algorithm for the Symmetric Tridiagonal Eigenvalue Problem

DOI10.1137/0908019zbMATH Open0649.65024OpenAlexW2073605792MaRDI QIDQ3795152FDOQ3795152

Authors: Sy-Shin Lo, Bernard Philippe, Ahmed H. Sameh 

Publication date: 1987

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0908019

Recommendations

• Publication:4721525
• Solving the Symmetric Tridiagonal Eigenvalue Problem on the Hypercube
• A parallel algorithm for determining all eigenvalues of large real symmetric tridiagonal matrices
• The symmetric tridiagonal eigenvalue problem on a transputer network
• A Parallel Inertia Method for Finding Eigenvalues on Vector and SIMD Architectures

zbMATH Keywords

clusternumerical exampleseigenvectorsGram-Schmidt processinverse iterationmultiprocessororthogonalizationbisectionSturm sequencesreal symmetric tridiagonal eigenvalue problemZeroin method

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Software, source code, etc. for problems pertaining to linear algebra (15-04)

Cited In (23)

• A case against a divide and conquer approach to the nonsymmetric eigenvalue problem
• Parallel implementations for solving generalized eigenvalue problems with symmetric sparse matrices
• Eigenvalue computation of large symmetric tridiagonal matrices on concurrent processors
• Title not available (Why is that?)
• Homotopy-Determinant Algorithm for Solving Nonsymmetric Eigenvalue Problems
• An overview of parallel algorithms for the singular value and symmetric eigenvalue problems
• A parallel algorithm for determining all eigenvalues of large real symmetric tridiagonal matrices
• Computation of minimum eigenvalue through minimization of rayleigh's quotient for large sparse matrices using vector computer:
• A fast and stable parallel QR algorithm for symmetric tridiagonal matrices
• Parallel homotopy algorithm for symmetric large sparse eigenproblems
• The geometric mean algorithm
• Title not available (Why is that?)
• A Parallel Algorithm for Computing the Eigenvalues of a Symmetric Tridiagonal Matrix
• 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
• The symmetric tridiagonal eigenvalue problem on a transputer network
• Solving the Symmetric Tridiagonal Eigenvalue Problem on the Hypercube
• Parallel algorithms for reduction of a symmetric matrix to tridiagonal form on a shared memory multiprocessor
• Applying parallel computer systems to solve symmetric tridiagonal eigenvalue problems
• Tridiagonalization of band symmetric matrices for vector computers
• The symmetric tridiagonal eigenproblem on a shared memory multiprocessor. II
• The symmetric tridigonal eigenproblem on a shared memory multiprocessor. I
• MONITORING THE CONVERGENCE OF THE LANCZOS ALGORITHM IN PARALLEL COMPUTING ENVIRONMENTS

This page was built for publication: A Multiprocessor Algorithm for the Symmetric Tridiagonal Eigenvalue Problem

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