Related papers: Fitzpatrick Algorithm for Multivariate Rational In…
We describe a strategy for solving nonlinear eigenproblems numerically. Our approach is based on the approximation of a vector-valued function, defined as solution of a non-homogeneous version of the eigenproblem. This approximation step is…
In this article, we investigate partial integrals and partial derivatives of bivariate fractal interpolation functions. We prove also that the mixed Riemann-Liouville fractional integral and derivative of order $\gamma = (p, q); p > 0,q >…
An algorithm for generating interpolants for formulas which are conjunctions of quadratic polynomial inequalities (both strict and nonstrict) is proposed. The algorithm is based on a key observation that quadratic polynomial inequalities…
We consider quadrature formulas based on interpolation using the basis functions $1/(1+t_kx)$ $(k=1,2,3,\ldots)$ on $[-1,1]$, where $t_k$ are parameters on the interval $(-1,1)$. We investigate two types of quadratures: quadrature formulas…
Interpolation is an important property of classical and many non classical logics that has been shown to have interesting applications in computer science and AI. Here we study the Interpolation Property for the propositional version of the…
Recently, in [Electronic Transaction on Numerical Analysis, 41 (2014), pp. 420-442] authors introduced a new class of rational cubic fractal interpolation functions with linear denominators via fractal perturbation of traditional…
We prove a finiteness principle for interpolation of data by nonnegative Cm functions. Our result raises the hope that one can start to understand constrained interpolation problems in which e.g. the interpolating function F is required to…
This paper presents a regularization technique for the high order efficient numerical evaluation of nearly singular, principal-value, and finite-part Cauchy-type integral operators. By relying on the Cauchy formula, the Cauchy-Goursat…
Unitary best approximation to the exponential function on an interval on the imaginary axis has been introduced recently. In the present work two algorithms are considered to compute this best approximant: an algorithm based on rational…
We propose a non grid-based interpolation scheme based on the information from the data collected from the vicinity of the query point. As a non-grid-based interpolation, the data points can be distributed randomly in a small region, and…
We study in this paper the function approximation error of multivariate linear extrapolation. The sharp error bound of linear interpolation already exists in the literature. However, linear extrapolation is used far more often in…
In this article we study the estimation of bifurcation coefficients in nonlinear branching problems by means of Rayleigh-Ritz approximation to the eigenvectors of the corresponding linearized problem. It is essential that the approximations…
We consider the following interpolation problem. Suppose one is given a finite set $E \subset \mathbb{R}^d$, a function $f: E \rightarrow \mathbb{R}$, and possibly the gradients of $f$ at the points of $E$. We want to interpolate the given…
Histopolation, or interpolation on segments, is a mathematical technique used to approximate a function $f$ over a given interval $I=[a,b]$ by exploiting integral information over a set of subintervals of $I$. Unlike classical polynomial…
Given a straight-line program whose output is a polynomial function of the inputs, we present a new algorithm to compute a concise representation of that unknown function. Our algorithm can handle any case where the unknown function is a…
An algorithm for computing an analytic function of a matrix $A$ is described. The algorithm is intended for the case where $A$ has some close eigenvalues, and clusters (subsets) of close eigenvalues are separated from each other. This…
On one hand, consider the problem of finding global solutions to a polynomial optimization problem and, on the other hand, consider the problem of interpolating a set of points with a complex exponential function. This paper proposes a…
The Zippel algorithm performs a rational reconstruction of multivariate polynomials and aims specifically at the sparse case. It is applied in different fields of science, lately becoming an important step in Feynman integral reduction in…
We design convergent multipoint Pade interpolation schemes to Cauchy transforms of non-vanishing complex densities with respect to Jacobi-type weights on analytic arcs, under mild smoothness assumptions on the density. We rely on our…
We provide a general framework to construct fractal interpolation surfaces (FISs) for a prescribed countably infinite data set on a rectangular grid. Using this as a crucial tool, we obtain a parameterized family of bivariate fractal…