A program to reorder and solve sparse unsymmetric linear systems using the envelope method

Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/2308

Full metadata record

DC Field	Value	Language
dc.contributor.author	Judice, JJ	-
dc.contributor.author	Mitra, G	-
dc.contributor.author	Tamiz, M	-
dc.coverage.spatial	50	en
dc.date.accessioned	2008-05-29T14:30:30Z	-
dc.date.available	2008-05-29T14:30:30Z	-
dc.date.issued	1987	-
dc.identifier.citation	Maths Technical Papers (Brunel University). March 1987 , pp 1-49	en
dc.identifier.uri	http://bura.brunel.ac.uk/handle/2438/2308	-
dc.description.abstract	The envelope data structure and the Choleski based (bordering) method for the solution of symmetric sparse systems of linear equations have been extended by the authors to solve unsymmetric systems of linear equations. The data structures used in this general linear equation Solver and a set of FORTRAN 77 subroutines are described. Some test data (extracted from LP problems as basis matrices) together with experimental results are presented.	en
dc.format.extent	312632 bytes	-
dc.format.mimetype	application/pdf	-
dc.language.iso	en	-
dc.publisher	Brunel University	en
dc.relation.ispartof	Brunel University Mathematics Technical Papers collection;	-
dc.relation.ispartofseries	;TR/04/87	-
dc.title	A program to reorder and solve sparse unsymmetric linear systems using the envelope method	en
dc.type	Research Paper	en
Appears in Collections:	Dept of Mathematics Research Papers Mathematical Sciences

Files in This Item:

File	Description	Size	Format
TR_04_87.pdf		305.3 kB	Adobe PDF	View/Open