Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Library”

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.

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

At least 595 records · Page 33

DMFTwDFT: An open-source code combining Dynamical Mean Field Theory with various density functional theory packages

We report Dynamical Mean Field Theory (DMFT) is a successful method to compute the electronic structure of strongly correlated materials, especially when it is combined with density functional theory (DFT). Here, we present an open-source computational package (and a library) combining DMFT with various DFT codes interfaced through the Wannier90 package. The correlated subspace is expanded as a linear combination of Wannier functions introduced in the DMFT approach as local orbitals. In particular, we provide a library mode for computing the DMFT density matrix. This library can be linked and then internally called from any DFT package, assuming that a set of localized orbitals can be generated in the correlated subspace. The existence of this library allows developers of other DFT codes to interface with our package and achieve the charge-self-consistency within DFT+DMFT loops. To test and check our implementation, we computed the density of states and the band structure of well-known solid-state correlated materials, namely LaNiO, SrVO, and NiO. The obtained results are compared to those obtained from other DFT+DMFT implementations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimal checkpointing for adjoint multistage time-stepping schemes

Here, we consider checkpointing strategies that minimize the number of recomputations needed when performing discrete adjoint computations using multistage time-stepping schemes that require computing several substeps within one complete time step. Specifically, we propose two algorithms that can generate optimal checkpoint-ing schedules under weak assumptions. The first is an extension of the seminal Revolve algorithm adapted to multistage schemes. The second algorithm, named CAMS, is developed based on dynamic programming, and it requires the least number of recomputations when compared with other algorithms. The CAMS algorithm is made publicly available in a library with bindings to C and Python. Numerical results show that the proposed algorithms can deliver up to two times the speedup compared with that of classical Revolve. Moreover, we discuss the utilization of the CAMS library in mature scientific computing libraries and demonstrate the ease of using it in an adjoint workflow. The proposed algorithms have been adopted by the PETSc TSAdjoint library. Their performance has been demonstrated with a large-scale PDE-constrained optimization problem on a leadership-class supercomputer. This work is a significant extension of the authors' conference paper.

97 MATHEMATICS AND COMPUTING↗

Impact of recent ENDF nuclear data update, high initial enrichment and high burnup fuel on critical experiments applicability determination via the integral index c k for burnup credit validation

In 2012, NUREG/CR-7109 reported on the validation of burnup credit calculations involving major and minor actinides and major fission products which was investigated for pressurized and boiling water reactor (PWR and BWR) fuel enrichments up to 5 wt% 235 U and assembly-average burnups up to 60 GWd/MTU. Recently, there has been interest in increasing the maximum enrichment used in PWR fuel as high as 8 wt% 235 U and correspondingly increasing the maximum assembly-average burnups to approximately 75 GWd/MTU. These proposed increases in enrichment and burnup necessitate reinvestigation of the validation basis for k eff calculations for this expanded application space. Additionally, the 2012 study was performed by using the Evaluated Nuclear Data File (ENDF)/B-VII.0 nuclear data with the SCALE 6 covariance library, and the effects of using the newly released ENDF/B-VII.1 and ENDF/B-VIII.0 nuclear data and covariance libraries should be evaluated. In this work, published in NUREG/CR-7309 in 2025, the validation assessment was performed consistently with NUREG/CR-7109: modeling irradiated fuel assemblies in the Generic Burnup Credit (GBC)-32 cask defined in NUREG/CR-6747. The TSUNAMI-3D sequence was used to generate sensitivity data for the application model, and the data were compared with sensitivity data from select benchmark models. The integral parameter c k is the metric of similarity used in this study and is consistent with NUREG/CR-7109, where a c k value in excess of 0.8 indicates sufficient similarity for use in validation. A new set of benchmark experiments with sensitivity data has been assembled for this effort. The number of experiments with available sensitivity data is now 2,104, compared to 474 in NUREG/CR-7109. This increase was facilitated by the efforts of the Nuclear Energy Agency to generate sensitivity data for a majority of the experiments in the International Criticality Safety Benchmark Evaluation Project (ICSBEP) Handbook to supplement the data available in the Oak Ridge National Laboratory (ORNL) Verified, Archived Library of Inputs and Data (VALID). The complete set of benchmarks considered here includes experiments for low-enriched uranium (LEU), intermediate enriched uranium (IEU), and a mixture of uranium and plutonium (MIX) from the ICSBEP Handbook and VALID, as well as ORNL models of the Haut Taux de Combustion (HTC) experiments and other potentially relevant models not included in VALID. The updated similarity study shows that none of the extended burnup and higher enrichment combinations considered show a significant decrease in the number of potentially applicable experiments, meaning sufficient critical experiments exist for the validation of BUC criticality safety calculations, with initial enrichments up to 8 wt% 235 U and burnups up to 80 GWd/MTU. Additionally, both the ENDF/B-VII.1 and ENDF/B-VIII.0 nuclear data libraries can be used for validation since the number of critical experiments applicable for validation increases for most cases with the most recent nuclear data compared to the previous one. As in previous BUC validation studies, the French HTC experiments are the most similar in a majority of the application cases studied, especially from representative discharge burnups ranging from 40 to 80 GWd/MTU. In conclusion, these results match the conclusions presented in NUREG/CR-7109 regarding validation of the primary actinides in BUC analyses.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Improved Characterization of Soil Organic Matter by Integrating FT-ICR MS, Liquid Chromatography Tandem Mass Spectrometry, and Molecular Networking: A Case Study of Root Litter Decay under Drought Conditions

