Pages that link to "Item:Q1205895"
From MaRDI portal
The following pages link to Parametrization of Newton's iteration for computations with structured matrices and applications (Q1205895):
Displayed 11 items.
- Solving structured linear systems with large displacement rank (Q954988) (← links)
- Improved parallel computations with Toeplitz-like and Hankel-like matrices (Q1260780) (← links)
- Structured matrices and Newton's iteration: unified approach (Q1348095) (← links)
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields (Q1365930) (← links)
- Algebraic and numerical techniques for the computation of matrix determinants (Q1368466) (← links)
- Improved algorithms for computing determinants and resultants (Q1763424) (← links)
- Parallel computation of a Krylov matrix for a sparse and structured input (Q1900259) (← links)
- Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant (Q1903781) (← links)
- Optimal and nearly optimal algorithms for approximating polynomial zeros (Q1921261) (← links)
- Lifting/descending processes for polynomial zeros. (Q1977147) (← links)
- Superfast algorithms for Cauchy-like matrix computations and extensions (Q1978119) (← links)