Skip to main content
SpringerLink
Log in

The optimization algorithms of network node relabeling for large finite elements program system

  • Published:
Applied Mathematics and Mechanics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Jennings, A., A compact storage scheme for the solution of Symmetric linear simultaneous equations,Compt. J. 9. (1966), 281–285.

    Google Scholar 

  2. Purgemieniecki, J. S., Theory of Matrix Structural Analysis, (1968).

  3. Wilkinson, J. H., Reinsch, C., Linear Algebra, (1971_.

  4. Cuthill, E. and McKee, J., Reducing the bandwidth of sparse symmetric matrices,Proc. 24th Nat. Conf. of the ACM, ACM Publ. 69, Association for Computing Machinery, New York, (1969), 157–172.

    Google Scholar 

  5. Liu Wai-hung and Sherman, A. H., Comparative Analysis of the Cuthill-McKee and the Reverse Cuthill-McKee ordering algorithms for sparse matrices,SIAM J. Numer. Anal., 13, 2, (1976), 196–213.

    Google Scholar 

  6. Gibbs, N. E., Poole, Jr, W. G. and Stockmeyer, Paul K., An algorithm for reducing the bandwidth and profile of a sparse matrix.SIAM J. Numer. Aual, 13, 2, (1976), 236–250.

    Google Scholar 

  7. 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.

    Google Scholar 

  8. Rosen, R., Matrix bandwidth minimization,Proc. 23rd Nat. Conf. ACM Publ. 68, 585–595. Brandon Systems Press, Princeton, New Jersey, (1968).

    Google Scholar 

  9. Grooms, H. R., Algorithm for matrix bandwidth reduction,ASCE, J. Struct. Div. 98, STI (1972), 203–214.

    Google Scholar 

  10. Rodrigues, J. S., Node numbering optimization in structural analysis,Proc. ASCE, Jour. Struc. Div. 101, ST2, (1975), 361–376.

    Google Scholar 

  11. Akyuz, F. A., and Utku, S., An automatic relabeling scheme for bandwidth minimization of stiffness matrices,J. Amer. Inst. Aeronout. Astronaut., 6 (1968), 728–730.

    Google Scholar 

  12. Selutions of Large Sparse Systems of Linear Equations,Shanghai Institute of Computer Technology, (1978), (to be published).

  13. Hua, Bo-hao, Ye, Wen-long, A general purpose program SAPFEM in finite element structural analysis,Shanghai Mechanics, 1, 1 (1980).

Download references

Author information

Authors and Affiliations

  1. Shanghai Institute of Computer Technology, Shanghai

    Hua Bo-hao

Authors
  1. Hua Bo-hao
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by Xu Ci-da

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bo-hao, H. The optimization algorithms of network node relabeling for large finite elements program system. Appl Math Mech 2, 225–236 (1981). https://doi.org/10.1007/BF01876781

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01876781

Keywords

Search

Navigation