Related papers: A sparse FFT approach for ODE with random coeffici…
We design and analyse a new numerical method to solve ODE system based on the structural method. We compute approximations of solutions together with its derivatives up to order $K$ by solving an entire block corresponding to $R$ time…
The present article deals with the similarity method to tackle the fractional Schrodinger equation where the derivative is defined in the Riesz sense. Moreover the procedure of reducing a fractional partial differential equation (FPDE) into…
We present fast, spatially dispersionless and unconditionally stable high-order solvers for Partial Differential Equations (PDEs) with variable coefficients in general smooth domains. Our solvers, which are based on (i) A certain "Fourier…
In this paper, we present numerical methods suitable for solving convex quadratic Fractional Differential Equation (FDE) constrained optimization problems, with box constraints on the state and/or control variables. We develop an…
In this work we consider the problem of approximating the statistics of a given Quantity of Interest (QoI) that depends on the solution of a linear elliptic PDE defined over a random domain parameterized by $N$ random variables. The random…
We study solution techniques for an evolution equation involving second order derivative in time and the spectral fractional powers, of order $s \in (0,1)$, of symmetric, coercive, linear, elliptic, second-order operators in bounded domains…
We develop an all-at-once modeling framework for learning systems of ordinary differential equations (ODE) from scarce, partial, and noisy observations of the states. The proposed methodology amounts to a combination of sparse recovery…
In this paper we approximate high-dimensional functions $f\colon\mathbb T^d\to\mathbb C$ by sparse trigonometric polynomials based on function evaluations. Recently it was shown that a dimension-incremental sparse Fourier transform (SFT)…
The Dirac-{\delta} distribution may be realized through sequences of convlutions, the latter being also regarded as approximation to the identity. The present study proposes the so called pre-orthogonal adaptive Fourier decomposition…
This paper is devoted to order-one explicit approximations of random periodic solutions to multiplicative noise driven stochastic differential equations (SDEs) with non-globally Lipschitz coefficients. The existence of the random periodic…
Physical models with uncertain inputs are commonly represented as parametric partial differential equations (PDEs). That is, PDEs with inputs that are expressed as functions of parameters with an associated probability distribution.…
In this paper, an Artificial Neural Network (ANN) technique is developed to find solution of celebrated Fractional order Differential Equations (FDE). Compared to integer order differential equation, FDE has the advantage that it can better…
When the eigenvalues of the coefficient matrix for a linear scalar ordinary differential equation are of large magnitude, its solutions exhibit complicated behaviour, such as high-frequency oscillations, rapid growth or rapid decay. The…
In this paper we construct high order numerical methods for solving third and fourth orders nonlinear functional differential equations (FDE). They are based on the discretization of iterative methods on continuous level with the use of the…
A new (algebraic) approximation scheme to find {\sl global} solutions of two point boundary value problems of ordinary differential equations (ODE's) is presented. The method is applicable for both linear and nonlinear (coupled) ODE's whose…
We consider parameter estimation of ordinary differential equation (ODE) models from noisy observations. For this problem, one conventional approach is to fit numerical solutions (e.g., Euler, Runge--Kutta) of ODEs to data. However, such a…
The Fast Fourier Transform (FFT) is the most efficiently known way to compute the Discrete Fourier Transform (DFT) of an arbitrary n-length signal, and has a computational complexity of O(n log n). If the DFT X of the signal x has only k…
In many practical applications, spatial data are often collected at areal levels (i.e., block data) and the inferences and predictions about the variable at points or blocks different from those at which it has been observed typically…
The (modern) arbitrary derivative (ADER) approach is a popular technique for the numerical solution of differential problems based on iteratively solving an implicit discretization of their weak formulation. In this work, focusing on an ODE…
We present a computationally efficient algorithm for stable numerical differentiation from noisy, uniformly-sampled data on a bounded interval. The method combines multi-interval Fourier extension approximations with an adaptive domain…