Search NASA⌕ Search

SEARCH · Search NASA

Results for “high order methods”

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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Numerical integration in the virtual element method with the scaled boundary cubature scheme

Abstract The virtual element method (VEM) is a stabilized Galerkin method on meshes that consist of arbitrary (convex and nonconvex) polygonal and polyhedral elements. A crucial ingredient in the implementation of low‐ and high‐order VEM is the numerical integration of monomials and nonpolynomial functions over such elements. In this article, we apply the recently proposed scaled boundary cubature (SBC) scheme to compute the weak form integrals in various virtual element formulations over polygonal and polyhedral meshes. In doing so, we demonstrate the flexibility of the approach and the accuracy that it delivers on a broad suite of boundary‐value problems in 2D and 3D over polytopes with affine faces as well as on elements with curved boundaries. In addition, the use of the SBC scheme is exemplified in an enriched Poisson formulation of the VEM in which weakly singular functions are required to be integrated. This study establishes the SBC method as a simple, accurate and efficient integration scheme for use in the VEM.

Chin, Eric B.↗
DOE OSTI2026

Scientific Discovery with Physics-Informed System Identification (Abbreviated Report)

My fellowship research focused on making physics-based simulations faster and more useful through machine learning. Many problems in science and engineering are governed by partial differential equations, but high-fidelity simulations are often too expensive to run repeatedly. I worked on improving Latent Space Dynamics Identification (LaSDI), a reduced-order modeling framework that compresses large simulation data sets into a smaller representation and then learns how that representation evolves over time. The motivation was to develop reduced models that remain accurate for more challenging systems, especially when predictions must remain reliable over long time intervals or when the underlying dynamics are more complicated than standard methods can easily handle. I also contributed to related work on Quandary, a high-performance software effort for simulation and control of open quantum systems, before focusing primarily on Latent Space Dynamics Identification methods. The main outcomes of the fellowship were two new algorithms (both of which were published), Rollout-LaSDI and Higher-Order LaSDI, together with supporting work on multi-stage Latent Space Dynamics Identification. Rollout-LaSDI improved long-term prediction by training the model to stay accurate over extended time horizons, and Higher-Order LaSDI broadened the method so it could model systems with higher-order time dynamics. My contributions to multistage Latent Space Dynamics Identification also helped show that its later training stages could be simplified without losing effectiveness, and that this behavior held across different model architectures and training strategies. Taken together, these advances improved the accuracy, flexibility, and practical value of reduced-order modeling tools for computational science.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Masked Particle Modeling on Sets: Towards Self-Supervised High Energy Physics Foundation Models

Abstract We propose masked particle modeling (MPM) as a self-supervised method for learning generic, transferable, and reusable representations on unordered sets of inputs for use in high energy physics (HEP) scientific data. This work provides a novel scheme to perform masked modeling based pre-training to learn permutation invariant functions on sets. More generally, this work provides a step towards building large foundation models for HEP that can be generically pre-trained with self-supervised learning and later fine-tuned for a variety of down-stream tasks. In MPM, particles in a set are masked and the training objective is to recover their identity, as defined by a discretized token representation of a pre-trained vector quantized variational autoencoder. We study the efficacy of the method in samples of high energy jets at collider physics experiments, including studies on the impact of discretization, permutation invariance, and ordering. We also study the fine-tuning capability of the model, showing that it can be adapted to tasks such as supervised and weakly supervised jet classification, and that the model can transfer efficiently with small fine-tuning data sets to new classes and new data domains.

Heinrich, Lukas (ORCID:0000000240487584)↗
DOE OSTI2025

SDA: a symbolic differential algebra package in C++

Truncated Power Series Algebra (TPSA), or Differential Algebra (DA), is a well-established tool in accelerator physics, commonly used for generating high-order maps of dynamic systems, as well as in symplectic tracking, normal form analysis, verified integration, optimization, and fast multipole methods. This package is the first to perform symbolic DA computations, enabling traceability of initial condition contributions and runtime reduction for repeated DA calculations, potentially expanding DA’s applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Portable Parallel Algorithms and Frameworks for Exascale Graph Analytics

