Related papers: A Constructive Method for Approximate Solution to …
This work addresses a central challenge in the numerical analysis of the cutoff spatially homogeneous Boltzmann equation: the development of rigorously justified, accurate numerical schemes. We present (i) a novel Fourier spectral method…
This paper combines two ingredients in order to get a rather surprising result on one of the most studied, elegant and powerful tools for solving convex feasibility problems, the method of alternating projections (MAP). Going back to names…
This letter aims at resolving the issues raised in the recent short communication [1] and answered by [2] by proposing a systematic approximation scheme based on non-mapped shape functions, which both allows to fully exploit the unique…
We construct rigorously suitable approximate solutions to the Stokes/Cahn-Hilliard system by using the method of matched asymptotics expansions. This is a main step in the proof of convergence given in the first part of this contribution,…
We consider convolution integral equations on a finite interval with a real-valued kernel of even parity, a problem equivalent to finding a Wiener-Hopf factorisation of a notoriously difficult class of $2\times 2$ matrices. The kernel…
A fundamental problem in numerical analysis and approximation theory is approximating smooth functions by polynomials. A much harder version under recent consideration is to enforce bounds constraints on the approximating polynomial. In…
This article gives an introduction for mathematicians interested in numerical computations in algebraic geometry and number theory to some recent progress in algorithmic number theory, emphasising the key role of approximate computations…
In this paper, we propose new proximal Newton-type methods for convex optimization problems in composite form. The applications include model predictive control (MPC) and embedded MPC. Our new methods are computationally attractive since…
We present a complete solution of the soft x-ray edge problem within a field-theoretic approach based on the Wiener-Hopf infinite-time technique. We derive for the first time within this approach critical asymptotics of all the relevant…
An efficient proximal-gradient-based method, called proximal extrapolated gradient method, is designed for solving monotone variational inequality in Hilbert space. The proposed method extends the acceptable range of parameters to obtain…
We develop embedding formulae for all possible diffraction problems with Dirichlet scatterers on square lattices using the Wiener--Hopf perspective. The embedding formula expresses solutions for arbitrary plane-wave incidence in terms of a…
This study presents a method for constructing a sequence of approximate solutions of increasing accuracy to general equilibrium models on nonlocal domains. The method is based on a technique originated from dynamical systems theory. The…
In an ordinary feature selection procedure, a set of important features is obtained by solving an optimization problem such as the Lasso regression problem, and we expect that the obtained features explain the data well. In this study,…
In this paper, we propose a method for the approximation of the solution of high-dimensional weakly coercive problems formulated in tensor spaces using low-rank approximation formats. The method can be seen as a perturbation of a minimal…
We discuss the $p$- and the $hp$-versions of the virtual element method for the approximation of eigenpairs of elliptic operators with a potential term on polygonal meshes. An application of this model is provided by the Schr\"odinger…
In Kuznetsov et al. (2011) a new Monte Carlo simulation technique was introduced for a large family of Levy processes that is based on the Wiener-Hopf decomposition. We pursue this idea further by combining their technique with the recently…
In this paper, we consider the problem of generating inspection paths for robots. These paths should allow an attached measurement device to perform high-quality measurements. We formally show that generating robot paths, while maximizing…
Error bounds have been studied for more than seventy years, beginning with the seminal result of Hoffman (1952) [{\it J. Res. Natl. Bur. Standards}, 49 (1952), 263--265], which establishes an upper bound for the distance from an arbitrary…
We consider the proximal-gradient method for minimizing an objective function that is the sum of a smooth function and a non-smooth convex function. A feature that distinguishes our work from most in the literature is that we assume that…
We describe an approximate rational arithmetic with round-off errors (both absolute and relative) controlled by the user. The rounding procedure is based on the continued fraction expansion of real numbers. Results of computer experiments…