SEARCH · Engineering Papers

Results for “equation learning”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 973 records · Page 54

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Multi-fidelity equations of state and transport coefficient datasets for pulsed-power applications

Reliably simulating experiments relevant to the National Nuclear Security Administration (NNSA) requires a detailed description of material properties across a wide range of conditions. Such properties include the equations of state, charged-particle transport coefficients, and optical properties like the opacity. Together, these properties make up the material models used in radiation-magnetohydrodynamic simulations of nuclear fusion experiments. Many of these models do not incorporate uncertainties in the data used to produce them. It is unknown whether these uncertainties significantly impact the interpretation of simulation results and diagnostics. The purpose of this work is to quantify how such uncertainties impact simulations of pulsed-power experiments. We accomplished this task by first assessing discrepancies between approaches used to generate the data. This included bringing together members of the high-energy-density community spanning the three NNSA laboratories and multiple universities. Then, using these data, we developed a general framework that systematically incorporates physical uncertainties within the material models suitable for uncertainty quantification analyses. The framework utilizes machine learning, Bayesian inference, and incorporates multi-fidelity datasets. We demonstrated the framework by quantifying the impact that material model uncertainties have on simulations of pulsed-power experiments underway on Z at Sandia National Laboratories. As a result of this work, we discovered that modest uncertainties in material models (roughly 20%) correspond to significant uncertainties in the outputs from simulations. Our framework has enabled rapid construction of material models through an automated procedure and allows for the generation of material models of interest to the NNSA.

36 MATERIALS SCIENCE↗

NASA NTRS2000

What we Hope to Learn about Global Mineral Dust Aerosols from EOS Multi-Angle Imaging SpectroRadiometer (MISR)

On global scales, just a few broad atmospheric aerosol compositional groups are commonly observed. Of these, "mineral dust" is the only group which both contains non-spherical particles, and typically has size distributions with enough large particles for particle shape to affect its visible-light-scattering properties. The MISR instrument is scheduled for launch into a 10:30 AM sun-synchronous, polar orbit aboard the EOS Terra satellite in 1999. MISR will measure the upwelling visible radiance from Earth in 4 spectral bands centered at 446, 558, 672, and 866 nm, at each of 9 emission angles spread out in the forward and aft directions along the flight path at +/-70.5 deg, +/-60.0 deg, +/-45.6 deg, +/-26.1deg, and nadir. Over a period of 7 minutes, as the spacecraft flies along, a 360 km wide swath of Earth will successively be viewed by each of the cameras, allowing MISR to sample a very large range of scattering angles; in mid latitudes, the instrument will observe scattering angles between about 60 deg and 160 deg. Global coverage will be acquired about once in 9 days at the equator; the nominal mission lifetime is 6 years. The distinction in single scattering phase function between natural distributions of spherical and randomly oriented, non-spherical particles, with a broad range of aspect ratios, shows up strongly for scattering angles ranging from about 90 deg to near 180 deg. For non-spherical particle distributions, single scattering phase functions tend to be much flatter in this region than for spherical particles. Since MISR samples the relevant range of scattering angles very well, we expect to be able to make critical distinctions between natural distributions of spherical and randomly oriented, non-spherical particles with MISR data. We anticipate that the new multiangle, multispectral data from MISR will also contain other information about particle properties, a major step beyond current spacecraft remote sensing retrievals, which obtain aerosol optical depth based on entirely assumed particle microphysical properties. According to simulations over cloud-free, calm ocean, for pure particles with natural ranges of optical depth, particle size, and indices of refraction, MISR should retrieve column optical depth for all but the darkest particles, to an uncertainty of at most 0.05 or 20%, whichever is larger, even if the particle properties are poorly known. For one common particle type, soot, constraints on the optical depth over dark ocean are very poor. The simulated measurements also should allow us to separate two to four compositional groups based on indices of refraction, and to identify three to four distinct size groups between 0.1 and 2.0 microns characteristic radius at most latitudes. The technique is most sensitive to particle microphysical properties in the "accumulation mode" sizes. where particle scattering undergoes the transition from Rayleigh to large-particle regimes for the MISR wavelengths. Based on these results, we expect to distinguish air masses containing different aerosol types, routinely and globally, with multiangle remote sensing data. Such data complements in situ and field data, which can provide details about aerosol size and composition locally that are needed to assess the radiative effects of aerosols quantitatively. Both field data and correlations in space and time with likely source and sink regions will also be helpful in developing a global picture of mineral dust aerosol budgets. Further work on the expected sensitivity of MISR to natural mixtures of pure particles, including climatologically likely mineral dust components, is currently underway.

