A new approach to minimising the frontwidth in finite element calculations
暂无分享，去创建一个
[1] Youssef Saab,et al. Combinatorial optimization by stochastic evolution , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[2] Cecilia R. Aragon,et al. Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..
[3] Emile H. L. Aarts,et al. Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.
[4] Steven J. Fenves,et al. A two‐step approach to finite element ordering , 1983 .
[5] R. M. Mattheyses,et al. A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.
[6] William G. Poole,et al. An algorithm for reducing the bandwidth and profile of a sparse matrix , 1976 .
[7] J. A. George. Computer implementation of the finite element method , 1971 .
[8] Brian W. Kernighan,et al. An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..
[9] Bruce M. Irons,et al. A frontal solution program for finite element analysis , 1970 .
[10] E. Cuthill,et al. Reducing the bandwidth of sparse symmetric matrices , 1969, ACM '69.