Puiseux series solutions of ordinary polynomial differential equations: complexity study.
Ayad, Ali (2010)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
Displaying similar documents to “Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields”
Puiseux series solutions of ordinary polynomial differential equations: complexity study.
Factoring polynomials over global fields
Karim Belabas, Mark van Hoeij, Jürgen Klüners, Allan Steel (2009)
Journal de Théorie des Nombres de Bordeaux
Similarity:
We prove that van Hoeij’s original algorithm to factor univariate polynomials over the rationals runs in polynomial time, as well as natural variants. In particular, our approach also yields polynomial time complexity results for bivariate polynomials over a finite field.
Invariants of singularities of polynomials in two complex variables and the Newton diagrams.
Masternak, Mateusz (2001)
Zeszyty Naukowe Uniwersytetu Jagiellońskiego. Universitatis Iagellonicae Acta Mathematica
Similarity:
On first experiences with the implementation of a Newton based linear programming approach.
Wanka, A. (1989)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Generic Newton polygons of Ekedahl-Oort strata: Oort’s conjecture
Shushi Harashita (2010)
Annales de l’institut Fourier
Similarity:
We study the moduli space of principally polarized abelian varieties in positive characteristic. In this paper we determine the Newton polygon of any generic point of each Ekedahl-Oort stratum, by proving Oort’s conjecture on intersections of Newton polygon strata and Ekedahl-Oort strata. This result tells us a combinatorial algorithm determining the optimal upper bound of the Newton polygons of principally polarized abelian varieties with a given isomorphism type of -kernel. ...
Remarks on the Cayley-van der Waerden-Chow form.
Achilles, Rüdiger, Stückrad, Jürgen (2007)
Zeszyty Naukowe Uniwersytetu Jagiellońskiego. Universitatis Iagellonicae Acta Mathematica
Similarity:
Local convergence analysis of inexact Newton-like methods.
Argyros, Ioannis K., Hilout, Said (2009)
The Journal of Nonlinear Sciences and its Applications
Similarity:
On multipoint iterative processes of efficiency index higher than Newton's method.
Argyros, Ioannis K., Hilout, Saïd (2009)
The Journal of Nonlinear Sciences and its Applications
Similarity:
On the computation of the GCD of 2-D polynomials
Panagiotis Tzekis, Nicholas Karampetakis, Haralambos Terzidis (2007)
International Journal of Applied Mathematics and Computer Science
Similarity:
The main contribution of this work is to provide an algorithm for the computation of the GCD of 2-D polynomials, based on DFT techniques. The whole theory is implemented via illustrative examples.