Pages that link to "Item:Q2284957"
From MaRDI portal
The following pages link to Fast computation of approximant bases in canonical form (Q2284957):
Displaying 10 items.
- The approximating capability of fast forms (Q1971592) (← links)
- Computing syzygies in finite dimension using fast linear algebra (Q2192678) (← links)
- Algorithms for simultaneous Hermite-Padé approximations (Q2200312) (← links)
- Deterministic computation of the characteristic polynomial in the time of matrix multiplication (Q2238844) (← links)
- Fast Algorithms for Digital Computation of Linear Canonical Transforms (Q2798298) (← links)
- Fast Computation of Minimal Interpolation Bases in Popov Form for Arbitrary Shifts (Q2985840) (← links)
- High-order lifting for polynomial Sylvester matrices (Q6149161) (← links)
- Minimization of differential equations and algebraic values of 𝐸-functions (Q6203471) (← links)
- Algorithms for linearly recurrent sequences of truncated polynomials (Q6666538) (← links)
- Computing the characteristic polynomial of generic Toeplitz-like and Hankel-like matrices (Q6666544) (← links)