𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An alternating least squares algorithm for fitting the two- and three-way dedicom model and the idioscal model

✍ Scribed by Henk A. L. Kiers

Book ID
112726921
Publisher
Springer
Year
1989
Tongue
English
Weight
575 KB
Volume
54
Category
Article
ISSN
0033-3123

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Relating two proposed methods for speedu
Relating two proposed methods for speedup of algorithms for fitting two- and three-way principal component and related multilinear models
✍ Henk A.L. Kiers; Richard A. Harshman πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 915 KB

Multilinear analysis methods such as component (and three-way component) analysis of very large data sets can become very computationally demanding and even infeasible unless some method is used to compress the data and/or speed up the algorithms. We discuss two previously proposed speedup methods.

A fast, direct algorithm for the least-s
A fast, direct algorithm for the least-squares fitting of two sets of atomic coordinates of macromolecular structures
✍ Zong Jie Liu; Roland Van Rapenbusch πŸ“‚ Article πŸ“… 1988 πŸ› John Wiley and Sons 🌐 English βš– 337 KB πŸ‘ 2 views

By use of rotation angle method a direct algorithm is derived, which determines the least-squares superposition that matches two sets of atomic coordinates. The program based on this algorithm runs fast. The solution obtained by this algorithm cannot be trapped by any local minimum. Testing examples

Comparison between the direct trilinear
Comparison between the direct trilinear decomposition and the multivariate curve resolution-alternating least squares methods for the resolution of three-way data sets
✍ Anna de Juan; Sarah C Rutan; RomΓ  Tauler; D.Luc Massart πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 464 KB

## Ε½ . Ε½ . Direct trilinear decomposition DTD and multivariate curve resolution-alternating least squares MCR-ALS methods are two of the most representative three-way resolution procedures. The former, non-iterative, is based on the resolution of the generalized eigenvectorreigenvalue problem and