Certification for polynomial systems via square subsystems (Q820969): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(13 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jsc.2020.07.010 / rank
Normal rank
 
Property / author
 
Property / author: Frank J. Sottile / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Q289032 / rank
Normal rank
 
Property / author
 
Property / author: Frank J. Sottile / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Juan C. Migliore / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: NewtonLib / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ISOLATE / rank
 
Normal rank
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 / describes a project that uses
 
Property / describes a project that uses: NumericalAlgebraicGeometry / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: NumericalCertification / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3041626282 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1812.02851 / 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: The number of roots of a system of equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective Certification of Approximate Solutions to Systems of Equations Involving Analytic Functions / 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: Newton Methods for Nonlinear Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3129746 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Error Bounds for the Newton–Kantorovich Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual formulation for certifiable computations in Schubert calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lifted square formulation for certifiable Schubert calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3943431 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3033866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Khovanskii Bases, Higher Rank Valuations, and Tropical Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed volume and an extension of intersection theory of divisors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton-Okounkov bodies, semigroups of integral points, graded algebras and intersection theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4775956 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gorenstein liaison, complete intersection liaison invariants and unobstructedness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3948528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4093739 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short survey on Kantorovich / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical algebraic geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Schubert calculus via the Littlewood-Richardson homotopy algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Safe Starting Regions for Iterative Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Interval Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5203133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving zero-dimensional systems through the rational univariate representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Gröbner bases to determine algebra membership, split surjective algebra homomorphisms determine birational equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Bezout's Theorem I: Geometric Aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4720691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerative geometry for the real Grassmannian of lines in projective space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using SAGBI bases to compute invariants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4861423 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Kantorovich Theorem for Newton's Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5198996 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Numerical Solution of Systems of Polynomials Arising in Engineering and Science / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JSC.2020.07.010 / rank
 
Normal rank

Latest revision as of 04:06, 10 December 2024

scientific article
Language Label Description Also known as
English
Certification for polynomial systems via square subsystems
scientific article

    Statements

    Certification for polynomial systems via square subsystems (English)
    0 references
    0 references
    0 references
    0 references
    29 September 2021
    0 references
    Given a set of polynomials \(f = (f_1,\dots,f_N)\) with \(f_i \in \mathbb C[z_1,\dots,z_n]\), an approximate solution to the system \(f_1(z) = 0, \dots, f_N(z) = 0\) is an estimate \(\hat \zeta\) of some point \(\zeta\) in the common vanishing locus of the \(f_i\) (i.e. \(\zeta\) is a solution of the system \(f\)). By ``approximate solution'' the authors mean that the approximation error \(\| \zeta - \hat \zeta \|\) can be refined efficiently as a function of the input size and the desired precision. To verify that an approximation is suitable, numerical certification seeks to develop criteria and algorithms. In this paper the authors produce algorithms to address the following problems: \begin{itemize} \item[(1)] How to certify that a point \(\zeta \in \mathbb C^n\) is an approximate solution of \(f\)? \item[(2)] If it is known that \(f\) has \(e\) solutions, how can we certify that a set \(Z \subset \mathbb C^n\) of \(e\) points consists of approximate solutions to \(f\)? \end{itemize} The authors consider numerical certification of approximate solutions to a system of polynomial equations with more equations than unknowns by first certifying solutions to a suitable square subsystem. They give several approaches, using different additional information. Among these are liaison, Newton-Okounkov bodies, or intersection theory. They may be used to certify individual solutions, reject non-solutions, or certify that we have found all solutions.
    0 references
    certified solutions
    0 references
    alpha theory
    0 references
    polynomial system
    0 references
    numerical algebraic geometry
    0 references
    Newton-Okounkov bodies
    0 references
    Schubert calculus
    0 references
    liaison
    0 references
    intersection theory
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    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