Algorithms and programs for calculating the roots of polynomial of one or two variables

DOI10.1134/S0361768821050042zbMATH Open1483.68500OpenAlexW3200394521MaRDI QIDQ2664516FDOQ2664516

Authors: A. B. Batkhin, A. D. Bryuno 

Publication date: 17 November 2021

Published in: Programming and Computer Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0361768821050042

Recommendations

• Algorithms for solving an algebraic equation
• scientific article; zbMATH DE number 2098030
• scientific article; zbMATH DE number 4108032
• Newton polygons and Newton algorithms
• Computer algebra procedures for separating the roots of algebraic equations

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Polynomials, factorization in commutative rings (13P05) Computational methods for problems pertaining to field theory (12-08)

Cites Work

• Title not available (Why is that?)
• Resolution of an algebraic singularity by power geometry algorithms
• Ideals, Varieties, and Algorithms
• The quickhull algorithm for convex hulls
• Title not available (Why is that?)
• Asymptotic expansions of solutions of the sixth Painlevé equation
• Stability sets of multiparameter Hamiltonian systems
• Title not available (Why is that?)
• Asymptotic behaviour and expansions of solutions of an ordinary differential equation
• Tata lectures on theta. II: Jacobian theta functions and differential equations. With the collaboration of C. Musili, M. Nori, E. Previato, M. Stillman, and H. Umemura
• An axisymmetric boundary layer on a needle
• Rational parametrizations of algebraic curves using a canonical divisor
• Geometric methods and applications. For computer science and engineering
• Title not available (Why is that?)
• Subresultants revisited.
• Basic Algebraic Geometry 2
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Parameterization of the discriminant set of a polynomial
• Title not available (Why is that?)
• Title not available (Why is that?)
• Understanding Maple
• Title not available (Why is that?)
• Algorithms for solving an algebraic equation
• Expansion of solutions to an ordinary differential equation into transseries

Cited In (10)

• Real normal form of a binary polynomial at a second-order critical point
• Computing level lines of a polynomial on the plane
• Level lines of a polynomial on a plane
• Symbolic computation of a homological equation of an arbitrary order and reduction of Hamiltonian system to its normal form
• Algorithms for solving an algebraic equation
• An algorithm for computing multivariable root loci by pivoting
• On calculating partial sums of multiple numerical series by methods of computer algebra
• Title not available (Why is that?)
• Title not available (Why is that?)
• Experimental and Efficient Algorithms

Uses Software

• cdd
• Mathematica
• SageMath
• SymPy
• Qhull
• cddplus
• PPL
• desing
• PGeomlib

This page was built for publication: Algorithms and programs for calculating the roots of polynomial of one or two variables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2664516)