Graphs (or networks) are a tool used to model the interactions among various entities. Efficiently processing large graphs has recently attracted significant attention due to the applications of graphs in various domains, such as biology, chemistry, and cyber-security. Analyzing the structure and properties of these graphs is an important component of many scientific computing pipelines. With the explosion in the volume of data, graphs have become very large and can contain hundreds of billions of vertices and trillions of edges. Therefore, it is crucial to develop high-performance methods to enable graph analysis to be done quickly and energy-efficiently. Furthermore, these solutions should be highly parallel in order to take advantage of modern parallel machines. However, designing efficient solutions is not enough. With the wide variety of computing environments available, each with different programmability and performance characteristics, it is necessary to develop solutions that are portable in terms of both performance (i.e., provide theoretical guarantees) and programmability (i.e., provide high level abstractions).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

A Scaling Study for Incompressible Multispecies Solver in Vertex-CFD

Multispecies incompressible flows occur widely in engineering and environmental applications, such as chemical reactors, fuel cells, ocean mixing, and biomedical systems. However, accurately resolving the complex transport and mixing phenomena associated with multiple interacting species remains computationally challenging, especially for large-scale problems. In this study, we present a robust, high-performance computing--enabled multispecies incompressible Navier–Stokes solver integrated within the Vertex-CFD framework. Our solver employs a fully coupled, implicit, finite element--based formulation that accurately captures the advection, diffusion, and interaction of multiple species in incompressible flows by leveraging the Kokkos library for parallel computing to achieve high computational efficiency. For pressure coupling, the entropically damped artificial compressibility method is utilized. We validated the solver against canonical test cases, including multispecies advection, diffusion, and Bateman systems; the results demonstrate second- and third-order spatial accuracy and consistent convergence. Additionally, we demonstrated the strong and weak scaling study results obtained on the leadership-class high-performance computing system, Frontier at Oak Ridge National Laboratory.

Oz, Furkan [ORNL] (ORCID:0000000265831724)↗
DOE OSTI2024

Low-Cost Heliostat for High-Flux Small-Area Receivers (Final Technical Report)

This project analyzed a two-stage heliostat concept consisting of a tracking stage and a concentrating stage. The tracking stage uses mirrors mounted on a common drive that move to track the sun. The concentrating stage consists of stationary mirrors that each have a unique angle to direct rays towards a small-area, high-flux, point-focused receiver. By splitting the collection and concentrating process into two stages, multiple small, inexpensive mirrors can share a structure and be controlled by a single drive in the tracking stage. The project effort developed modeling techniques that were specifically relevant to this two-stage heliostat concept. Both field-level and unit-level models were developed. The field-level model does not explicitly consider unit-level losses which are predicted by the unit-level model and then integrated into the field-level model through a correlation referred to as an efficiency modifier. This approach is referred to as the two-model approach; the development and demonstration of this two-model approach for a multi-stage heliostat technology is a key outcome of this work. The field-level model is used to design a field that hits a specific design day power given a set of heliostat design parameters. An oversized field is simulated and then heliostat units are removed based on their annual energy production in order to generate the highest performing field. The field reduction procedure fits a smooth curve fit to annual energy production as a function of position in the field which has the effect of reducing the noise that is otherwise caused by the Monte Carlo ray tracing technique. This approach is referred to as the annual energy fit method and substantially reduces computational run time for a given field level modeling accuracy. The annual energy fit approach enables the selection of a properly sized, high-performing field using orders of magnitude fewer rays than would otherwise be possible and the development of this approach is a second key outcome of this work. These models are used within a genetic optimization algorithm in order to optimize the geometric parameters associated with a heliostat in order to achieve the lowest cost per unit of collected design day power. The cost modeling that underlies the optimization is a simple, scaling type analysis backed up by a much more detailed Design for Manufacture and Assembly (DFMA) analysis. Although the figure of merit used for optimization was not cost per mirror area, this metric is reasonable to use as a means of comparison. The optimally designed 500 kW design has a tracking mirror specific cost of $181.85/m 2 , which is significantly larger than the target value and also larger than the current state of the art. The cost of the torque-tube type linkages contributed substantially to the overall cost. Based on this observation, potentially attractive alternative design configuration utilizing a capstan type actuation system should be investigated. Finally, NREL compared the performance of the two-stage heliostat to the performance of a focused and different sized flat conventional heliostats and showed that, as expected, additional losses versus the convention heliostat caused by a worse cosine efficiency, two stages of reflection, and interstage interactions. The two-stage heliostat requires around 75% more reflective area than a flat 1x1 meter conventional heliostat (similar to a focused heliostat) and 40% more than a flat 2x2 meter conventional heliostat.

