Pages that link to "Item:Q2706245"
From MaRDI portal
The following pages link to Fraction-free computation of matrix rational interpolants and matrix GCDs (Q2706245):
Displaying 27 items.
- Efficient algorithms for order basis computation (Q420746) (← links)
- Fraction-free algorithm for the computation of diagonal forms matrices over Ore domains using Gröbner bases (Q432750) (← links)
- Subresultants, Sylvester sums and the rational interpolation problem (Q480645) (← links)
- Extended rate, more GFUN (Q548596) (← links)
- Computing high precision matrix Padé approximants (Q695617) (← links)
- Determining the closed forms of the anomalous dimensions and Wilson coefficients from Mellin moments by means of computer algebra (Q711793) (← links)
- Solving structured linear systems with large displacement rank (Q954988) (← links)
- Approximate solutions to a parameterized sixth order boundary value problem (Q980341) (← links)
- The set of unattainable points for the rational Hermite interpolation problem (Q1680295) (← links)
- Inverse linear difference operators (Q1746360) (← links)
- Matrix methods for Padé approximation: numerical calculation of poles, zeros and residues (Q1748078) (← links)
- Verification protocols with sub-linear communication for polynomial matrix operations (Q1994891) (← links)
- Computing syzygies in finite dimension using fast linear algebra (Q2192678) (← links)
- Matrices of scalar differential operators: divisibility and spaces of solutions (Q2206414) (← links)
- Fast computation of approximant bases in canonical form (Q2284957) (← links)
- Subresultants in multiple roots: an extremal case (Q2361559) (← links)
- Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix (Q2402419) (← links)
- Simple forms of higher-order linear differential systems and their applications in computing regular solutions (Q2430021) (← links)
- A fraction free matrix Berlekamp/Massey algorithm (Q2435413) (← links)
- Fraction-free row reduction of matrices of Ore polynomials. (Q2457346) (← links)
- Normal forms for general polynomial matrices (Q2457359) (← links)
- Output-sensitive modular algorithms for polynomial matrix normal forms (Q2470057) (← links)
- Computing minimal interpolation bases (Q2628323) (← links)
- An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form (Q2674009) (← links)
- On the Differential and Full Algebraic Complexities of Operator Matrices Transformations (Q2829987) (← links)
- Computing Sparse Representations of Systems of Rational Fractions (Q2830013) (← links)
- Minimal solutions of the rational interpolation problem (Q4997894) (← links)