Related papers: Resolution of singularities by rational functions

Approximate methods to full N-body simulations provide a fast and accurate solution to the development of mock catalogues for the modeling of galaxy clustering observables. In this paper we extend ICE-COLA (Izard et al. 2016), based on an…

We address the problem of clustering a set of points in $\mathbb{R}^d$ with axis-parallel clusters. Previous exact approaches to this problem are mostly based on integer programming formulations and can only solve to optimality instances of…

Given a set $F$ of $n$ positive functions over a ground set $X$, we consider the problem of computing $x^*$ that minimizes the expression $\sum_{f\in F}f(x)$, over $x\in X$. A typical application is \emph{shape fitting}, where we wish to…

A numerical scheme is presented to solve the one source near field refractor problem to arbitrary precision and it is proved that the scheme terminates in a finite number of iterations. The convergence of the algorithm depends upon proving…

We investigate deep composite polynomial approximations of continuous but non-differentiable functions with algebraic cusp singularities. The functions in focus consist of finitely many cusp terms of the form $|x-a_j|^{\alpha_j}$ with…

We develop an efficient and convergent numerical method for solving the inverse problem of determining the potential of nonlinear hyperbolic equations from lateral Cauchy data. In our numerical method we construct a sequence of linear…

In this work, we study the problem of finding approximate, with minimum support set, solutions to matrix max-plus equations, which we call sparse approximate solutions. We show how one can obtain such solutions efficiently and in polynomial…

A convergence theorem for the continuous weak approximation of the solution of stochastic differential equations by general one step methods is proved, which is an extension of a theorem due to Milstein. As an application, uniform second…

This paper provides a numerical approach for solving the linear stochastic Volterra integral equation using Walsh function approximation and the corresponding operational matrix of integration. A convergence analysis and error analysis of…

We study a regularized version of the Landau equation, which was recently introduced in~\cite{CHWW20} to numerically approximate the Landau equation with good accuracy at reasonable computational cost. We develop the existence and…

This is a survey on best polynomial approximation on the unit sphere and the unit ball. The central problem is to describe the approximation behavior of a function by polynomials via smoothness of the function. A major effort is to identify…

We present two new classes of orthogonal functions, log orthogonal functions (LOFs) and generalized log orthogonal functions (GLOFs), which are constructed by applying a $\log$ mapping to Laguerre polynomials. We develop basic approximation…

Many clustering algorithms when the data are curves or functions have been recently proposed. However, the presence of contamination in the sample of curves can influence the performance of most of them. In this work we propose a robust,…

This note is a continuation of our papers [1,2], devoted to $L$-approximation of characteristic function of $(-h, h)$ by trigonometric polynomials. In the paper [1] the sharp values of the best approximation for the special values of $h$…

We consider approximating analytic functions on the interval $[-1,1]$ from their values at a set of $m+1$ equispaced nodes. A result of Platte, Trefethen \& Kuijlaars states that fast and stable approximation from equispaced samples is…

We suggest a new optimization technique for minimizing the sum $\sum_{i=1}^n f_i(x)$ of $n$ non-convex real functions that satisfy a property that we call piecewise log-Lipschitz. This is by forging links between techniques in computational…

We describe inexact proximal Newton-like methods for solving degenerate regularized optimization problems and for the broader problem of finding a zero of a generalized equation that is the sum of a continuous map and a maximal monotone…

In the space of all entire functions it is solved the problem of interpolation taking into account multiplicities by sums of the series of exponentials with the exponents from a given set. It is found a criterion of solubility of the…

Let $ D $ be a bounded Jordan domain and $ A $ be its complement on the Riemann sphere. We investigate the $ n $-th root asymptotic behavior in $ D $ of best rational approximants, in the uniform norm on $ A $, to functions holomorphic on $…

We give a new fast method for evaluating sprectral approximations of nonlinear polynomial functionals. We prove that the new algorithm is convergent if the functions considered are smooth enough, under a general assumption on the spectral…