Numerical primary decomposition
From MaRDI portal
Abstract: Consider an ideal defining a complex affine variety . We describe the components associated to by means of {em numerical primary decomposition} (NPD). The method is based on the construction of {em deflation ideal} that defines the {em deflated variety} in a complex space of higher dimension. For every embedded component there exists and an isolated component of projecting onto . In turn, can be discovered by existing methods for prime decomposition, in particular, the {em numerical irreducible decomposition}, applied to . The concept of NPD gives a full description of the scheme by representing each component with a {em witness set}. We propose an algorithm to produce a collection of witness sets that contains a NPD and that can be used to solve the {em ideal membership problem} for .
Cited in
(13)- Evaluation techniques for zero-dimensional primary decomposition
- Unification and extension of intersection algorithms in numerical algebraic geometry
- Primary ideals and their differential equations
- Noetherian operators and primary decomposition
- On deflation and multiplicity structure
- Isosingular sets and deflation
- Eliminating dual spaces
- Numerical algorithms for detecting embedded components
- Chern numbers of smooth varieties via homotopy continuation and intersection theory
- Two-step Newton's method for deflation-one singular zeros of analytic systems
- Linear PDE with constant coefficients
- Local dual spaces and primary decomposition
- Multi-graded Macaulay dual spaces
This page was built for publication: Numerical primary decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301619)