Understanding of how soil organic matter (SOM) chemistry is altered in a changing climate has advanced considerably; however, most SOM components remain unidentified, impeding the ability to characterize a major fraction of organic matter and predict what types of molecules, and from which sources, will persist in soil. Here we present a novel approach to better characterize SOM extracts by integrating information from three types of analyses, and we deploy this method to characterize decaying root-detritus soil microcosms subjected to either drought or normal conditions. To observe broad differences in composition, we employed direct infusion Fourier-transform ion cyclotron resonance mass spectrometry (DI-FT-ICR MS). We complemented this with liquid chromatography tandem mass spectrometry (LC-MS/MS) to identify components by library matching. Since libraries contain only a small fraction of SOM components, we also used fragment spectral cosine similarity scores to relate unknowns and library matches through molecular networks. This integrated approach allowed us to corroborate DI-FT-ICR MS molecular formulas using library matches, which included fungal metabolites and related polyphenolic compounds. We also inferred structures of unknowns from molecular networks and improved LC-MS/MS annotation rates from ~5 to 35% by considering DI-FT-ICR MS molecular formula assignments. Under drought conditions, we found greater relative amounts of lignin-like vs condensed aromatic polyphenol formulas and lower average nominal oxidation state of carbon, suggesting reduced decomposition of SOM and/or microbes under stress. Our integrated approach provides a framework for enhanced annotation of SOM components that is more comprehensive than performing individual data analyses in parallel.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Quantum Chemistry Calculations for Metabolomics

A primary goal of metabolomics and exposomics studies is to fully characterize the small molecule composition of complex biological and environmental samples. However, despite advances in analytical technologies over the past two decades, the majority of small molecules in complex samples are not readily identifiable due to the immense structural and chemical diversi-ty present within the metabolome and exposome. Current gold-standard identification methods rely on reference libraries built using authentic chemical materials (“standards”), which are not available for most molecules. Computational quantum chemis-try methods, which can be used to calculate chemical properties that are then measured by analytical platforms, offer an alter-native route for building reference libraries, i.e., in silico libraries for “standards-free” identification. In this review, we cover the major roadblocks currently facing metabolomics and discuss applications where quantum chemistry calculations offer a solu-tion. Several successful examples for nuclear magnetic resonance spectroscopy, ion mobility spectrometry, infrared spectros-copy, and mass spectrometry methods are reviewed. Finally, we consider current best practices, sources of error, and provide an outlook for quantum chemistry calculations in metabolomics and exposomics studies. We expect this review will inspire researchers in the field of small molecule identification to accelerate adoption of in silico methods for generation of reference libraries and to add quantum chemistry calculations as another tool at their disposal to characterize complex samples.

Metabolism↗

Mass Spectrometry Adduct Calculator

