Results 151 to 160 of about 40,102 (181)
Some of the next articles are maybe not open access.
International Symposium on Symbolic and Algebraic Computation
In this paper, we propose a novel symbolic computation algorithm for structural analysis of equilibrium outcomes of Cournot and Bertrand oligopoly games.
Xiaoliang Li, Bo Huang, A. Q. Zhang
semanticscholar +1 more source
In this paper, we propose a novel symbolic computation algorithm for structural analysis of equilibrium outcomes of Cournot and Bertrand oligopoly games.
Xiaoliang Li, Bo Huang, A. Q. Zhang
semanticscholar +1 more source
Constructing a single cell in cylindrical algebraic decomposition
Journal of Symbolic Computation, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brown, Christopher, Kosta, Marek
exaly +4 more sources
Recent Developments in Real Quantifier Elimination and Cylindrical Algebraic Decomposition
Computer Algebra in Scientific ComputingThis extended abstract accompanies an invited talk at CASC 2024, which surveys recent developments in Real Quantifier Elimination (QE) and Cylindrical Algebraic Decomposition (CAD).
Matthew England
semanticscholar +1 more source
International Symposium on Symbolic and Algebraic Computation, 2020
Given a quantified logical formula whose atoms are polynomial constraints with real valued variables, Real Quantifier Elimination (QE) means to derive a logically equivalent formula which does not involve quantifiers or the quantified variables from the ...
M. England
semanticscholar +1 more source
Given a quantified logical formula whose atoms are polynomial constraints with real valued variables, Real Quantifier Elimination (QE) means to derive a logically equivalent formula which does not involve quantifiers or the quantified variables from the ...
M. England
semanticscholar +1 more source
Analytical solutions for the minimum weight design of trusses by cylindrical algebraic decomposition
Archive of Applied Mechanics, 2017Aristotelis E Charalampakis
exaly +2 more sources
On Approximations and Incidence in Cylindrical Algebraic Decompositions
SIAM Journal on Computing, 1986This interesting paper deals with a fruitful and central area of research, where classical constructive algebra in the form of computer algebra, complexity theory and algebraic geometry come together. Besides throwing new light on each of the fields mentioned, there is an abundant variety of applications within science and engineering.
openaire +1 more source
arXiv.org
Symbolic computation, powered by modern computer algebra systems, has important applications in mathematical reasoning through exact deep computations.
Rui-Juan Jing +2 more
semanticscholar +1 more source
Symbolic computation, powered by modern computer algebra systems, has important applications in mathematical reasoning through exact deep computations.
Rui-Juan Jing +2 more
semanticscholar +1 more source
Journal of the Franklin Institute, 2019
This paper considers the robust stability problem of fractional-order systems with uncertain order and structured perturbations. A stability check procedure is proposed for determining the robust bounds of uncertain order and other uncertain parameters ...
Jing Yang, Xiaorong Hou
semanticscholar +1 more source
This paper considers the robust stability problem of fractional-order systems with uncertain order and structured perturbations. A stability check procedure is proposed for determining the robust bounds of uncertain order and other uncertain parameters ...
Jing Yang, Xiaorong Hou
semanticscholar +1 more source
Cylindrical algebraic decomposition by quantifier elimination
1982Cylindrical algebraic decompositions were introduced as a major component of a new quantifier elimination algorithm for elementary algebra and geometry (G. Collins, 1973). In the present paper we turn the tables and show that one can use quantifier elimination for elementary algebra and geometry to obtain a new version of the cylindrical algebraic ...
Dennis S. Arnon, Scott McCallum
openaire +1 more source
A parallel implementation of the cylindrical algebraic decomposition algorithm
Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation - ISSAC '89, 1989In this paper, we describe a parallelization scheme for Collins' cylindrical algebraic decomposition algorithm for quantifier elimination in the theory of real closed fields. We first discuss a parallel implementation of the computer algebra system SAC2 in which a complete sequential implementation of Collins' algorithm already exists.
B. David Saunders +2 more
openaire +1 more source