Skip to main content
Springer Nature Link
Log in

Algorithms for Solving an Algebraic Equation

  • COMPUTER ALGEBRA
  • Published:
Programming and Computer Software Aims and scope Submit manuscript

Abstract

For finding global approximate solutions to an algebraic equation in n unknowns, the Hadamard open polygon for the case n = 1 and Hadamard polyhedron for the case n = 2 are used. The solutions thus found are transformed to the coordinate space by a translation (for n = 1) and by a change of coordinates that uses the curve uniformization (for n = 2). Next, algorithms for the local solution of the algebraic equation in the vicinity of its singular (critical) point for obtaining asymptotic expansions of one-dimensional and two-dimensional branches are presented for n = 2 and n = 3. Using the Newton polygon (for n = 2), the Newton polyhedron (for n = 3), and power transformations, this problem is reduced to situations similar to those occurring in the implicit function theorem. In particular, the local analysis of solutions to the equation in three unknowns leads to the uniformization problem of a plane curve and its transformation to the coordinate axis. Then, an asymptotic expansion of a part of the surface under examination can be obtained in the vicinity of this axis. Examples of such calculations are presented.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1.
Fig. 2.
Fig. 3.
Fig. 4.
Fig. 5.
Fig. 6.
Fig. 7.
Fig. 8.
Fig. 9.
Fig. 10.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

REFERENCES

  1. Fukuda, K., Exact algorithms and software in optimization and polyhedral computation, Proc. of XXI Int. Symp. on Symbolic and Algebraic Computations (ISSAC’08), New York: ACM, 2008, pp. 333–334.

  2. Barber, C.B., Dobkin, D.P., and Huhdanpaa, H.T., The Quickhull algorithm for convex hulls, ACM Trans. Math. Software, 1996, vol. 22, no. 4, pp. 469–483. http://www.qhull.org

    Article  MathSciNet  MATH  Google Scholar 

  3. King, R.B., Beyond the Quartic Equation, Boston: Birkhäuser, 1996.

    MATH  Google Scholar 

  4. Umemura, H., Resolution of algebraic equations by theta constants, in D. Mumford, Tata Lectures on Theta II (Birkhäuser, Boston, 1984).

    Google Scholar 

  5. Hadamard J., Etude sur les proprietes des fonctions entieres et en particulier d’une fonction consideree par Riemann, J. Math. Pures Appliques, 1893. vol. 9, no. 2. pp. 171–215.

    MATH  Google Scholar 

  6. Bruno, A.D., Local Methods in Nonlinear Differential Equations, Berlin: Springer,1989.

    Book  Google Scholar 

  7. Bateman, H. and Erdelyi, A., Higher Transcendental Functions, New York: McGraw-Hill, 1955.

  8. Brezhnev, Yu.V., On the uniformization of algebraic curves, Mosc. Math. J., 2008. vol. 8, no. 2, pp. 233–271.

    Article  MathSciNet  MATH  Google Scholar 

  9. Brezhnev, Yu.V., On uniformization of Burnside’s curve \({{y}^{2}} = {{x}^{5}} - x\), J. Math Phys, 2009, vol. 50, no. 10.

  10. Brezhnev, Yu.V., The sixth Painlevé transcendent and uniformization of algebraic curves, J. Diff. Equat., 2016, vol. 260, no. 3. pp. 2507–2556.

    Article  MathSciNet  MATH  Google Scholar 

  11. Belokolos, E.D. and Enolskii, V.Z., Reduction of Abelian functions and completely integrable equations, J. Math. Sci., 2001, vol. 106, no. 6. pp. 3395–3486 (Part I), 2002, vol. 108, no. 3, pp. 295–374 (Part II).

  12. Ônishi, Y., Complex multiplication formulae for hyperelliptic curves of genus three, Tokyo J. Math., 1998, vol. 21, pp. 381–431.

    Article  MathSciNet  MATH  Google Scholar 

  13. Aptekarev, A.I., Toulyakov, D.N., and Yattselev, M.L., On the parametrization of a certain algebraic curve of genus 2, Math. Notes, 2015, vol. 95, no. 5, pp. 843–846.

    Article  MATH  Google Scholar 

  14. Aptekarev, A.I., Toulyakov, D.N., and van Assche, W., Hyperelliptic uniformizati on of algebraic curves of third order, J. Comput. Applied Math., 2015, vol. 284, pp. 38–49.

    Article  MathSciNet  MATH  Google Scholar 

  15. Walker, R.J., Algebraic Curves, New Jersey: Princeton, 1950.

  16. Eilbeck, J.C., Enolski, V.Z., Matsutani, S., Ônishi, Y., and Previato, E., Abelian functions for trigonal curves of genus three, Int. Math. Res. Notices, 2007, vol. 2007, Article ID rnm140.

  17. Eilbeck, J.C., Weierstrass functions for higher genus curves. http://www.ma.hw.ac.uk/Weierstrass

  18. Sendra, J.R. and Sevilla, D., Radical parametrizations of algebraic curves by adjoint curves, J. Symb. Comput., 2011, vol. 46, pp. 1030–1038.

    Article  MathSciNet  MATH  Google Scholar 

  19. Harrison, M., Explicit solution by radicals, gonal maps and plane models of algebraic curves of genus 5 or 6, J. Symb. Comput., 2013, vol. 51, pp. 3–21.

    Article  MathSciNet  MATH  Google Scholar 

  20. Bruno, A.D. and Batkhin, A.B., Resolution of algebraic singularity by algorithms of power geometry, Program. Comput. Software, 2012, vol. 38, no. 2, pp. 57–72.

    Article  MathSciNet  MATH  Google Scholar 

  21. Sendra, J.R. and Sevilla, D., First step towards radical parametrization of algebraic surfaces, Comput. Aided Geometric Design, 2013, vol. 30, pp. 374–388.

    Article  MathSciNet  MATH  Google Scholar 

  22. Goursat, E., Course of Mathematical Analysis, New York: Dover, 1959.

    MATH  Google Scholar 

  23. Bruno, A.D., Power Geometry in Algebraic and Differential Equations, Amsterdam: Elsevier, 2000.

    Google Scholar 

  24. Bruno, A.D., Asymptotic solving essentially nonlinear problems, Math. Stat., 2016, vol. 4, no. 1, pp. 27–39.

    Article  Google Scholar 

Download references

ACKNOWLEDGMENTS

I am grateful to A. B. Batkhin for his big help in preparing this paper.

This work was supported by the Russian Foundation for Basic Research, project no. 18-01-00422a.

Author information

Authors and Affiliations

  1. Keldysh Institute of Applied Mathematics, Russian Academy of Sciences, 125047, Moscow, Russia

    A. D. Bruno

Authors
  1. A. D. Bruno
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to A. D. Bruno.

Additional information

Translated by A. Klimontovich

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bruno, A.D. Algorithms for Solving an Algebraic Equation. Program Comput Soft 44, 533–545 (2018). https://doi.org/10.1134/S0361768819100013

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0361768819100013