Related papers: Extremal and approximation properties of simple pa…
In this paper, a high-order and fast numerical method is investigated for the time-fractional Black-Scholes equation. In order to deal with the typical weak initial singularities of the solution, we construct a finite difference scheme with…
Nowadays, fractional differential equations are a well established tool to model phenomena from the real world. Since the analytical solution is rarely available, there is a great effort in constructing efficient numerical methods for their…
We consider approximation problems for a special space of d variate functions. We show that the problems have small number of active variables, as it has been postulated in the past using concentration of measure arguments. We also show…
We propose and study a class of numerical schemes to approximate time fractional differential equations. The methods are based on the approximation of the Caputo fractional derivative by continuous piecewise polynomials, which is strongly…
The current research of fractional Sturm-Liouville boundary value problems focuses on the qualitative theory and numerical methods, and much progress has been recently achieved in both directions. The objective of this paper is to explore a…
Using the generalized Kolmogorov-Feller equation with long-range interaction, we obtain kinetic equations with fractional derivatives with respect to coordinates. The method of successive approximations with the averaging with respect to…
We consider some known and some new properties of the family of polynomials introduced by Ted Suffridge in 1969. We begin by giving a brief overview of their extremal properties in classic and more recent work. We also give a compact form…
Bayesian inference for models that have an intractable partition function is known as a doubly intractable problem, where standard Monte Carlo methods are not applicable. The past decade has seen the development of auxiliary variable Monte…
This article proposes and analyzes explicit and easily implementable temporal numerical approximation schemes for additive noise-driven stochastic partial differential equations (SPDEs) with polynomial nonlinearities such as, e.g.,…
We investigate the problem of pricing derivatives under a fractional stochastic volatility model. We obtain an approximate expression of the derivative price where the stochastic volatility can be composed of deterministic functions of time…
We consider the problem of approximating the reachable set of a discrete-time polynomial system from a semialgebraic set of initial conditions under general semialgebraic set constraints. Assuming inclusion in a given simple set like a box…
This work aims to introduce the framework of polynomial optimization theory to solve fractional polynomial problems (FPPs). Unlike other widely used optimization frameworks, the proposed one applies to a larger class of FPPs, not…
We consider the spectral definition of the fractional Laplace operator and study a basic linear problem involving this operator and singular forcing. In two dimensions, we introduce an appropriate weak formulation in fractional Sobolev…
We first propose two conjectural estimates on Diophantine approximation of logarithms of algebraic numbers. Next we discuss the state of the art and we give further partial results on this topic.
Numerical relativity has traditionally been pursued via finite differencing. Here we explore pseudospectral collocation (PSC) as an alternative to finite differencing, focusing particularly on the solution of the Hamiltonian constraint (an…
Random Fourier features (RFF) represent one of the most popular and wide-spread techniques in machine learning to scale up kernel algorithms. Despite the numerous successful applications of RFFs, unfortunately, quite little is understood…
Partially observable Markov decision processes (POMDPs) provide an elegant mathematical framework for modeling complex decision and planning problems in stochastic domains in which states of the system are observable only indirectly, via a…
In this paper, we provide a new scheme for approximating the weakly efficient solution set for a class of vector optimization problems with rational objectives over a feasible set defined by finitely many polynomial inequalities. More…
A weakly infeasible semidefinite program (SDP) has no feasible solution, but it has approximate solutions whose constraint violation is arbitrarily small. These SDPs are ill-posed and numerically often unsolvable. They are also closely…
The numerical integration of stiff equations is a challenging problem that needs to be approached by specialized numerical methods. Exponential integrators form a popular class of such methods since they are provably robust to stiffness and…