✦ LIBER ✦

Error Analysis of the Quasi-Gram--Schmidt Algorithm

✍ Scribed by Stewart, G. W.

Book ID: 118215834
Publisher: Society for Industrial and Applied Mathematics
Year: 2005
Tongue: English
Weight: 162 KB
Volume: 27
Category: Article
ISSN: 0895-4798
DOI: 10.1137/040607794

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Rounding error analysis of the classical

Rounding error analysis of the classical Gram-Schmidt orthogonalization process

✍ Luc Giraud; Julien Langou; Miroslav Rozložník; Jasper van den Eshof 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 179 KB

A note on the error analysis of classica

A note on the error analysis of classical Gram–Schmidt

✍ Alicja Smoktunowicz; Jesse L. Barlow; Julien Langou 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 247 KB

Roundoff Error Estimates of the Modified

Roundoff Error Estimates of the Modified Gram–Schmidt Algorithm with Column Pivoting

✍ Musheng Wei; Qiaohua Liu 📂 Article 📅 2003 🏛 Springer Netherlands 🌐 English ⚖ 223 KB

Optimal algorithms of Gram–Schmidt type

✍ Wilson, James B. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 307 KB

On growth factors of the modified Gram–S

On growth factors of the modified Gram–Schmidt algorithm

✍ Musheng Wei; Qiaohua Liu 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 142 KB

## Abstract Growth factors play a central role in studying the stability properties and roundoff estimates of matrix factorizations; therefore, they have attracted many numerical analysts to study upper bounds of these growth factors. In this article, we derive several upper bounds of row‐wise gro

CPU vs. GPU - Performance comparison for

CPU vs. GPU - Performance comparison for the Gram-Schmidt algorithm

✍ T. Brandes, A. Arnold, T. Soddemann, D. Reith 📂 Article 📅 2012 🏛 Springer-Verlag 🌐 English ⚖ 663 KB