𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A New Class of Time Discretization Schemes for the Solution of Nonlinear PDEs

✍ Scribed by Gregory Beylkin; James M. Keiser; Lev Vozovoi


Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
324 KB
Volume
147
Category
Article
ISSN
0021-9991

No coin nor oath required. For personal study only.

✦ Synopsis


We consider issues of stability of time-discretization schemes with exact treatment of the linear part (ELP schemes) for solving nonlinear PDEs. A distinctive feature of ELP schemes is the exact evaluation of the contribution of the linear term, that is if the nonlinear term of the equation is zero, then the scheme reduces to the evaluation of the exponential function of the operator representing the linear term. Computing and applying the exponential or other functions of operators with variable coefficients in the usual manner requires evaluating dense matrices and is highly inefficient. It turns out that computing the exponential of strictly elliptic operators in the wavelet system of coordinates yields sparse matrices (for a finite but arbitrary accuracy). This observation makes our approach practical in a number of applications. In particular, we consider applications of ELP schemes to advection-diffusion equations. We study the stability of these schemes and show that both explicit and implicit ELP schemes have distinctly different stability properties if compared with known implicit-explicit schemes. For example, we describe explicit schemes with stability regions similar to those of typical implicit schemes used for solving advection-diffusion equations.


πŸ“œ SIMILAR VOLUMES


Threshold computation for fault detectio
✍ Abdul Qayyum Khan; Steven X. Ding πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 193 KB πŸ‘ 3 views

## Abstract In this paper, we address the problem of designing robust thresholds for fault detection in discrete‐time nonlinear uncertain systems in the presence of process disturbances. Both constant and dynamic thresholds are proposed. For the computation of constant thresholds, a generalized fra

Robustness and convergence rate of a dis
✍ Samer S. Saab πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 127 KB πŸ‘ 2 views

In this paper, we apply a discrete-time learning algorithm to a class of discrete-time varying nonlinear systems with a$ne input action and linear output having relative degree one. We investigate the robustness of the algorithm to state disturbance, measurement noise and reinitialization errors. We

A Discrete Scheme of Landweber Iteration
✍ Qinian Jin; Umberto Amato πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 130 KB

In this paper we consider the finite dimensional approximation of Landweber iteration for nonlinear ill-posed problems and propose an a posteriori stopping rule to choose the termination index of the iteration. Under certain conditions, we obtain convergence, a pseudo-optimality estimate, and rates

On a class of PDEs with nonlinear distri
✍ Alexander V. Rezounenko πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 157 KB

## Abstract A new class of nonlinear partial differential equations with distributed in space and time state‐dependent delay is investigated. We find appropriate assumptions on the kernel function which represents the state‐dependent delay and discuss advantages of this class. Local and long‐time a