Algebraic and combinatorial graph theory for optimal structural analysis

Authors:
A. Kaveh
Affiliations:
Structures and Hydro-Structures Research Center Department of Civil Engineering Iran University of Science and Technology, Narmak, Tehran, Iran
Venue:
Civil and structural engineering computing: 2001
Year:
2001

Citing 10
Cited 0

Direct methods for sparse matrices

Direct methods for sparse matrices
Transportation in graphs and the admittance spectrum

Discrete Applied Mathematics
A polynomial-time algorithm to find the shortest cycle basis of a graph

SIAM Journal on Computing
The union of matroids and the rigidity of frameworks

SIAM Journal on Discrete Mathematics
A new algorithm for finding a pseudoperipheral node in a graph

SIAM Journal on Matrix Analysis and Applications
A multi-level finite element nodal ordering using algebraic graph theory

Finite Elements in Analysis and Design
Automated Structural Analysis: An Introduction

Automated Structural Analysis: An Introduction
Reducing the bandwidth of sparse symmetric matrices

ACM '69 Proceedings of the 1969 24th national conference
A hybrid graph-genetic method for domain decomposition

Finite Elements in Analysis and Design
Graphs and Hypergraphs

Graphs and Hypergraphs

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.