東華大學圖書館 |

Model Order Reduction for Multidisciplinary Design Optimization in Higher-Dimensional Parameter Spaces.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Model Order Reduction for Multidisciplinary Design Optimization in Higher-Dimensional Parameter Spaces./
作者:	Boncoraglio, Gabriele.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2021,
面頁冊數:	252 p.
附註:	Source: Dissertations Abstracts International, Volume: 83-03, Section: B.
Contained By:	Dissertations Abstracts International83-03B.
標題:	Computational mathematics. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28483298
ISBN:	9798505571392

Model Order Reduction for Multidisciplinary Design Optimization in Higher-Dimensional Parameter Spaces.
Boncoraglio, Gabriele.

Model Order Reduction for Multidisciplinary Design Optimization in Higher-Dimensional Parameter Spaces. - Ann Arbor : ProQuest Dissertations & Theses, 2021 - 252 p.

Source: Dissertations Abstracts International, Volume: 83-03, Section: B.

Thesis (Ph.D.)--Stanford University, 2021.

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

This thesis introduces a new framework for solving optimization problems efficiently in higher-dimensional parameter spaces constrained by partial differential equations (PDEs). These problems, such as optimal design and optimal control, have a central and vital role in industrial, technological, economic, medical, and environmental applications. Even though the state of numerical simulation for solving PDEs has reached impressive levels of maturity, enabling the prediction of complicated dynamics, solving these problems, especially large scale industrial problems, is computationally intensive. The problem is aggravated in a many-query scenario, such as PDE-constrained optimization, where the PDE is repeatedly solved for various configurations and design parameters. This situation is further complicated when the optimization problem has many design parameters, typical in industrial settings, where the computational cost can increase by potentially many orders of magnitude. To make the process of solving repeatedly large scale PDEs tractable, this dissertation employs projection-based reduced-order models (PROMs) based on the method of snapshots and proper orthogonal decomposition (POD). In recent years, PROMs have shown potential for solving complex parametric PDEs but with a relatively small number of design parameters. However, with a large number of design parameters, as in industrial PDE-constrained optimization problems, the large increase in computational cost due to the training in higher-dimensional parameter spaces and the PROMs' size makes the use of these surrogate models impractical.This dissertation introduces the concept of piecewise-global reduced-order basis and hyperreduced projection-based reduced-order models (HPROMs) to address these issues. This concept leverages inexpensive approximation models to significantly reduce the cost of solving, for instance, nonlinear PDE-constrained optimization problems in higher-dimensional parameter spaces. A piecewise-global HPROM, for a fixed level of the desired accuracy, is more computationally efficient than its counterpart approach based on a global HPROM. In fact, the piecewise-global model needs to be accurate only in a local region of the design space allowing the model to be of a smaller dimension. The proposed method is shown to find the optimal aerodynamic shape of a full aircraft configuration with roughly a 30-fold reduction in computational time for the optimization process compared to using a global HPROM.This dissertation also introduces the method of active manifold (AM) to mitigate the curse of dimensionality associated with high-dimensional design spaces during the PROMs training. The AM is discovered using a deep convolutional autoencoder for dimensionality reduction. It is proposed as a superior alternative to the concept of active subspace (AS), whose capabilities are limited by the associated affine approximation. It has the advantage of allowing the discovery of an approximation manifold of a lower dimension than an optimal, linear active subspace. Hence, it can reduce the computational cost of the offline phase associated with the construction of projection-based reduced-order models, reduce the number of iterations performed by an optimization procedure, and improve the computed solution's optimality. The AM method is shown to find the optimal solution to an optimization problem, reducing computational time and the dimension of design space compared to solving the problem using the AS method. The new approach is intertwined with the concepts of projection-based model order reduction, demonstrating the feasibility of the overall AM- and PROM-based computational framework for accelerating the solution of complex PDE-constrained optimization problems.To construct the AM for reducing the dimensionality of the optimization problem, instead of performing an empirical, a priori sampling, as proposed in the original AS method, this dissertation presents an alternative approach where the information is sampled by following the solution trajectory of an economical version of the optimization problem of interest. This strategy has the advantage of reducing the number of sampling points used to construct the AM and using information related to the optimization problem of interest, such as the problem constraints. The new sampling strategy is also applied to the method of active subspace, giving origin to a new take on the method of AS. The new take is shown to compute the AS in about half the time required by the original AS method. Additionally, the AS obtained using the new take on the method of AS is shown to outperform the AS obtained by the original AS method when solving a multidisciplinary design optimization (MDO) problem.

ISBN: 9798505571392Subjects--Topical Terms:

3683612
Computational mathematics.

