A numerical local dimension test for points on the solution set of a system of polynomial equations
DOI10.1137/08073264XzbMATH Open1211.14066OpenAlexW2007860444MaRDI QIDQ3056243FDOQ3056243
Authors: Daniel J. Bates, Jonathan D. Hauenstein, Chris Peterson, Andrew J. Sommese
Publication date: 11 November 2010
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/08073264x
Recommendations
- scientific article; zbMATH DE number 1736023
- Numerical local irreducible decomposition
- Numerical decomposition of the solution sets of polynomial systems into irreducible components
- Numerical homotopies to compute generic points on positive dimensional algebraic sets
- scientific article; zbMATH DE number 1961539
multiplicityhomotopy continuationlocal dimensionpolynomial systemnumerical algebraic geometryirreducible componentsgeneric points
Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Computational aspects in algebraic geometry (14Q99)
Cited In (33)
- Numerical local irreducible decomposition
- Solving determinantal systems using homotopy techniques
- Numerical algorithms for dual bases of positive-dimensional ideals
- Numerical computation of the Hilbert function and regularity of a zero dimensional scheme
- A numerical realization of the conditions of Max Nöther's residual intersection theorem
- Comparison of probabilistic algorithms for analyzing the components of an affine algebraic variety
- Unification and extension of intersection algorithms in numerical algebraic geometry
- Global structure of curves from generalized unitarity cut of three-loop diagrams
- Puiseux expansions and nonisolated points in algebraic varieties
- Numerical algebraic geometry and algebraic kinematics
- Decomposing solution sets of polynomial systems using derivatives
- Cell decomposition of almost smooth real algebraic surfaces
- Title not available (Why is that?)
- On Computing the Nonlinearity Interval in Parametric Semidefinite Optimization
- Multiple zeros of nonlinear systems
- Determining dimension of the solution component that contains a computed zero of a polynomial system
- Perturbed homotopies for finding all isolated solutions of polynomial systems
- Testing zero-dimensionality of varieties at a point
- ON THE DIMENSIONS OF THE REALIZATION SPACES OF POLYTOPES
- Numerical irreducible decomposition over a number field
- A counter example to an ideal membership test
- Symmetric Functions Applied to Decomposing Solution Sets of Polynomial Systems
- Numerically computing real points on algebraic sets
- On Search for All Roots of a System of Quadratic Equations
- Exceptional Stewart-Gough platforms, Segre embeddings, and the special Euclidean group
- Mechanism mobility and a local dimension test
- Algebraic boundaries of Hilbert's SOS cones
- Multiprojective witness sets and a trace test
- Eliminating dual spaces
- Foreword. What is numerical algebraic geometry?
- Numerical decomposition of the solution sets of polynomial systems into irreducible components
- Recovering exact results from inexact numerical data in algebraic geometry
- Regeneration homotopies for solving systems of polynomials
Uses Software
This page was built for publication: A numerical local dimension test for points on the solution set of a system of polynomial equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3056243)