Kahn, Ralph↗

DOE OSTI2021

Machine learning-based microstructure prediction during laser sintering of alumina

Abstract Predicting material’s microstructure under new processing conditions is essential in advanced manufacturing and materials science. This is because the material’s microstructure hugely influences the material’s properties. We demonstrate an elegant machine learning algorithm that faithfully predicts the microstructure under new conditions, without the need of knowing the governing laws. We name this algorithm, RCWGAN-GP, which is regression-based conditional generative adversarial networks with Wasserstein loss function and gradient penalty. This algorithm was trained with experimental SEM micrographs from laser-sintered alumina under various laser powers. The RCWGAN-GP realistically regenerates the SEM micrographs under the trained laser powers. Impressively, it also faithfully predicts the alumina’s microstructure under unexplored laser powers. The predicted microstructure features, including the morphology of the sintered particles and the pores, match the experimental SEM micrographs very well. We further quantitatively examined the prediction accuracy of the RCWGAN-GP. We trained the algorithm with computer-created micrograph datasets of secondary-phase growth governed by the well-known Johnson–Mehl–Avrami (JMA) equation. The RCWGAN-GP accurately regenerates the micrographs at the trained time series, in terms of the grains’ shapes, sizes, and spatial distributions. More importantly, the predicted secondary phase fraction accurately follows the JMA curve.

08 HYDROGEN↗

DOE OSTI2022

Physics‐Informed Machine Learning Method for Large‐Scale Data Assimilation Problems

Abstract We develop a physics‐informed machine learning approach for large‐scale data assimilation and parameter estimation and apply it for estimating transmissivity and hydraulic head in the two‐dimensional steady‐state subsurface flow model of the Hanford Site given synthetic measurements of said variables. In our approach, we extend the physics‐informed conditional Karhunen‐Loéve expansion (PICKLE) method to modeling subsurface flow with unknown flux (Neumann) and varying head (time‐dependent Dirichlet) boundary conditions. We demonstrate that the PICKLE method is comparable in accuracy with the standard maximum a posteriori (MAP) method, but is significantly faster than MAP for large‐scale problems. Both methods use a mesh to discretize the computational domain. In MAP, the parameters and states are discretized on the mesh; therefore, the size of the MAP parameter estimation problem directly depends on the mesh size. In PICKLE, the mesh is used to evaluate the residuals of the governing equation, while the parameters and states are approximated by the truncated conditional Karhunen‐Loéve expansions with the number of parameters controlled by the smoothness of the parameter and state fields, and not by the mesh size. For a considered example, we demonstrate that the computational cost of PICKLE increases near linearly (as N 1.15 ) with the number of grid nodes N , while that of MAP increases much faster (as N 3.28 ). We also show that once trained for one set of Dirichlet boundary conditions (i.e., one river stage), the PICKLE method provides accurate estimates of the hydraulic head for any value of the Dirichlet boundary conditions (i.e., for any river stage).

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Efficient Bayesian inference with latent Hamiltonian neural networks in No-U-Turn Sampling

When sampling for Bayesian inference, one popular approach in the computational field is to use Hamiltonian Monte Carlo (HMC) and specifically the No-U-Turn Sampler (NUTS), which automatically decides the end time of the Hamiltonian trajectory. However, HMC and NUTS can require numerous numerical gradients of the target density and can prove slow in practice when relying on computationally expensive forward models. We propose Latent Hamiltonian neural networks (L-HNNs) with HMC and NUTS for solving Bayesian inference problems. Once trained, L-HNNs do not require numerical gradients of the target density during sampling, and hence numerous evaluations of the forward computational model. Moreover, L-HNNs satisfy important properties such as perfect time reversibility and Hamiltonian conservation, making them well-suited for use within HMC and NUTS because stationarity can be shown. We also propose the integration of L-HNNs in an online error monitoring scheme, in which numerical gradients of the target density are used for a few samples whenever the L-HNNs prediction errors are large. This online error monitor scheme prevents sample degeneracy in regions of low probability density and ensures robust uncertainty quantification. We demonstrate L-HNNs in NUTS with online error monitoring on several analytical examples involving complex, heavy-tailed, and high-local-curvature probability densities. We then demonstrate the applicability of L-HNNs in NUTS to two computational case studies, namely the Allen-Cahn stochastic partial differential equation and an elliptic partial differential equation with 25 and 50 inference parameters, respectively. Overall, the L-HNNs in NUTS with online error monitoring satisfactorily inferred these probability densities. In conclusion, compared to traditional NUTS, L-HNNs in NUTS with online error monitoring required 1–2 orders of magnitude fewer numerical gradients of the target density and improved the effective sample size (ESS) per gradient (which is a measure of both the sampling quality and the computational expense) by an order of magnitude.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2019

