A stable semi-implicit algorithm

05/11/2019

∙

When the singular values of the evolution operator are all smaller or all greater than one, stable integration algorithms are obtained either by explicit or implicit methods. When the singular spectrum mixes greater and smaller than one values, neither explicit nor implicit methods insure stabilty. The problem is solved by using a splitting of the evolution operator and a semi-implicit scheme. The method is illustrated in the study of a two-field model of the tokamak scrape-off layer.

READ FULL TEXT

A stable semi-implicit algorithm

Stability properties of a projector-splitting scheme for the dynamical low rank approximation of random parabolic equations

A dual adaptive explicit time integration algorithm for efficiently solving the cardiac monodomain equation

Two-level schemes for the advection equation

Semi-implicit methods for advection equations with explicit forms of numerical solution

A theoretical and experimental investigation of a family of immersed finite element methods

Fundamental Schemes for Efficient Unconditionally Stable Implicit Finite-Difference Time-Domain Methods

On the impact of explicit or semi-implicit integration methods over the stability of real-time numerical simulations

A stable semi-implicit algorithm

Related Research

Stability properties of a projector-splitting scheme for the dynamical low rank approximation of random parabolic equations

A dual adaptive explicit time integration algorithm for efficiently solving the cardiac monodomain equation

Two-level schemes for the advection equation

Semi-implicit methods for advection equations with explicit forms of numerical solution

A theoretical and experimental investigation of a family of immersed finite element methods

Fundamental Schemes for Efficient Unconditionally Stable Implicit Finite-Difference Time-Domain Methods

On the impact of explicit or semi-implicit integration methods over the stability of real-time numerical simulations