scientific article

zbMath0800.68501MaRDI QIDQ3138975

Pan, Victor Y., Dario Andrea Bini

Publication date: 20 October 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

parallel complexitytridiagonal symmetric eigenvalue problem

Mathematics Subject Classification ID

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

Related Items (12)

SuperDC: Superfast Divide-And-Conquer Eigenvalue Decomposition With Improved Stability for Rank-Structured Matrices ⋮ 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 ⋮ Optimal and nearly optimal algorithms for approximating polynomial zeros ⋮ Nearly optimal refinement of real roots of a univariate polynomial ⋮ 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 ⋮ Efficient parallel factorization and solution of structured and unstructured linear systems ⋮ Superfast Divide-and-Conquer Method and Perturbation Analysis for Structured Eigenvalue Solutions ⋮ Computation of approximate polynomial GCDs and an extension

This page was built for publication: