English
Related papers

Related papers: Wall rational functions and Khrushchev's formula f…

200 papers

In the present paper we prove a Stieltjes type theorem on the convergence of a sequence of rational functions associated with a mixed type Hermite-Pad\'e approximation problem of a Nikishin system of functions and analyze the ratio…

Classical Analysis and ODEs · Mathematics 2022-08-31 L. G. González Ricardo , G. López Lagomasino , S. Medina Peralta

We study the connection between block Krylov subspaces and matrix orthogonal functions. Under a no-deflation assumption, we show that polynomial block Krylov subspaces are isometrically isomorphic to spaces of matrix polynomials of bounded…

Numerical Analysis · Mathematics 2026-05-19 Michele Rinelli , Raf Vandebril

Unlike polynomials, rational functions can represent functions having poles or branch cuts with root-exponential convergence and no Runge phenomenon. Recent developments of the AAA and greedy Thiele algorithms have sparked renewed interest…

Numerical Analysis · Mathematics 2025-12-09 Tobin A. Driscoll

We study the approximation of holomorphic functions of several complex variables by the ring $\mathcal{P}^S(\mathbb{C}^n)$ of polynomials whose exponents are restricted to a convex cone $\mathbb{R}_+S$ for some compact convex $S\in…

Complex Variables · Mathematics 2025-08-05 Álfheiður Edda Sigurðardóttir

In this paper, we give several characterizations of Herglotz-Nevanlinna functions in terms of a specific type of positive semi-definite functions called Poisson-type functions. This allows us to propose a multidimensional analogue of the…

Complex Variables · Mathematics 2022-01-05 Mitja Nedic

We study AAK-type meromorphic approximants to functions $F$, where $F$ is a sum of a rational function $R$ and a Cauchy transform of a complex measure $\lambda$ with compact regular support included in $(-1,1)$, whose argument has bounded…

Classical Analysis and ODEs · Mathematics 2015-05-13 Laurent Baratchart , Maxim Yattselev

We study the computational power of polynomial threshold functions, that is, threshold functions of real polynomials over the boolean cube. We provide two new results bounding the computational power of this model. Our first result shows…

Computational Complexity · Computer Science 2009-11-29 Ido Ben-Eliezer , Shachar Lovett , Ariel Yadin

In this paper, we propose a new and simple approach to the approximation algorithms that are modified and improved from our published results. The computational and graphical examples are presented with the aid of Maple procedures.

Numerical Analysis · Mathematics 2025-06-24 Quan Le Phuong

Let h be a complex meromorphic function decomposed in two different ways P(f) and Q(g), where f, g are meromorphic functions and P, Q are rational functions. We follow an approach due to C.-C. Yang, P. Li and K. H. Ha who handle similar…

Complex Variables · Mathematics 2007-05-23 Alain Escassut , Eberhard Mayerhofer

The best polynomial approximation and Chebyshev approximation are both important in numerical analysis. In tradition, the best approximation is regarded as more better than the Chebyshev approximation, because it is usually considered in…

Numerical Analysis · Mathematics 2021-11-17 Xiaolong Zhang

This article describes a sequence of rational functions which converges locally uniformly to the zeta function. The numerators (and denominators) of these rational functions can be expressed as characteristic polynomials of matrices that…

Number Theory · Mathematics 2019-06-28 Keith Ball

In this note, we use Rouch\'e's theorem and the pleasant properties of the arithmetic of the logarithmic derivative to establish several new results regarding the geometry of the zeros, poles, and critical points of a rational function.…

Complex Variables · Mathematics 2019-06-13 Trevor J. Richards

We extend the study of the Pick class, the set of complex analytic functions taking the upper half plane into itself, to the noncommutative setting. R. Nevanlinna showed that elements of the Pick class have certain integral representations…

Functional Analysis · Mathematics 2013-10-18 J. E. Pascoe , Ryan Tully-Doyle

We present effective algorithms for uniform approximation of multivariate functions satisfying some prescribed inner structure. We extend in several directions the analysis of recovery of ridge functions $f(x)=g(\langle a,x\rangle)$ as…

Functional Analysis · Mathematics 2014-06-09 Anton Kolleck , Jan Vybiral

Motivated by the abundance of functional data such as time series and images, there has been a growing interest in integrating such data into neural networks and learning maps from function spaces to R (i.e., functionals). In this paper, we…

Machine Learning · Statistics 2024-03-20 Tian-Yi Zhou , Namjoon Suh , Guang Cheng , Xiaoming Huo

We introduce a family of discrete analytic functions, called expandable discrete analytic functions, which includes discrete analytic polynomials, and define two products in this family. The first one is defined in a way similar to the…

Functional Analysis · Mathematics 2012-08-21 Daniel Alpay , Palle Jorgensen , Ron Seager , Dan Volok

We address the problem of the best uniform approximation by linear combinations of a finite system of functions. If the system is Chebyshev and the problem is unconstrained, then the classical Remez algorithm provides a fast and precise…

Numerical Analysis · Mathematics 2025-07-08 Vladimir Yu. Protasov , Rinat Kamalov

A crucial ingredient in the recent discovery by Ablowitz, Halburd, Herbst and Korhonen \cite{AHH}, \cite {HK-2} that a connection exists between discrete Painlev\'e equations and (finite order) Nevanlinna theory is an estimate of the…

Complex Variables · Mathematics 2009-07-18 Yik-Man Chiang , Shaoji Feng

Sharp quadrature formulas for integrals of complex rational functions on circles, real axis and its segments are obtained. We also find sharp quadrature formulas for calculation of $L_2$-norms of rational functions on such sets. Basing on…

Classical Analysis and ODEs · Mathematics 2015-03-24 V. I. Danchenko , L. A. Semin

We show how rational function approximations to the logarithm, such as $\log z \approx (z^2 - 1)/(z^2 + 6z + 1)$, can be turned into fast algorithms for approximating the determinant of a very large matrix. We empirically demonstrate that…

Data Structures and Algorithms · Computer Science 2024-05-07 Thomas Colthurst , Srinivas Vasudevan , James Lottes , Brian Patton
‹ Prev 1 4 5 6 7 8 10 Next ›