Some examples for solving systems of algebraic equations by calculating Gröbner bases
From MaRDI portal
Publication:1082037
DOI10.1016/S0747-7171(86)80014-1zbMath0602.65032OpenAlexW2034234139MaRDI QIDQ1082037
Publication date: 1986
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0747-7171(86)80014-1
Gröbner basessystems of algebraic equationssymbolic computationsBuchberger's algorithmvariable ordering
Probabilistic models, generic numerical methods in probability and statistics (65C20) Numerical computation of solutions to systems of equations (65H10)
Related Items (19)
PHoMpara-parallel implementation of the polyhedral homotopy continuation method for polynomial systems ⋮ Computing dimension and independent sets for polynomial ideals ⋮ Solving algebraic equations: Combining Buchberger's algorithm with multivariate factorization ⋮ An FGLM-like algorithm for computing the radical of a zero-dimensional ideal ⋮ Parametric equation solving and quantifier elimination in finite fields with the characteristic set method ⋮ Computer classification of integrable coupled KdV-like systems ⋮ An algorithm for primary decomposition in polynomial rings over the integers ⋮ An improved term ordering for the ideal of commuting matrices ⋮ Extended parallelism in the Gröbner basis algorithm ⋮ Comprehensive Gröbner bases ⋮ Regularized learning in Banach spaces as an optimization problem: representer theorems ⋮ Efficient techniques for performing an irregular computation on distributed memory machines ⋮ HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method ⋮ Triangular sets for solving polynomial systems: a comparative implementation of four methods ⋮ Floating point Gröbner bases. ⋮ Construction of Gröbner bases for investigation of systems of polynomial equations ⋮ Intersection points algorithm for piecewise algebraic curves based on Groebner bases ⋮ Bifurcation manifolds in predator-prey models computed by Gröbner basis method ⋮ Numerical homotopies to compute generic points on positive dimensional algebraic sets
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An application of the Runge-Kutta space
- Computer algebra application for classification of integrable non-linear evolution equations
- Über B. Buchbergers Verfahren, Systeme algebraischer Gleichungen zu lösen
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
- Some comments on the modular approach to Gröbner-bases
- On improving approximate results of Buchberger's algorithm by Newton's method
- Algorithm 628
This page was built for publication: Some examples for solving systems of algebraic equations by calculating Gröbner bases