English
Related papers

Related papers: Numerical Differentiation of Functions of Two Vari…

200 papers

The extension of the classical Bayesian penalized spline method to inference on vector-valued functions is considered, with an emphasis on characterizing the suitability of the method for general application.We show that the standard…

Machine Learning · Statistics 2010-03-26 David M. Rogers , Thomas L. Beck

Polynomial approximations to boolean functions have led to many positive results in computer science. In particular, polynomial approximations to the sign function underly algorithms for agnostically learning halfspaces, as well as…

Computational Complexity · Computer Science 2014-12-09 Mark Bun , Thomas Steinke

In this paper, we propose an adaptive high-order method for hyperbolic systems of conservation laws. The proposed method is based on a dual formulation approach: Two numerical solutions, corresponding to conservative and nonconservative…

Numerical Analysis · Mathematics 2026-01-29 Alina Chertock , Qingcheng Fu , Alexander Kurganov , Lorenzo Micalizzi

The multivariate integer Chebyshev problem is to find polynomials with integer coefficients that minimize the supremum norm over a compact set in $\C^d.$ We study this problem on general sets, but devote special attention to product sets…

Number Theory · Mathematics 2013-07-23 P. B. Borwein , I. E. Pritsker

Fitting a matrix of a given rank to data in a least squares sense can be done very effectively using 2nd order methods such as Levenberg-Marquardt by explicitly optimizing over a bilinear parameterization of the matrix. In contrast, when…

Computer Vision and Pattern Recognition · Computer Science 2020-07-10 José Pedro Iglesias , Carl Olsson , Marcus Valtonen Örnhag

We establish fractional Leibniz rules in weighted settings for nonnegative self-adjoint operators on spaces of homogeneous type. Using a unified method that avoids Fourier transforms, we prove bilinear estimates for spectral multiplier on…

Classical Analysis and ODEs · Mathematics 2025-11-26 The Anh Bui

In this paper we use Bernstein and Chebyshev polynomials to approximate the price of some basket options under a bivariate Black-Scholes model. The method consists in expanding the price of a univariate related contract after conditioning…

Pricing of Securities · Quantitative Finance 2014-04-14 Pablo Olivares

We analyze the convergence of compressive sensing based sampling techniques for the efficient evaluation of functionals of solutions for a class of high-dimensional, affine-parametric, linear operator equations which depend on possibly…

Numerical Analysis · Mathematics 2015-09-22 Holger Rauhut , Christoph Schwab

This contribution proposes a new formulation to efficiently compute directional derivatives of order one to fourth. The formulation is based on automatic differentiation implemented with dual numbers. Directional derivatives are particular…

Numerical Analysis · Mathematics 2023-06-14 R. Peón-Escalante , K. B. Cantún-Avila , O. Carvente , A. Espinosa-Romero , F. Peñuñuri

In this article, a formulation of a point-collocation method in which the unknown function is approximated using global expansion in tensor product Bernstein polynomial basis is presented. Bernstein polynomials used in this study are…

Numerical Analysis · Mathematics 2012-11-16 Nikola Mirkov , Bosko Rasuo

This paper addresses the study of a new class of nonsmooth optimization problems, where the objective is represented as a difference of two generally nonconvex functions. We propose and develop a novel Newton-type algorithm to solving such…

Optimization and Control · Mathematics 2023-01-10 Francisco J. Aragón-Artacho , Boris S. Mordukhovich , Pedro Pérez-Aros

The paper investigates the problem of performing correlation analysis when the number of observations is very large. In such a case, it is often necessary to combine the random observations to achieve dimensionality reduction of the…

Information Theory · Computer Science 2020-10-19 Pavel Loskot

We employ the generalized Remez algorithm, initially suggested by P. T. P. Tang, to perform an experimental study of Chebyshev polynomials in the complex plane. Our focus lies particularly on the examination of their norms and zeros. What…

Complex Variables · Mathematics 2025-07-11 Lennart Aljoscha Hübner , Olof Rubin

Chebyshev polynomials of the first and second kind for a set K are monic polynomials with minimal L $\infty$-and L 1-norm on K, respectively. This articles presents numerical procedures based on semidefinite programming to compute these…

Optimization and Control · Mathematics 2019-03-12 Simon Foucart , Jean-Bernard Lasserre

We obtain the decay bounds for Chebyshev series coefficients of functions with finite Vitali variation on the unit square. A generalization of the well known identity, which relates exact and approximated coefficients, obtained using the…

Numerical Analysis · Mathematics 2022-05-12 Akansha

We establish connections between the problem of learning a two-layer neural network and tensor decomposition. We consider a model with feature vectors $\boldsymbol x \in \mathbb R^d$, $r$ hidden units with weights $\{\boldsymbol w_i\}_{1\le…

Machine Learning · Computer Science 2018-10-11 Marco Mondelli , Andrea Montanari

The density of polynomials in a weighted space of infinitely differentiable functions in a multidimensional real space is proved under minimal conditions on weight functions and on differences between weight functions. We apply this result…

Classical Analysis and ODEs · Mathematics 2007-05-23 P. V. Fedotova , I. Kh. Musin

The relationship between the operator norms of fractional integral operators acting on weighted Lebesgue spaces and the constant of the weights is investigated. Sharp boundsare obtained for both the fractional integral operators and the…

Classical Analysis and ODEs · Mathematics 2012-05-08 Michael Lacey , Kabe Moen , Carlos Perez , Rodolfo H. Torres

By means of a linear scaling of the variables we convert a singular bifurcation equation in $\R^n$ into an equivalent equation to which the classical implicit function theorem can be directly applied. This allows to deduce the existence of…

Classical Analysis and ODEs · Mathematics 2009-09-24 Mikhail Kamenskii , Oleg Makarenkov , Paolo Nistri

The solution of a (stochastic) differential equation can be locally approximated by a (stochastic) expansion. If the vector field of the differential equation is a polynomial, the corresponding expansion is a linear combination of iterated…

Probability · Mathematics 2010-09-29 Christophe Ladroue , Anastasia Papavasiliou
‹ Prev 1 8 9 10 Next ›