Model Order Reduction for Multidisciplinary Design Optimization in Higher-Dimensional Parameter Spaces.
LDR:05910nmm a2200337 4500 001 2344796
005 20220531062142.5
008 241004s2021 ||||||||||||||||| ||eng d
020 $a 9798505571392
035 $a (MiAaPQ)AAI28483298
035 $a (MiAaPQ)STANFORDkp331vy7335
035 $a AAI28483298
040 $a MiAaPQ $c MiAaPQ
100 1 $a Boncoraglio, Gabriele. $3 3683611
245 1 0 $a Model Order Reduction for Multidisciplinary Design Optimization in Higher-Dimensional Parameter Spaces.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2021
300 $a 252 p.
500 $a Source: Dissertations Abstracts International, Volume: 83-03, Section: B.
500 $a Advisor: Farhat, Charbel; Alonso, Juan Jose; Hastie, Trevor.
502 $a Thesis (Ph.D.)--Stanford University, 2021.
506 $a This item must not be sold to any third party vendors.
520 $a This thesis introduces a new framework for solving optimization problems efficiently in higher-dimensional parameter spaces constrained by partial differential equations (PDEs). These problems, such as optimal design and optimal control, have a central and vital role in industrial, technological, economic, medical, and environmental applications. Even though the state of numerical simulation for solving PDEs has reached impressive levels of maturity, enabling the prediction of complicated dynamics, solving these problems, especially large scale industrial problems, is computationally intensive. The problem is aggravated in a many-query scenario, such as PDE-constrained optimization, where the PDE is repeatedly solved for various configurations and design parameters. This situation is further complicated when the optimization problem has many design parameters, typical in industrial settings, where the computational cost can increase by potentially many orders of magnitude. To make the process of solving repeatedly large scale PDEs tractable, this dissertation employs projection-based reduced-order models (PROMs) based on the method of snapshots and proper orthogonal decomposition (POD). In recent years, PROMs have shown potential for solving complex parametric PDEs but with a relatively small number of design parameters. However, with a large number of design parameters, as in industrial PDE-constrained optimization problems, the large increase in computational cost due to the training in higher-dimensional parameter spaces and the PROMs' size makes the use of these surrogate models impractical.This dissertation introduces the concept of piecewise-global reduced-order basis and hyperreduced projection-based reduced-order models (HPROMs) to address these issues. This concept leverages inexpensive approximation models to significantly reduce the cost of solving, for instance, nonlinear PDE-constrained optimization problems in higher-dimensional parameter spaces. A piecewise-global HPROM, for a fixed level of the desired accuracy, is more computationally efficient than its counterpart approach based on a global HPROM. In fact, the piecewise-global model needs to be accurate only in a local region of the design space allowing the model to be of a smaller dimension. The proposed method is shown to find the optimal aerodynamic shape of a full aircraft configuration with roughly a 30-fold reduction in computational time for the optimization process compared to using a global HPROM.This dissertation also introduces the method of active manifold (AM) to mitigate the curse of dimensionality associated with high-dimensional design spaces during the PROMs training. The AM is discovered using a deep convolutional autoencoder for dimensionality reduction. It is proposed as a superior alternative to the concept of active subspace (AS), whose capabilities are limited by the associated affine approximation. It has the advantage of allowing the discovery of an approximation manifold of a lower dimension than an optimal, linear active subspace. Hence, it can reduce the computational cost of the offline phase associated with the construction of projection-based reduced-order models, reduce the number of iterations performed by an optimization procedure, and improve the computed solution's optimality. The AM method is shown to find the optimal solution to an optimization problem, reducing computational time and the dimension of design space compared to solving the problem using the AS method. The new approach is intertwined with the concepts of projection-based model order reduction, demonstrating the feasibility of the overall AM- and PROM-based computational framework for accelerating the solution of complex PDE-constrained optimization problems.To construct the AM for reducing the dimensionality of the optimization problem, instead of performing an empirical, a priori sampling, as proposed in the original AS method, this dissertation presents an alternative approach where the information is sampled by following the solution trajectory of an economical version of the optimization problem of interest. This strategy has the advantage of reducing the number of sampling points used to construct the AM and using information related to the optimization problem of interest, such as the problem constraints. The new sampling strategy is also applied to the method of active subspace, giving origin to a new take on the method of AS. The new take is shown to compute the AS in about half the time required by the original AS method. Additionally, the AS obtained using the new take on the method of AS is shown to outperform the AS obtained by the original AS method when solving a multidisciplinary design optimization (MDO) problem.
590 $a School code: 0212.
650 4 $a Computational mathematics. $3 3683612
650 4 $a Families & family life. $3 3422406
650 4 $a Design optimization. $3 3681984
650 4 $a Skin. $3 843661
650 4 $a Partial differential equations. $3 2180177
650 4 $a Algorithms. $3 536374
650 4 $a Friendship. $3 611043
650 4 $a Design. $3 518875
650 4 $a Mathematics. $3 515831
650 4 $a Individual & family studies. $3 2122770
650 4 $a Morphology. $3 591167
690 $a 0287
690 $a 0389
690 $a 0628
690 $a 0405
710 2 $a Stanford University. $3 754827
773 0 $t Dissertations Abstracts International $g 83-03B.
790 $a 0212
791 $a Ph.D.
792 $a 2021
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28483298