Related papers: Extending Data to Improve Stability and Error Esti…
A new method to remove the stiffness of partial differential equations is presented. Two terms are added to the right-hand-side of the PDE : the first is a damping term and is treated implicitly, the second is of the opposite sign and is…
We design an adaptive finite element method to approximate the solutions of quasi-linear elliptic problems. The algorithm is based on a Ka\v{c}anov iteration and a mesh adaptation step is performed after each linear solve. The method is…
We present a quantum algorithm for systems of (possibly inhomogeneous) linear ordinary differential equations with constant coefficients. The algorithm produces a quantum state that is proportional to the solution at a desired final time.…
Estimating the values of unknown parameters from corrupted measured data faces a lot of challenges in ill-posed problems. In such problems, many fundamental estimation methods fail to provide a meaningful stabilized solution. In this work,…
In this paper, we address stability of parabolic linear Partial Differential Equations (PDEs). We consider PDEs with two spatial variables and spatially dependent polynomial coefficients. We parameterize a class of Lyapunov functionals and…
Partial differential equations (PDEs) are crucial for modeling various physical phenomena such as heat transfer, fluid flow, and electromagnetic waves. In computer-aided engineering (CAE), the ability to handle fine resolutions and large…
Physics-Informed Neural Networks (PINNs) have emerged as a powerful framework for solving partial differential equations (PDEs), yet they often fail to achieve accurate convergence in the H1 norm, especially in the presence of boundary…
We present a continuous finite element method for some examples of fully nonlinear elliptic equation. A key tool is the discretisation proposed in Lakkis & Pryer (2011, SISC) allowing us to work directly on the strong form of a linear PDE.…
We introduce a new method of symmetrization of mappings on the $n$-sphere ($n\geq 2$). They are applied to estimate solutions of quasilinear elliptic partial differential equations of $p$-Laplacian type, with combinations of Dirac measures…
There are many numerical methods for solving partial different equations (PDEs) on manifolds such as classical implicit, finite difference, finite element, and isogeometric analysis methods which aim at improving the interoperability…
In this technical note a general procedure is described to construct internally consistent splitting methods for the numerical solution of differential equations, starting from matching pairs of explicit and diagonally implicit Runge-Kutta…
A new method for numerical solving of boundary problem for ordinary differential equations with slowly varying coefficients which is aimed at better representation of solutions in the regions of their rapid oscillations or exponential…
Solving time-dependent partial differential equations (PDEs) that exhibit sharp gradients or local singularities is computationally demanding, as traditional physics-informed neural networks (PINNs) often suffer from inefficient point…
The efficient numerical solution of many kinetic models in plasma physics is impeded by the stiffness of these systems. Exponential integrators are attractive in this context as they remove the CFL condition induced by the linear part of…
The E(xplicit)I(implicit)N(null) method was developed recently to remove numerical instability from PDEs, adding and subtracting an operator $\mathcal{D}$ of arbitrary structure, treating the operator implicitly in one case, and explicitly…
This paper develops validated computational methods for studying infinite dimensional stable manifolds at equilibrium solutions of parabolic PDEs, synthesizing disparate errors resulting from numerical approximation. To construct our…
A general stochastic algorithm for solving mixed linear and nonlinear problems was introduced in [11]. We show in this paper how it can be used to solve the fault inverse problem, where a planar fault in elastic half-space and a slip on…
The Kaczmarz algorithm (KA) is a popular method for solving a system of linear equations. In this note we derive a new exponential convergence result for the KA. The key allowing us to establish the new result is to rewrite the KA in such a…
A novel algorithm to solve the quadratic programming problem over ellipsoids is proposed. This is achieved by splitting the problem into two optimisation sub-problems, quadratic programming over a sphere and orthogonal projection. Next, an…
We provide an a priori analysis of collocation methods for solving elliptic boundary value problems. They begin with information in the form of point values of the data and utilize only this information to numerically approximate the…