The following pages link to (Q3138975):
Displaying 12 items.
- Nearly optimal refinement of real roots of a univariate polynomial (Q898253) (← links)
- On the evaluation of the eigenvalues of a banded Toeplitz block matrix (Q1186509) (← links)
- Parallel solution of Toeplitzlike linear systems (Q1190529) (← links)
- Practical improvement of the divide-and-conquer eigenvalue algorithms (Q1192014) (← links)
- Improving the solution of the symmetric eigenvalue problem and an extension (Q1206210) (← links)
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields (Q1365930) (← links)
- Generalized updating problems and computation of the eigenvalues of rational Toeplitz matrices (Q1373318) (← links)
- Computation of approximate polynomial GCDs and an extension (Q1854432) (← links)
- Optimal and nearly optimal algorithms for approximating polynomial zeros (Q1921261) (← links)
- Efficient parallel factorization and solution of structured and unstructured linear systems (Q2486566) (← links)
- Superfast divide-and-conquer method and perturbation analysis for structured eigenvalue solutions (Q2805015) (← links)
- SuperDC: Superfast Divide-And-Conquer Eigenvalue Decomposition With Improved Stability for Rank-Structured Matrices (Q5038407) (← links)
