Related papers: Rodas6P and Tsit5DA - two new Rosenbrock-type meth…
The discrete-dipole approximation (DDA) is a flexible technique for computing scattering and absorption by targets of arbitrary geometry. In this paper we perform systematic study of various non-stationary iterative (conjugate gradient)…
A spectral method for solving linear partial differential equations (PDEs) with variable coefficients and general boundary conditions defined on rectangular domains is described, based on separable representations of partial differential…
This paper presents differential algebra-based differential dynamic programming (DADDy), a publicly available C++ framework for constrained, fuel-optimal low-thrust trajectory optimisation. The method uses differential algebra (DA) for two…
Implicit Runge--Kutta (IRK) methods are highly effective for solving stiff ordinary differential equations (ODEs) but can be computationally expensive for large-scale problems due to the need of solving coupled algebraic equations at each…
This paper presents a novel method that allows to generalise the use of the Adam-Bashforth to Partial Differential Equations with local and non local operator. The Method derives a two step Adam-Bashforth numerical scheme in Laplace space…
We present and analyze fully discrete Nystr\"om methods for the solution of three classes of well conditioned boundary integral equations for the solution of two dimensional scattering problems by homogeneous dielectric scatterers.…
This work is concerned with linear matrix equations that arise from the space-time discretization of time-dependent linear partial differential equations (PDEs). Such matrix equations have been considered, for example, in the context of…
Fully implicit Runge-Kutta (IRK) methods have many desirable accuracy and stability properties as time integration schemes, but high-order IRK methods are not commonly used in practice with large-scale numerical PDEs because of the…
We implement an iterative numerical method to solve polynomial equations $f(x)=0$ in the $p$-adic numbers, where $f(x) \in\mathbb{Z}_p[x]$. This method is a simplified $p$-adic analogue of Jarratt's method for finding roots of functions…
Second-order Newton-type algorithms that leverage the exact Hessian or its approximation are central to solve nonlinear optimization problems. However, their applications in solving large-scale nonconvex problems are hindered by three…
The asymptotic iteration method (AIM) is an iterative technique used to find exact and approximate solutions to second-order linear differential equations. In this work, we employed AIM to solve systems of two first-order linear…
This paper is devoted to the explicit construction of optimal designs for discrimination between two polynomial regression models of degree $n-2$ and $n$. In a fundamental paper, Atkinson and Fedorov [Biometrika 62 (1975a) 57--70] proposed…
Several forms for constructing novel physics-informed neural-networks (PINN) for the solution of partial-differential-algebraic equations based on derivative operator splitting are proposed, using the nonlinear Kirchhoff rod as a prototype…
In this paper a new Runge-Kutta type scheme is introduced for nonlinear stochastic partial differential equations (SPDEs) with multiplicative trace class noise. The proposed scheme converges with respect to the computational effort with a…
We propose a higher-order dimensionality reduction framework based on the Trace Ratio (TR) optimization problem. We establish conditions for existence and uniqueness of solutions and clarify the theoretical connection between the Trace…
We present a new solver for coupled nonlinear elliptic partial differential equations (PDEs). The solver is based on pseudo-spectral collocation with domain decomposition and can handle one- to three-dimensional problems. It has three…
In this manuscript, we introduce the tensor-train reduced basis method, a novel projection-based reduced-order model designed for the efficient solution of parameterized partial differential equations. While reduced-order models are widely…
In this work, we construct novel discretizations for the unsteady convection-diffusion equation. Our discretization relies on multiderivative time integrators together with a novel discretization that reduces the total number of unknowns…
In this master thesis we have compared different second order stabilized explicit Runge-Kutta methods when applied to the incompressible Navier-Stokes equations by means of a projection method and a differential algebraic approach. We…
The quest for analytical solutions to differential equations has traditionally been constrained by the need for extensive mathematical expertise. Machine learning methods like genetic algorithms have shown promise in this domain, but are…