Computational Technology Resources - CCP

Paper V.1

A Graph Theoretical Method for Frontwidth Reduction

A. Kaveh* and G.R. Roosta#

*Iran University of Science and Technology, Tehran, Iran
#Building and Housing Research Centre, Tehran, Iran

doi:10.4203/ccp.39.5.1

A. Kaveh, G.R. Roosta, "A Graph Theoretical Method for Frontwidth Reduction", in B.H.V. Topping, (Editor), "Advances in Finite Element Technology", Civil-Comp Press, Edinburgh, UK, pp 245-253, 1996. doi:10.4203/ccp.39.5.1

Abstract

A graph theoretical approach is designed for element renumbering of finite element meshes for frontwidth reduction of sparse matrices with symmetric structures. In this heuristic, the problem is transformed into that of a graph nodal ordering. The incidence graph of a mesh is used for representing its connectivity. The efficiency of the method is illustrated through worst-case analysis and 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 £85 +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: 39 ADVANCES IN FINITE ELEMENT TECHNOLOGY Edited by: B.H.V. Topping Paper V.1 A Graph Theoretical Method for Frontwidth Reduction A. Kaveh* and G.R. Roosta# *Iran University of Science and Technology, Tehran, Iran #Building and Housing Research Centre, Tehran, Iran doi:10.4203/ccp.39.5.1 purchase the full-text of this paper Full Bibliographic Reference for this paper A. Kaveh, G.R. Roosta, "A Graph Theoretical Method for Frontwidth Reduction", in B.H.V. Topping, (Editor), "Advances in Finite Element Technology", Civil-Comp Press, Edinburgh, UK, pp 245-253, 1996. doi:10.4203/ccp.39.5.1 Abstract A graph theoretical approach is designed for element renumbering of finite element meshes for frontwidth reduction of sparse matrices with symmetric structures. In this heuristic, the problem is transformed into that of a graph nodal ordering. The incidence graph of a mesh is used for representing its connectivity. The efficiency of the method is illustrated through worst-case analysis and 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 £85 +P&P)
Back to top	©Civil-Comp Limited 2023 - terms & conditions