Related papers: A new rational approximation algorithm via the emp…
Invariant inference algorithms such as interpolation-based inference and IC3/PDR show that it is feasible, in practice, to find inductive invariants for many interesting systems, but non-trivial upper bounds on the computational complexity…
The interpretation of cosmological observables requires the use of increasingly sophisticated theoretical models. Since these models are becoming computationally very expensive and display non-trivial uncertainties, the use of standard…
In this paper we develop proximal methods for statistical learning. Proximal point algorithms are useful in statistics and machine learning for obtaining optimization solutions for composite functions. Our approach exploits closed-form…
We consider the problem of interpolating an unknown multivariate polynomial with coefficients taken from a finite field or as numerical approximations of complex numbers. Building on the recent work of Garg and Schost, we improve on the…
We consider optimal interpolation of functions analytic in simply connected domains in the complex plane. By choosing a specific structure for the approximant, we show that the resulting first order optimality conditions can be interpreted…
Through introducing a new iterative formula for divided differnce using Neville's and Aitken's algorithms,we study new iterative methods for interpolation,numerical differentiation and numerical integration formulas with arbitrary order of…
This investigation seeks to establish the practicality of numerical frame approximations. Specifically, it develops a new method to approximate the inverse frame operator and analyzes its convergence properties. It is established that…
In this paper, we study the following robust optimization problem. Given an independence system and candidate objective functions, we choose an independent set, and then an adversary chooses one objective function, knowing our choice. Our…
In this work we present a new WENO b-spline based quasi-interpolation algorithm. The novelty of this construction resides in the application of the WENO weights to the b-spline functions, that are a partition of unity, instead to the…
The purpose of the paper is to provide a characterization of the error of the best polynomial approximation of composite functions in weighted spaces. Such a characterization is essential for the convergence analysis of numerical methods…
This paper deals with the kernel-based approximation of a multivariate periodic function by interpolation at the points of an integration lattice -- a setting that, as pointed out by Zeng, Leung, Hickernell (MCQMC2004, 2006) and Zeng,…
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…
In a common formulation of semi-infinite programs, the infinite constraint set is a requirement that a function parametrized by the decision variables is nonnegative over an interval. If this function is sufficiently closely approximable by…
We study the existing algorithms that solve the multidimensional martingale optimal transport. Then we provide a new algorithm based on entropic regularization and Newton's method. Then we provide theoretical convergence rate results and we…
We enhance the approximation capabilities of algebraic polynomials by composing them with homeomorphisms. This composition yields families of functions that remain dense in the space of continuous functions, while enabling more accurate…
We describe a novel approach to accelerating Monte Carlo Markov Chains. Our focus is cosmological parameter estimation, but the algorithm is applicable to any problem for which the likelihood surface is a smooth function of the free…
The last two decades have seen major developments in interpolatory methods for model reduction of large-scale linear dynamical systems. Advances of note include the ability to produce (locally) optimal reduced models at modest cost; refined…
In this paper, we propose a new choice of poles to define reliable rational Krylov methods. These methods are used for approximating function of positive definite matrices. In particular, the fractional power and the fractional resolvent…
In this paper a local approximation method on the sphere is presented. As interpolation scheme we consider a partition of unity method, such as the modified spherical Shepard's method, which uses zonal basis functions (ZBFs) plus spherical…
Given a nondecreasing function $f$ on $[-1,1]$, we investigate how well it can be approximated by nondecreasing algebraic polynomials that interpolate it at $\pm 1$. We establish pointwise estimates of the approximation error by such…