The design and use of algorithms for permuting large entries to the diagonal of sparse matrices

IS Duff, J Koster - SIAM Journal on Matrix Analysis and Applications, 1999 - SIAM
We consider techniques for permuting a sparse matrix so that the diagonal of the permuted
matrix has entries of large absolute value. We discuss various criteria for this and consider …
被引用次数：327 相关文章
[PDF] archive.org

[PDF][PDF] The design and use of algorithms for permuting large entries to the diagonal of sparse matrices1

IS Du, J Koster - 1997 - scholar.archive.org
We consider techniques for permuting a sparse matrix so that the diagonal of the permuted
matrix has entries of large absolute value. We discuss various criteria for this and consider …
[PDF] psu.edu

[PDF][PDF] The design and use of algorithms for permuting large entries to the diagonal of sparse matrices1

IS Du, J Koster - 1997 - Citeseer
We consider techniques for permuting a sparse matrix so that the diagonal of the permuted
matrix has entries of large absolute value. We discuss various criteria for this and consider …

[引用][C] The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices

IS Duff, J Koster - SIAM Journal on Matrix Analysis and Applications, 1999 - cir.nii.ac.jp
The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse
Matrices | CiNii Research CiNii 国立情報学研究所 学術情報ナビゲータ[サイニィ] 詳細へ移動 検索 …
[PDF] stfc.ac.uk

[PDF][PDF] The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices

IS Duff, J Koster - epubs.stfc.ac.uk
We consider techniques for permuting a sparse matrix so that the diagonal of the permuted
matrix has entries of large absolute value. We discuss various criteria for this and consider …

The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices

IS Duff, J Koster - SIAM Journal on Matrix Analysis and …, 1999 - search.proquest.com
We consider techniques for permuting a sparse matrix so that the diagonal of the permuted
matrix has entries of large absolute value. We discuss various criteria for this and consider …
[PS] cerfacs.fr

[PS][PS] The design and use of algorithms for permuting large entries to the diagonal of sparse matrices1

IS Du, J Koster - 1997 - cerfacs.fr
We consider techniques for permuting a sparse matrix so that the diagonal of the permuted
matrix has entries of large absolute value. We discuss various criteria for this and consider …
[PDF] cern.ch

[PDF][PDF] The design and use of algorithms for permuting large entries to the diagonal of sparse matrices

IS Duff, LJ Köster - 1997 - cds.cern.ch
We consider techniques for permuting a sparse matrix so that the diagonal of the permuted
matrix has entries of large absolute value. We discuss various criteria for this and consider …

The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices

IS Duff, J Koster - SIAM Journal on Matrix Analysis and Applications, 1999 - dl.acm.org
We consider techniques for permuting a sparse matrix so that the diagonal of the permuted
matrix has entries of large absolute value. We discuss various criteria for this and consider …

[引用][C] The design and use of algorithms for permuting large entries to the diagonal of sparse matrices1

IS Du, J Koster - 1997