scientific article; zbMATH DE number 432841

MaRDI QIDQ3138975zbMATH OpenFDO

Authors Dario A. Bini, Victor Y. Pan

Publication date 20 October 1993

zbMATH Keywords

parallel complexitytridiagonal symmetric eigenvalue problem

Mathematics Subject Classification ID

Inequalities involving eigenvalues and eigenvectors (15A42) Basic linear algebra (15A99) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05) Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Cited in

(12)

• On the evaluation of the eigenvalues of a banded Toeplitz block matrix
• Parallel solution of Toeplitzlike linear systems
• Practical improvement of the divide-and-conquer eigenvalue algorithms
• Improving the solution of the symmetric eigenvalue problem and an extension
• Parallel computation of polynomial GCD and some related parallel computations over abstract fields
• Generalized updating problems and computation of the eigenvalues of rational Toeplitz matrices
• Computation of approximate polynomial GCDs and an extension
• Optimal and nearly optimal algorithms for approximating polynomial zeros
• Efficient parallel factorization and solution of structured and unstructured linear systems
• Superfast divide-and-conquer method and perturbation analysis for structured eigenvalue solutions
• SuperDC: superfast divide-and-conquer eigenvalue decomposition with improved stability for rank-structured matrices
• Nearly optimal refinement of real roots of a univariate polynomial

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)