✦ LIBER ✦

Algorithms for roundoff error analysis —A relative error approach

✍ Scribed by J. L. Larson; A. H. Sameh

Publisher: Springer Vienna
Year: 1980
Tongue: English
Weight: 1020 KB
Volume: 24
Category: Article
ISSN: 0010-485X
DOI: 10.1007/bf02237815

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Roundoff error analysis of algorithms ba

Roundoff error analysis of algorithms based on Krylov subspace methods

✍ M. Arioli; C. Fassino 📂 Article 📅 1996 🏛 Springer Netherlands 🌐 English ⚖ 656 KB

Roundoff error analysis of fast DCT algo

Roundoff error analysis of fast DCT algorithms in fixed point arithmetic

✍ Katja Ihsberner 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 495 KB

A new iterative refinement with roundoff

A new iterative refinement with roundoff error analysis

✍ Xinyuan Wu; Zhengyu Wang 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 79 KB

A note on the roundoff error in the Nume

A note on the roundoff error in the Numerov algorithm

✍ J.L. Friar 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 358 KB

Error analysis algorithms for distribute

Error analysis algorithms for distributed parameter filtering

✍ G.R.V. Kumar; A.P. Sage 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 307 KB

Interest in estimation in distributed parameter linear systems is increasing. Unfortunately, algorithms for filtering in distributed parameter systems are quite complex and thus suboptimization will often, in practice, be necessary. Also incorrect models for distributed processes and prior statistic

Error analysis of splitting algorithms f

Error analysis of splitting algorithms for polynomials

✍ Nai-Kuan Tsao 📂 Article 📅 1979 🏛 Springer-Verlag 🌐 English ⚖ 446 KB