Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithmic differentiation”

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 451 records · Page 25
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations

Many applications require minimizing the sum of smooth and nonsmooth functions. For example, basis pursuit denoising problems in data science require minimizing a measure of data misfit plus an $\ell^1$-regularizer. Similar problems arise in the optimal control of partial differential equations (PDEs) when sparsity of the control is desired. Here, we develop a novel trust-region method to minimize the sum of a smooth nonconvex function and a nonsmooth convex function. Our method is unique in that it permits and systematically controls the use of inexact objective function and derivative evaluations. When using a quadratic Taylor model for the trust-region subproblem, our algorithm is an inexact, matrix-free proximal Newton-type method that permits indefinite Hessians. We prove global convergence of our method in Hilbert space and demonstrate its efficacy on three examples from data science and PDE-constrained optimization.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Parametric matrix models

We present a general class of machine learning algorithms called parametric matrix models. In contrast with most existing machine learning models that imitate the biology of neurons, parametric matrix models use matrix equations that emulate physical systems. Similar to how physics problems are usually solved, parametric matrix models learn the governing equations that lead to the desired outputs. Parametric matrix models can be efficiently trained from empirical data, and the equations may use algebraic, differential, or integral relations. While originally designed for scientific computing, we prove that parametric matrix models are universal function approximators that can be applied to general machine learning problems. After introducing the underlying theory, we apply parametric matrix models to a series of different challenges that show their performance for a wide range of problems. For all the challenges tested here, parametric matrix models produce accurate results within an efficient and interpretable computational framework that allows for input feature extrapolation.

Computational science↗
DOE OSTI2025

The System for Classification of Low-Pressure Systems (SyCLoPS): An All-In-One Objective Framework for Large-Scale Data Sets

We propose the first unified objective framework (SyCLoPS) for detecting and classifying all types of low-pressure systems (LPSs) in a given data set. We use the state-of-the-art automated feature tracking software TempestExtremes (TE) to detect and track LPS features globally in ERA5 and compute 16 parameters from commonly found atmospheric variables for classification. A Python classifier is implemented to classify all LPSs at once. The framework assigns 16 different labels (classes) to each LPS data point and designates four different types of high-impact LPS tracks, including tracks of tropical cyclone (TC), monsoonal system, subtropical storm and polar low. The classification process involves disentangling high-altitude and drier LPSs, differentiating tropical and non-tropical LPSs using novel criteria, and optimizing for the detection of the four types of high-impact LPS. A comparison of our labels with those in the International Best Track Archive for Climate Stewardship (IBTrACS) revealed an overall accuracy of 95% in distinguishing between tropical systems, extratropical cyclones, and disturbances. SyCLoPS produces a better TC detection skill compared to the previous algorithms, highlighted by an approximately 6% reduction in the false alarm rate compared to the previous TE algorithm. The vertical cross section composite of the four types of high-impact LPS we detect each shows distinct structural characteristics. Finally, we demonstrate that SyCLoPS is valuable for investigating various aspects of LPSs in climate data, such as the evolution of a single LPS track, patterns of LPS frequencies, and precipitation or wind influence associated with a particular LPS class.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

Machine learning for the identification of phase transitions in interacting agent-based systems: A Desai-Zwanzig example

Deriving closed-form analytical expressions for reduced-order models, and judiciously choosing the closures leading to them, has long been the strategy of choice for studying phase- and noise-induced transitions for agent-based models (ABMs). In this paper, we propose a data-driven framework that pinpoints phase transitions for an ABM—the Desai-Zwanzig model—in its mean-field limit, using a smaller number of variables than traditional closed-form models. To this end, we use the manifold learning algorithm Diffusion Maps to identify a parsimonious set of data-driven latent variables, and we show that they are in one-to-one correspondence with the expected theoretical order parameter of the ABM. We then utilize a deep learning framework to obtain a conformal reparametrization of the data-driven coordinates that facilitates, in our example, the identification of a single parameter-dependent ordinary differential equation (ODE) in these coordinates. Additionally, we identify this ODE through a residual neural network inspired by a numerical integration scheme (forward Euler). We then use the identified ODE—enabled through an odd symmetry transformation—to construct the bifurcation diagram exhibiting the phase transition.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A scalable matrix-free spectral element approach for unsteady PDE constrained optimization using PETSc/TAO

