Computing Sparse Representations of Systems of Rational Fractions
From MaRDI portal
Recommendations
- Solving very sparse rational systems of equations
- Computational Complexity of Sparse Rational Interpolation
- Fractional representations of linear systems
- Solving sparse rational linear systems
- Algorithms for the Minimal Rational Fraction Representation of Sequences Revisited
- On sparse interpolation of rational functions and gcds
- Fraction-free computation of matrix rational interpolants and matrix GCDs
- scientific article; zbMATH DE number 3856405
- Representations and Parallel Computations for Rational Functions
- Computation of the rational representation for solutions of high-dimensional systems
Cites work
- A method for semi-rectifying algebraic and differential systems using scaling type Lie point symmetries with linear algebra
- Algorithms in real algebraic geometry
- Computing the rank profile matrix
- scientific article; zbMATH DE number 478435 (Why is no real title available?)
- Moving coframes. II: Regularization and theoretical foundations
- Reduction of Algebraic Parametric Systems by Rectification of Their Affine Expanded Lie Symmetries
- Scaling invariants and symmetry reduction of dynamical systems
- Towards an automated reduction method for polynomial ODE models of biochemical reaction systems
This page was built for publication: Computing Sparse Representations of Systems of Rational Fractions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2830013)