Computing parametric geometric resolutions
From MaRDI portal
Publication:1566400
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)
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
Cited in
(44)- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers
- Elimination for generic sparse polynomial systems
- Computing modular polynomials by deformation
- Interpolation by decomposable univariate polynomials
- Solving parametric systems of polynomial equations over the reals through Hermite matrices
- Change of order for regular chains in positive dimension
- On solving parametric polynomial systems
- Solving parametric polynomial systems
- The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple}
- Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping
- Sparse resultants and straight-line programs
- Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces
- Dynamic balancing of planar mechanisms using toric geometry
- An improvement of the rational representation for high-dimensional systems
- An \(\mathfrak{m}\)-adic algorithm for bivariate Gröbner bases
- On the complexity of the resolvent representation of some prime differential ideals
- An algorithm for solving zero-dimensional parametric systems of polynomial homogeneous equations
- Complexity results for triangular sets
- Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study
- On the computation of rational solutions of underdetermined systems over a finite field
- A concise proof of the Kronecker polynomial system solver from scratch
- 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
- Solving determinantal systems using homotopy techniques
- Finding new families of rank-one convex polynomials
- On sign conditions over real multivariate polynomials
- Complexity of solving parametric polynomial systems
- Fast computation of a rational point of a variety over a finite field
- A geometric index reduction method for implicit systems of differential algebraic equations
- Fast Algorithms for Discrete Differential Equations
- A linear algebra approach to the differentiation index of generic DAE systems
- On the bit complexity of polynomial system solving
- A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface
- p-adic algorithm for bivariate Gröbner bases
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
- A probabilistic algorithm for computing data-discriminants of likelihood equations
- Computing real radicals and \(S\)-radicals of polynomial systems
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization
- A parametric representation of totally mixed Nash equilibria
- Bit-size estimates for triangular sets in positive dimension
- Polynomial equation solving by lifting procedures for ramified fibers
- Relaxed Hensel lifting of triangular sets
- On computing absolutely irreducible components of algebraic varieties with parameters
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)
