Block scaling with optimal Euclidean condition

Elsner L (1984)
Linear algebra and its applications 58(Apr): 69-73.

Download
OA
Journal Article | Published | English
Abstract
Let M denote the set of all complex n×n matrices whose columns span certain given linear subspaces. The minimal Euclidean condition number of matrices in M is given in terms of the canonical angles between the linear subspaces, and optimal matrices in M are described. The result is also stated in terms of norms of certain projections.
Publishing Year
ISSN
PUB-ID

Cite this

Elsner L. Block scaling with optimal Euclidean condition. Linear algebra and its applications. 1984;58(Apr):69-73.
Elsner, L. (1984). Block scaling with optimal Euclidean condition. Linear algebra and its applications, 58(Apr), 69-73.
Elsner, L. (1984). Block scaling with optimal Euclidean condition. Linear algebra and its applications 58, 69-73.
Elsner, L., 1984. Block scaling with optimal Euclidean condition. Linear algebra and its applications, 58(Apr), p 69-73.
L. Elsner, “Block scaling with optimal Euclidean condition”, Linear algebra and its applications, vol. 58, 1984, pp. 69-73.
Elsner, L.: Block scaling with optimal Euclidean condition. Linear algebra and its applications. 58, 69-73 (1984).
Elsner, Ludwig. “Block scaling with optimal Euclidean condition”. Linear algebra and its applications 58.Apr (1984): 69-73.
Main File(s)
Access Level
OA Open Access

This data publication is cited in the following publications:
This publication cites the following data publications:

Export

0 Marked Publications

Open Data PUB

Web of Science

View record in Web of Science®

Search this title in

Google Scholar