東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Computational Feasibility of Simulta...

O'Connor, Justin.

FindBook

Google Book

Amazon

博客來

Computational Feasibility of Simultaneous Analysis and Design in Interior Point Topology Optimization.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Computational Feasibility of Simultaneous Analysis and Design in Interior Point Topology Optimization./
作者:	O'Connor, Justin.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2023,
面頁冊數:	113 p.
附註:	Source: Dissertations Abstracts International, Volume: 85-02, Section: A.
Contained By:	Dissertations Abstracts International85-02A.
標題:	Mathematics. -
電子資源:	https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=30316497
ISBN:	9798380121347

Computational Feasibility of Simultaneous Analysis and Design in Interior Point Topology Optimization.
O'Connor, Justin.

Computational Feasibility of Simultaneous Analysis and Design in Interior Point Topology Optimization. - Ann Arbor : ProQuest Dissertations & Theses, 2023 - 113 p.

Source: Dissertations Abstracts International, Volume: 85-02, Section: A.

Thesis (Ph.D.)--Colorado State University, 2023.

This item must not be sold to any third party vendors.

Topology optimization is a class of algorithms designed to optimize a design or structure to accomplish some goal. It is part of a process of computer generated design that allows engineers to design better products faster. One such algorithm that has piqued the imagination of developers is called Simultaneous Analysis and Design (SAND), especially in the context of Interior Point Optimization (IPO). This method is known to generate extremely optimal designs, and is good at avoiding local minima. However, this method is not used in practice, due to its computational cost. This thesis examines the SAND IPO method, and develops an effective algorithm to generate a design using it. I begin by discussing nonlinear optimization algorithms, selecting pieces that work together for this problem, to generate a cohesive algorithm for the whole process. Inside this developed algorithm, as with most nonlinear optimization algorithms, the most expensive part is a linear solve. In my case, it is a linear solve of a block system. I develop and implement a multi-tier preconditioning approach to solve this system in a reasonable amount of time. Finally, I present a large topology optimization problem presented in three dimensions that has been solved using IPO and SAND, demonstrating the usability of the implemented algorithm.

ISBN: 9798380121347Subjects--Topical Terms:

515831
Mathematics.
Subjects--Index Terms:

Simultaneous Analysis and Design

Computational Feasibility of Simultaneous Analysis and Design in Interior Point Topology Optimization.
LDR:02586nmm a2200385 4500 001 2393610
005 20240414211451.5
006 m o d
007 cr#unu||||||||
008 251215s2023 ||||||||||||||||| ||eng d
020 $a 9798380121347
035 $a (MiAaPQ)AAI30316497
035 $a AAI30316497
040 $a MiAaPQ $c MiAaPQ
100 1 $a O'Connor, Justin. $3 575878
245 1 0 $a Computational Feasibility of Simultaneous Analysis and Design in Interior Point Topology Optimization.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2023
300 $a 113 p.
500 $a Source: Dissertations Abstracts International, Volume: 85-02, Section: A.
500 $a Advisor: Bangerth, Wolfgang.
502 $a Thesis (Ph.D.)--Colorado State University, 2023.
506 $a This item must not be sold to any third party vendors.
520 $a Topology optimization is a class of algorithms designed to optimize a design or structure to accomplish some goal. It is part of a process of computer generated design that allows engineers to design better products faster. One such algorithm that has piqued the imagination of developers is called Simultaneous Analysis and Design (SAND), especially in the context of Interior Point Optimization (IPO). This method is known to generate extremely optimal designs, and is good at avoiding local minima. However, this method is not used in practice, due to its computational cost. This thesis examines the SAND IPO method, and develops an effective algorithm to generate a design using it. I begin by discussing nonlinear optimization algorithms, selecting pieces that work together for this problem, to generate a cohesive algorithm for the whole process. Inside this developed algorithm, as with most nonlinear optimization algorithms, the most expensive part is a linear solve. In my case, it is a linear solve of a block system. I develop and implement a multi-tier preconditioning approach to solve this system in a reasonable amount of time. Finally, I present a large topology optimization problem presented in three dimensions that has been solved using IPO and SAND, demonstrating the usability of the implemented algorithm.
590 $a School code: 0053.
650 4 $a Mathematics. $3 515831
650 4 $a Mathematics education. $3 641129
650 4 $a Theoretical mathematics. $3 3173530
653 $a Simultaneous Analysis and Design
653 $a Interior Point Optimization
653 $a Cohesive algorithm
653 $a Topology optimization
690 $a 0405
690 $a 0642
690 $a 0280
710 2 $a Colorado State University. $b Mathematics. $3 1683531
773 0 $t Dissertations Abstracts International $g 85-02A.
790 $a 0053
791 $a Ph.D.
792 $a 2023
793 $a English
856 4 0 $u https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=30316497