In this work, we provide a new approach for the efficient matrix-free application of the transpose of the Jacobian for the spectral element method for the adjoint-based solution of partial differential equation (PDE) constrained optimization. This results in optimizations of nonlinear PDEs using explicit integrators where the integration of the adjoint problem is not more expensive than the forward simulation. Solving PDE constrained optimization problems entails combining expertise from multiple areas, including simulation, computation of derivatives, and optimization. The Portable, Extensible Toolkit for Scientific computation (PETSc) together with its companion package, the Toolkit for Advanced Optimization (TAO), is an integrated numerical software library that contains an algorithmic/software stack for solving linear systems, nonlinear systems, ordinary differential equations, differential algebraic equations, and large-scale optimization problems and, as such, is an ideal tool for performing PDE-constrained optimization. This paper describes an efficient approach in which the software stack provided by PETSc/TAO can be used for large-scale nonlinear time-dependent problems. Time integration can involve a range of high-order methods, both implicit and explicit. The PDE-constrained optimization algorithm used is gradient-based and seamlessly integrated with the simulation of the physical problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Xyce(™) Parallel Electronic Simulator v.7.5

The Xyce Parallel Electronic Simulator simulates electronic circuit behavior in DC, AC, HB, MPDE and transient mode using standard analog (DAE) and/or device (PDE) device models including several age and radiation aware devices. It supports a variety of computing platforms (both serial and parallel) computers. Lastly, it uses a variety of modern solution algorithms dynamic parallel load-balancing and iterative solvers.! ! Xyce is primarily used to simulate the voltage and current behavior of a circuit network (a network of electronic devices connected via a conductive network). As a tool, it is mainly used for the design and analysis of electronic circuits.! ! Kirchoff's conservation laws are enforced over a network using modified nodal analysis. This results in a set of differential algebraic equations (DAEs). The resulting nonlinear problem is solved iteratively using a fully coupled Newton method, which in turn results in a linear system that is solved by either a standard sparse-direct solver or iteratively using Trilinos linear solver packages, also developed at Sandia National Laboratories.

Source record↗
DOE OSTI2022

Time-dependent Hamiltonian Simulation of Highly Oscillatory Dynamics and Superconvergence for Schrödinger Equation

We propose a simple quantum algorithm for simulating highly oscillatory quantum dynamics, which does not require complicated quantum control logic for handling time-ordering operators. To our knowledge, this is the first quantum algorithm that is both insensitive to the rapid changes of the time-dependent Hamiltonian and exhibits commutator scaling. Our method can be used for efficient Hamiltonian simulation in the interaction picture. In particular, we demonstrate that for the simulation of the Schrödinger equation, our method exhibits superconvergence and achieves a surprising second order convergence rate, of which the proof rests on a careful application of pseudo-differential calculus. Numerical results verify the effectiveness and the superconvergence property of our method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

miss-SNF: a multimodal patient similarity network integration approach to handle completely missing data sources

Abstract Motivation Precision medicine leverages patient-specific multimodal data to improve prevention, diagnosis, prognosis, and treatment of diseases. Advancing precision medicine requires the non-trivial integration of complex, heterogeneous, and potentially high-dimensional data sources, such as multi-omics and clinical data. In the literature, several approaches have been proposed to manage missing data, but are usually limited to the recovery of subsets of features for a subset of patients. A largely overlooked problem is the integration of multiple sources of data when one or more of them are completely missing for a subset of patients, a relatively common condition in clinical practice. Results We propose miss-Similarity Network Fusion (miss-SNF), a novel general-purpose data integration approach designed to manage completely missing data in the context of patient similarity networks. miss-SNF integrates incomplete unimodal patient similarity networks by leveraging a non-linear message-passing strategy borrowed from the SNF algorithm. miss-SNF is able to recover missing patient similarities and is “task agnostic”, in the sense that can integrate partial data for both unsupervised and supervised prediction tasks. Experimental analyses on nine cancer datasets from The Cancer Genome Atlas (TCGA) demonstrate that miss-SNF achieves state-of-the-art results in recovering similarities and in identifying patients subgroups enriched in clinically relevant variables and having differential survival. Moreover, amputation experiments show that miss-SNF supervised prediction of cancer clinical outcomes and Alzheimer’s disease diagnosis with completely missing data achieves results comparable to those obtained when all the data are available. Availability and implementation miss-SNF code, implemented in R, is available at https://github.com/AnacletoLAB/missSNF.

