Repositorio de producción científica de la Universidad de Sevilla

A node ordering algorithm to speed up the solution of sparse matrix and sparse vector linear equation systems

Opened Access A node ordering algorithm to speed up the solution of sparse matrix and sparse vector linear equation systems
Estadísticas
Icon
Exportar a
Autor: Gómez Expósito, Antonio
García Franquelo, Leopoldo
Departamento: Universidad de Sevilla. Departamento de Ingeniería Electrónica
Fecha: 1986
Publicado en: International Conference on Modelling And Simulation, 115-124. Nápoles, Italia : AMSE
Tipo de documento: Ponencia
Resumen: Recently, more attention has been devoted to sparse vector methods in order to reduce the computational burden when solving sparse systems of linear equations. These methods exploit the sparsity of the independent vector and/or the desire to know only a subset of the unknown vector. They are also applicable when refactorization of a slightly modified matrix is required. This paper proposes a scheme to order the nodes with the purpose of reducing the number of operations when applying sparse vector methods.
Tamaño: 1.992Mb
Formato: PDF

URI: http://hdl.handle.net/11441/23765

Mostrar el registro completo del ítem


Esta obra está bajo una Licencia Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 Internacional

Este registro aparece en las siguientes colecciones