scientific article
From MaRDI portal
Publication:3138975
zbMATH Open0800.68501MaRDI QIDQ3138975FDOQ3138975
Publication date: 20 October 1993
Title of this publication is not available (Why is that?)
Parallel numerical computation (65Y05) Inequalities involving eigenvalues and eigenvectors (15A42) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Analysis of algorithms and problem complexity (68Q25) Basic linear algebra (15A99) Distributed algorithms (68W15)
Cited In (12)
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields
- Superfast divide-and-conquer method and perturbation analysis for structured eigenvalue solutions
- Efficient parallel factorization and solution of structured and unstructured linear systems
- Optimal and nearly optimal algorithms for approximating polynomial zeros
- Generalized updating problems and computation of the eigenvalues of rational Toeplitz matrices
- Parallel solution of Toeplitzlike linear systems
- Computation of approximate polynomial GCDs and an extension
- Practical improvement of the divide-and-conquer eigenvalue algorithms
- SuperDC: Superfast Divide-And-Conquer Eigenvalue Decomposition With Improved Stability for Rank-Structured Matrices
- Nearly optimal refinement of real roots of a univariate polynomial
- Improving the solution of the symmetric eigenvalue problem and an extension
- On the evaluation of the eigenvalues of a banded Toeplitz block matrix
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138975)
