MONITORING THE CONVERGENCE OF THE LANCZOS ALGORITHM IN PARALLEL COMPUTING ENVIRONMENTS
From MaRDI portal
Publication:4820115
DOI10.1080/10637199508915516zbMATH Open1049.68932OpenAlexW2008703489MaRDI QIDQ4820115FDOQ4820115
Authors:
Publication date: 6 October 2004
Published in: Parallel Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10637199508915516
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A class of Lanczos-like algorithms implemented on parallel computers
- Eigenvalues of a symmetric tridiagonal matrix: A divide-and-conquer approach
- A Multiprocessor Algorithm for the Symmetric Tridiagonal Eigenvalue Problem
- The Lanczos algorithm for the generalized symmetric eigenproblem on shared-memory architectures
- Tracking the Progress of the Lanczos Algorithm for Large Symmetric Eigenproblems
- Parallel implementation of bisection for the calculation of eigenvalues of tridiagonal symmetric matrices
Cited In (1)
This page was built for publication: MONITORING THE CONVERGENCE OF THE LANCZOS ALGORITHM IN PARALLEL COMPUTING ENVIRONMENTS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4820115)