14 SOLAR ENERGY↗
DOE OSTI2025

Moment-based adaptive time integration for thermal radiation transport

Here, in this paper we develop a framework for moment-based adaptive time integration of deterministic multifrequency thermal radiation transpot (TRT). We generalize our recent semi-implicit-explicit (IMEX) integration framework for gray TRT to multifrequency TRT, and also introduce a semi-implicit variation that facilitates higher-order integration of TRT, where each stage is implicit in all components except opacities. To appeal to the broad literature on adaptivity with Runge–Kutta methods, we derive new embedded methods for four asymptotic preserving IMEX Runge–Kutta schemes we have found to be robust in our previous work on TRT and radiation hydrodynamics. We then use a moment-based high-order-low-order representation of the transport equations. Due to the high dimensionality, memory is always a concern in simulating TRT. We form error estimates and adaptivity in time purely based on temperature and radiation energy, for a trivial overhead in computational cost and memory usage compared with the base second order integrators. We then test the adaptivity in time on the tophat and Larsen problem, demonstrating the ability of the adaptive algorithm to naturally vary the timestep across 4–5 orders of magnitude, ranging from the dynamical timescales of the streaming regime to the thick diffusion limit.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

The chemRIXS Instrument for Solution-Phase Resonant Inelastic X-ray Scattering at the Linac Coherent Light Source

The chemRIXS instrument at the Linac Coherent Light Source (LCLS) offers new opportunities for studying solution-phase systems with time-resolved soft X-ray spectroscopic methods such as resonant inelastic X-ray scattering (RIXS) using the recently commissioned high-repetition-rate LCLS-II X-ray free electron laser. The orders-of-magnitude X-ray flux improvement provided by the superconducting accelerator, combined with corresponding advances in the optical laser system and the liquid jet recirculation system, enables studies on dilute systems with high signal-to-noise compared to what was possible with the LCLS-I copper accelerator. These capabilities open up time-resolved X-ray absorption spectroscopy and RIXS to entirely new classes of samples, as well as enabling the development of new soft X-ray spectroscopic methods on liquid samples. An overview of the beamline components and the first LCLS-II commissioning results are presented.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Simulating Open Quantum Systems Using Hamiltonian Simulations

We present a novel method to simulate the Lindblad equation, drawing on the relationship between Lindblad dynamics, stochastic differential equations, and Hamiltonian simulations. We derive a sequence of unitary dynamics in an enlarged Hilbert space that can approximate the Lindblad dynamics up to an arbitrarily high order. This unitary representation can then be simulated using a quantum circuit that involves only Hamiltonian simulation and tracing out the ancilla qubits. There is no need for additional postselection in measurement outcomes, ensuring a success probability of one at each stage. Our method can be directly generalized to the time-dependent setting. We provide numerical examples that simulate both time-independent and time-dependent Lindbladian dynamics with accuracy up to the third order. Published by the American Physical Society 2024

Ding, Zhiyan (ORCID:000000018863403X)↗
DOE OSTI2025

mphys-surrogate-model

This repository contains python scripts for building and studying reduced-order-modeling representations of droplet coalescence for eventual use in atmospheric models. The included data are generated from high-fidelity superdroplet methods and are utilized by machine learning pipelines to build data-driven models of droplet size distributions that evolve under coalescence. This repository further includes scripts to determine prediction (uncertainty) intervals on the data-driven model products based on conformal prediction.

