Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Tan Bui-Thanh is active.

Publication


Featured researches published by Tan Bui-Thanh.


AIAA Journal | 2004

Aerodynamic Data Reconstruction and Inverse Design Using Proper Orthogonal Decomposition

Tan Bui-Thanh; Murali Damodaran; Karen Willcox

The application of proper orthogonal decomposition for incomplete (gappy) data for compressible external aerodynamic problems has been demonstrated successfully in this paper for the first time. Using this approach, it is possible to construct entire aerodynamic flowfields from the knowledge of computed aerodynamic flow data or measured flow data specified on the aerodynamic surface, thereby demonstrating a means to effectively combine experimental and computational data. The sensitivity of flow reconstruction results to available measurements and to experimental error is analyzed. Another new extension of this approach allows one to cast the problem of inverse airfoil design as a gappy data problem. The gappy methodology demonstrates a great simplification for the inverse airfoil design problem and is found to work well on a range of examples, including both subsonic and transonic cases.


SIAM Journal on Scientific Computing | 2008

Model Reduction for Large-Scale Systems with High-Dimensional Parametric Input Space

Tan Bui-Thanh; Karen Willcox; Omar Ghattas

A model-constrained adaptive sampling methodology is proposed for the reduction of large-scale systems with high-dimensional parametric input spaces. Our model reduction method uses a reduced basis approach, which requires the computation of high-fidelity solutions at a number of sample points throughout the parametric input space. A key challenge that must be addressed in the optimization, control, and probabilistic settings is the need for the reduced models to capture variation over this parametric input space, which, for many applications, will be of high dimension. We pose the task of determining appropriate sample points as a PDE-constrained optimization problem, which is implemented using an efficient adaptive algorithm that scales well to systems with a large number of parameters. The methodology is demonstrated using examples with parametric input spaces of dimension 11 and 21, which describe thermal analysis and design of a heat conduction fin, and compared with statistically based sampling methods. For these examples, the model-constrained adaptive sampling leads to reduced models that, for a given basis size, have error several orders of magnitude smaller than that obtained using the other methods.


Journal of Computational Physics | 2007

Goal-oriented, model-constrained optimization for reduction of large-scale systems

Tan Bui-Thanh; Karen Willcox; Omar Ghattas; B. van Bloemen Waanders

Optimization-oriented reduced-order models should target a particular output functional, span an applicable range of dynamic and parametric inputs, and respect the underlying governing equations of the system. To achieve this goal, we present an approach for determining a projection basis that uses a goal-oriented, model-constrained optimization framework. The mathematical framework permits consideration of general dynamical systems with general parametric variations and is applicable to both linear and nonlinear systems. Results for a simple linear model problem of the two-dimensional heat equation demonstrate the ability of the goal-oriented approach to target a particular output functional of interest. Application of the methodology to a more challenging example of a subsonic blade row governed by the unsteady Euler flow equations shows a significant advantage of the new method over the proper orthogonal decomposition.


AIAA Journal | 2007

Parametric Reduced-Order Models for Probabilistic Analysis of Unsteady Aerodynamic Applications

Tan Bui-Thanh; Karen Willcox; Omar Ghattas

DOI: 10.2514/1.35850 We address the problem of propagating input uncertainties through a computational fluid dynamics model. Methods such as Monte Carlo simulation can require many thousands (or more) of computational fluid dynamics solves, rendering them prohibitively expensive for practical applications. This expense can be overcome with reduced-order models that preserve the essential flow dynamics. The specific contributions of this paper are as follows: first, to derive a linearized computational fluid dynamics model that permits the effects of geometry variations to be represented with an explicit affine function; second, to propose an adaptive sampling method to derive a reduced basis that is effective over the joint probability density of the geometry input parameters. The method is applied to derive efficient reduced models for probabilistic analysis of a two-dimensional problem governedbythelinearized Eulerequations.Reduced-order modelsthatachieve 3-orders-of-magnitude reduction in the number of states are shown to accurately reproduce computational fluid dynamics Monte Carlo simulation results at a fraction of the computational cost.


SIAM Journal on Scientific Computing | 2013

A Computational Framework for Infinite-Dimensional Bayesian Inverse Problems Part I: The Linearized Case, with Application to Global Seismic Inversion

Tan Bui-Thanh; Omar Ghattas; James F. Martin; Georg Stadler

We present a computational framework for estimating the uncertainty in the numerical solution of linearized infinite-dimensional statistical inverse problems. We adopt the Bayesian inference formulation: given observational data and their uncertainty, the governing forward problem and its uncertainty, and a prior probability distribution describing uncertainty in the parameter field, find the posterior probability distribution over the parameter field. The prior must be chosen appropriately in order to guarantee well-posedness of the infinite-dimensional inverse problem and facilitate computation of the posterior. Furthermore, straightforward discretizations may not lead to convergent approximations of the infinite-dimensional problem. And finally, solution of the discretized inverse problem via explicit construction of the covariance matrix is prohibitive due to the need to solve the forward problem as many times as there are parameters. Our computational framework builds on the infinite-dimensional formulation proposed by Stuart (A. M. Stuart, Inverse problems: A Bayesian perspective, Acta Numerica, 19 (2010), pp. 451-559), and incorporates a number of components aimed at ensuring a convergent discretization of the underlying infinite-dimensional inverse problem. The framework additionally incorporates algorithms for manipulating the prior, constructing a low rank approximation of the data-informed component of the posterior covariance operator, and exploring the posterior that together ensure scalability of the entire framework to very high parameter dimensions. We demonstrate this computational framework on the Bayesian solution of an inverse problem in 3D global seismic wave propagation with hundreds of thousands of parameters.


