Computing parametric geometric resolutions
DOI10.1007/S00200-002-0109-XzbMATH Open1058.68123OpenAlexW2037381995MaRDI QIDQ1566400FDOQ1566400
Publication date: 2 June 2003
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-002-0109-x
Recommendations
- An algorithm for solving zero-dimensional parametric systems of polynomial homogeneous equations
- Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions
- Complexity of solving parametric polynomial systems
- scientific article; zbMATH DE number 1979261
- scientific article; zbMATH DE number 1069614
- On the Bézout construction of the resultant
- Solving systems of algebraic equations
- scientific article; zbMATH DE number 1263385
- Deformation techniques for efficient polynomial equation solving.
- Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. III
complexitysymbolic computationparametric polynomial systemsalgebraic computationNewton operatorgeometric resolutions
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Numerical computation of solutions to systems of equations (65H10) Finite ground fields in algebraic geometry (14G15) Computational aspects of algebraic curves (14Q05)
Cited In (44)
- Solving determinantal systems using homotopy techniques
- A parametric representation of totally mixed Nash equilibria
- A concise proof of the Kronecker polynomial system solver from scratch
- Change of order for regular chains in positive dimension
- Exact algorithms for semidefinite programs with degenerate feasible set
- A geometric index reduction method for implicit systems of differential algebraic equations
- On the bit complexity of polynomial system solving
- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers
- Complexity results for triangular sets
- p-adic algorithm for bivariate Gröbner bases
- Solving parametric systems of polynomial equations over the reals through Hermite matrices
- Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study
- A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
- Bit-size estimates for triangular sets in positive dimension
- Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces
- Blind algebraic identification of communication channels: symbolic solution algorithms
- Deformation techniques for sparse systems
- A Numerical Method for Computing Border Curves of Bi-parametric Real Polynomial Systems and Applications
- A probabilistic algorithm for computing data-discriminants of likelihood equations
- A linear algebra approach to the differentiation index of generic DAE systems
- On solving parametric polynomial systems
- On the computation of rational solutions of underdetermined systems over a finite field
- Finding new families of rank-one convex polynomials
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization
- Polynomial equation solving by lifting procedures for ramified fibers
- Interpolation by decomposable univariate polynomials
- Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping
- Fast computation of a rational point of a variety over a finite field
- On computing absolutely irreducible components of algebraic varieties with parameters
- Complexity of solving parametric polynomial systems
- On the complexity of the resolvent representation of some prime differential ideals
- Dynamic balancing of planar mechanisms using toric geometry
- On sign conditions over real multivariate polynomials
- Computing real radicals and \(S\)-radicals of polynomial systems
- Relaxed Hensel lifting of triangular sets
- The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple}
- Elimination for generic sparse polynomial systems
- An \(\mathfrak{m}\)-adic algorithm for bivariate Gröbner bases
- Computing modular polynomials by deformation
- Sparse resultants and straight-line programs
- Fast Algorithms for Discrete Differential Equations
- Solving parametric polynomial systems
- An improvement of the rational representation for high-dimensional systems
This page was built for publication: Computing parametric geometric resolutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1566400)
