Computing the QR decomposition of a long dense matrix having a minimum fill-in sparse orthogonal matrix

Conference Paper uoadl:1041905 849 Read counter

Original Title:
Computing the QR decomposition of a long dense matrix having a minimum fill-in sparse orthogonal matrix
Languages of Item:
English
Creator:
Kontoghiorghes, Erricos John
Abstract:
Empty abstract
Main subject category:
Databases and Information Systems
Keywords:
Parallel systems, Distributed systems, Παράλληλα συστήματα, Κατανεμημένα συστήματα
Pages (from-to):
58-61
The digital material of the item is not available.