相关论文: Dense output for highly oscillatory numerical solu…
This paper is concerned with the asymptotic expansions of the amplitude of the solution of the Helmholtz equation. The original expansions were obtained using a pseudo-differential decomposition of the Dirichlet to Neumann operator. This…
A recipe is presented for constructing band-limited superoscillating functions that exhibit arbitrarily high frequencies over arbitrarily long intervals.
Runge-Kutta methods have an irreplaceable position among numerical methods designed to solve ordinary differential equations. Especially, implicit ones are suitable for approximating solutions of stiff initial value problems. We propose a…
A new method for the numerical solution of ODEs is presented. This approach is based on an approximate formulation of the Taylor methods that has a much easier implementation than the original Taylor methods, since only the functions in the…
We extend the ultraspherical spectral method to solving nonlinear ODE boundary value problems. We propose to use the inexact Newton-GMRES framework for which an effective preconditioner can be constructed and a fast Jacobian-vector…
In [11] and [5], an error estimate of optimal convergence rates and optimal error propagation (optimal^2) was given for the Runge-Kutta discontinuous Galerkin (RKDG) method solving the scalar nonlinear conservation laws in the case of…
While quantum algorithms for solving large scale systems of linear equations offer potentially exponential speedups, their application has largely been confined to sparse matrices. This work extends the scope of these algorithms to a broad…
Sampling with Markov chain Monte Carlo methods often amounts to discretizing some continuous-time dynamics with numerical integration. In this paper, we establish the convergence rate of sampling algorithms obtained by discretizing smooth…
Spectral data is routinely broadened in order to improve appearance, approximate a higher sampling level or model experimental measurement effects. While there has been extensive work in the signal processing field to develop efficient…
This paper introduces the Runge-Kutta Chebyshev descent method (RKCD) for strongly convex optimisation problems. This new algorithm is based on explicit stabilised integrators for stiff differential equations, a powerful class of numerical…
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…
We discuss the numerical solution of initial value problems for $\varepsilon^2\,\varphi''+a(x)\,\varphi=0$ in the highly oscillatory regime, i.e., with $a(x)>0$ and $0<\varepsilon\ll 1$. We analyze and implement an approximate solution…
This paper investigates the energy conservation properties of explicit Runge--Kutta (RK) time discretizations for autonomous skew-symmetric systems. For linear problems, we present a general framework for constructing RK methods in which…
In [1] is proposed a simplified DeC method, that, when combined with the residual distribution (RD) framework, allows to construct a high order, explicit FE scheme with continuous approximation avoiding the inversion of the mass matrix for…
Algebraic Riccati equations with indefinite quadratic terms play an important role in applications related to robust controller design. While there are many established approaches to solve these in case of small-scale dense coefficients,…
The parametric instability arising when ordinary differential equations (ODEs) are numerically integrated with Runge-Kutta-Nystr\"om (RKN) methods with varying step sizes is investigated. It is shown that when linear constant coefficient…
ksmt is a CDCL-style calculus for solving non-linear constraints over real numbers involving polynomials and transcendental functions. In this paper we investigate properties of the ksmt calculus and show that it is a $\delta$-complete…
In this paper we consider an approach to improve the performance of exponential Runge--Kutta integrators and Lawson schemes} in cases where the solution of a related, but usually much simpler, problem can be computed efficiently. While for…
A wide range of numerical methods exists for computing polynomial approximations of solutions of ordinary differential equations based on Chebyshev series expansions or Chebyshev interpolation polynomials. We consider the application of…
Numerical simulation codes are very common tools to study complex phenomena, but they are often time-consuming and considered as black boxes. For some statistical studies (e.g. asset management, sensitivity analysis) or optimization…