Numerical solution of nonlinear differential boundary value problems using adaptive non-overlapping domain decomposition method

This work aims is to study a nonlinear second-order boundary value differential elliptic problem in one dimension where the nonlinearity concerns the solution and its first derivative. We assume that the source term can be non-smooth and the nonlinearity can grow faster than quadratic. First, we sho...

Full description

Saved in:
Bibliographic Details
Published in:Applicable analysis Vol. 101; no. 6; pp. 2044 - 2065
Main Authors: Naceur, Nahed, Khenissi, Moez, Roche, Jean R.
Format: Journal Article
Language:English
Published: Abingdon Taylor & Francis 13.04.2022
Taylor & Francis Ltd
Subjects:
ISSN:0003-6811, 1563-504X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This work aims is to study a nonlinear second-order boundary value differential elliptic problem in one dimension where the nonlinearity concerns the solution and its first derivative. We assume that the source term can be non-smooth and the nonlinearity can grow faster than quadratic. First, we show the existence of a non-negative weak solution if we assume the existence of a super-solution. Second, we present a numerical algorithm to compute an approximation of the non-negative weak solution. The proposed algorithm is decomposed in two steps, the first one is devoted to computing a super-solution, and in the second one, the algorithm computes a sequence of solutions of an intermediate problem obtained by using the Yosida approximation of the nonlinearity. This sequence converges to the non-negative weak solution of the nonlinear equation. The numerical method is an application of the Newton method to the discretized version of the problem, but at each iteration, the resulting system can be indefinite. To overcome this difficulty, we introduce an adaptive non-overlapping domain decomposition method.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0003-6811
1563-504X
DOI:10.1080/00036811.2020.1800649