Parallel computation of pseudospectra of large sparse matrices
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1113875
- Pseudospectral methods on massively parallel computers
- Parallel computation of pseudospectra by fast descent
- scientific article; zbMATH DE number 1817673
- Parallel solving large-scale sparse matrix eigenvalue problems
- Computation of pseudospectra by spectral dichotomy methods in a parallel environment
- Large-Scale Scientific Computing
- Parallel computation of spectral portrait of large matrices by Davidson type methods
- Sparse Matrix Computations on Parallel Processor Arrays
- scientific article; zbMATH DE number 4070168
Cited in
(12)- Parallel computation of pseudospectra by fast descent
- Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
- Cobra: Parallel path following for computing the matrix pseudospectrum
- PAT -- a reliable path-following algorithm
- V. A. Steklov's problem of estimating the growth of orthogonal polynomials
- Robust localization and counting of eigenvalues
- scientific article; zbMATH DE number 6531153 (Why is no real title available?)
- Computation of pseudospectra by spectral dichotomy methods in a parallel environment
- Approximated structured pseudospectra
- scientific article; zbMATH DE number 1948453 (Why is no real title available?)
- Computing unstructured and structured polynomial pseudospectrum approximations
- Theoretical error estimates for computing the matrix logarithm by Padé-type approximants
This page was built for publication: Parallel computation of pseudospectra of large sparse matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958212)
