Молимо вас користите овај идентификатор за цитирање или овај линк до ове ставке: https://open.uns.ac.rs/handle/123456789/12267
Назив: Algorithm for peripheral joint search in renumbering shemes by the finite element method
Аутори: Kovačević D.
Folić R.
Датум издавања: 1-дец-1994
Часопис: International Conference on Computational Structures Technology - Proceedings
Сажетак: 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
Налази се у колекцијама:Naučne i umetničke publikacije

Приказати целокупан запис ставки

Преглед/и станица

11
Протекла недеља
11
Протекли месец
0
проверено 03.05.2024.

Google ScholarTM

Проверите


Ставке на DSpace-у су заштићене ауторским правима, са свим правима задржаним, осим ако није другачије назначено.