A heuristic method for certifying isolated zeros of polynomial systems (Q1634514): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Macaulay2 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: alphaCertified / 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.3390/math6090166 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2883255855 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4720691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Test for Existence of Solutions to Nonlinear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3730926 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval solution of nonlinear equations using linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal Proofs for Nonlinear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Generation of Positivstellensatz Witnesses in Degenerate Cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing sum of squares decompositions with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Rational Points in Convex Semialgebraic Sets and Sum of Squares Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the multiplicity structure in solving polynomial systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On location and approximation of clusters of zeros: Case of embedding dimension one / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isosingular sets and deflation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying Isolated Singular Points and their Multiplicity Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: A numerical method for branch points of a system of nonlinear algebraic equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deflation algorithm for the multiple roots of a system of nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing multiple roots of inexact polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple zeros of nonlinear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4703996 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton's method with deflation for isolated singularities of polynomial systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verified Error Bounds for Isolated Singular Solutions of Polynomial Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deflation and certified isolation of singular zeros of polynomial systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verified error bounds for multiple roots of systems of nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton's method for overdetermined systems of equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying simple zeros of over-determined polynomial systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive Definiteness and Stability of Interval Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new deflation method for verifying the isolated singular zeros of polynomial systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On deflation and multiplicity structure / rank
 
Normal rank

Latest revision as of 16:36, 17 July 2024

scientific article
Language Label Description Also known as
English
A heuristic method for certifying isolated zeros of polynomial systems
scientific article

    Statements

    A heuristic method for certifying isolated zeros of polynomial systems (English)
    0 references
    0 references
    0 references
    0 references
    18 December 2018
    0 references
    By transforming the given over-determined system into a square one, the authors provide necessary and sufficient conditions to certify the simple roots of the over-determined system by certifying the simple roots of the square system. Based on their previous research, the authors propose a heuristic method for certifying not only the isolated singular zeros of polynomial systems, but also the multiplicity structures of the isolated singular zeros. Various numerical examples are presented.
    0 references
    over-determined polynomial system
    0 references
    isolated zeros
    0 references
    minimum point
    0 references
    sum of squares
    0 references
    interval methods
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers