Algorithms for computer algebra
Algorithms for computer algebra
About the Newton algorithm for non-linear ordinary differential equations
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Solving “generalized algebraic equations”
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Modern computer algebra
An Algorithm on Quasi-Ordinary Polynomials
AAECC-6 Proceedings of the 6th International Conference, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Power series solutions for non-linear PDE's
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Formal desingularization of surfaces: The Jung method revisited
Journal of Symbolic Computation
Convergence and many-valuedness of hensel seriesnear the expansion point
Proceedings of the 2009 conference on Symbolic numeric computation
A study of Hensel series in general case
Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation
Computing Puiseux series for algebraic surfaces
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
| Hi-index | 0.00 |
The classical Newton polygon method for the local resolution of algebraic equations in one variable can be extended to the case of multi-variate equations of the type f(y) = 0, f ∈ C[x1,..., xN][y]. For this purpose we will use a generalization of the Newton polygon - the Newton polyhedron - and a generalization of Puiseux series for several variables.