Eigenvalue computation of large symmetric tridiagonal matrices on concurrent processors
Symmetric tridiagonal eigenvalue problems may arise indirectly in structural dynamic analysis. An algorithm for eigenvalue computation of large symmetric tridiagonal matrices on concurrent processors to meet the challenge of thetial differential equations; Runge-Kutta discretization of ordinary differential equation. A self-consistent estimate for a power-law creeping matrix with aligned penny-shaped cracks is presented. The analysis focuses on both finite element implementations and a closed-form linearized solution. The latter is shown to be an accurate result for a sensible range of arguments; therefore we present the answer in a simple form.
- A parallel algorithm for determining all eigenvalues of large real symmetric tridiagonal matrices
- Applying parallel computer systems to solve symmetric tridiagonal eigenvalue problems
- scientific article; zbMATH DE number 434520
- A Multiprocessor Algorithm for the Symmetric Tridiagonal Eigenvalue Problem
- Solving the Symmetric Tridiagonal Eigenvalue Problem on the Hypercube
- Applying parallel computer systems to solve symmetric tridiagonal eigenvalue problems
- The symmetric tridiagonal eigenproblem on a shared memory multiprocessor. II
- The symmetric tridigonal eigenproblem on a shared memory multiprocessor. I
- The symmetric tridiagonal eigenvalue problem on a transputer network
This page was built for publication: Eigenvalue computation of large symmetric tridiagonal matrices on concurrent processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3773520)