Reducing the Total Bandwidth of a Sparse Unsymmetric Matrix
暂无分享,去创建一个
[1] Peter Fleischmann,et al. Double Ordering and Fill-In for the LU Factorization , 2003, SIAM J. Matrix Anal. Appl..
[2] Andrew Lim,et al. A centroid-based approach to solve the bandwidth minimization problem , 2004, 37th Annual Hawaii International Conference on System Sciences, 2004. Proceedings of the.
[3] B. H. Mayoh,et al. A graph technique for inverting certain matrices , 1965 .
[4] Iain S. Duff,et al. Sparse matrix test problems , 1982 .
[5] Jennifer A. Scott,et al. Row ordering for frontal solvers in chemical process engineering , 2000 .
[6] J. A. George. Computer implementation of the finite element method , 1971 .
[7] Jennifer A. Scott,et al. A new row ordering strategy for frontal solvers , 1999, Numer. Linear Algebra Appl..
[8] William G. Poole,et al. An algorithm for reducing the bandwidth and profile of a sparse matrix , 1976 .
[9] John Reid,et al. Ordering symmetric sparse matrices for small profile and wavefront , 1999 .
[10] Iain S. Duff,et al. The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices , 1999, SIAM J. Matrix Anal. Appl..
[11] John K. Reid,et al. The design of MA48: a code for the direct solution of sparse unsymmetric linear systems of equations , 1996, TOMS.
[12] E. Cuthill,et al. Reducing the bandwidth of sparse symmetric matrices , 1969, ACM '69.
[13] Jennifer A. Scott,et al. Ordering techniques for singly bordered block diagonal forms for unsymmetric parallel sparse direct solvers , 2005, Numer. Linear Algebra Appl..