We describe the Mass Spectrometry Adduct Calculator (MSAC), an automated Python tool to calculate the adduct ion masses of a parent molecule. Here, adduct refers to a version of a parent molecule [M] that is charged due to addition or loss of atoms and electrons resulting in a charged ion, e.g. [M+H] + . MSAC includes a database of 2,341 potential ions and their mass-to-charge ratios (m/z) as extracted from the NIST/EPA/NIH Mass Spectral Library (NIST17), the Global Natural Products Social Molecular Networking Public Spectral Libraries (GNPS), and MassBank of North America (MoNA). The calculator relies on user-selected subsets of the combined database to calculate expected m/z for adducts of molecules supplied as formulas This tool is intended to help researchers create identification libraries to collect evidence for the presence of molecules in mass spectrometry data. While the included adduct database focuses on adducts typically detected during liquid chromatography-mass spectrometry analyses, users may supply their own lists of adducts and charge states for calculating expected m/z. We also analyzed statistics on adducts from spectra contained in the three selected mass spectral libraries. MSAC is freely available at https://github.com/pnnl/MSAC.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Design and Characterization of a Transcriptional Repression Toolkit for Plants

Regulation of gene expression is essential for all life. Tools to manipulate the gene expression level have therefore proven to be very valuable in efforts to engineer biological systems. However, there are few well-characterized genetic parts that reduce gene expression in plants, commonly known as transcriptional repressors. We characterized the repression activity of a library consisting of repression motifs from approximately 25% of the members of the largest known family of repressors. Combining sequence information with our trans-regulatory function data, we next generated a library of synthetic transcriptional repression motifs with function predicted in advance. After characterizing our synthetic library, we demonstrated not only that many of our synthetic constructs were functional as repressors but also that our advance predictions of repression strength were better than random guesses. Finally, we assessed the functionality of known transcriptional repression motifs from a wide range of eukaryotes. Our study represents the largest plant repressor motif library experimentally characterized to date, providing unique opportunities for tuning transcription in plants.

59 BASIC BIOLOGICAL SCIENCES↗

AI-accelerated protein-ligand docking for SARS-CoV-2 is 100-fold faster with no significant change in detection

Protein-ligand docking is a computational method for identifying drug leads. The method is capable of narrowing a vast library of compounds down to a tractable size for downstream simulation or experimental testing and is widely used in drug discovery. While there has been progress in accelerating scoring of compounds with artificial intelligence, few works have bridged these successes back to the virtual screening community in terms of utility and forward-looking development. We demonstrate the power of high-speed ML models by scoring 1 billion molecules in under a day (50 k predictions per GPU seconds). We showcase a workflow for docking utilizing surrogate AI-based models as a pre-filter to a standard docking workflow. Our workflow is ten times faster at screening a library of compounds than the standard technique, with an error rate less than 0.01% of detecting the underlying best scoring 0.1% of compounds. Our analysis of the speedup explains that another order of magnitude speedup must come from model accuracy rather than computing speed. In order to drive another order of magnitude of acceleration, we share a benchmark dataset consisting of 200 million 3D complex structures and 2D structure scores across a consistent set of 13 million “in-stock” molecules over 15 receptors, or binding sites, across the SARS-CoV-2 proteome. We believe this is strong evidence for the community to begin focusing on improving the accuracy of surrogate models to improve the ability to screen massive compound libraries 100 × or even 1000 × faster than current techniques and reduce missing top hits. The technique outlined aims to be a fast drop-in replacement for docking for screening billion-scale molecular libraries.

59 BASIC BIOLOGICAL SCIENCES↗

Evaluation of Sandia NCS Benchmark Suite Updates

The Sandia Nuclear Criticality Safety (NCS) program’s benchmark suite was recently updated. This suite is used to ensure that NCS calculations using computer-based neutron transportation codes have an established baseline comparison of calculated versus known experimental results. The Evaluated Nuclear Data File (ENDF) version used for the MCNP models in the suite was changed from ENDF/B-VII.1 to ENDF/B-VIII.0. Additionally, relevant thermal scattering law data libraries (TSLs) were updated. The sensitivity of the calculational bias of each benchmark model to these changes is discussed. Implementation of the ENDF/B-VIII.0 library and updated TSLs results in improvements to bias distribution in the intermediate enriched uranium, plutonium, and mixed uranium–plutonium (IEU, PU, and MIX) fissionable material benchmark categories, but a small bias increase in low- and high-enriched uranium categories (LEU and HEU, respectively). The results also highlight the sensitivity of the benchmarks, with average lethargy of neutrons causing fission energies (EALF) in the intermediate energy range to ENDF/B library changes. The most numerous bias changes were observed in the thermal energy region when transitioning from ENDF/B-VII.1 to ENDF/B-VIII.0. In conclusion, most of the unique bias changes observed in MCNP 6.3.0 between the two nuclear data libraries were in the LEU-COMP-THERM evaluation subset.

