Pages that link to "Item:Q5270834"
From MaRDI portal
The following pages link to Fast approximate computations with Cauchy matrices and polynomials (Q5270834):
Displaying 7 items.
- A fast algorithm for orthogonalizing polynomials on an arbitrarily shaped region (revised version). (Q1367132) (← links)
- On fast computation of a polynomial in the Frobenius matrix (Q1571128) (← links)
- Accelerated approximation of the complex roots and factors of a univariate polynomial (Q2357367) (← links)
- Fast approximate PCPs (Q2819532) (← links)
- (Q4226968) (← links)
- Fast matrix multiplication and its algebraic neighbourhood (Q4610195) (← links)
- A new fast root-finder for black box polynomials (Q6658315) (← links)