Aihua Wood
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Aihua Wood has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Alexander Alekseenko
California State University Northridge
4 shared publications - Christopher R. Schrock
Air Force Institute of Technology, Wright-Patterson Air Force Base, Ohio, 45433
2 shared publications - Tri Van
Mission Research Corporation
2 shared publications - Chancellor Johnstone
Department of Mathematics Statistics, Air Force Institute of Technology, Wright-Patterson Air Force Base, OH, USA
1 shared publication David Smith
Department of Mathematics and Statistics , Air Force Institute of Technology , Wright-Patterson AFB, OH 45433-7765, USA
1 shared publication- Ian Holloway
Department of Mathematics, Air Force Institute of Technology, WPAFB, OH 45433, USA
1 shared publication
Latest Publications
- Open Access
- 7 August 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (15) , 3428
Anomaly Detection in the Molecular Structure of Gallium Arsenide Using Convolutional Neural Networks
This paper concerns the development of a machine learning tool to detect anomalies in the molecular structure of Gallium Arsenide. We employ a combination of a CNN and a PCA reconstruction to create the model, using real images taken with an electron microscope in training and testing. The methodology developed allows for the creation of a defect detection model, without any labeled images of defects being required for training. The model performed well on all tests under the established assumptions, allowing for reliable anomaly detection. To the best of our knowledge, such methods are not currently available in the open literature; thus, this work fills a gap in current capabilities.
- 7 August 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (15) , 3428
Open AccessAnomaly Detection in the Molecular Structure of Gallium Arsenide Using Convolutional Neural Networks
This paper concerns the development of a machine learning tool to detect anomalies in the molecular structure of Gallium Arsenide. We employ a combination of a CNN and a PCA reconstruction to create the model, using real images taken with an electron microscope in training and testing. The methodology developed allows for the creation of a defect detection model, without any labeled images of defects being required for training. The model performed well on all tests under the established assumptions, allowing for reliable anomaly detection. To the best of our knowledge, such methods are not currently available in the open literature; thus, this work fills a gap in current capabilities.
- 17 August 2022
- Published by Elsevier in Journal of Computational Physics
- Vol. 470
Fast evaluation of the Boltzmann collision operator using data driven reduced order models
- 17 August 2022
- Published by Elsevier in Journal of Computational Physics
- Vol. 470
Fast evaluation of the Boltzmann collision operator using data driven reduced order models
- Open Access
- 15 June 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (12) , 1384
Acceleration of Boltzmann Collision Integral Calculation Using Machine Learning
The Boltzmann equation is essential to the accurate modeling of rarefied gases. Unfortunately, traditional numerical solvers for this equation are too computationally expensive for many practical applications. With modern interest in hypersonic flight and plasma flows, to which the Boltzmann equation is relevant, there would be immediate value in an efficient simulation method. The collision integral component of the equation is the main contributor of the large complexity. A plethora of new mathematical and numerical approaches have been proposed in an effort to reduce the computational cost of solving the Boltzmann collision integral, yet it still remains prohibitively expensive for large problems. This paper aims to accelerate the computation of this integral via machine learning methods. In particular, we build a deep convolutional neural network to encode/decode the solution vector, and enforce conservation laws during post-processing of the collision integral before each time-step. Our preliminary results for the spatially homogeneous Boltzmann equation show a drastic reduction of computational cost. Specifically, our algorithm requires operations, while asymptotically converging direct discretization algorithms require , where n is the number of discrete velocity points in one velocity dimension. Our method demonstrated a speed up of 270 times compared to these methods while still maintaining reasonable accuracy.- 15 June 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (12) , 1384
Open AccessAcceleration of Boltzmann Collision Integral Calculation Using Machine Learning
The Boltzmann equation is essential to the accurate modeling of rarefied gases. Unfortunately, traditional numerical solvers for this equation are too computationally expensive for many practical applications. With modern interest in hypersonic flight and plasma flows, to which the Boltzmann equation is relevant, there would be immediate value in an efficient simulation method. The collision integral component of the equation is the main contributor of the large complexity. A plethora of new mathematical and numerical approaches have been proposed in an effort to reduce the computational cost of solving the Boltzmann collision integral, yet it still remains prohibitively expensive for large problems. This paper aims to accelerate the computation of this integral via machine learning methods. In particular, we build a deep convolutional neural network to encode/decode the solution vector, and enforce conservation laws during post-processing of the collision integral before each time-step. Our preliminary results for the spatially homogeneous Boltzmann equation show a drastic reduction of computational cost. Specifically, our algorithm requires operations, while asymptotically converging direct discretization algorithms require , where n is the number of discrete velocity points in one velocity dimension. Our method demonstrated a speed up of 270 times compared to these methods while still maintaining reasonable accuracy. - Open Access
- 27 May 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (11) , 1209
Defect Detection in Atomic Resolution Transmission Electron Microscopy Images Using Machine Learning
Point defects play a fundamental role in the discovery of new materials due to their strong influence on material properties and behavior. At present, imaging techniques based on transmission electron microscopy (TEM) are widely employed for characterizing point defects in materials. However, current methods for defect detection predominantly involve visual inspection of TEM images, which is laborious and poses difficulties in materials where defect related contrast is weak or ambiguous. Recent efforts to develop machine learning methods for the detection of point defects in TEM images have focused on supervised methods that require labeled training data that is generated via simulation. Motivated by a desire for machine learning methods that can be trained on experimental data, we propose two self-supervised machine learning algorithms that are trained solely on images that are defect-free. Our proposed methods use principal components analysis (PCA) and convolutional neural networks (CNN) to analyze a TEM image and predict the location of a defect. Using simulated TEM images, we show that PCA can be used to accurately locate point defects in the case where there is no imaging noise. In the case where there is imaging noise, we show that incorporating a CNN dramatically improves model performance. Our models rely on a novel approach that uses the residual between a TEM image and its PCA reconstruction.
- 27 May 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (11) , 1209
Open AccessDefect Detection in Atomic Resolution Transmission Electron Microscopy Images Using Machine Learning
Point defects play a fundamental role in the discovery of new materials due to their strong influence on material properties and behavior. At present, imaging techniques based on transmission electron microscopy (TEM) are widely employed for characterizing point defects in materials. However, current methods for defect detection predominantly involve visual inspection of TEM images, which is laborious and poses difficulties in materials where defect related contrast is weak or ambiguous. Recent efforts to develop machine learning methods for the detection of point defects in TEM images have focused on supervised methods that require labeled training data that is generated via simulation. Motivated by a desire for machine learning methods that can be trained on experimental data, we propose two self-supervised machine learning algorithms that are trained solely on images that are defect-free. Our proposed methods use principal components analysis (PCA) and convolutional neural networks (CNN) to analyze a TEM image and predict the location of a defect. Using simulated TEM images, we show that PCA can be used to accurately locate point defects in the case where there is no imaging noise. In the case where there is imaging noise, we show that incorporating a CNN dramatically improves model performance. Our models rely on a novel approach that uses the residual between a TEM image and its PCA reconstruction.
- Open Access
- 1 January 2018
- Published by American Institute of Mathematical Sciences (AIMS) in Kinetic and Related Models
- Vol. 11 (5) , 1211-1234
A deterministic-stochastic method for computing the Boltzmann collision integral in $\mathcal{O}(MN)$ operationsWe developed and implemented a numerical algorithm for evaluating the Boltzmann collision integral with $O(MN)$ operations, where $N$ is the number of the discrete velocity points and $M <N$. At the base of the algorithm are nodal-discontinuous Galerkin discretizations of the collision operator on uniform grids and a bilinear convolution form of the Galerkin projection of the collision operator. Efficiency of the algorithm is achieved by applying singular value decomposition compression of the discrete collision kernel and by approximating the kinetic solution by a sum of Maxwellian streams using a stochastic likelihood maximization algorithm. Accuracy of the method is established on solutions to the problem of spatially homogeneous relaxation.- 1 January 2018
- Published by American Institute of Mathematical Sciences (AIMS) in Kinetic and Related Models
- Vol. 11 (5) , 1211-1234
Open AccessA deterministic-stochastic method for computing the Boltzmann collision integral in $\mathcal{O}(MN)$ operationsWe developed and implemented a numerical algorithm for evaluating the Boltzmann collision integral with $O(MN)$ operations, where $N$ is the number of the discrete velocity points and $M <N$. At the base of the algorithm are nodal-discontinuous Galerkin discretizations of the collision operator on uniform grids and a bilinear convolution form of the Galerkin projection of the collision operator. Efficiency of the algorithm is achieved by applying singular value decomposition compression of the discrete collision kernel and by approximating the kinetic solution by a sum of Maxwellian streams using a stochastic likelihood maximization algorithm. Accuracy of the method is established on solutions to the problem of spatially homogeneous relaxation. - 1 January 2016
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 1786 (1) , 180006
A deterministic-stochastic approach to compute the Boltzmann collision integral in O(MN) operations
We developed and implemented a numerical algorithm for evaluating the Boltzmann collision operator with O(MN) operations, where N is the number of the discrete velocity points and M < N. The approach is formulated using a bilinear convolution form of the Galerkin projection of the collision operator and discontinuous Galerkin (DG) discretizations of the collision operator. Key ingredients of the new approach are singular value decomposition (SVD) compression of the collision kernel and approximations of the solution by a sum of Maxwellian streams using a stochastic likelihood maximization algorithm. The developed method is significantly faster than the full deterministic DG velocity discretization of the collision integral. Accuracy of the method is established on solutions to the problem of spatially homogeneous relaxation.
- 1 January 2016
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 1786 (1) , 180006
A deterministic-stochastic approach to compute the Boltzmann collision integral in O(MN) operations
We developed and implemented a numerical algorithm for evaluating the Boltzmann collision operator with O(MN) operations, where N is the number of the discrete velocity points and M < N. The approach is formulated using a bilinear convolution form of the Galerkin projection of the collision operator and discontinuous Galerkin (DG) discretizations of the collision operator. Key ingredients of the new approach are singular value decomposition (SVD) compression of the collision kernel and approximations of the solution by a sum of Maxwellian streams using a stochastic likelihood maximization algorithm. The developed method is significantly faster than the full deterministic DG velocity discretization of the collision integral. Accuracy of the method is established on solutions to the problem of spatially homogeneous relaxation.
- 1 January 2012
- Published by Global Science Press in Advances in Applied Mathematics and Mechanics
- Vol. 4 (1) , 102-121
Convergence of a Distributional Monte Carlo Method for the Boltzmann Equation
Convergence of A Distributional Monte Carlo Method for the Boltzmann Equation - Volume 4 Issue 1 - Christopher R. Schrock, Aihua W. Wood
- 1 January 2012
- Published by Global Science Press in Advances in Applied Mathematics and Mechanics
- Vol. 4 (1) , 102-121
Convergence of a Distributional Monte Carlo Method for the Boltzmann Equation
Convergence of A Distributional Monte Carlo Method for the Boltzmann Equation - Volume 4 Issue 1 - Christopher R. Schrock, Aihua W. Wood
- 1 January 2012
- Published by Global Science Press in Advances in Applied Mathematics and Mechanics
- Vol. 4 (6) , 703-718
A Modified Helmholtz Equation with Impedance Boundary Conditions
A Modified Helmholtz Equation With Impedance Boundary Conditions - Volume 4 Issue 6 - Robert S. Callihan, Aihua W. Wood
- 1 January 2012
- Published by Global Science Press in Advances in Applied Mathematics and Mechanics
- Vol. 4 (6) , 703-718
A Modified Helmholtz Equation with Impedance Boundary Conditions
A Modified Helmholtz Equation With Impedance Boundary Conditions - Volume 4 Issue 6 - Robert S. Callihan, Aihua W. Wood
- 1 January 2012
- Published by American Institute of Aeronautics and Astronautics (AIAA) in Journal of Thermophysics and Heat Transfer
- Vol. 26 (1) , 185-189
Distributional Monte Carlo Solution Technique for Rarefied Gasdynamics
- 1 January 2012
- Published by American Institute of Aeronautics and Astronautics (AIAA) in Journal of Thermophysics and Heat Transfer
- Vol. 26 (1) , 185-189
Distributional Monte Carlo Solution Technique for Rarefied Gasdynamics
- 18 May 2010
- Published by Taylor & Francis in Applicable Analysis
- Vol. 89 (6) , 905-914
Large solutions of coupled sublinear/superlinear elliptic equations
We show that large positive solutions exist for the semilinear elliptic equation Δu = p(x)u α + q(x)v β on bounded domains in R n , n ≥ 3, for the superlinear case 0 < α ≤ β, β > 1, but not the sublinear case 0 < α ≤ β ≤ 1. We also show that entire large positive solutions exist for both the superlinear and sublinear cases provided the nonnegative continuous functions p and q satisfy certain decay conditions at infinity. Existence and nonexistence of entire bounded solutions are established as well.
- 18 May 2010
- Published by Taylor & Francis in Applicable Analysis
- Vol. 89 (6) , 905-914
Large solutions of coupled sublinear/superlinear elliptic equations
We show that large positive solutions exist for the semilinear elliptic equation Δu = p(x)u α + q(x)v β on bounded domains in R n , n ≥ 3, for the superlinear case 0 < α ≤ β, β > 1, but not the sublinear case 0 < α ≤ β ≤ 1. We also show that entire large positive solutions exist for both the superlinear and sublinear cases provided the nonnegative continuous functions p and q satisfy certain decay conditions at infinity. Existence and nonexistence of entire bounded solutions are established as well.