Computing the multiplicity structure in solving polynomial systems
From MaRDI portal
Publication:5262751
Recommendations
Cited in
(66)- A heuristic method for certifying isolated zeros of polynomial systems
- Efficient computation of dual space and directional multiplicity of an isolated point
- Clustering complex zeros of triangular systems of polynomials
- Numerical computation of the Hilbert function and regularity of a zero dimensional scheme
- Newton's method with deflation for isolated singularities of polynomial systems
- Comparison of probabilistic algorithms for analyzing the components of an affine algebraic variety
- Computing PUR of zero-dimensional ideals of breadth at most one
- Multiplicity-preserving triangular set decomposition of two polynomials
- Binomiality testing and computing sparse polynomials via witness sets
- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers
- Nearest multivariate system with given root multiplicities
- Enumerating rigid sphere packings
- Improved two-step Newton's method for computing simple multiple zeros of polynomial systems
- Numerical calculation of the multiplicity of a solution to algebraic equations
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
- Regeneration homotopies for solving systems of polynomials
- Evaluation techniques for zero-dimensional primary decomposition
- Numerical approximation of multiple isolated roots of analytical systems
- A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set
- Sampling algebraic sets in local intrinsic coordinates
- The closedness subspace method for computing the multiplicity structure of a polynomial system
- Witness sets of projections
- Determining singular solutions of polynomial systems via symbolic-numeric reduction to geometric involutive forms
- On isolation of simple multiple zeros and clusters of zeros of polynomial systems
- The equivalent representation of the breadth-one \(D\)-invariant polynomial subspace and its discretization
- Real solution isolation with multiplicity of zero-dimensional triangular systems
- On the null spaces of the Macaulay matrix
- Multiprojective witness sets and a trace test
- Multiple zeros of nonlinear systems
- Isosingular sets and deflation
- A numerical elimination method for polynomial computations
- Regenerative cascade homotopies for solving polynomial systems
- Sweeping algebraic curves for singular solutions
- Mechanism mobility and a local dimension test
- Locating the closest singularity in a polynomial homotopy
- scientific article; zbMATH DE number 1254248 (Why is no real title available?)
- Verified error bounds for isolated singular solutions of polynomial systems: case of breadth one
- Computing Solutions Uniquely Collapses the Polynomial Hierarchy
- A new deflation method for verifying the isolated singular zeros of polynomial systems
- Regularization and matrix computation in numerical polynomial algebra
- Computing the multiplicity structure from geometric involutive form
- Numerical decomposition of the rank-deficiency set of a matrix of multivariate polynomials
- Numerical computation of the genus of an irreducible curve within an algebraic set
- An adaptive homotopy method for computing bifurcations of nonlinear parametric systems
- scientific article; zbMATH DE number 5995258 (Why is no real title available?)
- On deflation and multiplicity structure
- On approximate triangular decompositions in dimension zero
- Verified error bounds for singular solutions of nonlinear systems
- Chern numbers of smooth varieties via homotopy continuation and intersection theory
- Unification and extension of intersection algorithms in numerical algebraic geometry
- Computers and the Multiplicity of Polynomial Roots
- Computing the multiplicity structure of an isolated singular solution: case of breadth one
- Eliminating dual spaces
- Foreword. What is numerical algebraic geometry?
- Inverse multivariate polynomial root-finding: numerical implementations of the affine and projective Buchberger-Möller algorithm
- Determining dimension of the solution component that contains a computed zero of a polynomial system
- On the multiplicity of isolated roots of sparse polynomial systems
- Newton polytopes and witness sets
- Two-step Newton's method for deflation-one singular zeros of analytic systems
- Numerical irreducible decomposition over a number field
- Squarefree normal representation of zeros of zero-dimensional polynomial systems
- Newton-Anderson at Singular Points
- Analyzing the dual space of the saturated ideal of a regular set and the local multiplicities of its zeros
- Systems of Polynomial Equations, Higher-Order Tensor Decompositions, and Multidimensional Harmonic Retrieval: A Unifying Framework. Part II: The Block Term Decomposition
- A certified iterative method for isolated singular roots
- Isolated singularities, inverse systems and the punctual Hilbert scheme
This page was built for publication: Computing the multiplicity structure in solving polynomial systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262751)
