Strength of Materials

, Volume 12, Issue 2, pp 208–210 | Cite as

Algorithm for renumbering nodal unknowns in the finite-element method

  • V. G. Borovik
Scientific-Technical Section
Received:
  • 25 Downloads

Keywords

Nodal Unknown 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature cited

  1. 1.
    R. Tewarson, Discharged Matrices [Russian translation], Mir, Moscow (1977).Google Scholar
  2. 2.
    R. Rosen, “Matrix bandwidth minimization”, in: Proc. 23rd Nat. Conf. ACM Publ., Brandon Systems Press, Princeton, New Jersey (1968), p. 68, pp. 585–595.Google Scholar
  3. 3.
    E. H. Cultil and J. McKee, “Reducing the bandwidth of sparse symmetric matrices,” in: Tech. Note ALM-40-69, Appl. Math. Lab. Naval Ship. Res. and Develop. Center, Washington, D. C. (1969).Google Scholar
  4. 4.
    R. J. Collins, “Bandwidth reduction by automatic renumbering”, Int. J. Num. Meth. Eng.,6, 345–356 (1973).Google Scholar

Copyright information

© Plenum Publishing Corporation 1980

Authors and Affiliations

  • V. G. Borovik
    • 1
  1. 1.Kiev Polytechnic InstituteKiev

Personalised recommendations