2020-11-30T22:28:39Z
http://oa.upm.es/cgi/oai2
oai:oa.upm.es:30920
2014-10-27T08:24:36Z
7374617475733D707562
7375626A656374733D6D6174656D617469636173
747970653D626F6F6B5F73656374696F6E
Sparse differential resultant formulas: between the linear and the nonlinear case
Rueda PĂ©rez, Sonia Luisa
Mathematics
A matrix representation of the sparse differential resultant is the basis for efficient computation algorithms, whose study promises a great contribution to the development and applicability of differential elimination techniques.
It is shown how sparse linear differential resultant formulas provide bounds for the order of derivation, even in the nonlinear case, and they also provide (in many cases) the bridge with results in the nonlinear algebraic case.
E.T.S. Arquitectura (UPM)
(c) Editor/Autor
2013-07
info:eu-repo/semantics/bookPart
Book Section
Sparse differential resultant formulas: between the linear and the nonlinear case | En: Proceedings Applications of Computer Algebra 2013 | pag. 102-106 | ACA 2013 | 2013-07
NonPeerReviewed
application/pdf
spa
info:eu-repo/semantics/openAccess
http://oa.upm.es/30920/