Biochemistry & Molecular Biology↗
DOE OSTI2025

Scalable Algorithms for Inverse Problems With High-Dimensional Parameter Spaces

Inverse problems, which involve inferring unknown parameters from observed data, present significant computational challenges, especially in large-scale settings with high-dimensional unknown parameters and nonlinear relationships between the unknowns and observations. Bayesian inference provides an approach for addressing these problems, often relying on sequential sampling methods like Markov chain Monte Carlo (MCMC) to approximate the posterior distribution of the parameters. However, MCMC methods become computationally demanding as the dimensionality of the problem increases, particularly in large-scale systems where likelihood evaluations rely on solving partial differential equations (PDEs) on large spatial domains with finely resolved meshes. To overcome these limitations, recent advancements have focused on designing scalable computa tional techniques – for both PDE simulations and sampling strategies – to make Bayesian methods feasible for high-dimensional problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Theory of an Automatic Seepage Meter and Ramifications for Applications

A new approach for measuring fluxes across surface water—groundwater interfaces was recently proposed. The Automatic Seepage Meter (ASM) is equipped with a precise water level sensor and digital memory that analyzes water level time series in a vertical tube inserted into a streambed. The ability to infer flux values with high temporal resolution relies on an accurate interpretation of water level dynamics inside the tube. Here, we reduce the three-dimensional hydrodynamic problem that describes the ASM water level in a variety of field conditions to a single ordinary differential equation. This novel general analytical solution for estimating ASM responses is more comprehensive and flexible than previous approaches and is applicable to the entire range of field conditions, including steady or transient stream stages, evaporation, rainfall, and noise. For example, our analysis determines the timing of the nonmonotonic ASM response to a monotonic linear stream stage variation and explains previously used empirical parabolic approximation for estimating fluxes. We present algorithms for simultaneous inference of vertical interface flux and hydraulic conductivity values together with an example code. We quantify how the accuracy of parameter estimation depends on test duration and noise amplitude and propose how our analysis can be used to optimize field test protocols. On this basis, changing the ASM geometry by increasing the radius and decreasing tube insertion depth may enable ASM field test protocols that estimate interface flux and hydraulic conductivity faster while maintaining desired accuracy. Potential applications of joint parameter estimation are suggested.

47 OTHER INSTRUMENTATION↗
DOE OSTI2024

Measurement of jet substructure in boosted $t\overline{t}$ events with the ATLAS detector using 140 fb -1 of 13 TeV $pp$ collisions

Measurements of the substructure of top-quark jets are presented, using 140 fb -1 of 13 TeV pp collision data recorded with the ATLAS detector at the LHC. Top-quark jets reconstructed with the anti-k t algorithm with a radius parameter R = 1.0 are selected in top-quark pair ($t\overline{t}$) events where one top quark decays semileptonically and the other hadronically, or where both top quarks decay hadronically. The top-quark jets are required to have transverse momentum p T > 350 GeV, yielding large samples of data events with jet p T values between 350 and 600 GeV. One- and two-dimensional differential cross sections for eight substructure variables, defined using only the charged components of the jets, are measured in a particle-level phase space by correcting for the smearing and acceptance effects induced by the detector. The differential cross sections are compared with the predictions of several Monte Carlo simulations in which top-quark pair-production quantum chromodynamic matrix-element calculations at next-to-leading-order precision in the strong coupling constant α S are passed to leading-order parton shower and hadronization generators. The Monte Carlo predictions for measures of the broadness, and also the two-body structure, of the top-quark jets are found to be in good agreement with the measurements, while variables sensitive to the three-body structure of the top-quark jets exhibit some tension with the measured distributions.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2025

AlgaeOrtho, a bioinformatics tool for processing ortholog inference results in algae

Introduction: Microalgae constitute a prominent feedstock for producing biofuels and biochemicals by virtue of their prolific reproduction, high bioproduct accumulation, and the ability to grow in brackish and saline water. However, naturally occurring wild type algal strains are rarely optimal for industrial use; therefore, bioengineering of algae is necessary to generate superior performing strains that can address production challenges in industrial settings, particularly the bioenergy and bioproduct sectors. One of the crucial steps in this process is deciding on a bioengineering target: namely, which gene/protein to differentially express. These targets are often orthologs which are defined as genes/proteins originating from a common ancestor in divergent species. Although bioinformatics tools for the identification of protein orthologs already exist, processing the output from such tools is nontrivial, especially for a researcher with little or no bioinformatics experience. Methods: The present study introduces AlgaeOrtho, a user-friendly tool that builds upon the SonicParanoid orthology inference tool (based on an algorithm that identifies potential protein orthologs based on amino acid sequences) and the PhycoCosm database from JGI (Joint Genome Institute) to help researchers identify orthologs of their proteins of interest in multiple diverse algal species. Results: The output of this application includes a table of the putative orthologs of their protein of interest, a heatmap showing sequence similarity (%), and an unrooted tree of the putative protein orthologs. Notably, the tool would be instrumental in identifying novel bioengineering targets in different algal strains, including targets in not-fully annotated algal species, since it does not depend on existing protein annotations. We tested AlgaeOrtho using three case studies, for which orthologs of proteins relevant to bioengineering targets, were identified from diverse algal species, demonstrating its ease of use and utility for bioengineering researchers. Discussion: This tool is unique in the protein ortholog identification space as it can visualize putative orthologs, as desired by the user, across several algal species.

09 BIOMASS FUELS↗
DOE OSTI2023

Method and apparatus for constructing informative outcomes to guide multi-policy decision making

In Multi-Policy Decision-Making (MPDM), many computationally-expensive forward simulations are performed in order to predict the performance of a set of candidate policies. In risk-aware formulations of MPDM, only the worst outcomes affect the decision making process, and efficiently finding these influential outcomes becomes the core challenge. Recently, stochastic gradient optimization algorithms, using a heuristic function, were shown to be significantly superior to random sampling. In this disclosure, it was shown that accurate gradients can be computed-even through a complex forward simulation—using approaches similar to those in dep networks. The proposed approach finds influential outcomes more reliably, and is faster than earlier methods, allowing one to evaluate more policies while simultaneously eliminating the need to design an easily-differentiable heuristic function.

Olson, Edwin↗
DOE OSTI2023

Faster approximate subgraph counts with privacy

One of the most common problems studied in the context of differential privacy for graph data is counting the number of non-induced embeddings of a subgraph in a given graph. These counts have very high global sensitivity. Therefore, adding noise based on powerful alternative techniques, such as smooth sensitivity and higher-order local sensitivity have been shown to give significantly better accuracy. However, all these alternatives to global sensitivity become computationally very expensive, and to date efficient polynomial time algorithms are known only for few selected subgraphs, such as triangles, k-triangles, and k-stars. In this paper, we show that good approximations to these sensitivity metrics can be still used to get private algorithms. Using this approach, we much faster algorithms for privately counting the number of triangles in real-world social networks, which can be easily parallelized. We also give a private polynomial time algorithm for counting any constant size subgraph using less noise than the global sensitivity; we show this can be improved significantly for counting paths in special classes of graphs

Nguyen, Dung↗
DOE OSTI2020

Application of Gaussian Bayes classifier to differentiate chlorine-based chemical agents

The Portable Isotopic Neutron Spectroscopy (PINS) is a commercialized system developed by Idaho National Laboratory (INL) to examine chemical warfare agents (CWA) non-destructively, utilizing Prompt Gamma Neutron Activation Analysis (PGNAA) techniques. The PINS system takes advantage of a high-resolution gamma-ray spectrum from a mechanically-cooled high-purity germanium (HPGe) detector. One of the difficult technical challenges is to discriminate the chlorine-based chemical agents. Especially, CN, CNB, CNS and CG have similar chemical compositions to make it hard to discriminate them with a higher confidence. Current identification algorithms for PINS systems with 252-Cf sources have been improved and updated continuously as more field data became available, and new algorithms was studied to complement the current algorithms by adopting the Gaussian Bayes classifier. These new algorithms were intended to be applied to a subset of chlorine-based chemical agents, and their main goal is discriminate CN, CNB, CNS and CG with their ratios of the chlorine neutron inelastic 1763keV peak to the chlorine thermal neutron capture 1959keV peak, which is referred to as the “Cl i/c” or “clic” ratio in this study. The Cl i/c ratios were assumed to follow Gaussian distributions with the means and the standard deviations unique to their corresponding chemical agents. The prior probabilities of these four chemical agents were optimized with a collection of field data to achieve the best performance in terms of precision or positive predictive value (PPV). Finally, their posterior probabilities as functions of the Cl i/c ratio were implemented in the current version of PINS analysis software in order to be tested with more field data.

