This paper describes the implementation of recursive algorithms for approximation and summation processes using the Maple programming language for symbolic computation. The programs are collected in the Maple package trans which contains most of the currently known algorithms (transformations) for the construction of rational approximations. The advantages of employing mixed symbolic-numeric computation techniques are indicated and demonstrated by some numerical examples
MAPLE procedures for converting Taylor series expansions and asymptotic series expansions to rationa...
In this work we describe the use of truncated p-adic expansion of handling rational numbers by paral...
Abstract. One of the basic techniques in every mathematician's toolkit is the Taylor series rep...
The combination of symbolic and numeric computation techniques leads to new approaches for problem-s...
In symbolic computation on computers, also known as computer algebra, keyboard and display replace t...
We provide algorithms for symbolic integration of hyperlogarithms multiplied by rational functions, ...
A complete MAPLE procedure is designed to effectively implement an algorithm for approximating trigo...
AbstractIn this paper, by using parallel computing along with recursion, we describe a reliable symb...
This paper considers the problem of effective algorithms for some problems having structured coeffic...
The relevance of the material presented in this paper due to the need to develop and implement new i...
Abstract. Some methods being used to speed up floating-point computation in Maple are described. Spe...
AbstractThe problem of computing a closed form for sums of special functions arises in many parts of...
AbstractSome large scale physical computations require algorithms performing symbolic computations w...
This paper describes a systolic algorithm for rational interpolation based on Thiele's reciprocal di...
An important problem of symbolic-numeric interface is the optimization of computations generated by ...
MAPLE procedures for converting Taylor series expansions and asymptotic series expansions to rationa...
In this work we describe the use of truncated p-adic expansion of handling rational numbers by paral...
Abstract. One of the basic techniques in every mathematician's toolkit is the Taylor series rep...
The combination of symbolic and numeric computation techniques leads to new approaches for problem-s...
In symbolic computation on computers, also known as computer algebra, keyboard and display replace t...
We provide algorithms for symbolic integration of hyperlogarithms multiplied by rational functions, ...
A complete MAPLE procedure is designed to effectively implement an algorithm for approximating trigo...
AbstractIn this paper, by using parallel computing along with recursion, we describe a reliable symb...
This paper considers the problem of effective algorithms for some problems having structured coeffic...
The relevance of the material presented in this paper due to the need to develop and implement new i...
Abstract. Some methods being used to speed up floating-point computation in Maple are described. Spe...
AbstractThe problem of computing a closed form for sums of special functions arises in many parts of...
AbstractSome large scale physical computations require algorithms performing symbolic computations w...
This paper describes a systolic algorithm for rational interpolation based on Thiele's reciprocal di...
An important problem of symbolic-numeric interface is the optimization of computations generated by ...
MAPLE procedures for converting Taylor series expansions and asymptotic series expansions to rationa...
In this work we describe the use of truncated p-adic expansion of handling rational numbers by paral...
Abstract. One of the basic techniques in every mathematician's toolkit is the Taylor series rep...
Add to ORKG