Mostrar o rexistro simple do ítem
Sparse Givens QR Factorization on a Multiprocessor
| dc.contributor.author | Touriño, Juan | |
| dc.contributor.author | Doallo, Ramón | |
| dc.contributor.author | Zapata, E.L. | |
| dc.date.accessioned | 2019-05-03T14:57:56Z | |
| dc.date.available | 2019-05-03T14:57:56Z | |
| dc.date.issued | 1996-06-01 | |
| dc.identifier.citation | TOURINO, Juan; DOALLO, Ramon; ZAPATA, Emilio L. Sparse givens QR factorization on a multiprocessor. En 2nd. Int'l. Conf. on Massively Parallel Computing Systems, Ischia, Italy. 1996. | es_ES |
| dc.identifier.isbn | 978-0818676000 | |
| dc.identifier.uri | http://hdl.handle.net/2183/22818 | |
| dc.description.abstract | [Abstract] We present a parallel algorithm for the QR factorization with column pivoting of a sparse matrix by means of Givens rotations. Nonzero elements of the matrix M to be decomposed are stored in a one dimensional doubly linked list data struct1tre. We will discuss a strategy to reduce fill-in in order to gain memory savings and decrease the computation times. As an application of QR factorization, we will describe the least squares problem. This algorithm has been designed for a message passing multiprocessor and we have evaluated it on the Cray T3D supercomputer using the Harwell-Boeing sparse matrix collection. | es_ES |
| dc.language.iso | eng | es_ES |
| dc.publisher | IEEE Computer Society | es_ES |
| dc.subject | Parallel algorithm | es_ES |
| dc.subject | QR factorization | es_ES |
| dc.subject | Supercomputer | es_ES |
| dc.title | Sparse Givens QR Factorization on a Multiprocessor | es_ES |
| dc.type | info:eu-repo/semantics/conferenceObject | es_ES |
| dc.type | info:eu-repo/semantics/conferenceObject | es_ES |
| dc.rights.access | info:eu-repo/semantics/openAccess | es_ES |
| UDC.startPage | 524 | es_ES |
| UDC.endPage | 529 | es_ES |
| UDC.conferenceTitle | 2nd International Conference on Massively Parallel Computing Systems, MPCS'96 | es_ES |
