A hybrid finite difference level set–implicit mesh discontinuous Galerkin method for multi-layer coating flows
Not Available
97 MATHEMATICS AND COMPUTING↗
Engineering topics
Sethian, James A.
Publications and source records attributed to Sethian, James A..
Insights from high-fidelity modeling of industrial rotary bell atomization
The global automotive industry sprayed over 2.6 billion liters of paint in 2018, much of which through electrostatic rotary bell atomization, a highly complex process involving the fluid mechanics of rapidly rotating thin films tearing apart into micrometer-thin filaments and droplets. Coating operations account for 65% of the energy usage in a typical automotive assembly plant, representing 10,000s of gigawatt-hours each year in the United States alone. Optimization of these processes would allow for improved robustness, reduced material waste, increased throughput, and significantly reduced energy usage. Here, we introduce a high-fidelity mathematical and algorithmic framework to analyze rotary bell atomization dynamics at industrially relevant conditions. Our approach couples laboratory experiment with the development of robust non-Newtonian fluid models; devises high-order accurate numerical methods to compute the coupled bell, paint, and gas dynamics; and efficiently exploits high-performance supercomputing architectures. These advances have yielded insight into key dynamics, including i) parametric trends in film, sheeting, and filament characteristics as a function of fluid rheology, delivery rates, and bell speed; ii) the impact of nonuniform film thicknesses on atomization performance; and iii) an understanding of spray composition via primary and secondary atomization. These findings result in coating design principles that are poised to improve energy- and cost-efficiency in a wide array of industrial and manufacturing settings.
97 MATHEMATICS AND COMPUTING↗
Advanced stationary and nonstationary kernel designs for domain-aware Gaussian processes
Gaussian process regression is a widely-applied method for function approximation and uncertainty quantification. The technique has gained popularity recently in the machine learning community due to its robustness and interpretability. The mathematical methods we discuss in this paper are an extension of the Gaussian-process framework. We are proposing advanced kernel designs that only allow for functions with certain desirable characteristics to be elements of the reproducing kernel Hilbert space (RKHS) that underlies all kernel methods and serves as the sample space for Gaussian process regression. These desirable characteristics reflect the underlying physics; two obvious examples are symmetry and periodicity constraints. In addition, non-stationary kernel designs can be defined in the same framework to yield flexible multi-task Gaussian processes. We will show the impact of advanced kernel designs on Gaussian processes using several synthetic and two scientific data sets. The results of our research show that including domain knowledge, communicated through advanced kernel designs, has a significant impact on the accuracy and relevance of the function approximation.
97 MATHEMATICS AND COMPUTING↗
Cross-correlation analysis of X-ray photon correlation spectroscopy to extract rotational diffusion coefficients
Coefficients for translational and rotational diffusion characterize the Brownian motion of particles. Emerging X-ray photon correlation spectroscopy (XPCS) experiments probe a broad range of length scales and time scales and are well-suited for investigation of Brownian motion. While methods for estimating the translational diffusion coefficients from XPCS are well-developed, there are no algorithms for measuring the rotational diffusion coefficients based on XPCS, even though the required raw data are accessible from such experiments. In this paper, we propose angular-temporal cross-correlation analysis of XPCS data and show that this information can be used to design a numerical algorithm (Multi-Tiered Estimation for Correlation Spectroscopy [MTECS]) for predicting the rotational diffusion coefficient utilizing the cross-correlation: This approach is applicable to other wavelengths beyond this regime. We verify the accuracy of this algorithmic approach across a range of simulated data.
97 MATHEMATICS AND COMPUTING↗
Autonomous Discovery in Science and Engineering
The Center for Advanced Mathematics for Energy Research Applications (CAMERA) is an integrated, cross-disciplinary center aimed at inventing, developing, and delivering the fundamental new mathematics required to capitalize on experimental investigations at scientific facilities. Jointly funded by the Office of Advanced Scientific Computing Research (ASCR) and the Office of Basic Energy Sciences (BES) within the US Department of Energy’s Office of Science, CAMERA identifies areas in experimental science that can be aided by new mathematical insights, develops the needed algorithmic tools, and delivers them as user-friendly software to the experimental community.
97 MATHEMATICS AND COMPUTING↗
Gaussian processes for autonomous data acquisition at large-scale synchrotron and neutron facilities
The execution and analysis of complex experiments are challenged by the vast dimensionality of the underlying parameter spaces. Although an increase in data-acquisition rates should allow broader querying of the parameter space, the complexity of experiments and the subtle dependence of the model function on input parameters remains daunting owing to the sheer number of variables. New strategies for autonomous data acquisition are being developed, with one promising direction being the use of Gaussian process regression (GPR). GPR is a quick, non-parametric and robust approximation and uncertainty quantification method that can be applied directly to autonomous data acquisition. We review GPR-driven autonomous experimentation and illustrate its functionality using real-world examples from large experimental facilities in the USA and France. We introduce the basics of a GPR-driven autonomous loop with a focus on Gaussian processes, and then shift the focus to the infrastructure that needs to be built around GPR to create a closed loop. Finally, the case studies we discuss show that Gaussian-process-based autonomous data acquisition is a widely applicable method that can facilitate the optimal use of instruments and facilities by enabling the efficient acquisition of high-value datasets.
36 MATERIALS SCIENCE↗
Numerical Schemes for the Hamilton-Jacobi and Level Set Equations on Triangulated Domains
Borrowing from techniques developed for conservation law equations, we have developed both monotone and higher order accurate numerical schemes which discretize the Hamilton-Jacobi and level set equations on triangulated domains. The use of unstructured meshes containing triangles (2D) and tetrahedra (3D) easily accommodates mesh adaptation to resolve disparate level set feature scales with a minimal number of solution unknowns. The minisymposium talk will discuss these algorithmic developments and present sample calculations using our adaptive triangulation algorithm applied to various moving interface problems such as etching, deposition, and curvature flow.
Barth, Timothy J.↗
Numerical Schemes for the Hamilton-Jacobi and Level Set Equations on Triangulated Domains
Borrowing from techniques developed for conservation law equations, numerical schemes which discretize the Hamilton-Jacobi (H-J), level set, and Eikonal equations on triangulated domains are presented. The first scheme is a provably monotone discretization for certain forms of the H-J equations. Unfortunately, the basic scheme lacks proper Lipschitz continuity of the numerical Hamiltonian. By employing a virtual edge flipping technique, Lipschitz continuity of the numerical flux is restored on acute triangulations. Next, schemes are introduced and developed based on the weaker concept of positive coefficient approximations for homogeneous Hamiltonians. These schemes possess a discrete maximum principle on arbitrary triangulations and naturally exhibit proper Lipschitz continuity of the numerical Hamiltonian. Finally, a class of Petrov-Galerkin approximations are considered. These schemes are stabilized via a least-squares bilinear form. The Petrov-Galerkin schemes do not possess a discrete maximum principle but generalize to high order accuracy.
Barth, Timothy J.↗
Fronts propagating with curvature dependent speed: Algorithms based on Hamilton-Jacobi formulations
New numerical algorithms are devised (PSC algorithms) for following fronts propagating with curvature-dependent speed. The speed may be an arbitrary function of curvature, and the front can also be passively advected by an underlying flow. These algorithms approximate the equations of motion, which resemble Hamilton-Jacobi equations with parabolic right-hand-sides, by using techniques from the hyperbolic conservation laws. Non-oscillatory schemes of various orders of accuracy are used to solve the equations, providing methods that accurately capture the formation of sharp gradients and cusps in the moving fronts. The algorithms handle topological merging and breaking naturally, work in any number of space dimensions, and do not require that the moving surface be written as a function. The methods can be used also for more general Hamilton-Jacobi-type problems. The algorithms are demonstrated by computing the solution to a variety of surface motion problems.
Osher, Stanley↗