Algorithm 575: Permutations for a Zero-Free Diagonal [F1]

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Algorithm 575: Permutations for a Zero-Free Diagonal [F1]

Full text

Pdf (167 KB)

Source

ACM Transactions on Mathematical Software (TOMS) archive
Volume 7 , Issue 3 (September 1981) table of contents

Pages: 387 - 390

Year of Publication: 1981

ISSN:0098-3500

Author

I. S. Duff

Computer Science and Systems Division, Building 8.9, AERE Harewell, Oxon, England

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 40, Citation Count: 9

Additional Information:

appendices and supplements references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/355958.355968 What is a DOI?

APPENDICES and SUPPLEMENTS

MC21A (575.gz) (3 KB)

row permutation for a zero-free diagonal That is, given the pattern of nonzeros of a sparse matrix, this routine attempts to find a permutation of its rows that makes the matrix have no zeros on its diagonal
Gams: D2e

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	DUFF, I.S On permutations to block mangular form. J Inst Math. Appl. 19 (1977), 339-342.
	2	DUFF, I.S MA28--A set of Fortran subroutines for sparse unsymmetrlc hnear equations. AERE Rep R 8730, Her Majesty's Stationery Office, London, 1977.
	3	I. S. Duff, On Algorithms for Obtaining a Maximum Transversal, ACM Transactions on Mathematical Software (TOMS), v.7 n.3, p.315-330, Sept. 1981 [doi>10.1145/355958.355963]
	4	I. S. Duff , J. K. Reid, Algorithm 529: Permutations To Block Triangular Form [F1], ACM Transactions on Mathematical Software (TOMS), v.4 n.2, p.189-192, June 1978 [doi>10.1145/355780.355790]

CITED BY 9

	I. S. Duff , J. K. Reid, The design of MA48: a code for the direct solution of sparse unsymmetric linear systems of equations, ACM Transactions on Mathematical Software (TOMS), v.22 n.2, p.187-226, June 1996
	I. S. Duff, On Algorithms for Obtaining a Maximum Transversal, ACM Transactions on Mathematical Software (TOMS), v.7 n.3, p.315-330, Sept. 1981
	K. A. Gallivan , B. A. Marsolf , H. A. G. Wijshoff, The parallel solution of nonsymmetric sparse linear systems using the H* reordering and an associated factorization, Proceedings of the 8th international conference on Supercomputing, p.419-430, July 11-15, 1994, Manchester, England
	Iain S. Duff , Torbjörn Wiberg, Remarks on implementation of O(n^1/2τ) assignment algorithms, ACM Transactions on Mathematical Software (TOMS), v.14 n.3, p.267-287, Sept. 1988
	Olaf Schenk , Klaus Gärtner, Two-level dynamic scheduling in PARDISO: improved scalability on shared memory multiprocessing systems, Parallel Computing, v.28 n.2, p.187-197, February 2002
	Xiaoye S. Li , James W. Demmel, Making sparse Gaussian elimination scalable by static pivoting, Proceedings of the 1998 ACM/IEEE conference on Supercomputing (CDROM), p.1-17, November 07-13, 1998, San Jose, CA
	Iain S. Duff , Jennifer A. Scott, Stabilized bordered block diagonal forms for parallel sparse solvers, Parallel Computing, v.31 n.3+4, p.275-289, March/April 2005
	Olaf Schenk , Andreas Wächter , Michael Hagemann, Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization, Computational Optimization and Applications, v.36 n.2-3, p.321-341, April 2007
	Jonas Larsson, A Framework for Implementation-Independent Simulation Models, Simulation, v.82 n.9, p.563-579, September 2006