Computational Technology Resources - CCP

Keywords: level set method, parallel fast marching, domain decomposition, signed distance, contact mechanics.

Summary

This paper presents a parallel library supporting large scale engineering problems which deal with free boundaries and distance computation using efficient solvers for level set methods and Eikonal equations. Some applications that will benefit from such a framework are design and material optimization, contact problems, modelling of flood lakes, air pollution simulation, combustion modeling, computer vision or image registration. All the mentioned problems share a common drawback: limited problem size and computational speed. Both these factors are taken into account in the design of efficient parallel algorithms. Another important aspect is the ease of use, which is also taken care of in our code design.

The first part of this paper deals with design of a new parallel algorithm for fast marching methods based on the domain decomposition approach. The newly designed algorithm is created in a way that avoids most of the communication. Our parallel fast marching algorithm is based on the simple idea of setting appropriate boundary condition for each subdomain, so that the fast marching has sufficient data to run the computation independently.

The second part of this paper presents our parallel level set library. This library is based on the parallel level set method and our parallel fast marching method. An important part of the library consist of the programming interface used to provide easy connection to our third party libraries.

The last part of this paper presents an existing application of the parallel level set library in contact mechanics. Our library is already used by UG solver library developed at ISC in Lugano.

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 £40 +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: 101 PROCEEDINGS OF THE THIRD INTERNATIONAL CONFERENCE ON PARALLEL, DISTRIBUTED, GRID AND CLOUD COMPUTING FOR ENGINEERING Edited by: Paper 4 A Parallel Library for Level Set Methods with Application to Contact Mechanics P. Kotas¹, V. Vondrak¹, R. Croce², V. Poletti² and R. Krause² ¹Department of Applied Mathematics, VSB - Technical University of Ostrava, Ostrava - Poruba, Czech Republic ²Institute of Computational Science, USI Università della Svizzera Italiana, Lugano, Switzerland doi:10.4203/ccp.101.4 purchase the full-text of this paper Full Bibliographic Reference for this paper P. Kotas, V. Vondrak, R. Croce, V. Poletti, R. Krause, "A Parallel Library for Level Set Methods with Application to Contact Mechanics", in , (Editors), "Proceedings of the Third International Conference on Parallel, Distributed, Grid and Cloud Computing for Engineering", Civil-Comp Press, Stirlingshire, UK, Paper 4, 2013. doi:10.4203/ccp.101.4 Keywords: level set method, parallel fast marching, domain decomposition, signed distance, contact mechanics. Summary This paper presents a parallel library supporting large scale engineering problems which deal with free boundaries and distance computation using efficient solvers for level set methods and Eikonal equations. Some applications that will benefit from such a framework are design and material optimization, contact problems, modelling of flood lakes, air pollution simulation, combustion modeling, computer vision or image registration. All the mentioned problems share a common drawback: limited problem size and computational speed. Both these factors are taken into account in the design of efficient parallel algorithms. Another important aspect is the ease of use, which is also taken care of in our code design. The first part of this paper deals with design of a new parallel algorithm for fast marching methods based on the domain decomposition approach. The newly designed algorithm is created in a way that avoids most of the communication. Our parallel fast marching algorithm is based on the simple idea of setting appropriate boundary condition for each subdomain, so that the fast marching has sufficient data to run the computation independently. The second part of this paper presents our parallel level set library. This library is based on the parallel level set method and our parallel fast marching method. An important part of the library consist of the programming interface used to provide easy connection to our third party libraries. The last part of this paper presents an existing application of the parallel level set library in contact mechanics. Our library is already used by UG solver library developed at ISC in Lugano. 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 £40 +P&P)
Back to top	©Civil-Comp Limited 2023 - terms & conditions