Proceedings of the Twenty-First International Symposium on Symbolic and Algebraic Computation 2008
DOI: 10.1145/1390768.1390793
|View full text |Cite
|
Sign up to set email alerts
|

Numerical primary decomposition

Abstract: Consider an ideal I ⊂ R = C[x1, . . . , xn] defining a complex affine variety X ⊂ C n . We describe the components associated to I by means of numerical primary decomposition (NPD).The method is based on the construction of deflation ideal I (d) that defines the deflated variety X (d) in a complex space of higher dimension. For every embedded component there exists d and an isolated component Y (d) of I (d) projecting onto Y . In turn, Y (d) can be discovered by existing methods for prime decomposition, in par… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
28
0

Year Published

2009
2009
2021
2021

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 18 publications
(28 citation statements)
references
References 17 publications
0
28
0
Order By: Relevance
“…For example, [19] uses rank conditions on Macaulay matrices to locate embedded components along with other singular sets. In [6], the left null spaces of Macaulay matrices are related to syzygies.…”
Section: Fn(x; P)mentioning
confidence: 99%
“…For example, [19] uses rank conditions on Macaulay matrices to locate embedded components along with other singular sets. In [6], the left null spaces of Macaulay matrices are related to syzygies.…”
Section: Fn(x; P)mentioning
confidence: 99%
“…It is important to note that the only difference between Theorem 1 and Proposed Theorem 2 (Theorem 4.6 of [4]) is that Theorem 1 uses the whole dual space while Proposed Theorem 2 uses only the dual space of order deg g. That is, since the whole dual space can be infinite-dimensional, this difference turns the proposed ideal membership test of [4] into a finite-dimensional computation, namely Algorithm 4.7 of [4]. Unfortunately, as the example presented in Section 4 demonstrates, Theorem 4.6 and Algorithm 4.7 of [4] are invalid since truncating the dual space at order deg g is not sufficient for determining ideal membership in general.…”
Section: Proposed Membership Testmentioning
confidence: 99%
“…Unfortunately, as the example presented in Section 4 demonstrates, Theorem 4.6 and Algorithm 4.7 of [4] are invalid since truncating the dual space at order deg g is not sufficient for determining ideal membership in general.…”
Section: Proposed Membership Testmentioning
confidence: 99%
See 2 more Smart Citations