The Network Node Relabeling Optimum Algorithms for Large Finite Element Program System

Hua Bo-hao

Article Contents

Article Navigation > Applied Mathematics and Mechanics > 1981 > 2(2): 207-218

Hua Bo-hao. The Network Node Relabeling Optimum Algorithms for Large Finite Element Program System[J]. Applied Mathematics and Mechanics, 1981, 2(2): 207-218.

Citation:

Hua Bo-hao. The Network Node Relabeling Optimum Algorithms for Large Finite Element Program System[J]. Applied Mathematics and Mechanics, 1981, 2(2): 207-218.

Citation:

Hua Bo-hao. The Network Node Relabeling Optimum Algorithms for Large Finite Element Program System[J]. Applied Mathematics and Mechanics, 1981, 2(2): 207-218.

PDF( 680 KB)

The Network Node Relabeling Optimum Algorithms for Large Finite Element Program System

Hua Bo-hao

Shanghai Institute of Computer Technology, Shanghai

Received Date: 1980-03-18
Publish Date: 1981-04-15

Abstract

Abstract

This paper describes the optimization algorithms of network node relabeling relating to large finite elements program system mainly during the period from 1968 to 1976. Some computation techniques of the application of these algorithms are discussed and a more efficient executive program of RCM algorithm is given for application.

FullText(HTML)

References(17)

References

[1]	Jennings,A.,A compact storage scheme for the solution of Symmetric linear simultaneous equations,Compt.J.9. (1966),281-285.
[2]	曹志浩,大型线性方程集的直接解法,复旦学报,(1974.1).
[3]	徐次达、华伯浩、王远功,薄壳有限元混合法与求解程序,计算技术通讯,(1978.3)
[4]	J S,普齐米尼斯基,《矩阵结构分析理论》,国防工业出版社,(1974).
[5]	结构和连续力学中的有限单体法,上海交通大学《有限单体法》翻译组.
[6]	Wilkinson,J. H.,Reinsch, C., Linear Algebra (1971).
[7]	唐伟枫,有限元分析的分批波阵法程序,全国机械学会有限元会议,(1978.12).
[8]	Cuthill, E, and Mckee, J.,Reducing the bandwidth of sparse symmetric matrices,Proc. 24th Nat Conf, of the ACM, ACM Publ, gg, Association for Computing Machinery, New york, (1969) 157-172.
[9]	Liu Wai-hung and Sherman, A.H.,Comparative analysis of the Cuthill-Mckee and the reverse Cuthill-Mckee ordering algorithms for sparse matrices, SJAM J.Numer.Anal,13.2(1976). 198-213.
[10]	Gibbs, N.E,,Poole, Jr.,W.G, and Stcckmeyer, Paul K.An algorithm for reducing the bandwidth and profile of a sparse matriB, SIAM I.Numer Anal, 13.2(1976). 236-250.
[11]	Akhras, G, and Dhatt, G.,An automatic node relabeling scheme for minimizing a matrix or network bandwidth, Int, J. Num, Math, Engng, 10. 4.(1976). 787-797.
[12]	Rosen, R,,Matrix bandwidth minimization Proc, l3 rd Nat‘Conf.ACM Publ.68. 585-595.Brandon Systems Press, Princeton, New Jersey, (1968).
[13]	Grooms, H, R,,Algorithm for matrix bandwidth reduction, ASCE, J.Struct, Div.g8, ST1. (1972), 203-214.
[14]	Rodrigues, J.5 Node numbering optimization in structural analysis, Proc. ASCE,Jour.Struc, Div, 101,ST2,(1975). 361-376.
[15]	Akyuz, F.A.and Utku, S,,An automatic relabeling scheme for bandwidth minimization of stiffness matrices, J.Amer 1 nst.Aeronaut.Astronaut, 6,(1968).728-730.
[16]	弹性薄壳有限单元混合法强度分析,上海市计算技术研究所、上海同济大学工程力学研究室等合编(1976.8)
[17]	大型稀疏线性方程组的解法,上海计算技术研究所,(1978).(待出版).