Computational Technology Resources - CCP

Paper III.1

Graph Theoretical Methods for Profile Reduction

A. Kaveh and G.R. Roosta

Iran University of Science and Technology, Tehran, Iran

doi:10.4203/ccp.50.3.1

A. Kaveh, G.R. Roosta, "Graph Theoretical Methods for Profile Reduction", in B.H.V. Topping, M.B. Leeming, (Editors), "Innovation in Computer Methods for Civil and Structural Engineering", Civil-Comp Press, Edinburgh, UK, pp 43-50, 1997. doi:10.4203/ccp.50.3.1

Abstract

This paper employs nine graph models with an efficient strategy for nodal ordering of finite element meshes in order to construct different graph theoretical algorithms for the profile reduction of sparse matrices with symmetric structures. The efficiency of the algorithms are compared through examples of unstructured finite element models.

purchase the full-text of this paper (price £20)

go to the previous paper
go to the next paper
return to the table of contents
return to the book description
purchase this book (price £52 +P&P)

	Computational & Technology Resources an online resource for computational, engineering & technology publications
	not logged in - login
Front Page Browse CCP CSETS CTR IJRT Other Authors Search Purchase Guide FAQ Contact us	Civil-Comp Proceedings ISSN 1759-3433 CCP: 50 INNOVATION IN COMPUTER METHODS FOR CIVIL AND STRUCTURAL ENGINEERING Edited by: B.H.V. Topping and M.B. Leeming Paper III.1 Graph Theoretical Methods for Profile Reduction A. Kaveh and G.R. Roosta Iran University of Science and Technology, Tehran, Iran doi:10.4203/ccp.50.3.1 purchase the full-text of this paper Full Bibliographic Reference for this paper A. Kaveh, G.R. Roosta, "Graph Theoretical Methods for Profile Reduction", in B.H.V. Topping, M.B. Leeming, (Editors), "Innovation in Computer Methods for Civil and Structural Engineering", Civil-Comp Press, Edinburgh, UK, pp 43-50, 1997. doi:10.4203/ccp.50.3.1 Abstract This paper employs nine graph models with an efficient strategy for nodal ordering of finite element meshes in order to construct different graph theoretical algorithms for the profile reduction of sparse matrices with symmetric structures. The efficiency of the algorithms are compared through examples of unstructured finite element models. purchase the full-text of this paper (price £20) go to the previous paper go to the next paper return to the table of contents return to the book description purchase this book (price £52 +P&P)
Back to top	©Civil-Comp Limited 2023 - terms & conditions