Computer algebra: symbolic and algebraic computation (2nd ed.)
Computer algebra: symbolic and algebraic computation (2nd ed.)
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Algebraic Extensions and Algebraic Closure in Scratchpad II
ISAAC '88 Proceedings of the International Symposium ISSAC'88 on Symbolic and Algebraic Computation
EUROSAM '84 Proceedings of the International Symposium on Symbolic and Algebraic Computation
Complexity of computation of embedded resolution of algebraic curves
EUROCAL '87 Proceedings of the European Conference on Computer Algebra
About a New Method for Computing in Algebraic Number Fields
EUROCAL '85 Research Contributions from the European Conference on Computer Algebra-Volume 2
| Hi-index | 0.00 |
We describe a new Pascal implementation, due to the second author, of programs of the first author which help study singularities of plane algebraic curves. Given an algebraic plane singularity (not necessarily irreducible), represented by a two-variable polynomial (with rational coefficients), the main program uses the algorithm of Newton and Puiseux to compute the initial part of all the Puiseux expansions. All computations in algebraic extensions of the rationals are done symbolically.There is an auxiliary subprogram to compute the two-variable polynomial equation for a singularity given by finite Puiseux expansions. Some of the algebraic subprograms (manipulations of polynomials etc.) are also accessible interactively.