Modeling Mesoscale Processes of Scalable Synthesis (Final Report)

The main objective of the center is to develop tools that can help for the understanding of equilibrium and non-equilibrium properties of nanoparticles in aqueous electrolytes. To achieve this goal, we need to develop new computational methodologies that can integrate molecular level description such as the electronic structure analysis to mesoscale description such as generalized hydrodynamics. The challenge is to develop systematic coarse graining techniques that can adaptively choose the level of description needed for the particular task. For example, if bonding breaking is involved, then one should use appropriate models from quantum mechanics to accurately model the time scale and molecular mechanism for the breaking process. However, to model transport process or the process of self-assembly, much less detailed models can be used. There are two main components to this task. One is to develop accurate models that bridge different levels of description. The classical example is the QM/MM model that bridges quantum mechanics and molecular mechanics for studying chemical reactions of large molecules. This work was awarded the Nobel prize this year. For our purpose, we also need to develop methods that bridge molecular and continuum levels of description. Another main task is to develop systematic coarse-graining methods that can give rise to accurate mesoscale and macroscale models, starting from more detailed models at the atomic or molecular scale. None of these ideas are new. By now they have been fashionable topics for quite some time. But neither problem is satisfactorily resolved. The main problem is that uncontrolled approximations are used. As a result, we have very little idea about the validity and accuracy of these models. The main purpose of the center is to exploit the Mori-Zwanzig formalism to achieve the goals stated above. The Mori-Zwanzig formalism is a general tool for eliminating degrees of freedom from existing models. What is attractive about this formalism is its generality. The flip side is that it is also somewhat of a tautology. In order to make it a practical tool, one has to make approximations and this is where the trouble comes. Instead of focusing on Mori-Zwanzig formalism, the PI proposes to study the closely related renormalization group formalism (RG). Like Mori-Zwanzig, RG is a general strategy for eliminating small scale degrees of freedom in a model. Unlike Mori-Zwanzig, RG has the advantage that at least for some problems, one can write a PDE (partial differential equation) type of model for the exact RG flow, without any approximation. This gives us a solid starting point for discussing and analyzing approximations. The PI studied approximate RG flows for turbulent diffusion and related problems. However, extending it to more practical problems proved to be hard. The second line that the PI has pursued is to develop special numerical algorithms for studying particularly important events for dynamics processes in meso-scale systems. The PI succeeded in doing so for the problem of understanding phase transition in metallic systems.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Structure–Property Linkage in Alloys Using Graph Neural Network and Explainable Artificial Intelligence

Deep learning tools have recently shown significant potential for accelerating the prediction of microstructure–property linkage in materials. While deep neural networks like convolution neural networks (CNNs) can extract physics information from 3D microstructure images, they often require a large network architecture and substantial training time. In this research, we trained a graph neural network (GNN) using phase field generated microstructures of Ni-Al alloys to predict the evolution of mechanical properties. We found that a single GNN is capable of accurately predicting the strengthening of Ni-Al alloys with microstructures of varying sizes and dimensions, which cannot otherwise be done with a CNN. Additionally, GNN requires significantly less GPU utilization than CNN and offers more interpretable explanation of predictions using saliency analysis as features are manually defined in the graph. We also utilize explainable artificial intelligence tool Bayesian Inference to determine the coefficients in the power law equation that governs coarsening of precipitates. Overall, our work demonstrates the ability of the GNN to accurately and efficiently extract relevant information from material microstructures without having restrictions on microstructure size or dimension and offers an interpretable explanation.

