Singular Points of Algebraic Curves

  title={Singular Points of Algebraic Curves},
  author={Takis Sakkalis and Rida T. Farouki},
  journal={J. Symb. Comput.},

Figures from this paper

Singular algebraic curves over finite fields
This paper presents algorithms for the identification and resolution of rational and non-rational singularities (by means of blowings-up) of a projective plane curve C: F(x1, x2, x3)=0 with
Computing Singular Points of Projective Plane Algebraic Curves by Homotopy Continuation Methods
An algorithm that computes the singular points of projective plane algebraic curves and determines their multiplicities and characters is presented and it is proved that the algorithm has the polynomial time complexity on the degree of the algebraic curve.
Parametrization of Algebraic Curves over Optimal Field Extensions
An efficient algorithm for computing optimal parametrizations of plane algebraic curves over an algebraic extension of least degree over the field of definition is presented and a classical theorem of Hilbert and Hurwitz about birational transformations is generalized.
Computing in the jacobian of a plane algebraic curve
An algorithm which extends the classical method of adjoints due to Brill and Noether for carrying out the addition operation in the Jacobian variety of a plane algebraic curve defined over an algebraic number field K with arbitrary singularities is described and it is proved that the answers it produces are defined over K.
Computation of the singularities of parametric plane curves
Computing the topology of an arrangement of implicitly defined real algebraic plane curves
A new algebraic approach dealing with the problem of computing the topology of an arrangement of a finite set of real algebraic plane curves presented implicitly achieves a complete avoidance of irrational numbers that appear when using the sweeping method in the classical way.
Detecting Algebraic Curves in Bad Position
  • K. Kalorkoti
  • Mathematics, Computer Science
    J. Symb. Comput.
  • 2001
A method is described for detecting two affine algebraic curves over the complex numbers in bad position and it is used to develop an algorithm for finding the common points of twogebraic curves along with their multiplicities.
Noether's S-transformation simplifies curve singularities rationally: a local analysis
The author analyzes a birational plane transformation described by Max Noether which improves upon the classical method in two ways: first, it requires no ground field extension; second, the degree of the curve it produces is an exponential factor lower than that produced by the standard method.


Algebraic curves
This introduction to algebraic geometry examines how the more recent abstract concepts relate to traditional analytical and geometrical problems. The presentation is kept as elementary as A linear
A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane
A numerical method for solving polynomial equations ms presented that is deflation-free, handles multiple complex zeros, and contains budt-m safeguards against buildup of roundoff error.
Tracing surface intersections
Historical Ramblings in Algebraic Geometry and Related Algebra
We associate different catchwords with these divisions: function theory: function, integral; geometry: curve, surface, variety; high-school algebra: polynomial, power series; college algebra: ring,
On Euclid's Algorithm and the Theory of Subresultants
An elementary treatment of the theory of subresultants is presented, and the relationship of the sub resultants of a given pair of polynomials to their polynomial remainder sequence as determined by Euclid's algorithm is examined.
The Euclidean Algorithm and the Degree of the Gauss Map
  • T. Sakkalis
  • Mathematics, Computer Science
    SIAM J. Comput.
  • 1990
This paper examines the computation of the topological degree of the Gauss map, defined by polynomials in the plane, via the Euclidean algorithm.