Mostrar o rexistro simple do ítem
Parallel Sparse Modified Gram-Schmidt QR Decomposition
| dc.contributor.author | Doallo, Ramón | |
| dc.contributor.author | Fraguela, Basilio B. | |
| dc.contributor.author | Touriño, Juan | |
| dc.contributor.author | Zapata, Emilio L. | |
| dc.date.accessioned | 2019-03-26T16:22:52Z | |
| dc.date.available | 2019-03-26T16:22:52Z | |
| dc.date.issued | 1996 | |
| dc.identifier.citation | Doallo R., Fraguela B.B., Touriño J., Zapata E.L. (1996) Parallel sparse modified Gram-Schmidt QR decomposition. In: Liddell H., Colbrook A., Hertzberger B., Sloot P. (eds) High-Performance Computing and Networking. HPCN-Europe 1996. Lecture Notes in Computer Science, vol 1067. Springer, Berlin, Heidelberg | es_ES |
| dc.identifier.isbn | 978-3-540-61142-4 | |
| dc.identifier.isbn | 978-3-540-49955-8 | |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.issn | 1611-3349 | |
| dc.identifier.uri | http://hdl.handle.net/2183/22369 | |
| dc.description | This is a post-peer-review, pre-copyedit version of an article published in Lecture Notes in Computer Science. The final authenticated version is available online at: https://doi.org/10.1007/3-540-61142-8_609 | es_ES |
| dc.description.abstract | [Abstract] We present a parallel computational method for the QR decomposition with column pivoting of a sparse matrix by means of Modified Gram-Schmidt orthogonalization. Nonzero elements of the matrix M to be decomposed are stored in a one-dimensional doubly linked list data structure. We discuse a strategy to reduce fill-in in order to get memory savings and decrease the computation times. As an application of QR decomposition, we describe the least squares problem. This algorithm was designed for a message passing multiprocessor and has been evaluated on a Cray T3D, using the Harwell-Boeing sparse matrix collection. | es_ES |
| dc.description.sponsorship | Comisión Interministerial de Ciencia y Tecnología; TIC92-0942-C03 | es_ES |
| dc.description.sponsorship | European Commision; ERB-CHGE-CT92-0005 | es_ES |
| dc.language.iso | eng | es_ES |
| dc.publisher | Springer | es_ES |
| dc.relation.uri | https://doi.org/10.1007/3-540-61142-8_609 | es_ES |
| dc.subject | Nonzero element | es_ES |
| dc.subject | Sequential algorithm | es_ES |
| dc.subject | Sparse matrice | es_ES |
| dc.subject | Little square problem | es_ES |
| dc.subject | Pivot element | es_ES |
| dc.title | Parallel Sparse Modified Gram-Schmidt QR Decomposition | es_ES |
| dc.type | info:eu-repo/semantics/conferenceObject | es_ES |
| dc.rights.access | info:eu-repo/semantics/openAccess | es_ES |
| UDC.journalTitle | Lecture Notes in Computer Science | es_ES |
| UDC.volume | 1067 | es_ES |
| UDC.startPage | 646 | es_ES |
| UDC.endPage | 653 | es_ES |
| dc.identifier.doi | 10.1007/3-540-61142-8_609 | |
| UDC.conferenceTitle | 4th International Conference on High-Performance Computing and Networking, HPCN'96 | es_ES |