Chemistry↗

DOE OSTI2024

Multicode benchmark on simulated Ti K-edge x-ray absorption spectra of Ti-O compounds

X-ray absorption spectroscopy (XAS) is an element-specific materials characterization technique that is sensitive to structural and electronic properties. First-principles simulated XAS has been widely used as a powerful tool to interpret experimental spectra and draw physical insights. Recently, there has also been growing interest in building computational XAS databases to enable data analytics and machine learning applications. However, there are non-trivial differences among commonly used XAS simulation codes, both in underlying theoretical formalism and in technical implementation. Reliable and reproducible computational XAS databases require systematic benchmark studies. In this work, we benchmarked Ti K-edge XAS simulations of ten representative Ti-O binary compounds, which we refer to as the Ti-O-10 dataset, using three state-of-the-art codes: XSPECTRA, OCEAN and exciting. We systematically studied the convergence behavior with respect to the input parameters and developed a workflow to automate and standardize the calculations to ensure converged spectra. Our benchmark comparison considers a 35 eV spectral range starting from the K-edge onset, representative of widely used near-edge spectra. Quantitative comparison over this range is based on Spearman’s rank correlation score (r sp ). Our results show: (1) the two Bethe-Salpeter equation (BSE) codes (OCEAN and exciting) have excellent agreement with an average $r$ $sp$ of 0.998; (2) good agreement is obtained between the core-hole potential code (XSPECTRA) and BSE codes (OCEAN and exciting) with an average $r$ $sp$ of 0.990, and this smaller $r$ $sp$ reflects the noticeable differences in the main edge spectral shape that can be primarily attributed to the difference in the strength of the screened core-hole potential; (3) simulations from both methods overall reproduce well the main experimental spectral features of rutile and anatase, and the different treatments of the screened core-hole potential have visible impact on pre-edge intensities and the peak ratio of the main edge; (4) there exist moderate differences in the relative edge alignment of the three codes with a standard deviation of about 0.2 eV, which arise from multiple contributions including the frozen core approximation, final state effects, and different approximations used for the self-energy correction. In conclusion, our benchmark study provides important standards for first-principles XAS simulations with broad impact in data-driven XAS analysis.

36 MATERIALS SCIENCE↗

DOE OSTI2020

Newton versus the machine: solving the chaotic three-body problem using deep neural networks

ABSTRACT Since its formulation by Sir Isaac Newton, the problem of solving the equations of motion for three bodies under their own gravitational force has remained practically unsolved. Currently, the solution for a given initialization can only be found by performing laborious iterative calculations that have unpredictable and potentially infinite computational cost, due to the system’s chaotic nature. We show that an ensemble of converged solutions for the planar chaotic three-body problem obtained using an arbitrarily precise numerical integrator can be used to train a deep artificial neural network (ANN) that, over a bounded time interval, provides accurate solutions at a fixed computational cost and up to 100 million times faster than the numerical integrator. In addition, we demonstrate the importance of training an ANN using converged solutions from an arbitrary precise integrator, relative to solutions computed by a conventional fixed precision integrator, which can introduce errors in the training data, due to numerical round-off and time discretization, that are learned by the ANN. Our results provide evidence that, for computationally challenging regions of phase space, a trained ANN can replace existing numerical solvers, enabling fast and scalable simulations of many-body systems to shed light on outstanding phenomena such as the formation of black hole binary systems or the origin of the core collapse in dense star clusters.

Breen, Philip G.↗

NASA NTRS1995

Attitude determination using an adaptive multiple model filtering Scheme

