RAGlib
A library for real solving polynomial systems of equations and inequalities. RAGlib is a Maple package providing useful functionalities for the study of real solutions of polynomial systems of equations and inequalities such as testing the emptiness or computing sampling points in each connected component of their real solution set. RAGlib is built upon the FGb library and its interface with Maple developped by Jean-Charles Faugere (INRIA/ LIP6 PolSys) The RAGlib Maple package allows to solve polynomial systems of equations/inequalities over the reals. Provided functionalities allow to decide the existence of real solutions and to compute sample points in each connected component of the real solution set.
Keywords for this software
References in zbMATH (referenced in 65 articles )
Showing results 1 to 20 of 65.
Sorted by year (- Le, Huu Phuoc; Safey El Din, Mohab: Solving parametric systems of polynomial equations over the reals through Hermite matrices (2022)
- Magron, Victor; Safey El Din, Mohab: On exact Reznick, Hilbert-Artin and Putinar’s representations (2021)
- Safey El Din, Mohab; Yang, Zhi-Hong; Zhi, Lihong: Computing real radicals and (S)-radicals of polynomial systems (2021)
- Henrion, Didier; Naldi, Simone; Safey El Din, Mohab: Real root finding for low rank linear matrices (2020)
- Quadrat, Alban (ed.); Zerz, Eva (ed.): Algebraic and symbolic computation methods in dynamical systems. Based on articles written for the invited sessions of the 5th symposium on system structure and control, IFAC, Grenoble, France, February 4--6, 2013 and of the 21st international symposium on mathematical theory of networks and systems (MTNS 2014), Groningen, the Netherlands, July 7--11, 2014 (2020)
- Bouzidi, Yacine; Quadrat, Alban; Rouillier, Fabrice: Certified non-conservative tests for the structural stability of discrete multidimensional systems (2019)
- Dickenstein, Alicia: Algebra and geometry in the study of enzymatic cascades (2019)
- Magron, Victor; Safey El Din, Mohab; Schweighofer, Markus: Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials (2019)
- Verdière, N.; Orange, S.: A systematic approach for doing an a priori identifiability study of dynamical nonlinear models (2019)
- Greenwood, Torin: Asymptotics of bivariate analytic functions with algebraic singularities (2018)
- Lê, Công-Trình: A note on optimization with Morse polynomials (2018)
- Naldi, Simone; Plaumann, Daniel: Symbolic computation in hyperbolic programming (2018)
- Victor Magron, Mohab Safey El Din: RealCertify: a Maple package for certifying non-negativity (2018) arXiv
- Dias, Luis Renato G.; Tanabé, Susumu; Tibăr, Mihai: Toward effective detection of the bifurcation locus of real polynomial maps (2017)
- Rodriguez, Jose Israel; Tang, Xiaoxian: A probabilistic algorithm for computing data-discriminants of likelihood equations (2017)
- Woracek, Harald: Directing functionals and de Branges space completions in almost Pontryagin spaces (2017)
- Wu, Wenyuan; Reid, Greg; Feng, Yong: Computing real witness points of positive dimensional polynomial systems (2017)
- Abril Bucero, Marta; Mourrain, Bernard: Border basis relaxation for polynomial optimization (2016)
- Gross, Elizabeth; Harrington, Heather A.; Rosen, Zvi; Sturmfels, Bernd: Algebraic systems biology: a case study for the Wnt pathway (2016)
- Han, Jingjun; Jin, Zhi; Xia, Bican: Proving inequalities and solving global optimization problems via simplified CAD projection (2016)