Result: Algebraic and combinatorial graph theory for optimal structural analysis

Title:
Algebraic and combinatorial graph theory for optimal structural analysis
Authors:
Source:
Civil and structural engineering computing (Eisenstadt, 19-21 September 2001). :319-356
Publisher Information:
Edinburgh: Saxe-Coburg Publications, 2001.
Publication Year:
2001
Physical Description:
print, 82 ref
Original Material:
INIST-CNRS
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Structures and Hydro-Structures Research Center, Department of Civil Engineering, Iran University of Science and Technology, Narmak, Tehran, Iran, Islamic Republic of
Rights:
Copyright 2002 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Building. Public works. Transport. Civil engineering
Accession Number:
edscal.14194667
Database:
PASCAL Archive

Further Information

For an efficient analysis of structures, the corresponding matrices should be sparse, well conditioned, and well structured. Analysis having these properties for structural matrices is called an optimal analysis. Such analysis becomes more and more important as the number of nodes and members of the structure increases. In this paper, applications of graph theory, algebraic graph theory, and matroids are presented for optimal analysis of the structures. These methods are used either separately or in hybrid forms. Applications are extended to finite element nodal ordering using ten topological transformations.