On the complexity of the resolvent representation of some prime differential ideals

Mostrar todas las versiones(3)

We prove upper bounds on the order and degree of the polynomials involved in a resolvent representation of the prime differential ideal associated with a polynomial differential system for a particular class of ordinary first order algebraic-differential equations arising in control theory. We also...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: D'Alfonso, L., Jeronimo, G., Solernó, P.
Formato: Artículo publishedVersion
Publicado: 2006
Materias:
Differential algebra
Differential Hilbert function
Elimination theory
Probabilistic algorithms
Resolvent representation
Straight-line programs
Algorithms
Computation theory
Differential equations
Functions
Polynomials
Probabilistic logics
Computational complexity
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_0885064X_v22_n3_p396_DAlfonso
https://repositoriouba.sisbi.uba.ar/gsdl/cgi-bin/library.cgi?a=d&c=artiaex&d=paper_0885064X_v22_n3_p396_DAlfonso_oai
Aporte de:
Repositorio Digital de la Universidad de Buenos Aires (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares