메뉴 건너뛰기
소속 기관 / 학교 인증
인증하면 논문, 학술자료 등을  무료로 열람할 수 있어요.
한국대학교, 누리자동차, 시립도서관 등 나의 기관을 확인해보세요
(국내 대학 90% 이상 구독 중)
고객센터 ENG
주제분류

순차 및 병렬처리 환경에서 효율적인 다분야통합최적설계 문제 해결 방법 An Efficient Solution Method to MDO Problems in Sequential and Parallel Computing Environments

논문 기본 정보

저자정보
(서울시립대학교)
저널정보
(사)한국CDE학회 한국CDE학회 논문집 한국CAD/CAM학회 논문집 제16권 제3호
발행연도
수록면
236 - 245 (10page)
오류 신고하기

피인용 0

순차 및 병렬처리 환경에서 효율적인 다분야통합최적설계 문제 해결 방법
검색

    초록·키워드

    Many researchers have recently studied multi-level formulation strategies to solve the MDO problems and they basically distributed the coupling compatibilities across all disciplines, while single-level formulations concentrate all the controls at the system-level. In addition, approximation techniques became remedies for computationally expensive analyses and simulations. This paper studies comparisons of the MDO methods with respect to computing performance considering both conventional sequential and modern distributed/parallel processing environments. The comparisons show Individual Disciplinary Feasible (IDF) formulation is the most efficient for sequential processing and IDF with approximation (IDFa) is the most efficient for parallel processing. Results incorporating two popular design examples show this finding. The author suggests design engineers should firstly choose IDF formulation to solve MDO problems because of its simplicity of implementation and not-bad performance. A single drawback of IDF is requiring more memory for local design variables and coupling variables. Adding cheap memories can save engineers valuable time and effort for complicated multilevel formulations and let them free out of no solution headache of Multi-Disciplinary Analysis (MDA) of the Multi-Disciplinary Feasible (MDF) formulation.

    최근 본 자료 전체보기