On the extended Hensel construction and its application to the computation of real limit points (Q2284954): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jsc.2019.07.009 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: DISCOVERER / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jsc.2019.07.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2956505993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irreducibility criterion for germs of analytic functions of two complex variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Extended Hensel Construction and its Application to the Computation of Limit Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Limit Points of the Quasi-component of a Regular Chain in Dimension One / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Limits of Real Multivariate Rational Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Standard Basis Free Algorithm for Computing the Tangent Cones of a Space Curve / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms in real algebraic geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4232481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits of quotients of bivariate real analytic functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangular decomposition of semi-algebraic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing with semi-algebraic sets: relaxation techniques and effective boundaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for computing triangular decomposition of polynomial systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On expansion of algebraic functions in power and Puiseux series. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2724091 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4406533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determination of Bounds for the Solutions to those Binary Diophantine Equations that Satisfy the Hypotheses of Runge's Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorization of multivariate polynomials by extended Hensel construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: All Algebraic Functions Can Be Computed Fast / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Newton-Puiseux Theory and Hensel's Lemma in C[[x, y]] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving parametric polynomial systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Newton–Puiseux theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on Divisors of Zero / rank
 
Normal rank
Property / cites work
 
Property / cites work: On solving parametric polynomial systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The red book of varieties and schemes. Includes the Michigan lectures (1974) on ``Curves and their Jacobians''. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving Complexity Bounds for the Computation of Puiseux Series over Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhancing the Extended Hensel Construction by Using Gröbner Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving multivariate algebraic equation by Hensel construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4232464 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of CAD-based Methods for Computation of Rational Function Limits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3963106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved EZ-GCD algorithm for multivariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: An existence theorem for optimal control in the Boltz problem, some of its applications and the necessary conditions for the optimality of moving and singular systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits of quotients of polynomial functions in three variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determination of the limits for multivariate rational functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete algorithm for automated discovering of a class of inequality-type theorems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JSC.2019.07.009 / rank
 
Normal rank

Latest revision as of 20:03, 17 December 2024

scientific article
Language Label Description Also known as
English
On the extended Hensel construction and its application to the computation of real limit points
scientific article

    Statements

    On the extended Hensel construction and its application to the computation of real limit points (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 January 2020
    0 references
    The Extended Hensel Construction (EHC) is an algorithm designed by \textit{T. Sasaki} and \textit{F. Kako} [Japan J. Ind. Appl. Math. 16, No. 2, 257--285 (1999; Zbl 0941.12002)] for factoring univariate polynomials with power series coefficients. The goal of this algorithm was to provide an alternative approach to the classical NewtonPuiseux method for univariate power series coefficients. The EHC relies on Yun-Moses polynomials which make this algorithm inefficient in practice. In the paper under review, the authors show that the EHC requires only linear algebra and univariate polynomial arithmetic and report its complexity supported by favorable experimental results. Furthermore, they investigate two applications of this study. The first one is the computation of real branches of space curves and the second one deals with the computation of limits of real multivariate rational functions.
    0 references
    0 references
    extended Hensel construction
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references