Please use this identifier to cite or link to this item: https://open.uns.ac.rs/handle/123456789/12267
Title: Algorithm for peripheral joint search in renumbering shemes by the finite element method
Authors: Kovačević D.
Folić R.
Issue Date: 1-Dec-1994
Journal: International Conference on Computational Structures Technology - Proceedings
Abstract: The paper describe possibilities for increase of the numerical efficiency of structural computation on the basis of the improvement of renumbering method of finite element system joints. It is shown that the modified Cuthill-McKee (MCM) algorithm could serve, among others, in determination of so-called peripheral or pseudo-peripheral joint of the graph by which the finite elements system is approximated. In several numerical examples the advantages of application of the MCM algorithm in relation to the well known Gibbs-Poole-Stockmayer (GPS) method are illustrated. In addition, the numerical aspects of application of the finite elements method and importance of selection of the optimum algorithm for solution of equations system with view to the actual courses in the software and hardware development in small computer systems branch, are considered.
URI: https://open.uns.ac.rs/handle/123456789/12267
Appears in Collections:Naučne i umetničke publikacije

Show full item record

Page view(s)

11
Last Week
11
Last month
0
checked on May 3, 2024

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.