Evaluation techniques for zero-dimensional primary decomposition
type: Item
instance of: scholarly article
title: Evaluation techniques for zero-dimensional primary decomposition
zbMATH Open document ID: 1221.13043
author: Clémence Durvye
published in: Journal of Symbolic Computation
publication date: 2009-07-01T00:00:00Z
Mathematics Subject Classification ID: 13P15
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 12Y05
zbMATH DE Number: 5573843
zbMATH Keywords: polynomial system solving
zbMATH Keywords: elimination theory
zbMATH Keywords: algorithm
zbMATH Keywords: complexity
describes a project that uses: Kronecker
describes a project that uses: SINGULAR
MaRDI profile type: Publication
full work available at URL: j.jsc.2008.02.008
OpenAlex ID: W2002678358
cites work: Q4714011
cites work: Q4331740
cites work: Q4470458
cites work: Q3139838
cites work: Computing the multiplicity structure in solving polynomial systems
cites work: Q4247789
cites work: A concise proof of the Kronecker polynomial system solver from scratch
cites work: Algebraic numbers: An example of dynamic evaluation
cites work: Dynamic evaluation and algebraic closure in Axiom
cites work: Q4317713
cites work: Direct methods for primary decomposition
cites work: Efficient computation of zero-dimensional Gröbner bases by change of ordering
cites work: Q4406533
cites work: Gröbner bases and primary decomposition of polynomial ideals
cites work: Lower bounds for diophantine approximations
cites work: Q4850731
cites work: Q4352797
cites work: A Gröbner free alternative for polynomial system solving
cites work: On location and approximation of clusters of zeros of analytic functions
cites work: On location and approximation of clusters of zeros: Case of embedding dimension one
cites work: Advances and improvements in the theory of standard bases and syzygies
cites work: Q2781760
cites work: On the intrinsic complexity of the arithmetic Nullstellensatz
cites work: On the time-space complexity of geometric elimination procedures
cites work: The computational complexity of the Chow form
cites work: Parallel algorithms for matrix normal forms
cites work: Solving systems of linear equations over polynomials
cites work: Q4714022
cites work: Q2770573
cites work: Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions
cites work: Quadratic Newton iteration for systems with multiplicity
cites work: Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
cites work: Numerical primary decomposition
cites work: Newton's method with deflation for isolated singularities of polynomial systems
cites work: On multiplicities in polynomial system solving
cites work: Probabilistic algorithms for geometric elimination
cites work: Computing the primary decomposition of zero-dimensional ideals
cites work: La queste del Saint \(\text{Gr}_ a(\text{AL})\): A computational approach to local algebra
cites work: Isolated points, duality and residues
cites work: On lattice reduction for polynomial matrices
cites work: Q4352783
cites work: Constructions in Algebra
cites work: Constructions in a Polynomial Ring Over the Ring of Integers
cites work: On the Lasker-Noether Decomposition Theorem
cites work: Localization and primary decomposition of polynomial ideals
cites work: Conquering inseparability: primary decomposition and multivariate factorization over algebraic function fields of positive characteristic
cites work: Q4234329
cites work: Generalized subresultants for computing the Smith normal form of polynomial matrices
DOI: 10.1016/J.JSC.2008.02.008
description: scientific article; zbMATH DE number 5573843