𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The behaviour of probabilistic error bounds in floating

✍ Scribed by Mitrouli, M. ;Koukouvinos, C.

Publisher
Springer-Verlag
Year
1997
Tongue
English
Weight
166 KB
Volume
4
Category
Article
ISSN
1226-0061

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Rigorous error bounds for RK methods in
Rigorous error bounds for RK methods in the proof of chaotic behaviour
✍ Arno Berger πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 202 KB

Complicated dynamical systems can be rigorously analysed by means of Conley index theory. Due to its partly numerical nature such an analysis necessitates bounds on the truncation and the round-o error. These are provided for explicit RK methods in the form of iteration schemes ready-made for applic

A linear lower bound on the unbounded er
A linear lower bound on the unbounded error probabilistic communication complexity
✍ JΓΌrgen Forster πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 187 KB

The main mathematical result of this paper may be stated as follows: Given a matrix MAfΓ€1; 1g nΓ‚n and any matrix MAR nΓ‚n such that signΓ° Mi;j Þ ΒΌ M i;j for all i; j; then rankΓ° MÞXn=jjMjj: Here jjMjj denotes the spectral norm of the matrix M: This implies a general lower bound on the complexity of