Search

This article is devoted to the construction and study of the finite element method for solving a two-dimensional nonlinear equation of elliptic type. Equations of this type arise in solving many applied problems, including problems of the theory of multiphase filtering, the theory of semiconductor devices, and many others. The relevance of the study of this problem is associated with the need to develop effective parallel methods for solving this problem. To discretize the equation, a mixed finite element method with Brezzi-Douglas-Marini elements is used. The issue of the convergence of the finite element method is investigated. To linearize the equation, the Picard iterative method is constructed. Two classes of basis functions of finite elements are used in the paper. A comparative analysis of the effectiveness of several direct and iterative methods for solving the resulting system of linear algebraic equations is carried out, including the method based on the Bunch-Kaufman LDLt factorization, the method of minimal residuals, the symmetric LQ method, the stabilized biconjugate gradient method, and a number of other iterative Krylov subspace algorithms with preconditioners based on incomplete LU decomposition. The method has been tested on several model problems by comparing an approximate solution with a known exact solution. The results of the analysis of the method error in various norms depending on the diameter of the mesh are presented.

Solving partial differential equations using neural networks is mostly a proof of concept approach. In the case of direct function approximation, a single neural network is constructed to be the solution of a particular boundary value problem. Independent variables are fed into the input layer, and a single output is considered as the solution's value. The network is substituted into the equation, and the residual is then minimized with respect to the weights of the network using a gradient-based method. Our previous work showed that by minimizing all derivatives of the residual up to the third order one can obtain a machine precise solution for 2D boundary value problem using very sparse grids. The goal of this paper is to use this grid complexity advantage in order to obtain a solution faster than finite differences. However, the number of all possible high-order derivatives (and therefore the training time) increases with the number of dimensions and it was unclear whether this goal can be achieved. Here, we demonstrate that this increase can be compensated by using random directional derivatives instead. In 2D case neural networks are slower than finite differences, but for each additional dimension the complexity increases approximately 4 times for neural networks and 125 times for finite differences. This allows neural networks to catch up in 3D case for memory complexity and in 5D case for time complexity. For the first time a machine precise solution was obtained with neural network faster than with finite differences method. [ABSTRACT FROM AUTHOR]

This paper presents some of the author's experimental results in applying a family of iterative methods, the family of EN-like methods Eirola & Nevanlinna (1989), to equations obtained from the discretization of the nonlinear two dimentional Poisson equation occuring in semiconductor device modelling. It is shown that these iterative methods are efficient both in computation times and in storage requirements in comparison with other known methods. [ABSTRACT FROM AUTHOR]

A nonlinear Poisson–Boltzmann equation with inhomogeneous Robin type boundary conditions at the interface between two materials is investigated. The model describes the electrostatic potential generated by a vector of ion concentrations in a periodic multiphase medium with dilute solid particles. The key issue stems from interfacial jumps, which necessitate discontinuous solutions to the problem. Based on variational techniques, we derive the homogenisation of the discontinuous problem and establish a rigorous residual error estimate up to the first-order correction. [ABSTRACT FROM PUBLISHER]

A steady-state Poisson-Nernst-Planck system is investigated, which is conformed into a nonlinear Poisson equation by means of the Boltzmann statistics. It describes the electrostatic potential generated by multiple concentrations of ions in a heterogeneous (porous) medium with diluted (solid) particles. The nonlinear elliptic problem is singularly perturbed with the Debye length as a small parameter related to the electric double layer near the solid particle boundary. For star-shaped solid particles, we prove rigorously that the solution of the problem in spatial dimensions 1d, 2d and 3d is uniformly and super-asymptotically approximated by a constant reference state. Copyright © 2015 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

Abstract: In this note, we study a Modica type gradient estimate for smooth solutions to general non-linear Poisson equation where is a complete Riemannian manifold with bounded geometry and non-negative Ricci curvature and f is the derivative of the non-negative smooth function on R. Then we use this gradient estimate to conclude a Liouville theorem. [Copyright &y& Elsevier]

In this article, we study the properties of the hyperinterpolation operator on the unit disc D in ℝ2. We show how hyperinterpolation can be used in connection with the Kumar–Sloan method to approximate the solution of a nonlinear Poisson equation on the unit disc (discrete Galerkin method). A bound for the norm of the hyperinterpolation operator in the space C(D) is derived. Our results prove the convergence of the discrete Galerkin method in the maximum norm if the solution of the Poisson equation is in the class C1, δ(D), δ > 0. Finally, we present numerical examples which show that the discrete Galerkin method converges faster than O(n–k), for every k ∈ ℕ if the solution of the nonlinear Poisson equation is in C∞(D). [ABSTRACT FROM PUBLISHER]

This paper applies radial point interpolation collocation method (RPICM) for solving nonlinear Poisson equations arising in computational chemistry and physics. Thin plate spline (TPS) Radial basis functions are used in the work. A series of test examples are numerically analysed using the present method, including 2D Liouville equation, Bratu problem and Poisson-Boltzmann equation, in order to test the accuracy and efficiency of the proposed schemes. Several aspects have been numerically investigated, namely the enforcement of additional polynomial terms; and the application of the Hermite-type interpolation which makes use of the normal gradient on Neumann boundary for the solution of PDEs with Neumann boundary conditions. Particular emphasis was on an efficient scheme, namely Hermite-type interpolation for dealing with Neumann boundary conditions. The numerical results demonstrate that a good accuracy can be obtained. The h-convergence rates are also studied for RPICM with coarse and fine discretization models. [ABSTRACT FROM AUTHOR]

Abstract: Numerical schemes for approximating the inverse of a given matrix, using an ordinary differential equation (ODE) model, were recently developed. We extend that approach to solve nonlinear minimization problems, within the framework of a preconditioned gradient method. The main idea is to develop an automatic and implicit scheme to approximate directly the preconditioned search direction at every iteration, without an a priori knowledge of the Hessian of the objective function, and involving only a reduced and controlled amount of storage and computational cost. The new scheme allows us to obtain asymptotically the Newton''s direction by improving the accuracy in the ODE solver associated with the implicit scheme. We will present extensive and encouraging numerical results on some well-known test problems, on the problem of computing the square root of a given symmetric and positive definite matrix, and also on a nonlinear Poisson type equation. [Copyright &y& Elsevier]

We study a singular perturbation problem for the nonlinear Poisson equation and we classify its solutions. This classification is based on their monotonicity properties, which mainly depend on the stationary points of the so‐called Sagdeev potential. For each class of solution, we give necessary and sufficient conditions for the resolution of the problem and provide a boundary layer analysis. [ABSTRACT FROM AUTHOR]

The drift-diffusion model can be described by a nonlinear Poisson equation for the electrostatic potential coupled with a system of convection-reaction-diffusion equations for the transport of charge. We use a Gummel-like process [10] to decouple this system. Each of the obtained equations is discretised with the finite element method. We use a local scaling method to avoid breakdown in the numerical algorithm introduced by the use of Slotboom variables. Solution of the discrete nonlinear Poisson equation is accomplished with quasi-Newton methods. The nonsymmetric discrete transport equations are solved using an incomplete LU factorization preconditioner in conjunction with some robust linear solvers, such as (CGS), (BI-CGSTAB) and (GMRES). We investigate the behaviour of these iterative methods to define the effective strategy for this class of problems. [ABSTRACT FROM AUTHOR]

Copyright of Computing is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)