Linear sparse differential resultant formulas

DOI10.1016/J.LAA.2013.01.016zbMATH Open1337.12002arXiv1112.3921OpenAlexW2024056102MaRDI QIDQ389711FDOQ389711

Authors: Sonia Rueda 

Publication date: 21 January 2014

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: Let $cP$ be a system of $n$ linear nonhomogeneous ordinary differential polynomials in a set $U$ of $n-1$ differential indeterminates. Differential resultant formulas are presented to eliminate the differential indeterminates in $U$ from $cP$. These formulas are determinants of coefficient matrices of appropriate sets of derivatives of the differential polynomials in $cP$, or in a linear perturbation $c{P}_{varepsilon}$ of $cP$. In particular, the formula $dfres(cP)$ is the determinant of a matrix $cM(cP)$ having no zero columns if the system $cP$ is "super essential". As an application, if the system $frakP$ is sparse generic, such formulas can be used to compute the differential resultant $dres(frakP)$ introduced by Li, Gao and Yuan in (Proceedings of the ISSAC'2011).

Full work available at URL: https://arxiv.org/abs/1112.3921

Recommendations

• Differential elimination by differential specialization of Sylvester style matrices
• Matrix formulae of differential resultant for first order generic ordinary differential polynomials
• Sparse differential resultant
• A resultant theory for the systems of two ordinary algebraic differential equations

zbMATH Keywords

differential eliminationlinear differential polynomiallinear perturbationsparse differential resultant

Mathematics Subject Classification ID

Abstract differential equations (12H20) Linear differential equations in abstract spaces (34G10) Solving polynomial systems; resultants (13P15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Associative differential operations
• On the Newton polytope of the resultant
• Tropical Implicitization and Mixed Fiber Polytopes
• Factorization-free decomposition algorithms in differential algebra
• Computing differential characteristic sets by change of ordering
• Implicitization of differential rational parametric equations.
• Resolvent representation for regular differential ideals
• A bound for orders in differential Nullstellensatz
• A perturbed differential resultant based implicitization algorithm for linear DPPEs
• Macaulay style formulas for sparse resultants
• Implicitization of curves and surfaces using predicted support
• Title not available (Why is that?)
• Sparse differential resultant
• Modern mathematical tools and techniques in capturing complexity
• A subdivision-based algorithm for the sparse resultant
• Linear complete differential resultants and the implicitization of linear DPPEs

Cited In (8)

• Linear differential implicitization and differential resultants
• Elimination theory in differential and difference algebra
• Triangular matrices, differential resultants and systems of linear homogeneous PDE's
• Index reduction of differential algebraic equations by differential Dixon resultant
• Differential elimination by differential specialization of Sylvester style matrices
• Matrix formulae of differential resultant for first order generic ordinary differential polynomials
• Advances in elimination theory for algebraic differential and difference equations
• Sparse differential resultant for Laurent differential polynomials

Uses Software

• BLAD
• DIFFALG
• DiffRes
• TrIm

This page was built for publication: Linear sparse differential resultant formulas

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q389711)