Differential elimination by differential specialization of Sylvester style matrices (Q895967): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W3103520372 / rank
 
Normal rank

Revision as of 18:16, 19 March 2024

scientific article
Language Label Description Also known as
English
Differential elimination by differential specialization of Sylvester style matrices
scientific article

    Statements

    Differential elimination by differential specialization of Sylvester style matrices (English)
    0 references
    0 references
    11 December 2015
    0 references
    The paper under review defines differential resultant formulas for a system \(\mathcal{P}\) of \(n\) ordinary Laurent differential polynomials in \(n-1\) differential variables. These are determinants of coefficient matrices of an extended system of polynomials obtained from \(\mathcal{P}\) through the differentiation and multiplication by Laurent polynomials. The proposed construction generalizes the construction of differential resultants introduced in [\textit{G. Carrà Ferro}, Lect. Notes Comput. Sci. 1255, 55--65 (1997; Zbl 1039.12500)] and extends the results of the author [Linear Algebra Appl. 438, No. 11, 4296--4321 (2013; Zbl 1337.12002)] to the nonlinear case. Starting with the above-mentioned system \(\mathcal{P}\) with an additional ``super essential'' condition, the author obtains (through the appropriate number of differentiations of the elements of \(\mathcal{P}\)) an extended system \(\mathrm{ps}(\mathcal{P})\) of \(L\) polynomials in \(L-1\) algebraic variables, which is nonsparse in the order of derivation. At the same time, it is shown that every system contains a subsystem with the super essential condition. In the next part of the paper the author introduces a concept of an algebraic generic sparse system \(\mathrm{ags}(\mathcal{P})\) associated with a super essential system \(\mathcal{P}\). It is explained how such a system can be used for construction of a Sylvester style matrix \(\mathrm{Syl}(\mathcal{P})\) with the technique of [\textit{J. F. Canny} and \textit{I. Z. Emiris}, J. ACM 47, No. 3, 417--451 (2000; Zbl 1094.65508)] under additional conditions. Then the author obtains differential resultant formulas for \(\mathcal{P}\) through the specialization of \(\mathrm{Syl}(\mathcal{P})\) to the differential coefficients of \(\mathrm{ps}(\mathcal{P})\). The last part of this work considers a generic system of sparse differential polynomials. It is shown that the obtained formulas provide order and degree bounds for the sparse differential resultant \(\partial\mathrm{Res}(\mathcal{P})\) of \(\mathcal{P}\) defined in [\textit{W. Li} et al., Found. Comput. Math. 15, No. 2, 451--517 (2015; Zbl 1315.12003)]. The results of the paper are illustrated with several relevant examples.
    0 references
    differential elimination
    0 references
    Laurent differential polynomial
    0 references
    sparse resultant
    0 references
    differential specialization
    0 references
    sparse differential resultant
    0 references
    0 references
    0 references

    Identifiers