ieee international conference on high performance computing data and analytics | 2012

Extreme-scale UQ for Bayesian inverse problems governed by PDEs

Tan Bui-Thanh; Carsten Burstedde; Omar Ghattas; James F. Martin; Georg Stadler; Lucas C. Wilcox

Quantifying uncertainties in large-scale simulations has emerged as the central challenge facing CS&E. When the simulations require supercomputers, and uncertain parameter dimensions are large, conventional UQ methods fail. Here we address uncertainty quantification for large-scale inverse problems in a Bayesian inference framework: given data and model uncertainties, find the pdf describing parameter uncertainties. To overcome the curse of dimensionality of conventional methods, we exploit the fact that the data are typically informative about low-dimensional manifolds of parameter space to construct low rank approximations of the covariance matrix of the posterior pdf via a matrix-free randomized method. We obtain a method that scales independently of the forward problem dimension, the uncertain parameter dimension, the data dimension, and the number of cores. We apply the method to the Bayesian solution of an inverse problem in 3D global seismic wave propagation with over one million uncertain earth model parameters, 630 million wave propagation unknowns, on up to 262K cores, for which we obtain a factor of over 2000 reduction in problem dimension. This makes UQ tractable for the inverse problem.


Computers & Mathematics With Applications | 2014

A robust DPG method for convection-dominated diffusion problems II: Adjoint boundary conditions and mesh-dependent test norms

Jesse Chan; Norbert Heuer; Tan Bui-Thanh; Leszek Demkowicz

We introduce a DPG method for convection-dominated diffusion problems. The choice of a test norm is shown to be crucial to achieving robust behavior with respect to the diffusion parameter (Demkowicz and Heuer 2011) [18]. We propose a new inflow boundary condition which regularizes the adjoint problem, allowing the use of a stronger test norm. The robustness of the method is proven, and numerical experiments demonstrate the methods robust behavior.


Inverse Problems | 2012

Analysis of the Hessian for inverse scattering problems: II. Inverse medium scattering of acoustic waves

Tan Bui-Thanh; Omar Ghattas

We address the inverse problem for scattering of acoustic waves due to an inhomogeneous medium. We derive and analyze the Hessian in both Hölder and Sobolev spaces. Using an integral equation approach based on Newton potential theory and compact embeddings in Hölder and Sobolev spaces, we show that the Hessian can be decomposed into two components, both of which are shown to be compact operators. Numerical examples are presented to validate our theoretical results. The implication of the compactness of the Hessian is that for small data noise and model error, the discrete Hessian can be approximated by a low-rank matrix. This in turn enables fast solution of an appropriately regularized inverse problem, as well as Gaussian-based quantification of uncertainty in the estimated inhomogeneity. (Some figures may appear in colour only in the online journal)


Computers & Mathematics With Applications | 2014

The DPG method for the Stokes problem

Nathan V. Roberts; Tan Bui-Thanh; Leszek Demkowicz

We discuss well-posedness and convergence theory for the DPG method applied to a general system of linear Partial Differential Equations (PDEs) and specialize the results to the classical Stokes problem. The Stokes problem is an iconic troublemaker for standard Bubnov-Galerkin methods; if discretizations are not carefully designed, they may exhibit non-convergence or locking. By contrast, DPG does not require us to treat the Stokes problem in any special manner. We illustrate and confirm our theoretical convergence estimates with numerical experiments.


SIAM Journal on Numerical Analysis | 2013

A Unified Discontinuous Petrov--Galerkin Method and Its Analysis for Friedrichs' Systems

Tan Bui-Thanh; Leszek Demkowicz; Omar Ghattas

We propose a unified discontinuous Petrov--Galerkin (DPG) framework with optimal test functions for Friedrichs-like systems, which embrace a large class of elliptic, parabolic, and hyperbolic partial differential equations (PDEs). The well-posedness, i.e., existence, uniqueness, and stability, of the DPG solution is established on a single abstract DPG formulation, and two abstract DPG methods corresponding to two different, but equivalent, norms are devised. We then apply the single DPG framework to several linear(ized) PDEs including, but not limited to, scalar transport, Laplace, diffusion, convection-diffusion, convection-diffusion-reaction, linear(ized) continuum mechanics (e.g., linear(ized) elasticity, a version of linearized Navier--Stokes equations, etc.), time-domain acoustics, and a version of the Maxwells equations. The results show that we not only recover several existing DPG methods, but also discover new DPG methods for both PDEs currently considered in the DPG community and new ones. As ...

Collaboration


Dive into the Tan Bui-Thanh's collaboration.

Top Co-Authors

Avatar

Omar Ghattas

University of Texas at Austin

View shared research outputs
Top Co-Authors

Avatar

Karen Willcox

Massachusetts Institute of Technology

View shared research outputs
Top Co-Authors

Avatar

Leszek Demkowicz

University of Texas at Austin

View shared research outputs
Top Co-Authors

Avatar

Ellen B. Le

University of Texas at Austin

View shared research outputs
Top Co-Authors

Avatar

Georg Stadler

Courant Institute of Mathematical Sciences

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Minh-Binh Tran

Basque Center for Applied Mathematics

View shared research outputs
Top Co-Authors

Avatar

Aaron Myers

University of Texas at Austin

View shared research outputs
Top Co-Authors

Avatar

James F. Martin

Baylor College of Medicine

View shared research outputs
Top Co-Authors

Avatar

Lucas C. Wilcox

Naval Postgraduate School

View shared research outputs
Researchain Logo
Decentralizing Knowledge