Please use this identifier to cite or link to this item:
http://hdl.handle.net/10553/73223
| Title: | The Go-Away algorithm for block factorization of a sparse matrix | Authors: | Almeida Benítez, Pedro Franco Branas, J. R. |
UNESCO Clasification: | 120205 Análisis combinatorio 1205 Teoría de números |
Issue Date: | 1998 | Journal: | NATO ASI series. Series C : Mathematical and physical sciences | Conference: | NATO Advanced Study Institute on Algorithms for Large Scale Linear Algebraic Systems - State of the Art and Applications in Science and Engineering | Abstract: | In this paper we consider the problem of colouring the vertices of a graph, without getting two adjacent vertices with the same colour and we study an algorithm to do so. Next, me present the Go-Away algorithm for block factorization of a sparse matrix and we obtain a substantial reduction of the factorization costs by using Cholesky's algorithm. | URI: | http://hdl.handle.net/10553/73223 | ISBN: | 0-7923-4975-X | ISSN: | 0258-2023 | Source: | NATO ASI series. Series C : Mathematical and physical sciences [ISSN 0258-2023], v. 508, p. 107-117, (1998) |
| Appears in Collections: | Actas de congresos |
Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.