๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Some LP algorithms using orthogonal matrices

โœ Scribed by C. G. Broyden; G. Spaletta

Book ID
110562661
Publisher
Springer Milan
Year
1995
Tongue
English
Weight
531 KB
Volume
32
Category
Article
ISSN
0008-0624

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Algorithms in Convex Analysis to Fit lp-
Algorithms in Convex Analysis to Fit lp-Distance Matrices
โœ R. Mathar; R. Meyer ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 695 KB

We consider the MDS problem of fitting an \(l_{r}\)-distance matrix to a given dissimilarity matrix with respect to the weighted least squares loss function (STRESS). The problem is reduced to the maximization of a ratio of two norms on a finite dimensional Hilbert space. A necessary condition for a

Orthogonality of matrices and some dista
Orthogonality of matrices and some distance problems
โœ Rajendra Bhatia; Peter ล emrl ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 348 KB

If A and B are matrices such that IIA + zBII ~ IIA II for all complex numbers z, then A is said to be orthogonal to B. We find necessary and sufficient conditions for this to be the case. Some applications and generalisations are also discussed.

Analysis of Algorithms for Orthogonalizi
Analysis of Algorithms for Orthogonalizing Products of Unitary Matrices
โœ Roy Mathias ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 995 KB

We consider the problem of computing u k = Qk uk-1 (where U0 is given) in finite precision (CM = machine precision) where U0 and the Qi are known to be unitary. The problem is that fik, the computed product may not be unitary, so one applies an O(n2) orthogonalizing step after each multiplication to