𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The weak and strong stability of algorithms in numerical linear algebra

✍ Scribed by James R. Bunch

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
906 KB
Volume
88-89
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Strong and weak points in the interpreta
Strong and weak points in the interpretation of colloid stability
✍ J. Theodoor; G. Overbeek πŸ“‚ Article πŸ“… 1982 πŸ› Elsevier Science 🌐 English βš– 814 KB

Lyophobic dispersions can be stabilized against aggregation by electrostatic repulsion or by "steric" repulsion caused by the presence of large molecules at the interfaces. Theories of colloid stability are briefly reviewed. Strong and weak points in the present interpretations are pointed out. Two

On the numerical stability of two widely
On the numerical stability of two widely used PLS algorithms
✍ Nicolaas (Klaas) M. Faber; Joan FerrΓ© πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 197 KB

## Abstract Ideally, the score vectors numerically computed by an orthogonal scores partial least squares (PLS) algorithm should be orthogonal close to machine precision. However, this is not ensured without taking special precautions. The progressive loss of orthogonality with increasing number of