Attitude determination has been considered as a permanent topic of active research and perhaps remaining as a forever-lasting interest for spacecraft system designers. Its role is to provide a reference for controls such as pointing the directional antennas or solar panels, stabilizing the spacecraft or maneuvering the spacecraft to a new orbit. Least Square Estimation (LSE) technique was utilized to provide attitude determination for the Nimbus 6 and G. Despite its poor performance (estimation accuracy consideration), LSE was considered as an effective and practical approach to meet the urgent need and requirement back in the 70's. One reason for this poor performance associated with the LSE scheme is the lack of dynamic filtering or 'compensation'. In other words, the scheme is based totally on the measurements and no attempts were made to model the dynamic equations of motion of the spacecraft. We propose an adaptive filtering approach which employs a bank of Kalman filters to perform robust attitude estimation. The proposed approach, whose architecture is depicted, is essentially based on the latest proof on the interactive multiple model design framework to handle the unknown of the system noise characteristics or statistics. The concept fundamentally employs a bank of Kalman filter or submodel, instead of using fixed values for the system noise statistics for each submodel (per operating condition) as the traditional multiple model approach does, we use an on-line dynamic system noise identifier to 'identify' the system noise level (statistics) and update the filter noise statistics using 'live' information from the sensor model. The advanced noise identifier, whose architecture is also shown, is implemented using an advanced system identifier. To insure the robust performance for the proposed advanced system identifier, it is also further reinforced by a learning system which is implemented (in the outer loop) using neural networks to identify other unknown quantities such as spacecraft dynamics parameters, gyro biases, dynamic disturbances, or environment variations.

Lam, Quang↗

DOE OSTI2023

PETSc/TAO Users Manual (Rev. 3.19)

This manual describes the use of the Portable, Extensible Toolkit for Scientific Computation (PETSc) and the Toolkit for Advanced Optimization (TAO) for the numerical solution of partial differential equations and related problems on high-performance computers. PETSc/TAO is a suite of data structures and routines that provide the building blocks for the implementation of large-scale application codes on parallel (and serial) computers. PETSc uses the MPI standard for all distributed memory communication. PETSc/TAO includes a large suite of parallel linear solvers, nonlinear solvers, time integrators, and opti mization that may be used in application codes written in Fortran, C, C++, and Python (via petsc4py; see Getting Started). PETSc provides many of the mechanisms needed within parallel application codes, such as parallel matrix and vector assembly routines. The library is organized hierarchically, enabling users to employ the level of abstraction that is most appropriate for a particular problem. By using techniques of object-oriented programming, PETSc provides enormous flexibility for users. PETSc is a sophisticated set of software tools; as such, for some users it initially has a much steeper learning curve than packages such as MATLAB or a simple subroutine library. In particular, for individuals without some computer science background, experience programming in C, C++, python, or Fortran and experience using a debugger such as gdb or lldb, it may require a significant amount of time to take full advantage of the features that enable efficient software use. However, the power of the PETSc design and the algorithms it incorporates may make the efficient implementation of many application codes simpler than “rolling them” yourself. For many tasks a package such as MATLAB is often the best tool; PETSc is not intended for the classes of problems for which effective MATLAB code can be written. There are several packages, built on PETSc, that may satisfy your needs without requiring directly using PETSc. We recommend reviewing these packages functionality before starting to code directly with PETSc. PETSc can be used to provide a “MPI parallel linear solver” in an otherwise sequential, or OpenMP parallel code. This approach cannot provide extremely large improvements in the application time by utilizing large numbers of MPI processes but can still improve the performance. Certainly all parts of a previously sequential code need not be parallelized but the matrix generation portion must be parallelized to expect true scalability to large numbers of MPI processes. See PCMPI for details on how to utilize the PETSc MPI linear solver server. Since PETSc is under continued development, small changes in usage and calling sequences of routines will occur. PETSc has been supported for twenty-five years; see mailing list information on our website for information on contacting support.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS2004

Construction and Analysis of Electronic circuits

