We describe the implementation of output code optimization in the open source computer algebra system Form. This implementation is based on recently discovered techniques of Monte Carlo tree search to find efficient multivariate Horner schemes, in combination with other optimization algorithms, such as common subexpression elimination. For systems for which no specific knowledge is provided it performs significantly better than other methods we could compare with. Because the method has a number of free parameters, we also show some methods by which to tune them to different types of problems. ar X i
Abstract. In this article we look at the generation of libraries for dense linear algebra operations...
International audienceThe polyhedral model is a powerful framework for automatic optimization and pa...
This paper considers a programming language where all control is encoded in algebras and combinators...
Abstract: In many applications of computer algebra large expressions must be simplified to make repe...
For univariate polynomials f(x1), Horner scheme provides the fastest way to compute the value. For m...
AbstractThe role of computer algebra systems (CASs) is not limited to analyzing and solving mathemat...
Algebraic properties such as associativity or distributivity allow the manipulation of a set of math...
Advances in high energy physics have created the need to increase computational capac-ity. Project H...
Algorithm optimisation can be accomplished by an exhaustive search over alternative algorithms for p...
After the defeat of the human chess World Champion in 1997, many researchers turned their attention ...
This thesis deals with optimization of source code during its compilation. The paper introduces some...
An important problem of symbolic-numeric interface is the optimization of computations generated by ...
Recently, a new and promising Inductive Program Synthesis (IPS) system, Brute, showed the potential ...
After the defeat of the human chess World Champion in 1997, many researchers turned their attention ...
The research presented focuses on optimization of polynomials using algebraic manipulations at the h...
Abstract. In this article we look at the generation of libraries for dense linear algebra operations...
International audienceThe polyhedral model is a powerful framework for automatic optimization and pa...
This paper considers a programming language where all control is encoded in algebras and combinators...
Abstract: In many applications of computer algebra large expressions must be simplified to make repe...
For univariate polynomials f(x1), Horner scheme provides the fastest way to compute the value. For m...
AbstractThe role of computer algebra systems (CASs) is not limited to analyzing and solving mathemat...
Algebraic properties such as associativity or distributivity allow the manipulation of a set of math...
Advances in high energy physics have created the need to increase computational capac-ity. Project H...
Algorithm optimisation can be accomplished by an exhaustive search over alternative algorithms for p...
After the defeat of the human chess World Champion in 1997, many researchers turned their attention ...
This thesis deals with optimization of source code during its compilation. The paper introduces some...
An important problem of symbolic-numeric interface is the optimization of computations generated by ...
Recently, a new and promising Inductive Program Synthesis (IPS) system, Brute, showed the potential ...
After the defeat of the human chess World Champion in 1997, many researchers turned their attention ...
The research presented focuses on optimization of polynomials using algebraic manipulations at the h...
Abstract. In this article we look at the generation of libraries for dense linear algebra operations...
International audienceThe polyhedral model is a powerful framework for automatic optimization and pa...
This paper considers a programming language where all control is encoded in algebras and combinators...