Related papers: Preconditioned normal equations for solving discre…
This paper introduces a novel Transformed Primal-Dual with variable-metric/preconditioner (TPDv) algorithm, designed to efficiently solve affine constrained optimization problems common in nonlinear partial differential equations (PDEs).…
For some typical and widely used non-convex half-quadratic regularization models and the Ambrosio-Tortorelli approximate Mumford-Shah model, based on the Kurdyka-\L ojasiewicz analysis and the recent nonconvex proximal algorithms, we…
Within the theoretical framework of a recently introduced approach to approximate Lie symmetries of differential equations containing small terms, which is consistent with the principles of perturbative analysis, we define accordingly…
In this paper we propose two variants of the substructuring preconditioner for solving three-dimensional elliptic-type equations with strongly discontinuous coefficients. In the new preconditioners, we use the simplest coarse solver…
This paper concerns robust numerical treatment of an elliptic PDE with high contrast coefficients, for which classical finite-element discretizations yield ill-conditioned linear systems. This paper introduces a procedure by which the…
We present a general purpose method for solving partial differential equations on a closed surface, based on a technique for discretizing the surface introduced by Wenjun Ying and Wei-Cheng Wang [J. Comput. Phys. 252 (2013), pp. 606-624]…
This paper deals with the solution of large classes of systems of nonlinear partial differential equations (PDEs) in spaces of generalized functions that are constructed as the completion of uniform convergence spaces. The existence result…
Simulations of complex physical systems are typically realized by discretizing partial differential equations (PDEs) on unstructured meshes. While neural networks have recently been explored for surrogate and reduced order modeling of PDE…
This paper develops a probabilistic numerical method for solution of partial differential equations (PDEs) and studies application of that method to PDE-constrained inverse problems. This approach enables the solution of challenging inverse…
The numerical solution methods for partial differential equation (PDE) solution allow obtaining a discrete field that converges towards the solution if the method is applied to the correct problem. Nevertheless, the numerical methods…
The efficient solution of discretisations of coupled systems of partial differential equations (PDEs) is at the core of much of numerical simulation. Significant effort has been expended on scalable algorithms to precondition Krylov…
A linearly implicit conservative difference scheme is applied to discretize the attractive coupled nonlinear Schr\"odinger equations with fractional Laplacian. Complex symmetric linear systems can be obtained, and the system matrices are…
In this research, to solve the large indefinite least squares problem, we firstly transform its normal equation into a sparse block three-by-three linear systems, then use GMRES method with an accelerated preconditioner to solve it. The…
We propose a collocation method based on multivariate polynomial splines over triangulation or tetrahedralization for the numerical solution of partial differential equations. We start with a detailed explanation of the method for the…
This paper is concerned with developing and analyzing two novel implicit temporal discretization methods for the stochastic semilinear wave equations with multiplicative noise. The proposed methods are natural extensions of well-known…
Polynomial preconditioning is an important tool in solving large linear systems and eigenvalue problems. A polynomial from GMRES can be used to precondition restarted GMRES and restarted Arnoldi. Here we give methods for indefinite matrices…
Some connections between classical and nonclassical symmetries of a partial differential equation (PDE) are given in terms of determining equations of the two symmetries. These connections provide additional information for determining…
This work develops neural-network--based preconditioners to accelerate solution of the Wilson-Dirac normal equation in lattice quantum field theories. The approach is implemented for the two-flavor lattice Schwinger model near the critical…
In this paper we develop a family of preconditioners for the linear algebraic systems arising from the arbitrary Lagrangian-Eulerian discretization of some fluid-structure interaction models. After the time discretization, we formulate the…
The treatment of the differential PDE constraint poses a key challenge in computing the numerical solution of the Serre-Green-Naghdi (SGN) equations. In this work, we introduce a constant coefficient preconditioner for the SGN constraint…