A formal theory for estimating defeaturing-induced engineering analysis errors

Authors:
Sankara Hari Gopalakrishnan;Krishnan Suresh
Affiliations:
Department of Mechanical Engineering, University of Wisconsin, Madison, WI 53706, United States;Department of Mechanical Engineering, University of Wisconsin, Madison, WI 53706, United States
Venue:
Computer-Aided Design
Year:
2007

Citing 3
Cited 2

Iterative Methods for Sparse Linear Systems

Iterative Methods for Sparse Linear Systems
A small feature suppression/unsuppression system for preparing B-rep models for analysis

Proceedings of the 2005 ACM symposium on Solid and physical modeling
Concepts and Applications of Finite Element Analysis

Concepts and Applications of Finite Element Analysis

Estimating defeaturing-induced engineering analysis errors for arbitrary 3D features

Computer-Aided Design
Engineering analysis error estimation when removing finite-sized features in nonlinear elliptic problems

Computer-Aided Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

Defeaturing is a popular CAD/CAE simplification technique that suppresses 'small or irrelevant features' within a CAD model to speed-up downstream processes such as finite element analysis. Unfortunately, defeaturing inevitably leads to analysis errors that are not easily quantifiable within the current theoretical framework. In this paper, we provide a rigorous theory for swiftly computing such defeaturing-induced engineering analysis errors. In particular, we focus on problems where the features being suppressed are cutouts of arbitrary shape and size within the body. The proposed theory exploits the adjoint formulation of boundary value problems to arrive at strict bounds on defeaturing induced analysis errors. The theory is illustrated through numerical examples.