Tianshu Wen

Tianshu Wen

Auto-generated profile, based on publicly available information

Tianshu Wen

Washington University in St. Louis

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 March 2017 in International Journal of Pharmaceutics
Verified
Journal Article
Closed access
JXJinxiang Xi
Jinxiang Xi
XSXiuhua April Si
Xiuhua April Si
SPShannon Peters
Shannon Peters
DNDannielle Nevorski
Dannielle Nevorski
TWTianshu Wen
Tianshu Wen
MLMark Lehman
Mark Lehman

27 November 2017 in Journal of Visualization
Verified
Journal Article
Closed access
PDF file
JXJinxiang Xi
Jinxiang Xi
Tiancheng YangTiancheng Yang
Tiancheng Yang
KTKhaled Talaat
Khaled Talaat
TWTianshu Wen
Tianshu Wen
YZYu Zhang
Yu Zhang
SPShannon Peters
Shannon Peters


1 January 2008 in Acta Physica Sinica
Verified
Journal Article
Open access
PDF file
HWHuang Wen-Zhong
Huang Wen-Zhong
LYLi Yu-Tong
Li Yu-Tong
XYXiong Yong
Xiong Yong
SZShuanggen Zhang
Shuanggen Zhang
WXWen Xian-Lun
Wen Xian-Lun
HYHe Ying-Ling
He Ying-Ling
建立了无色散型X射线谱仪. 利用SILEX-I激光装置的超强激光辐照固体物质,分别在靶前、后定量测量了Cu和Mo物质在不同激光功率密度时的X射线谱和Kα光子产额,推导了不同激光强度时的Kα X射线光子转换效率. 实验发现,打靶激光能量越高,靶后出射的Kα产额越高,100μm Mo靶可获得10-5量级转换效率.

15 June 2019
Verified
Conference Paper
Closed access
TWTianshu Wen
Tianshu Wen
RARamesh K. Agarwal
Ramesh K. Agarwal
SSShuai Shuai
Shuai Shuai
NANeil Ashton
Neil Ashton
MRMizanur Rahman
Mizanur Rahman
MLMarkku Lampinen
Markku Lampinen

20 June 2022 in arXiv
Verified
Preprint
Open access
PDF file
TWTianshu Wen
Tianshu Wen
MZMatthew J. Zahr
Matthew J. Zahr
We present a numerical method to efficiently solve optimization problems governed by large-scale nonlinear systems of equations, including discretized partial differential equations, using projection-based reduced-order models accelerated with hyperreduction (empirical quadrature) and embedded in a trust-region framework that guarantees global convergence. The proposed framework constructs a hyperreduced model on-the-fly during the solution of the optimization problem, which completely avoids an offline training phase. This ensures all snapshot information is collected along the optimization trajectory, which avoids wasting samples in remote regions of the parameters space that are never visited, and inherently avoids the curse of dimensionality of sampling in a high-dimensional parameter space. At each iteration of the proposed algorithm, a reduced basis and empirical quadrature weights are constructed precisely to ensure the global convergence criteria of the trust-region method are satisfied, ensuring global convergence to a local minimum of the original (unreduced) problem. Numerical experiments are performed on two fluid shape optimization problems to verify the global convergence of the method and demonstrate its computational efficiency; speedups over 18x (accounting for all computational cost, even cost that is traditionally considered "offline" such as snapshot collection and data compression) relative to standard optimization approaches that do not leverage model reduction are shown.