Related papers: Some Generalizations of the Chebyshev Method for S…
We give new improvements to the Chudnovsky-Chudnovsky method that provides upper bounds on the bilinear complexity of multiplication in extensions of finite fields through interpolation on algebraic curves. Our approach features three…
By applying hybrid functions of general block-pulse functions and the second Chebyshev polynomials,integrodifferential systems are converted into a system of algebraic equations. The approximate solutions of integrodifferential systems are…
In this paper, an efficient method is presented for solving three dimensional Volterra integral equations of the second kind with continuous kernel. Shifted Chebyshev polynomial is applied to approximate a solution for these integral…
Translation of the Latin original, "Methodus generalis investigandi radices omnium aequationum per approximationem" (1776). E643 in the Enestrom index. Euler gives a series to find powers of roots of polynomials.
The goal of this work is threefold. First, we give an expression of the most general five point integral on M_{0,n} in terms of Chebyshev polynomials. Second, we choose a special kinematics that transforms the polynomial form of the…
The generalized symmetry method is applied to a class of completely discrete equations including the Adler-Bobenko-Suris list. Assuming the existence of a generalized symmetry, we derive a few integrability conditions suitable for testing…
There is presented an approach to find an approximation polynomial of a function with two variables based on the two dimensional discrete Fourier transform. The approximation polynomial is expressed through Chebyshev polynomials. There is…
Sparse interpolation} refers to the exact recovery of a function as a short linear combination of basis functions from a limited number of evaluations. For multivariate functions, the case of the monomial basis is well studied, as is now…
We investigate the problem of numerical differentiation of bivariate functions from weighted Wiener classes using Chebyshev polynomial expansions. We develop and analyze a new version of the truncation method based on Chebyshev polynomials…
In our quest for the design, the analysis and the implementation of a subdivision algorithm for finding the complex roots of univariate polynomials given by oracles for their evaluation, we present sub-algorithms allowing substantial…
We determine the cardinality of the value sets of bivariate Chebyshev maps over finite fields. We achieve this using the dynamical properties of these maps and the algebraic expressions of their fixed points in terms of roots of unity.
The aim of the present work is to introduce a method based on Chebyshev polynomials for the numerical solution of a system of Cauchy type singular integral equations of the first kind on a finite segment. Moreover, an estimation error is…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
An inverse polynomial has a Chebyshev series expansion 1/\sum(j=0..k)b_j*T_j(x)=\sum'(n=0..oo) a_n*T_n(x) if the polynomial has no roots in [-1,1]. If the inverse polynomial is decomposed into partial fractions, the a_n are linear…
Bayesian probabilistic numerical methods are a set of tools providing posterior distributions on the output of numerical methods. The use of these methods is usually motivated by the fact that they can represent our uncertainty due to…
We study a family of high order Ehrlich-type methods for approximating all zeros of a polynomial simultaneously. Let us denote by $T^{(1)}$ the famous Ehrlich method (1967). Starting from $T^{(1)}$, Kjurkchiev and Andreev (1987) have…
We describe a deterministic algorithm that computes an approximate root of n complex polynomial equations in n unknowns in average polynomial time with respect to the size of the input, in the Blum-Shub-Smale model with square root. It…
Finite discrete-time dynamical systems (FDDS) model phenomena that evolve deterministically in discrete time. It is possible to define sum and product operations on these systems (disjoint union and direct product, respectively) giving a…
Exponential divided differences arise in numerical linear algebra, matrix-function evaluation, and quantum Monte Carlo simulations, where they serve as kernel weights for time evolution and observable estimation. Efficient and numerically…
The authors present a unified method for calculating the zeros of the classical orthogonal polynomials based upon the electrostatic interpretation and its connection to the energy minimization problem. Examples are given with error…