38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗
DOE OSTI2022

Nanoindentation mapping defects filtration for heterogeneous materials using generative adversarial networks

Advanced composite materials with multiple phases and heterogeneous microstructure necessitate spatial mapping characterization of elastic modulus to develop constitutive relations and overall mechanical response. Such modulus mapping can be obtained using the nanoindentation technique, where the indenter tip raster over the selected microstructure region. Typically, a surface preparation procedure is done in the specimens to ensure proper contact between the indenter tip and sample surface. However, a near-perfect surface finish is unachievable in heterogeneous materials, primarily with ceramic reinforcements, due to the differential material removal rate during polishing. Thus, the nanoindenter records localized erroneous measurements due to differences in surface roughness and corresponding force response. This study establishes a novel deep learning-based strategy to rectify incorrect experimental spatial measurements acquire during nanoindentation modulus mapping. Here, the integrated bicubic interpolation and generative adversarial networks (GANs) model was trained using 14 ceramic and 18 metallic data sets, each comprising 65,536 measurements. The developed algorithm was validated against experimental measurements on four unknown specimens. The standard deviation in measured elastic modulus reduces by ~50% in ceramics and ~72% in metallic samples. This computational framework proposes a novel approach to reducing uncertainty in materials’ properties using state-of-the-art computer vision techniques.

36 MATERIALS SCIENCE↗
DOE OSTI2023

The DESC stellarator code suite Part 3: Quasi-symmetry optimization

The DESC stellarator optimization code takes advantage of advanced numerical methods to search the full parameter space much faster than conventional tools. Only a single equilibrium solution is needed at each optimization step thanks to automatic differentiation, which efficiently provides exact derivative information. A Gauss–Newton trust-region optimization method uses second-order derivative information to take large steps in parameter space and converges rapidly. With just-in-time compilation and GPU portability, high-dimensional stellarator optimization runs take orders of magnitude less computation time with DESC compared to other approaches. This paper presents the theory of the DESC fixed-boundary local optimization algorithm along with demonstrations of how to easily implement it in the code. Example quasi-symmetry optimizations are shown and compared to results from conventional tools. Three different forms of quasi-symmetry objectives are available in DESC, and their relative advantages are discussed in detail. In the examples presented, the triple product formulation yields the best optimization results in terms of minimized computation time and particle transport. This paper concludes with an explanation of how the modular code suite can be extended to accommodate other types of optimization problems.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2020

An extended trajectory-mechanics approach for calculating two-phase flow paths

A technique originating in quantum dynamics is used to derive a trajectory-based, semi-analytical solution for two-phase flow. The partial differential equation governing the evolution of the aqueous phase is equivalent to a family of ordinary differential equations defined along a path through the porous medium. The trajectories may be found by solving the differential equations directly or by post-processing the output of a numerical solution to the full set of governing equations. The trajectories, which differ from conventional streamlines, are found to bend downward in response to gravitational forces. The curvature is more pronounced as the dip of the porous layer containing the flow increases. Subtle changes in the relative permeability curve can lead to significant variations in the trajectories. The ordinary differential equation for the trajectory provides an expression for the travel time along the path. The expression produces a semi-analytical approximation to the model parameter sensitivities, the partial derivatives of the travel times with respect to changes in the permeability model. The semi-analytical trajectory-based sensitivities generally agree with those computed using a numerical reservoir simulator and a perturbation approach. The sensitivities are useful in tomographic imaging algorithms designed to estimate the spatial variation in permeability within a porous medium using multiphase observations.

58 GEOSCIENCES↗