𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computing rank-deficiency of rectangular matrix pencils

✍ Scribed by Daniel Boley


Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
615 KB
Volume
9
Category
Article
ISSN
0167-6911

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Block computation and representation of
✍ Sabine Le Borne πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 179 KB

In this paper, we propose a new method to efficiently compute a representation of an orthogonal basis of the nullspace of a sparse matrix operator B T with B ∈ R nΓ—m , n > m. We assume that B has full rank, i.e., rank(B) = m. It is well known that the last nm columns of the orthogonal matrix Q in a