The Aviation Environmental Technical Branch produces many various types of aeronautical research that benefits the NASA mission for space exploration and in turn, produces new technology for our nation. One of the present goals of the Aviation Environmental Technical Branch is to create better engines for airplanes by testing supersonic jet propulsion and safe fuel combustion. During the summer of 2004, I was hired by Vincent Sattenvhite Chief executive of the Aviation Environmental Technical Branch to Assist Yves Lamothe with a fuel igniter circuit. Yves Lamothe is an electrical engineer who is currently working on safe fuel combustion testing. This testing is planned to determine the minimum ignition energy for fuel and air vapors of current and alternative fuels under simulated flight conditions. An air temperature bath will provide simulated flight profile temperatures and the heat fluxes to the test chamber. I was assigned with Yves to help complete the igniter circuit which consists of a 36k voltage supply an oscilloscope, and a high voltage transistor switch. During my tenure in the L.E.C.I.R.P. program I studied the basics of electricity and circuitry along with two other projects that I completed. In the beginning of my internship, I devote all of my time to research the aspects of circuitry so that I would be prepared for the projects that I was assigned to do. I read about lessons on; the basic physical concepts of electronics, Electrical units, Basic dc circuits, direct current circuit analysis, resistance and cell batteries, various types of magnetism , Alternating current basics, inductance, and power supplies. I received work sheets and math equations from my Mentor so that I could be able to apply these concepts into my work. After I complete my studies, I went on to construct a LED chaser circuit which displays a series of light patterns using a 555 timer. I incorporated a switch and motion detector into the circuit to create basic alarm system. This project challenged my ability to interpret a schematic and expand it. While I was still completing the LED chaser circuit I Also was given A Basic Stamp Toddler Robot to build and program. The Toddler robot can walk in 36 various styles using advanced robotics. I used many different programs to create movement and direction of the robot. Also the Toddler can use infrared vision to sense objects. This enables the robot to maneuver indefinitely without running into objects. During my tenure at the NASA Glen Research Center I definite utilized the NASA mission to educate. I learned valuable information to help in my up coming year as a freshman in college.

Thomas, Ashley N.↗

DOE OSTI2015

brulilo, Version 0.x

brulilo is a Python package for building and evolving thermonuclear reaction networks, such as those used in astrophysical explosion calculations. It is very much a current work in progress, and much of the intended functionality is still under development. The main goal of brulilo is an easy-to-use code for quick calculations or post-processing, as well as a learning tool to test various implementations of solvers on both CPUs and GPUs. Currently, brulilo parses an input text file that specifies the reactions to be included in the network. The notation of the inputs are in the typical astrophysical notation; i.e. hydrogen burning to deuterium in the sun, "p + p + e --> d + neutrino", is given as "p(p,)d." Each reaction is added to a list comprising the reaction network, and once completed, the network contains a list of all isotopes and reactions involved. brulilo then parses publicly available nuclear data (binding energy, spin, partition function data, etc.) for each isotope from the WebNucleo group's data at nucleo.ces.clemson.edu. Fits to reaction rate data for each reaction are obtained from the publicly available data provided by the Joint Institute for Nuclear Astrophysics' Reaclib database. Reverse reactions are calculated from detailed balance. The reaction network then consists of a sparse system of mathematically stiff ordinary differential equations (ODEs). Physically, "stiffness" here means that there are some reaction rates that are occurring much faster than others; the ratio of the fast to slow often being greater than 10^15 in astrophysics. Numerical integration of such systems typically involves implicit integration schemes, which brulilo will leverage from the scientific computing Python package, Numpy, as well as implement its own. There has recently been work from researchers at Oak Ridge National Lab who have found good results from applying quasi-equilibrium and quasi-asymptotic conditions to the stiff system of ODEs, which effectively remove some of the stiffness and allow for efficient explicit integration techniques to be used. The original intent of brulilo was to implement these stiffness-alleviating techniques with explicit integrators and compare the performance to traditional implicit integrations of the full stiff system. This is still underway, as the code is very much in an alpha-release state. Furthermore, explicit integrators are often much easier to parallelize than their implicit counterparts. brulilo will implement parallelization of these techniques, leveraging both the Python implementation of MPI, mpi4py, as well as highly parallelized versions targeted at GPUs with PyOpenCL and/or PyCUDA.

Malone, Chris↗

DOE OSTI2020

PETSc Users Manual (Rev. 3.13)

This manual describes the use of PETSc for the numerical solution of partial differential equations and related problems on high-performance computers. The Portable, Extensible Toolkit for Scientific Computation (PETSc) is a suite of data structures and routines that provide the building blocks for the implementation of large-scale application codes on parallel (and serial) computers. PETSc uses the MPI standard for all message-passing communication. PETSc includes an expanding suite of parallel linear solvers, nonlinear solvers, and time integrators that may be used in application codes written in Fortran, C, C++, and Python. PETSc provides many of the mechanisms needed within parallel application codes, such as parallel matrix and vector assembly routines. The library is organized hierarchically, enabling users to employ the level of abstraction that is most appropriate for a particular problem. By using techniques of object-oriented programming, PETSc provides enormous flexibility for users. PETSc is a sophisticated set of software tools; as such, for some users it initially has a much steeper learning curve than a simple subroutine library. In particular, for individuals without some computer science background, experience programming in C, C++, python, or Fortran and experience using a debugger such as gdb or dbx, it may require a significant amount of time to take full advantage of the features that enable efficient software use. However, the power of the PETSc design and the algorithms it incorporates may make the efficient implementation of many application codes simpler than \rolling them" yourself.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Computing Nonlinear Power Spectra Across Dynamical Dark Energy Model Space with Neural ODEs

