Notes on triangular sets and triangulation-decomposition algorithms. II: Differential systems
From MaRDI portal
Recommendations
- Notes on triangular sets and triangulation-decomposition algorithms. I: Polynomial systems
- Specifications for triangulation algorithms of elementary-algebraic systems
- Triangulations. Structures for algorithms and applications
- A triangular decomposition algorithm for differential polynomial systems with elementary computation complexity
- Improvements to a triangulation-decomposition algorithm for ordinary differential systems in higher degree cases
- Algorithms for computing triangular decompositions of polynomial systems
- Intersection formulas and algorithms for computing triangular decompositions
- On the existence of triangular difference systems of sets
- Symmetric-triangular decomposition and its applications. I: Theorems and algorithms
Cited in
(40)- Algebraic transformation of differential characteristic decompositions from one ranking to another
- Differential invariants of a Lie group action: syzygies on a generating set
- Implicit Riquier bases for PDAE and their semi-discretizations
- Computing differential characteristic sets by change of ordering
- Specifications for triangulation algorithms of elementary-algebraic systems
- Rational general solutions of systems of first-order algebraic partial differential equations
- Elimination theory in differential and difference algebra
- An equivalence theorem for regular differential chains
- Algebraic construction and numerical behavior of a new s-consistent difference scheme for the 2D Navier-Stokes equations
- A short contribution to the theory of regular chains
- A bound for orders in differential Nullstellensatz
- On the algorithmic linearizability of nonlinear ordinary differential equations
- On the consistency analysis of finite difference approximations
- A triangular decomposition algorithm for differential polynomial systems with elementary computation complexity
- New order bounds in differential elimination algorithms
- Universal characteristic decomposition of radical differential ideals
- On the complexity of the resolvent representation of some prime differential ideals
- Sufficient set of integrability conditions of an orthonomic system
- Algorithmic problems for differential polynomial algebras
- Computing constraint sets for differential fields
- scientific article; zbMATH DE number 708901 (Why is no real title available?)
- Algorithmic Thomas decomposition of algebraic and differential systems
- Notes on triangular sets and triangulation-decomposition algorithms. I: Polynomial systems
- Term-ordering free involutive bases
- A normal form algorithm for regular differential chains
- Differential algebra for derivations with nontrivial commutation rules
- Under- and overdetermined systems of differential equations
- The Maple package TDDS for computing Thomas decompositions of systems of nonlinear PDEs
- Differential Elimination for Dynamical Models via Projections with Applications to Structural Identifiability
- On the partial differential Lüroth's theorem
- Support bound for differential elimination in polynomial dynamical systems
- Identifiable specializations for ODE models
- Algebraic identifiability of partial differential equation models
- Differential elimination and algebraic invariants of polynomial dynamical systems
- A deductive refinement calculus for differential-algebraic programs
- Singularities of algebraic differential equations
- Lagrangian constraints and differential Thomas decomposition
- A bound for the Rosenfeld-Gröbner algorithm
- On the spectral parameter problem
- Probabilistic algorithms for computing resolvent representations of regular differential ideals
This page was built for publication: Notes on triangular sets and triangulation-decomposition algorithms. II: Differential systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4425662)
