On discrete systems based on the Adams and Neström methods (Q1280998)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On discrete systems based on the Adams and Neström methods |
scientific article; zbMATH DE number 1263100
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On discrete systems based on the Adams and Neström methods |
scientific article; zbMATH DE number 1263100 |
Statements
On discrete systems based on the Adams and Neström methods (English)
0 references
16 November 1999
0 references
In dealing with continuous-time systems (CTS) described by a canonical set of first order equations, \(\dot x=f(x)\), \(x\in\mathbb{R}^n\) , one is interested to study this system by its discretized version. In many applications, an \(m\)-step discretization is used: \[ x_k=x_{k-p}+h\cdot \sum^m_{i=0} b_if(x_{k-i}). \] For \(p=1\), the Adams method is obtained, whereas for \(p=2\), one gets the Neström method. One is naturally interested to know if the discretized system (DS) inherits the properties of the corresponding CTS. The paper provides some answers to this question by studying the phase space (in both cases) of the associated DS. Two propositions regarding the conditions under which the stability and asymptotic stability are preserved are proved. The imposed conditions on the mapping \(f(.)\) are very reasonable (bounded map, Lipschitz-like conditions, etc.).
0 references
\(m\)-step discretization
0 references
Adams method
0 references
asymptotic stability
0 references
0.87354714
0 references
0.86563766
0 references
0.8568758
0 references
0.8551108
0 references
0.85473454
0 references
0.85241544
0 references
0.8505404
0 references