Skip to main content

Algorithm of Local Resolution of Singularities of a Space Curve

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3718))

Abstract

In this paper we present a procedure that allows us to distinguish all branches of a space curve near the singular point and to compute parametric form of them with any accuracy. The same procedure works for finding the branches of a space curve such that some (or all) coordinates tend to infinity.

This work was supported by State Committee for Science and Technology of the Republic of Uzbekistan, grant No. 1.1.13.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bernshtein, D.N.: The number of roots of a system of equatios. Funct. Anal. Appl. 9 (1975)

    Google Scholar 

  2. Bruno, A.D.: Power Geometry for Algebraic and Differential Equations. Elsevier, Amsterdam (2000)

    Google Scholar 

  3. Soleev, A.: Singling out branches of an algebraic curve and Newton polyhedra, Dokl. Akad. Nauk SSSR 268, 1305–1307 (1983); English transl. In: Soviet Math Dokl. 27 (1983)

    Google Scholar 

  4. Soleev, A., Aranson, A.: Computation of a polyhedron and of normal cones of its faces. Preprint No. 4 of the Keldysh Institute of Applied Mathematics of RAS, Moscow (1994)

    Google Scholar 

  5. Bruno, A.D., Soleev, A.: Local uniformization of branches of a space curve, and Newton polyhedra. St. Peterburg Math. J. 3(1), 53–82 (1992)

    MathSciNet  Google Scholar 

  6. Varchenko, A.N., Khovanskii, A.G.: Asymptotics of integrals over vanishing cycle and the Newton polyhedron. Dokl. Akad. Nauk SSSR 283, 211–262 (1985); English transl. In: Soviet Math Dokl. 32 (1985)

    Google Scholar 

  7. Khovanskii, A.G.: Newton polyhedra (resolution of singularities), Itogi Nauki i Tekhniki: Sovremennye Problemy Mat., vol. 22, VINITI, Moscow, pp. 207–239 (1983); English transl. In: J. soviet Math 27 (1984)

    Google Scholar 

  8. Chernikov, S.N.: Linear Inequalities, Nauka, Moscow (1968); German transl. VEB Deutcsher Verlag, Berlin (1971)

    Google Scholar 

  9. Graves, L.M.: Remarks on singular points of functional equations. Trans. Amer. Math. Soc. 79, 150–157 (1955)

    Article  MATH  MathSciNet  Google Scholar 

  10. Vainberg, M.M., Trenogin, V.A.: The theory of Branching of Solutions of Nonlinear Equations. Wolters-Noordholf Intern. Publ., Leiden (1974)

    Google Scholar 

  11. Botashev, A.I.: Analytic methods in the theory of branching. Uspekhi Mat. Nauk 40 (4) (244), 147–148 (1985); English transl. in Russian Math. Surveys 40 (1985)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Soleev, A. (2005). Algorithm of Local Resolution of Singularities of a Space Curve. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds) Computer Algebra in Scientific Computing. CASC 2005. Lecture Notes in Computer Science, vol 3718. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11555964_35

Download citation

  • DOI: https://doi.org/10.1007/11555964_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28966-1

  • Online ISBN: 978-3-540-32070-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics