Related Research Articles
In symbolic computation, the Risch algorithm is a method of indefinite integration used in some computer algebra systems to find antiderivatives. It is named after the American mathematician Robert Henry Risch, a specialist in computer algebra who developed it in 1968.
Axiom is a free, general-purpose computer algebra system. It consists of an interpreter environment, a compiler and a library, which defines a strongly typed hierarchy.
In computer algebra, the Faugère F4 algorithm, by Jean-Charles Faugère, computes the Gröbner basis of an ideal of a multivariate polynomial ring. The algorithm uses the same mathematical principles as the Buchberger algorithm, but computes many normal forms in one go by forming a generally sparse matrix and using fast linear algebra to do the reductions in parallel.
Jean-Charles Faugère is the head of the POLSYS project-team of the Laboratoire d'Informatique de Paris 6 (LIP6) and Paris–Rocquencourt center of INRIA, in Paris. The team was formerly known as SPIRAL and SALSA.
In mathematics and computer science, computer algebra, also called symbolic computation or algebraic computation, is a scientific area that refers to the study and development of algorithms and software for manipulating mathematical expressions and other mathematical objects. Although computer algebra could be considered a subfield of scientific computing, they are generally considered as distinct fields because scientific computing is usually based on numerical computation with approximate floating point numbers, while symbolic computation emphasizes exact computation with expressions containing variables that have no given value and are manipulated as symbols.
A system of polynomial equations is a set of simultaneous equations f1 = 0, ..., fh = 0 where the fi are polynomials in several variables, say x1, ..., xn, over some field k.
In computer algebra, a triangular decomposition of a polynomial system S is a set of simpler polynomial systems S1, ..., Se such that a point is a solution of S if and only if it is a solution of one of the systems S1, ..., Se.
In mathematical invariant theory, an invariant of a binary form is a polynomial in the coefficients of a binary form in two variables x and y that remains invariant under the special linear group acting on the variables x and y.
In differential algebra, Picard–Vessiot theory is the study of the differential field extension generated by the solutions of a linear differential equation, using the differential Galois group of the field extension. A major goal is to describe when the differential equation can be solved by quadratures in terms of properties of the differential Galois group. The theory was initiated by Émile Picard and Ernest Vessiot from about 1883 to 1904.
In mathematical logic, computational complexity theory, and computer science, the existential theory of the reals is the set of all true sentences of the form
In mathematics, a polynomial decomposition expresses a polynomial f as the functional composition of polynomials g and h, where g and h have degree greater than 1; it is an algebraic functional decomposition. Algorithms are known for decomposing univariate polynomials in polynomial time.
Michel Paul Lazard was a French mathematician who worked on the theory of Lie groups in the context of p-adic analysis.
Charles Edmond Alfred Riquier was a French mathematician.
FGLM is one of the main algorithms in computer algebra, named after its designers, Faugère, Gianni, Lazard and Mora. They introduced their algorithm in 1993. The input of the algorithm is a Gröbner basis of a zero-dimensional ideal in the ring of polynomials over a field with respect to a monomial order and a second monomial order. As its output, it returns a Gröbner basis of the ideal with respect to the second ordering. The algorithm is a fundamental tool in computer algebra and has been implemented in most of the computer algebra systems. The complexity of FGLM is O(nD3), where n is the number of variables of the polynomials and D is the degree of the ideal. There are several generalization and various applications for FGLM.
Ferdinando 'Teo' Mora is an Italian mathematician, and since 1990 until 2019 a professor of algebra at the University of Genoa.
In computer algebra, the Gröbner fan of an ideal in the ring of polynomials is a concept in the theory of Gröbner bases. It is defined to be a fan consisting of cones that correspond to different monomial orders on that ideal. The concept was introduced by Mora and Robbiano in 1988. The result is a weaker version of the result presented in the same issue of the journal by Bayer and Morrison. Gröbner fan is a base for the nowadays active field of tropical geometry. One implementation of the Gröbner fan is called Gfan, based on an article of Fukuda, et al. which is included in some computer algebra systems such as Singular, Macaulay2, and CoCoA.
Valérie Berthé is a French mathematician who works as a director of research for the Centre national de la recherche scientifique (CNRS) at the Institut de Recherche en Informatique Fondamentale (IRIF), a joint project between CNRS and Paris Diderot University. Her research involves symbolic dynamics, combinatorics on words, discrete geometry, numeral systems, tessellations, and fractals.
James Milton Renegar Jr. is an American mathematician, specializing in optimization algorithms for linear programming and nonlinear programming.
Deepak Kapur is a Distinguished Professor in the Department of Computer Science at the University of New Mexico.
Karin Gatermann (1961–2005) was a German mathematician whose research topics included computer algebra, sum-of-squares optimization, toric varieties, and dynamical systems of chemical reactions.
References
- ↑ Daniel Lazard at the Mathematics Genealogy Project.
- ↑ Lazard, Daniel. Autour de la platitude (Thèse de doctorat). École Normale Supérieure (library record). Retrieved March 10, 2023.
- ↑ "International Conference on Polynomial System Solving, Paris, November 24-25-26 2004, in honour of Daniel Lazard", LIP6, archived from the original on March 14, 2009.
- ↑ Faugère, Jean-Charles; Rouillier, Fabrice (2009-03-01). "Foreword". Journal of Symbolic Computation . Polynomial System Solving in honor of Daniel Lazard. 44 (3): 221. doi:10.1016/j.jsc.2008.08.004. ISSN 0747-7171.
- ↑ "LAZARD Daniel 1998-2021 Publications". Sorbonne Institute. Retrieved February 23, 2023.