ICSBEP↗

Determining the 9 $\mathrm{Be}$($n, γ$) 10 $\mathrm{Be}$ integral cross section at fission neutron energies

The 9 B neutron capture cross section has significant implications for Be materials in the nuclear industry as well as the α process in stellar nucleosynthesis. While the cross section is well constrained at thermal neutron energies, there is a lack of experimental data at higher neutron energies, and the evaluated nuclear data libraries can differ by up to two orders of magnitude. We calculate the 9 Be(n, γ) 10 Be integral cross section at fission neutron energies in an effort to resolve disagreements amongst the nuclear data libraries. Foil irradiation experiments were performed using the Flattop critical assembly at the National Criticality Experiments Research Center with either the highly enriched U or Pu cores, with target foil stacks placed at multiple locations to exploit different neutron energy profiles. Accelerator mass spectrometry was used to measure the 10 Be/ 9 Be ratio in irradiated Be foils, while all other activation products were quantified through gamma spectrometry. The experiments were simulated using the Monte Carlo N-Particle radiation transport code and combined with experimental results to determine the total neutron fluence, while the staysl-pnnl suite and fispact-ii code were used to validate the model and assess the systematic uncertainty. The new 9 Be(n, γ) 10 Be integral cross sections calculated in this work are 26.5 ± 2.2µb at 0.59 ± 0.07 MeV, 24 ± 3 µb at 0.98 ± 0.14 MeV, 21.7 ± 1.3 µb at 1.26 ± 0.11 MeV, 21.8 ± 1.4 µb at 1.32 ± 0.11 MeV, and 18.6 ± 1.1 µb at 1.46 ± 0.13 MeV. These results do not agree with integral cross sections from any of the nuclear data library evaluations. Discrepancies between the new integral cross sections reported here and the nuclear data libraries suggest a more complex cross-section structure in the MeV range which allows for more resonance contributions, and more work is needed to further constrain the evaluated cross sections.

38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗

Distributed Training for High Resolution Images: A Domain and Spatial Decomposition Approach

In this work we developed two Pytorch libraries using the PyTorch RPC interface for distributed deep learning approaches on high resolution images. The spatial decomposition library allows for distributed training on very large images, which otherwise wouldn’t be possible on a single GPU. The domain parallelism library allows for distributed training across multiple domain unlabeled data, by leveraging the domain separation architecture. Both of those libraries where tested on the Summit supercomputer at Oak Ridge National Laboratory at a moderate scale.

Tsaris, Aristeidis (aris)↗

Deriving the Infrared Complex Refractive Indices of Organic Powders for Optical Modeling: Comparison of Methods

Identification of solids via infrared reflection spectroscopy requires a spectral library of all solids likely to be encountered. A confounding factor in populating such a spectral library is that the reflectance spectra of solids vary with their form, including particle size, film thickness, and substrate. To reduce the efforts of experimentally constructing such a library, an alternate strategy is to use the wavelength-dependent optical constants, n and k, of a solid to calculate a series of reflectance spectra corresponding to each scenario or morphology. Because most n/k measurements are best performed on mm-sized crystals, however, the challenge of determining the optical constants increases when a solid is only readily available as a powder, as is often the case. Some organic solids, such as caffeine, are both unavailable in large crystals and difficult to press into pellets. In this study, the infrared optical constants, or complex refractive indices, of caffeine were determined using three different methods: single-angle reflectance, infrared spectroscopic ellipsometry, and quantitative absorbance measurements of KBr pellets. The n and k values derived through each method were used to model the hyperspectral imaging reflectance spectrum of a caffeine film on a steel planchet. Over 1,110 – 870 cm-1, the single-angle reflectance-derived n and k had the best correlation with the experimental spectrum. These results suggest different organic solids may require different methods to determine the most accurate infrared complex refractive indices for synthetic spectral libraries.

