Please use this identifier to cite or link to this item:
|Title:||Real-time optimization using proper orthogonal decomposition: Free surface shape prediction due to underwater bubble dynamics|
|Citation:||My-Ha, D., Lim, K.M., Khoo, B.C., Willcox, K. (2007-03). Real-time optimization using proper orthogonal decomposition: Free surface shape prediction due to underwater bubble dynamics. Computers and Fluids 36 (3) : 499-512. ScholarBank@NUS Repository. https://doi.org/10.1016/j.compfluid.2006.01.016|
|Abstract:||A new data-driven reduced-order modeling approach for real-time optimization applications is presented. The proper orthogonal decomposition (POD) technique is used for the reduced-order model, with the basis functions determined from an ensemble of offline high-fidelity simulations. For optimization in real time, a rapid two-stage approach is taken in the online phase: the POD coefficients are first determined by solving a small optimization problem, and the desired parameters are subsequently obtained by interpolation of the POD coefficients using precomputed information from the simulation ensemble. This method is applied to optimizing parameters for underwater bubble explosions so that a desired free surface shape is generated. For time-critical applications, such as using the water barrier generated to stop sea-skimming objects, the time available for online optimization is limited to about 30 s. Results for two-dimensional simulation, using a personal computer (dual CPU running at 2.8 GHz), show that our new methodology is able to meet such a critical time requirement. For three-dimensional simulations, the time taken for computation increases, and a faster computer or parallel implementation is required. © 2006 Elsevier Ltd. All rights reserved.|
|Source Title:||Computers and Fluids|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 11, 2018
WEB OF SCIENCETM
checked on Oct 23, 2018
checked on Nov 10, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.