A fast method for solving three-dimensional arbitrarily shaped inclusions in a half space

Kun Zhou; W. Wayne Chen; Leon M. Keer; Q. Jane Wang

doi:10.1016/j.cma.2008.10.021

A fast method for solving three-dimensional arbitrarily shaped inclusions in a half space

Kun Zhou, W. Wayne Chen, Leon M. Keer^*, Q. Jane Wang

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

101 Scopus citations

Abstract

This paper presents a fast method for solving the problem of three-dimensional arbitrarily shaped inclusions in an isotropic half space. The solution utilizes the closed-form solution for a cuboidal inclusion in an infinite space by breaking up the arbitrarily shaped inclusions into multiple cuboids. A combination of three-dimensional and two-dimensional fast Fourier transform algorithms is applied to evaluate the solution. Both theoretical estimates and computational tests demonstrate that the present method can achieve significant computational efficiency as well as effective data space reduction. Numerical results are also presented that show the applicability of the method to available solutions for error analysis and to new solutions.

Original language	English (US)
Pages (from-to)	885-892
Number of pages	8
Journal	Computer Methods in Applied Mechanics and Engineering
Volume	198
Issue number	9-12
DOIs	https://doi.org/10.1016/j.cma.2008.10.021
State	Published - Feb 15 2009

Keywords

Arbitrarily shaped
Fast Fourier transform
Half space
Inclusion

ASJC Scopus subject areas

Computational Mechanics
Mechanics of Materials
Mechanical Engineering
General Physics and Astronomy
Computer Science Applications

Access to Document

10.1016/j.cma.2008.10.021

Cite this

@article{62ea0c2020d64d2795287b87d3c80259,

title = "A fast method for solving three-dimensional arbitrarily shaped inclusions in a half space",

abstract = "This paper presents a fast method for solving the problem of three-dimensional arbitrarily shaped inclusions in an isotropic half space. The solution utilizes the closed-form solution for a cuboidal inclusion in an infinite space by breaking up the arbitrarily shaped inclusions into multiple cuboids. A combination of three-dimensional and two-dimensional fast Fourier transform algorithms is applied to evaluate the solution. Both theoretical estimates and computational tests demonstrate that the present method can achieve significant computational efficiency as well as effective data space reduction. Numerical results are also presented that show the applicability of the method to available solutions for error analysis and to new solutions.",

keywords = "Arbitrarily shaped, Fast Fourier transform, Half space, Inclusion",

author = "Kun Zhou and Chen, {W. Wayne} and Keer, {Leon M.} and Wang, {Q. Jane}",

note = "Funding Information: The authors would like to acknowledge the Timken Company for financial supports. ",

year = "2009",

month = feb,

day = "15",

doi = "10.1016/j.cma.2008.10.021",

language = "English (US)",

volume = "198",

pages = "885--892",

journal = "Computer Methods in Applied Mechanics and Engineering",

issn = "0045-7825",

publisher = "Elsevier",

number = "9-12",

}

TY - JOUR

T1 - A fast method for solving three-dimensional arbitrarily shaped inclusions in a half space

AU - Zhou, Kun

AU - Chen, W. Wayne

AU - Keer, Leon M.

AU - Wang, Q. Jane

N1 - Funding Information: The authors would like to acknowledge the Timken Company for financial supports.

PY - 2009/2/15

Y1 - 2009/2/15

N2 - This paper presents a fast method for solving the problem of three-dimensional arbitrarily shaped inclusions in an isotropic half space. The solution utilizes the closed-form solution for a cuboidal inclusion in an infinite space by breaking up the arbitrarily shaped inclusions into multiple cuboids. A combination of three-dimensional and two-dimensional fast Fourier transform algorithms is applied to evaluate the solution. Both theoretical estimates and computational tests demonstrate that the present method can achieve significant computational efficiency as well as effective data space reduction. Numerical results are also presented that show the applicability of the method to available solutions for error analysis and to new solutions.

AB - This paper presents a fast method for solving the problem of three-dimensional arbitrarily shaped inclusions in an isotropic half space. The solution utilizes the closed-form solution for a cuboidal inclusion in an infinite space by breaking up the arbitrarily shaped inclusions into multiple cuboids. A combination of three-dimensional and two-dimensional fast Fourier transform algorithms is applied to evaluate the solution. Both theoretical estimates and computational tests demonstrate that the present method can achieve significant computational efficiency as well as effective data space reduction. Numerical results are also presented that show the applicability of the method to available solutions for error analysis and to new solutions.

KW - Arbitrarily shaped

KW - Fast Fourier transform

KW - Half space

KW - Inclusion

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

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

U2 - 10.1016/j.cma.2008.10.021

DO - 10.1016/j.cma.2008.10.021

M3 - Article

AN - SCOPUS:58349101757

SN - 0045-7825

VL - 198

SP - 885

EP - 892

JO - Computer Methods in Applied Mechanics and Engineering

JF - Computer Methods in Applied Mechanics and Engineering

IS - 9-12

ER -

A fast method for solving three-dimensional arbitrarily shaped inclusions in a half space

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this