Related papers: An Iterative Deep Ritz Method for Monotone Ellipti…
We propose a new framework to implement interior point method (IPM) to solve very large linear programs (LP). Traditional IPMs typically use Newton's method to approximately solve a subproblem that aims to minimize a log-barrier penalty…
In this paper, we propose a certified reduced basis (RB) method for quasilinear elliptic problems together with its application to nonlinear magnetostatics equations, where the later model permanent magnet synchronous motors (PMSM). The…
The Asymptotic Iteration Method (AIM) is a technique for solving analytically and approximately the linear second-order differential equation, especially the eigenvalue problems that frequently appear in theoretical and mathematical…
Deep neural network approaches show promise in solving partial differential equations. However, unlike traditional numerical methods, they face challenges in enforcing essential boundary conditions. The widely adopted penalty-type methods,…
For many applications in signal processing and machine learning, we are tasked with minimizing a large sum of convex functions subject to a large number of convex constraints. In this paper, we devise a new random projection method (RPM) to…
We examine the challenges associated with numerical integration when applying Neural Networks to solve Partial Differential Equations (PDEs). We specifically investigate the Deep Ritz Method (DRM), chosen for its practical applicability and…
In this paper, we propose a categorical embedding discontinuity-capturing shallow neural network for anisotropic elliptic interface problems. The architecture comprises three hidden layers: a discontinuity-capturing layer, which maps domain…
The embedded discontinuous Galerkin (EDG) method by Cockburn et al. [SIAM J. Numer. Anal., 2009, 47(4), 2686-2707] is obtained from the hybridizable discontinuous Galerkin method by changing the space of the Lagrangian multiplier from…
In this paper we present an immersed weak Galerkin method for solving second-order elliptic interface problems on polygonal meshes, where the meshes do not need to be aligned with the interface. The discrete space consists of constants on…
Image restoration is typically addressed through non-convex inverse problems, which are often solved using first-order block-wise splitting methods. In this paper, we consider a general type of non-convex optimisation model that captures…
We study the generalized forward-reflected-backward (GFRB) method, an extension of the forward-reflected-backward (FRB) scheme due to Malitsky and Tam, for solving monotone inclusion problems in real Hilbert spaces. We first analyze GFRB…
It is true that different approaches have been utilised to accelerate the computation of discrete logarithm problem on elliptic curves with Pollard's Rho method. However, trapping in cycles fruitless will be obtained by using the random…
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 provides a theoretical and numerical investigation of a penalty decomposition scheme for the solution of optimization problems with geometric constraints. In particular, we consider some situations where parts of the constraints…
Incremental gradient and incremental proximal methods are a fundamental class of optimization algorithms used for solving finite sum problems, broadly studied in the literature. Yet, without strong convexity, their convergence guarantees…
We introduce and analyze a fast iterative method based on sequential Bregman projections for nonlinear inverse problems in Banach spaces. The key idea, in contrast to the standard Landweber method, is to use multiple search directions per…
In this paper, we propose a unified framework, the Hessian discretisation method (HDM), which is based on four discrete elements (called altogether a Hessian discretisation) and a few intrinsic indicators of accuracy, independent of the…
We construct a soft thresholding operation for rank reduction of hierarchical tensors and subsequently consider its use in iterative thresholding methods, in particular for the solution of discretized high-dimensional elliptic problems. The…
In this paper, we propose a low rank approximation method for efficiently solving stochastic partial differential equations. Specifically, our method utilizes a novel low rank approximation of the stiffness matrices, which can significantly…
Non-overlapping domain decomposition methods are natural for solving interface problems arising from various disciplines, however, the numerical simulation requires technical analysis and is often available only with the use of high-quality…