FTIR, hyperspectral imaging, infrared, infrared (I↗

The Pele Simulation Suite for Reacting Flows at Exascale

In this work, we present the Pele suite of software tools for compressible and incompressible reacting flows. The Pele suite leverages several different libraries, notably AMReX and SUNDIALS, to achieve performance portability on heterogeneous computing architectures across the supercomputing landscape. The Pele suite is comprised of PeleC, a compressible reacting flow block-structured adaptive mesh refinement solver, PeleLMeX, a low-Mach number reacting flow block-structured adaptive mesh refinement solver, Pele-Physics, a library for transport, thermodynamics, finite rate chemistry, soot, spray and radiation physics. The objective of this paper is (i) to present the code development efforts necessary to achieve highly effective and scalable applications for exascale machines and (ii) to detail the performance results of the Combustion-Pele project applications on Oak Ridge National Laboratory's Frontier. We show good weak and strong scaling results for both PeleC and PeleLMeX up to more than 50 billion cells on more than 4096 Frontier graphics processing unit nodes. We also present a capability demonstration simulation of a dual-fuel pulse compression ignition engine (six adaptive mesh refinement levels, and 60 billion cells or 2.1 trillion degrees of freedom) on Frontier, to date one of the largest simulations performed on the first exascale-class supercomputer.

adaptive mesh refinement↗

CommBench: Micro-Benchmarking Hierarchical Networks with Multi-GPU, Multi-NIC Nodes

Modern high-performance computing systems have multiple GPUs and network interface cards (NICs) per node. The resulting network architectures have multilevel hierarchies of subnetworks with different interconnect and software technologies. These systems offer multiple vendor-provided communication capabilities and library implementations (IPC, MPI, NCCL, RCCL, OneCCL) with APIs providing varying levels of performance across the different levels. Understanding this performance is currently difficult because of the wide range of architectures and programming models (CUDA, HIP, OneAPI). We present CommBench, a library with cross-system portability and a high-level API that enables developers to easily build microbenchmarks relevant to their use cases and gain insight into the performance (bandwidth & latency) of multiple implementation libraries on different networks. We demonstrate CommBench with three sets of microbenchmarks that profile the performance of six systems. Our experimental results reveal the effect of multiple NICs on optimizing the bandwidth across nodes and also present the performance characteristics of four available communication libraries within and across nodes of NVIDIA, AMD, and Intel GPU networks.

Hidayetoglu, Mert↗

ArborX

ArborX library tackles a problem of efficiently finding geometric objects that are close in space. Variations of this problem, such as finding the nearest neighbors of a point, or finding all objects within a certain distance, are inherent components of applications in many fields. The data may be large so that solving the problem efficiently may require significant computational resources, such as multiple processors or accelerators such as general purpose GPUs. ArborX' main advantage in its ability to solve large problems efficiently utilizing a combination of distributed and on-node parallelism. ArborX can be run efficiently on a wide variety of hardware, including GPUs from different vendors, which distinguishes it from other available libraries which typically choose only few of these. The other advantage is that it supports both types of user problems: spatial problems (useful for intersections and finding objects within certain distance), and nearest neighbor problems. ArborX also supports flexible interface in its interaction with a user. Particularly, it allows a user to call user's own function on a positive match, a functionality not rarely available in other libraries. ArborX implements construction and traversal algorithms using efficient tree structures, such as bounding volume hierarchy (BVH). At its core, it uses linear BVH for its low construction cost and sufficient quality. ArborX is written using C++, and is parallelized using the message passing interface (MPI) for the distributed communication, and the Kokkos library for on-node parallelism. This approach allows ArborX to be run on a wide variety of hardware, from common laptops and desktops to supercomputers while using the same codebase. ArborX also implements several advanced algorithms using geometric search, such as density-based clustering algorithm DBSCAN.

ECP↗

ArborX 2.0

ArborX library tackles a problem of efficiently finding geometric objects that are close in space. Variations of this problem, such as finding the nearest neighbors of a point, or finding all objects within a certain distance, are inherent components of applications in many fields. The data may be large so that solving the problem efficiently may require significant computational resources, such as multiple processors or accelerators such as general purpose GPUs. ArborX' main advantage in its ability to solve large problems efficiently utilizing a combination of distributed and on-node parallelism. ArborX can be run efficiently on a wide variety of hardware, including GPUs from different vendors, which distinguishes it from other available libraries which typically choose only few of these. The other advantage is that it supports both types of user problems: spatial problems (useful for intersections and finding objects within certain distance), and nearest neighbor problems. ArborX also supports flexible interface in its interaction with a user. Particularly, it allows a user to call user's own function on a positive match, a functionality not rarely available in other libraries. ArborX implements construction and traversal algorithms using efficient tree structures, such as bounding volume hierarchy (BVH). At its core, ArborX uses linear BVH for its low construction cost and sufficient quality. ArborX implements both spatial and nearest-neighbor traversal algorithms. ArborX also provides several clustering algorithms (minimum spanning tree, DBSCAN, HDBSCAN*), interpolation using minimum least squares and ray tracing. ArborX is written using C++, and is parallelized using the message passing interface (MPI) for the distributed communication, and the Kokkos library for on-node parallelism. This approach allows ArborX to be run on a wide variety of hardware, from common laptops and desktops to supercomputers while using the same codebase.

Prokopenko, Andrey [Oak Ridge National Laboratory ↗

radkit v1.2

The radkit software suite (python) consists of three primary libraries: stark, trajan, and curie. The trajan library provides the tools to analyze and manipulate data from lidar and inertial measurement unit (IMU) devices as well as trajectories from algorithms such as simultaneous localization and mapping (SLAM). These components allow reading and writing standard data formats, performing rigid affine transformations, discretizing three-dimensional space, and visualizing data products. The curie library comprises a standard set of object-oriented tools for radiation data and analysis in the following modules: (1) listmode and binmode data classes with methods for manipulation, plotting, slicing and file IO; (2) radiological/nuclear source detection/identification analysis results; (3) source encounters of correlated analyses and (4) energy-dependent angular detector response functions. The stark package provides low-level tools that are leveraged by both curie and trajan. The tools are flexible for offline analysis as well as performant for real-time integrations. The radkit libraries have associated Robot Operating System packages for use in real-time and robotic systems.

Joshi, Tenzing↗

MEUMAPPS (C++ Version)

Many materials, metal alloys in particular, have features on the on micrometer or nanometer scale that have a large impact on the properties of the material. These features are known as the microstructure of the material. Understanding why and how the microstructure forms in a material is of fundamental scientific interest as well as of significant technological interest. The capability to predict microstructure evolution in a material allows the intentional design of microstructures and hence the intentional design of material properties. The phase-field method is one of the leading methods for predicting microstructure evolution. One of the most significant problems for phase-field models is their computational expense. Even limited phase-field simulations can easily require thousands of CPU core-hours to complete, which significantly limits their use. This code provides both a general framework for creating scalable, GPU-accelerated phase-field model applications as well as several applications themselves. The code is capable of using hundreds of GPUs efficiently, which greatly reduces the time required to perform simulations. The code is written with an emphasis on performance portability, that is the ability for the code to run efficiently on a number of different computing architectures without modification of the source code. The performance portability of this code is primarily enabled through the use of two libraries, Kokkos (performance portable data structures and execution patterns) and heFFTe (performance portable distributed 3D fast Fourier transforms). The code consists of a core library, applications, and tests. The core library includes shared functionality between applications. This includes interfaces with fast Fourier transform (FFT) libraries such as heFFTe, data structures based on Kokkos, file input and output capabilities, and a solver for infinitesimal strain mechanical equilibrium problems. Five applications are included in the code. The flagship application is the MEUMAPPS-SS application, which implements the Kim-Kim-Suzuki phase-field model for precipitation for an arbitrary number of phases and components in a metal alloy. Five simpler applications are also included that solve the Eshelby inclusion problem, Allen-Cahn equation, the coupled Allen-Cahn and diffusion equations, and the Cahn-Hilliard equation. The code includes two applications to solve the Cahn-Hilliard equation, one with constant-step-size first-order time integration and the second with adaptive high-order time integration.

DeWitt, Stephen [Oak Ridge National Lab. (ORNL), O↗