2013
DOI: 10.1016/j.laa.2013.01.016
|View full text |Cite
|
Sign up to set email alerts
|

Linear sparse differential resultant formulas

Abstract: Let P 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 P. These formulas are determinants of coefficient matrices of appropriate sets of derivatives of the differential polynomials in P, or in a linear perturbation P ε of P. In particular, the formula ∂FRes(P) is the determinant of a matrix M(P) having no zero columns if the system P is "s… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
14
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 11 publications
(14 citation statements)
references
References 28 publications
0
14
0
Order By: Relevance
“…It is useful to represent the sparse differential resultant as the quotient of two determinants, as done in [11,15] in the algebraic case. In the differential case, we do not have such formulas, even in the simplest case of the resultant for two generic differential polynomials in one variable [49] or a system of linear sparse differential polynomials [43]. In [43], for a sparse linear differential system S, Rueda gave an enlarged system S 1 of S such that S 1 has a matrix representation and the sparse differential resultant of S can be obtained from the determinant of S 1 .…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…It is useful to represent the sparse differential resultant as the quotient of two determinants, as done in [11,15] in the algebraic case. In the differential case, we do not have such formulas, even in the simplest case of the resultant for two generic differential polynomials in one variable [49] or a system of linear sparse differential polynomials [43]. In [43], for a sparse linear differential system S, Rueda gave an enlarged system S 1 of S such that S 1 has a matrix representation and the sparse differential resultant of S can be obtained from the determinant of S 1 .…”
Section: Resultsmentioning
confidence: 99%
“…Although efficient, this approach is not complete, because it is not proved that the differential resultant can always be computed in this way. Differential resultants for linear ordinary differential polynomials were studied by Rueda-Sendra [43,44]. In [17], a rigorous definition for the differential resultant of n + 1 differential polynomials in n variables was first presented and its properties were proved.…”
Section: Introductionmentioning
confidence: 99%
“…The underlying theory is the differential algebra of Ritt [28] and Kolchin [15]. Differential elimination algorithm in algebraic elimination theory is an active field and powerful tools with many important applications [7,10,26,29,34,35]. Almost all of the authors focus on the differential elimination theory for ODEs.…”
Section: Introductionmentioning
confidence: 99%
“…Secondly, the criterion for Laurent transformally essential systems given in Section 3.3 is quite different and much simpler than its differential counterpart given in [27]. Also, determinant representations for the sparse difference resultant and the difference resultant are given in Section 5 and Section 7, but such a representation is still not known for differential resultants [38,30,31]. Finally, there does not exist a definition for homogeneous difference polynomials, and the definition we give in this paper is different from its differential counterpart [25].…”
Section: Introductionmentioning
confidence: 99%