Interpolation of Dense and Sparse Rational Functions and other Improvements in

04/03/2020
by   Jonas Klappert, et al.
0

We present the main improvements and new features in version of the open-source library for the interpolation of rational functions. This includes algorithmic improvements, e.g. a hybrid algorithm for dense and sparse rational functions and an algorithm to identify and remove univariate factors. The new version is applied to a Feynman-integral reduction to showcase the runtime improvements achieved. Moreover, now supports parallelization with and offers new tools like a parser for expressions or an executable for the insertion of replacement tables.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/22/2019

Bicubic partially blended rational quartic surface

This paper investigates some univariate and bivariate constrained interp...
research
06/03/2017

Sparse Rational Function Interpolation with Finitely Many Values for the Coefficients

In this paper, we give new sparse interpolation algorithms for black box...
research
03/29/2019

Reconstructing Rational Functions with FireFly

We present the open-source C++ library FireFly for the reconstruction of...
research
06/21/2021

Certifying a probabilistic parallel modular algorithm for rational univariate representation

This paper is about solving polynomial systems. It first recalls how to ...
research
03/15/2021

Tangent-Chebyshev rational maps and Redei functions

Recently Lima and Campello de Souza introduced a new class of rational f...
research
07/07/2020

A Task-based Multi-shift QR/QZ Algorithm with Aggressive Early Deflation

The QR algorithm is one of the three phases in the process of computing ...
research
07/20/2017

FORM version 4.2

We introduce FORM 4.2, a new minor release of the symbolic manipulation ...

Please sign up or login with your details

Forgot password? Click here to reset