Evaluation techniques for zero-dimensional primary decomposition
From MaRDI portal
Publication:1030246
DOI10.1016/j.jsc.2008.02.008zbMath1221.13043OpenAlexW2002678358MaRDI QIDQ1030246
Publication date: 1 July 2009
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2008.02.008
Symbolic computation and algebraic computation (68W30) Solving polynomial systems; resultants (13P15)
Related Items
Segre-driven radicality testing, Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces, Deterministic normal position transformation and its applications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
- Localization and primary decomposition of polynomial ideals
- Parallel algorithms for matrix normal forms
- On location and approximation of clusters of zeros: Case of embedding dimension one
- Solving systems of linear equations over polynomials
- Gröbner bases and primary decomposition of polynomial ideals
- La queste del Saint \(\text{Gr}_ a(\text{AL})\): A computational approach to local algebra
- Direct methods for primary decomposition
- Probabilistic algorithms for geometric elimination
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Lower bounds for diophantine approximations
- Isolated points, duality and residues
- On lattice reduction for polynomial matrices
- Computing the primary decomposition of zero-dimensional ideals
- Quadratic Newton iteration for systems with multiplicity
- The computational complexity of the Chow form
- Algebraic numbers: An example of dynamic evaluation
- Dynamic evaluation and algebraic closure in Axiom
- Generalized subresultants for computing the Smith normal form of polynomial matrices
- Advances and improvements in the theory of standard bases and syzygies
- On the intrinsic complexity of the arithmetic Nullstellensatz
- A concise proof of the Kronecker polynomial system solver from scratch
- Conquering inseparability: primary decomposition and multivariate factorization over algebraic function fields of positive characteristic
- Newton's method with deflation for isolated singularities of polynomial systems
- On location and approximation of clusters of zeros of analytic functions
- Constructions in a Polynomial Ring Over the Ring of Integers
- Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions
- On the Lasker-Noether Decomposition Theorem
- Constructions in Algebra
- On multiplicities in polynomial system solving
- Computing the multiplicity structure in solving polynomial systems
- Numerical primary decomposition
- On the time-space complexity of geometric elimination procedures
- A Gröbner free alternative for polynomial system solving
