Machine iteration of a linear function: Local behaviour (Q804225): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q758111 |
Set OpenAlex properties. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: S. M. Grzegórski / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Effects of phase space discretization on the long-time behavior of dynamical systems / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0898-1221(91)90091-h / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2020351135 / rank | |||
Normal rank |
Latest revision as of 10:58, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Machine iteration of a linear function: Local behaviour |
scientific article |
Statements
Machine iteration of a linear function: Local behaviour (English)
0 references
1991
0 references
The paper deals with a computer which represents numbers as multiples of a discretization step \(\delta\). For floating-point representation, this means that all numbers should be of the same order of magnitude. The local behaviour of the linear function \(f(x)=ax+(1-a)\zeta\) is studied near its fixed point \(\zeta\). In the case of truncation, the author calculates the conditions needed for spurious multiple fixed points and for period-two cycles. Neither of these two errors can be reduced with better machine precision. Important qualitative differences between the schemes of roundoff and truncation are also shown.
0 references
machine linear iteration
0 references
truncation
0 references
spurious multiple fixed points
0 references
period-two cycles
0 references
roundoff
0 references