Add to ORKGA recurrence scheme is defined for the numerical determination of high degree polynomial approximations to functions as, for instance, inverse powers near zero. As an example, polynomials needed in the two-step multi-boson (TSMB) algorithm for fermion simulations are considered. For the polynomials needed in TSMB a code in C is provided which is easily applicable to polynomial degrees of several thousands. (orig.)SIGLEAvailable from TIB Hannover: RA 2999(03-020) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman
textabstractAn efficient algorithm and a Fortran 90 module (LaguerrePol) for computing Laguerre poly...
Multiple orthogonal polynomials satisfy a number of recurrence relations, in particular there is a (...
We give a solution of a discrete least squares approximation problem in terms of orthogonal polynomi...
A recurrence scheme is defined for the numerical determination of high degree polynomial approximati...
Least-squares optimized polynomials are discussed which are needed in the two-step multi-bosonic alg...
Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of informat...
Charlier polynomials (CHPs) and their moments are commonly used in image processing due to their sal...
Discrete Tchebichef polynomials (DTPs) and their moments are effectively utilized in different field...
Discrete Tchebichef polynomials (DTPs) and their moments are effectively utilized in different field...
This habilitation thesis deals with polynomial system solving through Gröbner bases computations. I...
An algorithm for the computation of the coefficients and roots of quadratically optimized polynomial...
This thesis provides a program to compute minimal values of polynomials of degree two to get a trans...
The Remez algorithm, 75 years old, is a famous method for computing minimax polynomial approximation...
International audienceSparse polynomial interpolation, sparse linear system solving or modular ratio...
AbstractThe n coefficients of a fixed linear recurrence can be expressed through its m≤2n terms or, ...
textabstractAn efficient algorithm and a Fortran 90 module (LaguerrePol) for computing Laguerre poly...
Multiple orthogonal polynomials satisfy a number of recurrence relations, in particular there is a (...
We give a solution of a discrete least squares approximation problem in terms of orthogonal polynomi...
A recurrence scheme is defined for the numerical determination of high degree polynomial approximati...
Least-squares optimized polynomials are discussed which are needed in the two-step multi-bosonic alg...
Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of informat...
Charlier polynomials (CHPs) and their moments are commonly used in image processing due to their sal...
Discrete Tchebichef polynomials (DTPs) and their moments are effectively utilized in different field...
Discrete Tchebichef polynomials (DTPs) and their moments are effectively utilized in different field...
This habilitation thesis deals with polynomial system solving through Gröbner bases computations. I...
An algorithm for the computation of the coefficients and roots of quadratically optimized polynomial...
This thesis provides a program to compute minimal values of polynomials of degree two to get a trans...
The Remez algorithm, 75 years old, is a famous method for computing minimax polynomial approximation...
International audienceSparse polynomial interpolation, sparse linear system solving or modular ratio...
AbstractThe n coefficients of a fixed linear recurrence can be expressed through its m≤2n terms or, ...
textabstractAn efficient algorithm and a Fortran 90 module (LaguerrePol) for computing Laguerre poly...
Multiple orthogonal polynomials satisfy a number of recurrence relations, in particular there is a (...
We give a solution of a discrete least squares approximation problem in terms of orthogonal polynomi...