Related papers: Variations on branching methods for non linear PDE…
Multiscale and multiphysics problems need novel numerical methods in order for them to be solved correctly and predictively. To that end, we develop a wavelet based technique to solve a coupled system of nonlinear partial differential…
A linear program with linear complementarity constraints (LPCC) requires the minimization of a linear objective over a set of linear constraints together with additional linear complementarity constraints. This class has emerged as a…
We propose some multigrid methods for solving the algebraic systems resulting from finite element approximations of space fractional partial differential equations (SFPDEs). It is shown that our multigrid methods are optimal, which means…
In the present paper, we precisely conduct a q-calculus method for the numerical solutions of PDEs. A nonlinear Schrodinger equation is considered. Instead of the classical discretization methods we consider subdomains according to…
We present an algorithm for the numerical solution of systems of fully nonlinear PDEs using stochastic coded branching trees. This approach covers functional nonlinearities involving gradient terms of arbitrary orders, and it requires only…
Detectability of failures of linear programming (LP) decoding and the potential for improvement by adding new constraints motivate the use of an adaptive approach in selecting the constraints for the underlying LP problem. In this paper, we…
Parabolic partial differential equations (PDEs) and backward stochastic differential equations (BSDEs) have a wide range of applications. In particular, high-dimensional PDEs with gradient-dependent nonlinearities appear often in the…
A nonlinear inequality is formulated in the paper. An estimate of the rate of decay of solutions to this inequality is obtained. This inequality is of interest in a study of dynamical systems and nonlinear evolution equations. It can be…
Fast and accurate solutions of time-dependent partial differential equations (PDEs) are of pivotal interest to many research fields, including physics, engineering, and biology. Generally, implicit/semi-implicit schemes are preferred over…
Elliptic partial differential equations (PDEs) arise in many areas of computational sciences such as computational fluid dynamics, biophysics, engineering, geophysics and more. They are difficult to solve due to their global nature and…
The problem of computing differential constraints for a family of evolution PDEs is discussed from a constructive point of view. A new method, based on the existence of generalized characteristics for evolution vector fields, is proposed in…
Nonlinear Sobolev-Burgers PDEs are considered. Their solutions are investigated. A technique of noncommutative line integration is utilized for their description. A new method of PDEs solution with the help of Cayley-Dickson algebras is…
Neural network based methods have emerged as a promising paradigm for scientific computing, yet they face critical bottlenecks in high frequency function approximation and partial differential equation (PDE) solving.
A linearizable version of multidimensional system of $n$-wave type nonlinear PDEs is proposed. This system is derived using the spectral representation of its solution via the procedure similar to the dressing method for the ISTM-integrable…
We study the problem of learning similarity by using nonlinear embedding models (e.g., neural networks) from all possible pairs. This problem is well-known for its difficulty of training with the extreme number of pairs. For the special…
The solution of systems of non-autonomous linear ordinary differential equations is crucial in a variety of applications, such us nuclear magnetic resonance spectroscopy. A new method with spectral accuracy has been recently introduced in…
In this paper, we present new techniques for solving a large variety of partial differential equations. The proposed method reduces the PDEs to first order differential equations known as classical equations such as Bernoulli, Ricatti and…
This paper focuses on the branching process for solving any constraint satisfaction problem (CSP). A parametrised schema is proposed that (with suitable instantiations of the parameters) can solve CSP's on both finite and infinite domains.…
When solving numerical constraints such as nonlinear equations and inequalities, solvers often exploit pruning techniques, which remove redundant value combinations from the domains of variables, at pruning steps. To find the complete…
Semilinear parabolic partial differential equations (PDEs) are fundamental to modeling complex dynamical systems across scientific domains. The Deep Backward Stochastic Differential Equation (BSDE) method is a promising approach for…