Related papers: $L^2$ and $L^\infty$ rational approximation
We describe a Lanczos-based algorithm for approximating the product of a rational matrix function with a vector. This algorithm, which we call the Lanczos method for optimal rational matrix function approximation (Lanczos-OR), returns the…
For a rational matrix function $\Phi$ with poles outside the unit circle, we estimate the degree of the unique superoptimal approximation $\A\Phi$ by matrix functions analytic in the unit disk. We obtain sharp estimates in the case of…
In this paper we consider $L_p$-approximation, $p \in \{2,\infty\}$, of periodic functions from weighted Korobov spaces. In particular, we discuss tractability properties of such problems, which means that we aim to relate the dependence of…
We prove that any given function can be smoothly approximated by functions lying in the kernel of a linear operator involving at least one fractional component. The setting in which we work is very general, since it takes into account…
We propose a simple and effective method for designing approximation formulas for weighted analytic functions. We consider spaces of such functions according to weight functions expressing the decay properties of the functions. Then, we…
Computing the probability of a formula given the probabilities or weights associated with other formulas is a natural extension of logical inference to the probabilistic setting. Surprisingly, this problem has received little attention in…
The exponential function maps the imaginary axis to the unit circle and, for many applications, this unitarity property is also desirable from its approximations. We show that this property is conserved not only by the (k,k)-rational…
We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.
In this note we formulate some questions in the study of approximations of reals by rationals of the form a/b^2 arising in theory of Shr"odinger equations. We hope to attract attention of specialists to this natural subject of number…
We present two approaches for computing rational approximations to multivariate functions, motivated by their effectiveness as surrogate models for high-energy physics (HEP) applications. Our first approach builds on the Stieltjes process…
In this paper, we study tractability of $L_2$-approximation of one-periodic functions from weighted Korobov spaces in the worst-case setting. The considered weights are of product form. For the algorithms we allow information from the class…
The iterative rational Krylov algorithm (\textsf{IRKA}) is a popular approach for producing locally optimal reduced-order $\mathcal{H}_2$-approximations to linear time-invariant (LTI) dynamical systems. Overall, \textsf{IRKA} has seen…
Through reducing the problem to rational orthogonal system (Takenaka-Malmquist system), this note gives a proof for existence of n-best rational approximation to functions in the Hardy H2(D) space by using pseudohyperbolic distance.
Function values are, in some sense, "almost as good" as general linear information for $L_2$-approximation (optimal recovery, data assimilation) of functions from a reproducing kernel Hilbert space. This was recently proved by new upper…
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…
We study theoretical and computational aspects of the least squares fit (LSF) of circles and circular arcs. First we discuss the existence and uniqueness of LSF and various parametrization schemes. Then we evaluate several popular circle…
We consider $L^2$-approximation on weighted reproducing kernel Hilbert spaces of functions depending on infinitely many variables. We focus on unrestricted linear information, admitting evaluations of arbitrary continuous linear…
Floor planning is an important and difficult task in architecture. When planning office buildings, rooms that belong to the same organisational unit should be placed close to each other. This leads to the following NP-hard mathematical…
The problem of assessing the performance of algorithms used for the minimization of an $\ell_1$-penalized least-squares functional, for a range of penalty parameters, is investigated. A criterion that uses the idea of `approximation…
Several estimates for singular integrals, maximal functions and the spherical summation operator are given in the spaces $L^p_{\text{rad}}L^2_{\text{ang}}(\mathbb{R}^n)$, $n\geq 2$.