Katona, JonasE [Lawrence Livermore National Labora↗
DOE OSTI2025

Tools for unbinned unfolding

Machine learning has enabled differential cross section measurements that are not discretized. Going beyond the traditional histogram-based paradigm, these unbinned unfolding methods are rapidly being integrated into experimental workflows. Here, in order to enable widespread adaptation and standardization, we develop methods, benchmarks, and software for unbinned unfolding. For methodology, we demonstrate the utility of boosted decision trees for unfolding with a relatively small number of high-level features. This complements state-of-the-art deep learning models capable of unfolding the full phase space. To benchmark unbinned unfolding methods, we develop an extension of existing dataset to include acceptance effects, a necessary challenge for real measurements. Additionally, we directly compare binned and unbinned methods using discretized inputs for the latter in order to control for the binning itself. Lastly, we have assembled two software packages for the OmniFold unbinned unfolding method that should serve as the starting point for any future analyses using this technique. One package is based on the widely-used RooUnfold framework and the other is a standalone package available through the Python Package Index (PyPI).

47 OTHER INSTRUMENTATION↗
DOE OSTI2024

A high-order explicit Runge-Kutta approximation technique for the shallow water equations

Here, we introduce a high-order space–time approximation of the Shallow Water Equations with sources that is invariant-domain preserving (IDP), well-balanced with respect to rest states, and employs a novel explicit Runge–Kutta (ERK) introduced in Ern and Guermond (SIAM J. Sci. Comput. 44(5), A3366–A3392, 2022) for systems of non-linear conservation equations. The resulting method is then numerically illustrated through verification and validation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Image processing tools for petabyte-scale light sheet microscopy data

Light sheet microscopy is a powerful technique for high-speed three-dimensional imaging of subcellular dynamics and large biological specimens. However, it often generates datasets ranging from hundreds of gigabytes to petabytes in size for a single experiment. Conventional computational tools process such images far slower than the time to acquire them and often fail outright due to memory limitations. To address these challenges, we present PetaKit5D, a scalable software solution for efficient petabyte-scale light sheet image processing. This software incorporates a suite of commonly used processing tools that are optimized for memory and performance. Notable advancements include rapid image readers and writers, fast and memory-efficient geometric transformations, high-performance Richardson–Lucy deconvolution and scalable Zarr-based stitching. These features outperform state-of-the-art methods by over one order of magnitude, enabling the processing of petabyte-scale image data at the full teravoxel rates of modern imaging cameras. The software opens new avenues for biological discoveries through large-scale imaging experiments.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A performant energy-conserving particle reweighting method for Particle-in-Cell simulations

A new particle-based reweighting method is developed and demonstrated in the Aleph Particle-in-Cell with Direct Simulation Monte Carlo (PIC-DSMC) program. Novel splitting and merging algorithms ensure that modified particles maintain physically consistent positions and velocities. This method allows a single reweighting simulation to efficiently model plasma evolution over orders of magnitude variation in density, while accurately preserving energy distribution functions (EDFs). Demonstrations on electrostatic sheath and collisional rate dynamics show that reweighting simulations achieve accuracy comparable to fixed weight simulations with substantial computational time savings. This highly performant reweighting method is recommended for modeling plasma applications that require accurate resolution of EDFs or exhibit significant density variations in time or space.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

Improving precision and accuracy of genetic mapping with genotyping‐by‐sequencing data in outcrossing species

Abstract Genotyping‐by‐sequencing (GBS) is a widely used strategy for obtaining large numbers of genetic markers in model and non‐model organisms. In crop plants, GBS‐derived marker datasets are frequently used to perform quantitative trait locus (QTL) mapping. In some plant species, however, high heterozygosity and complex genome structure mean that researchers must use care in handling GBS data to conduct QTL mapping most effectively. Such outbred crops include most of the perennial grass and tree species used for bioenergy. To identify strategies for increasing accuracy and precision of QTL mapping using GBS data in outbred crops, we conducted an empirical study of SNP‐calling and genetic map‐building pipeline parameters in a Miscanthus sinensis population, and a complementary simulation study to estimate the relationship between genome‐wide error rate, read depth, and marker number. The bioenergy grass Miscanthus is an obligate outcrossing species with a recent (diploidized) whole‐genome duplication. For the study of empirical M. sinensis data, we compared two SNP‐calling methods (one non‐reference‐based and one reference‐based), a series of depth filters (12×, 20×, 30×, and 40×) and two map‐construction methods (i.e., marker ordering: linkage‐only and order‐corrected based on a reference genome). We found that correcting the order of markers on a linkage map by using a high‐quality reference genome improved QTL precision (shorter confidence intervals). For typical GBS datasets of between 1000 and 5000 markers to build a genetic map for biparental populations, a depth filter set at 30× to 40× applied to outbred populations provided a genome‐wide genotype‐calling error rate of less than 1%, improved accuracy of QTL point estimates and minimized type I errors for identifying QTL. Based on these results, we recommend using a reference genome to correct the marker order of genetic maps and a robust genotype depth filter to improve QTL mapping for outbred crops.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2025

Optimizing the optimizer for physics-informed neural networks and Kolmogorov-Arnold networks

Physics-Informed Neural Networks (PINNs) have revolutionized the computation of PDE solutions by integrating partial differential equations (PDEs) into the neural network’s training process as soft constraints, becoming an important component of the scientific machine learning (SciML) ecosystem. More recently, physics-informed Kolmogorv-Arnold networks (PIKANs) have also shown to be effective and comparable in accuracy with PINNs. In their current implementation, both PINNs and PIKANs are mainly optimized using first-order methods like Adam, as well as quasi-Newton methods such as BFGS and its low-memory variant, L-BFGS. However, these optimizers often struggle with highly nonlinear and non-convex loss landscapes, leading to challenges such as slow convergence, local minima entrapment, and (non)degenerate saddle points. In this study, we investigate the performance of Self- Scaled BFGS (SSBFGS), Self-Scaled Broyden (SSBroyden) methods and other advanced quasi-Newton schemes, including BFGS and L-BFGS with different line search strategies. These methods dynamically rescale updates based on historical gradient information, thus enhancing training efficiency and accuracy. We systematically compare these optimizers – using both PINNs and PIKANs – on key challenging PDEs, including the Burgers, Allen-Cahn, Kuramoto-Sivashinsky, Ginzburg-Landau, and Stokes equations. Additionally, we evaluate the performance of SSBFGS and SSBroyden for Deep Operator Network (DeepONet) architectures, demonstrating their effectiveness for data-driven operator learning. Our findings provide state-of-the-art results with orders-of-magnitude accuracy improvements without the use of adaptive weights or any other enhancements typically employed in PINNs. More broadly, our work reveal insights into the effectiveness of quasi-Newton optimization strategies in significantly improving the convergence and accurate generalization of PINNs and PIKANs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

The Ductility of 49Fe-49Co-2V Soft Magnetic Alloy Bar: Surface Effects and Test Methods

The tensile ductility of 49Fe-49Co-2V (Hiperco® 50A) bar was investigated in both as-received and heat-treated conditions. The as-received/machined specimens exhibit very low ductility compared to samples where heat treatment was the final step prior to testing. Microstructural characterization showed that internal residual strain from bar processing and, most importantly, surface machining damage, cause lower elongation in the as-received material. Because fracture of this intermetallic alloy initiates at the surface, it is particularly susceptible to surface machining damage, i.e., the near-surface region has already exhausted most of its ability to accumulate tensile strain. During heat treatment, the internal residual strain and near-surface machining damage are eliminated and ductility is improved, despite a higher degree of crystallographic ordering in the heat-treated condition (which typically lowers ductility). Furthermore, if machining is again performed after heat treatment, the material again exhibits brittle behavior, even with only light touch-up machining passes. Here, in this work, methods of tensile strain measurement were investigated, namely conventional knife-edge extensometry and noncontact digital image correlation (DIC) on heat-treated material. For clip-on knife-edge extensometry, the range of failure strain was 2.5-5.5% for heat-treated Hiperco. For noncontact methods, ductility up to 7% was observed. The results highlight the tendency for the alloy to fail at surface imperfections, even those produced by application of the extensometer itself. Noncontact laser extensometry is recommended for determining the intrinsic ductility of the alloy. A method of laser surface modification was developed which increased ductility by ~ 100% compared to unmodified samples. The high cooling rates achieved during laser surface processing can bypass the ordering reaction and produce a ductile disordered structure at the surface that exhibits ductile fracture characteristics.

EBSD↗