Topology optimization of 2D continua for minimum compliance using parallel computing

A. Mahdavi, R. Balaji, Mary I. Frecker, Eric M. Mockensturm

Research output: Contribution to journalArticle

27 Citations (Scopus)

Abstract

Topology optimization is often used in the conceptual design stage as a preprocessing tool to obtain overall material distribution in the solution domain. The resulting topology is then used as an initial guess for shape optimization. It is always desirable to use fine computational grids to obtain high-resolution layouts that minimize the need for shape optimization and postprocessing (Bendsoe and Sigmund, Topology optimization theory, methods and applications. Springer, Berlin Heidelberg New York 2003), but this approach results in high computation cost and is prohibitive for large structures. In the present work, parallel computing in combination with domain decomposition is proposed to reduce the computation time of such problems. The power law approach is used as the material distribution method, and an optimality criteria-based optimizer is used for locating the optimum solution [Sigmund (2001)21:120-127; Rozvany and Olhoff, Topology optimization of structures and composites continua. Kluwer, Norwell 2000]. The equilibrium equations are solved using a preconditioned conjugate gradient algorithm. These calculations have been done using a master-slave programming paradigm on a coarse-grain, multiple instruction multiple data, shared-memory architecture. In this study, by avoiding the assembly of the global stiffness matrix, the memory requirement and computation time has been reduced. The results of the current study show that the parallel computing technique is a valuable tool for solving computationally intensive topology optimization problems.

Original languageEnglish (US)
Pages (from-to)121-132
Number of pages12
JournalStructural and Multidisciplinary Optimization
Volume32
Issue number2
DOIs
StatePublished - Aug 1 2006

Fingerprint

Topology Optimization
Shape optimization
Parallel processing systems
Parallel Computing
Compliance
Continuum
Shape Optimization
Preconditioned Conjugate Gradient
Conjugate Gradient Algorithm
Optimization Theory
Computational Grid
Conceptual Design
Optimality Criteria
Guess
Domain Decomposition
Stiffness Matrix
Shared Memory
Post-processing
Preprocessing
Layout

All Science Journal Classification (ASJC) codes

  • Software
  • Control and Systems Engineering
  • Computer Science Applications
  • Computer Graphics and Computer-Aided Design
  • Control and Optimization

Cite this

@article{16b9f51560ef408a8dca35a4c02b5670,
title = "Topology optimization of 2D continua for minimum compliance using parallel computing",
abstract = "Topology optimization is often used in the conceptual design stage as a preprocessing tool to obtain overall material distribution in the solution domain. The resulting topology is then used as an initial guess for shape optimization. It is always desirable to use fine computational grids to obtain high-resolution layouts that minimize the need for shape optimization and postprocessing (Bendsoe and Sigmund, Topology optimization theory, methods and applications. Springer, Berlin Heidelberg New York 2003), but this approach results in high computation cost and is prohibitive for large structures. In the present work, parallel computing in combination with domain decomposition is proposed to reduce the computation time of such problems. The power law approach is used as the material distribution method, and an optimality criteria-based optimizer is used for locating the optimum solution [Sigmund (2001)21:120-127; Rozvany and Olhoff, Topology optimization of structures and composites continua. Kluwer, Norwell 2000]. The equilibrium equations are solved using a preconditioned conjugate gradient algorithm. These calculations have been done using a master-slave programming paradigm on a coarse-grain, multiple instruction multiple data, shared-memory architecture. In this study, by avoiding the assembly of the global stiffness matrix, the memory requirement and computation time has been reduced. The results of the current study show that the parallel computing technique is a valuable tool for solving computationally intensive topology optimization problems.",
author = "A. Mahdavi and R. Balaji and Frecker, {Mary I.} and Mockensturm, {Eric M.}",
year = "2006",
month = "8",
day = "1",
doi = "10.1007/S00158-006-0006-1",
language = "English (US)",
volume = "32",
pages = "121--132",
journal = "Structural and Multidisciplinary Optimization",
issn = "1615-147X",
publisher = "Springer Verlag",
number = "2",

}

Topology optimization of 2D continua for minimum compliance using parallel computing. / Mahdavi, A.; Balaji, R.; Frecker, Mary I.; Mockensturm, Eric M.

In: Structural and Multidisciplinary Optimization, Vol. 32, No. 2, 01.08.2006, p. 121-132.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Topology optimization of 2D continua for minimum compliance using parallel computing

AU - Mahdavi, A.

AU - Balaji, R.

AU - Frecker, Mary I.

AU - Mockensturm, Eric M.

PY - 2006/8/1

Y1 - 2006/8/1

N2 - Topology optimization is often used in the conceptual design stage as a preprocessing tool to obtain overall material distribution in the solution domain. The resulting topology is then used as an initial guess for shape optimization. It is always desirable to use fine computational grids to obtain high-resolution layouts that minimize the need for shape optimization and postprocessing (Bendsoe and Sigmund, Topology optimization theory, methods and applications. Springer, Berlin Heidelberg New York 2003), but this approach results in high computation cost and is prohibitive for large structures. In the present work, parallel computing in combination with domain decomposition is proposed to reduce the computation time of such problems. The power law approach is used as the material distribution method, and an optimality criteria-based optimizer is used for locating the optimum solution [Sigmund (2001)21:120-127; Rozvany and Olhoff, Topology optimization of structures and composites continua. Kluwer, Norwell 2000]. The equilibrium equations are solved using a preconditioned conjugate gradient algorithm. These calculations have been done using a master-slave programming paradigm on a coarse-grain, multiple instruction multiple data, shared-memory architecture. In this study, by avoiding the assembly of the global stiffness matrix, the memory requirement and computation time has been reduced. The results of the current study show that the parallel computing technique is a valuable tool for solving computationally intensive topology optimization problems.

AB - Topology optimization is often used in the conceptual design stage as a preprocessing tool to obtain overall material distribution in the solution domain. The resulting topology is then used as an initial guess for shape optimization. It is always desirable to use fine computational grids to obtain high-resolution layouts that minimize the need for shape optimization and postprocessing (Bendsoe and Sigmund, Topology optimization theory, methods and applications. Springer, Berlin Heidelberg New York 2003), but this approach results in high computation cost and is prohibitive for large structures. In the present work, parallel computing in combination with domain decomposition is proposed to reduce the computation time of such problems. The power law approach is used as the material distribution method, and an optimality criteria-based optimizer is used for locating the optimum solution [Sigmund (2001)21:120-127; Rozvany and Olhoff, Topology optimization of structures and composites continua. Kluwer, Norwell 2000]. The equilibrium equations are solved using a preconditioned conjugate gradient algorithm. These calculations have been done using a master-slave programming paradigm on a coarse-grain, multiple instruction multiple data, shared-memory architecture. In this study, by avoiding the assembly of the global stiffness matrix, the memory requirement and computation time has been reduced. The results of the current study show that the parallel computing technique is a valuable tool for solving computationally intensive topology optimization problems.

UR - http://www.scopus.com/inward/record.url?scp=49649109242&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=49649109242&partnerID=8YFLogxK

U2 - 10.1007/S00158-006-0006-1

DO - 10.1007/S00158-006-0006-1

M3 - Article

AN - SCOPUS:49649109242

VL - 32

SP - 121

EP - 132

JO - Structural and Multidisciplinary Optimization

JF - Structural and Multidisciplinary Optimization

SN - 1615-147X

IS - 2

ER -