Skip navigation

Comparison of three algorithms for nonlinear metal cutting problems

Comparison of three algorithms for nonlinear metal cutting problems

Palansuriya, C., Lai, C-H. ORCID: 0000-0002-7558-6398, Ierotheou, C., Pericleous, K. ORCID: 0000-0002-7426-9999 and Keyes, D. (1999) Comparison of three algorithms for nonlinear metal cutting problems. In: 11th International Conference on Domain Decomposition Methods in Sciences and Engineering, 1999, Bergen, Norway.

Full text not available from this repository.


This paper compares three alternative numerical algorithms applied to a nonlinear metal cutting problem. One algorithm is based on an explicit method and the other two are implicit. Domain decomposition (DD) is used to break the original domain into subdomains, each containing a properly connected, well-formulated and continuous subproblem. The serial version of the explicit algorithm is implemented in FORTRAN and its parallel version uses MPI (Message Passing Interface) calls. One implicit algorithm is implemented by coupling the state-of-the-art PETSc (Portable, Extensible Toolkit for Scientific Computation) software with in-house software in order to solve the subproblems. The second implicit algorithm is implemented completely within PETSc. PETSc uses MPI as the underlying communication library. Finally, a 2D example is used to test the algorithms and various comparisons are made.

Item Type: Conference or Conference Paper (Paper)
Pre-2014 Departments: School of Computing & Mathematical Sciences
Last Modified: 02 Mar 2019 15:49
Selected for GREAT 2016: None
Selected for GREAT 2017: None
Selected for GREAT 2018: None
Selected for GREAT 2019: None
Selected for REF2021: None

Actions (login required)

View Item View Item