I show how to compute the nonlinear power spectrum across the entire $w(z)$ dynamical dark energy model space. Using synthetic ΛCDM data, I train a neural ordinary differential equation (ODE) to infer the evolution of the nonlinear matter power spectrum as a function of the background expansion and mean matter density across ∼9 Gyr of cosmic evolution. After training, the model generalises to any dynamical dark energy model parameterised by $w(z)$. With little optimisation, the neural ODE is accurate to within 4% up to $k = 5\, h\, {\mathrm Mpc}^{−1}$. Unlike simulation rescaling methods, neural ODEs naturally extend to summary statistics beyond the power spectrum that are sensitive to the growth history.

cosmology↗

DOE OSTI2015

brulilo, Version 0.x

Malone, Chris↗

DOE OSTI2019

Estimation of full-field, full-order experimental modal model of cable vibration from digital video measurements with physics-guided unsupervised machine learning and computer vision

Cables are critical components for a variety of structures such as stay cables and suspenders of cable-stayed bridges and suspension bridges. When in operational service, they are vulnerable to cumulative fatigue damage induced by dynamic loads (e.g., the cyclic vehicle loads and wind excitation). To accurately analyze and predict their dynamics behaviors and performance that could be spatially local and temporal transient, it is essential to perform high-resolution vibration measurements, from which their dynamics properties are identified and, subsequently, a high spatial resolution, full-modal-order dynamics model of cable vibration can be established. In this study, we develop a physics-guided, unsupervised machine learning-based video processing approach that can blindly and efficiently extract the full-field (as many points as the pixel number of the video frame) modal parameters of cable vibration using only the video of an operating (output-only) cable. In particular, by incorporating the physics of cable vibration (taut string model), a novel automated modal motion filtering method is proposed to enable autonomous identification of full-order (as many modes as possible) dynamic parameters, including those weakly excited modes that used to be challenging to identify in operational modal analysis. Therefore, a full-field, full-order modal model of cable vibration is established by the proposed method. Furthermore, this new approach provides a low-cost and noncontact technique to estimate the cable tension using only the video of the vibrating cable where the fundamental frequency is automatically and efficiently estimated to compute the cable tension according to the taut string equation. Laboratory experiments on a bench-scale cable are conducted to validate the developed approach.

42 ENGINEERING↗

DOE OSTI2022

When Do Extended Physics-Informed Neural Networks (XPINNs) Improve Generalization?

Physics-informed neural networks (PINNs) have become a popular choice for solving high-dimensional partial differential equations (PDEs) due to their excellent approximation power and generalization ability. Recently, extended PINNs (XPINNs) based on domain decomposition methods have attracted considerable attention due to their effectiveness in modeling multiscale and multiphysics problems and their parallelization. However, theoretical understanding of their convergence and generalization properties remains unexplored. In this study, we take an initial step towards understanding how and when XPINNs outperform PINNs. Specifically, for general multilayer PINNs and XPINNs, we first provide a prior generalization bound via the complexity of the target functions in the PDE problem and a posterior generalization bound via the posterior matrix norms of the networks after optimization. Moreover, based on our bounds, we analyze the conditions under which XPINNs improve generalization. Concretely, our theory shows that the key building block of XPINN, namely, the domain decomposition, introduces a tradeoff for generalization. On the one hand, XPINNs decompose the complex PDE solution into several simple parts, which decreases the complexity needed to learn each part and boosts generalization. On the other hand, decomposition leads to less training data being available in each subdomain, and hence such a model is typically prone to overfitting and may become less generalizable. Empirically, we choose five PDEs to show when XPINNs perform better than, similar to, or worse than PINNs, hence demonstrating and justifying our new theory.

97 MATHEMATICS AND COMPUTING↗