A complete algorithm for automated discovering of a class of inequality-type theorems
From MaRDI portal
Publication:865930
DOI10.1007/BF02713938zbMath1125.68406OpenAlexW1992483196MaRDI QIDQ865930
Xiaorong Hou, Lu Yang, Bican Xia
Publication date: 20 February 2007
Published in: Science in China. Series F (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02713938
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (35)
Dynamic behaviors of a symmetrically coupled period-doubling system ⋮ Chordality Preserving Incremental Triangular Decomposition and Its Implementation ⋮ A probabilistic algorithm for computing data-discriminants of likelihood equations ⋮ Recent advances in program verification through computer algebra ⋮ Modular composition modulo triangular sets and applications ⋮ The maximum number and its distribution of singular points for parametric piecewise algebraic curves ⋮ Gröbner bases for polynomial systems with parameters ⋮ Dynamics in a discrete time model of logistic type ⋮ A Direttissimo Algorithm for Equidimensional Decomposition ⋮ Using Symbolic Computation to Analyze Zero-Hopf Bifurcations of Polynomial Differential Systems ⋮ Algorithms for computing triangular decomposition of polynomial systems ⋮ Some geometric properties of successive difference substitutions ⋮ A program to create new geometry proof problems ⋮ Generic regular decompositions for parametric polynomial systems ⋮ Discovering polynomial Lyapunov functions for continuous dynamical systems ⋮ A review and prospect of readable machine proofs for geometry theorems ⋮ Solving parametric piecewise polynomial systems ⋮ Computing equilibria of semi-algebraic economies using triangular decomposition and real solution classification ⋮ The monotonicity of ratios of some abelian integrals ⋮ An algebraic method to calculate parameter regions for constrained steady-state distribution in stochastic reaction networks ⋮ Analysis of Snapback Repellers Using Methods of Symbolic Computation ⋮ An equivalence theorem for regular differential chains ⋮ Analysis of codimension 2 bifurcations for high-dimensional discrete systems using symbolic computation methods ⋮ Solution to the generalized champagne problem on simultaneous stabilization of linear systems ⋮ A class of mechanically decidable problems beyond Tarski's model ⋮ Parameter identification on abelian integrals to achieve Chebyshev property ⋮ On the extended Hensel construction and its application to the computation of real limit points ⋮ DISCOVERER ⋮ Real zeros of the zero-dimensional parametric piecewise algebraic variety ⋮ Symbolic computation for the qualitative theory of differential equations ⋮ Generic regular decompositions for generic zero-dimensional systems ⋮ Choosing better variable orderings for cylindrical algebraic decomposition via exploiting chordal structure ⋮ Special algorithm for stability analysis of multistable biological regulatory systems ⋮ An algorithm for isolating the real solutions of semi-algebraic systems ⋮ Solving parametric systems of polynomial equations over the reals through Hermite matrices
Uses Software
Cites Work
- Unnamed Item
- A complete discrimination system for polynomials
- Zeros and factors of polynomials with positive coefficients and protein- ligand binding
- A complete discrimination system for polynomials with complex coefficients and its automatic generation
- Mechanical theorem proving in geometries. Basic principles. Transl. from the Chinese by Xiaofan Jin and Dongming Wang
- Recent advances on determining the number of real roots of parametric polynomials
- Complete characterization of strictly positive real regions and robust strictly positive real synthesis method
- Polynomial algorithms in computer algebra
- Which Triangles are Plane Sections of Regular Tetrahedra?
- Cylindrical Algebraic Decomposition I: The Basic Algorithm
This page was built for publication: A complete algorithm for automated discovering of a class of inequality-type theorems
