Using parallel banded linear system solvers in generalized eigenvalue problems

DOI10.1016/0167-8191(94)90070-1zbMath0806.65035OpenAlexW1967660849MaRDI QIDQ1334518

William F. Moss, Hong Zhang

Publication date: 25 September 1994

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2060/19940017111

zbMATH Keywords

numerical exampleseigenvaluesparallel computationmultiprocessorgeneralized eigenproblemdistributed memorybanded systemdiagonally dominant algorithmmethod of subspace iterationoptimal shift selection strategypartition LU algorithm

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05)

Related Items (6)

Parallel difference schemes with interface extrapolation terms for quasi-linear parabolic systems ⋮ Alternating segment explicit-implicit scheme for nonlinear third-order KdV equation ⋮ Parallel iterative methods for parabolic equations ⋮ A difference scheme with intrinsic parallelism for fractional diffusion-wave equation with damping ⋮ A new alternating group explicit-implicit algorithm with high accuracy for dispersive equation ⋮ Unconditional stability of parallel difference schemes with variable time steplengths for heat equations^∗

This page was built for publication: Using parallel banded linear system solvers in generalized eigenvalue problems