SEARCH · Engineering Papers

Results for “Convex functions”

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 109 records · Page 6

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Throughput Measurements and Profile Analysis of Cloud Networks

Cloud networks utilize virtual connections to connect virtual machines distributed across cloud sites. They are increasingly deployed due to flexible provisioning using software and cost-effectiveness in not requiring to build physical network infrastructure. However, their extensive virtualization makes it unclear how well the established practices of conventional networks translate to them. Here, we study throughput measurements over a Google Cloud network using a matching hardware emulated conventional network, which provide production and exploratory conditions, respectively. The measurements span connections representing local, cross-continental and around the Earth distances. We study the effects of parallel flows, congestion control algorithms and retransmissions on the network throughput profile expressed as a function of RTT. We compare the throughput profile of Google Cloud network with those of emulated network under various loss conditions, including those too disruptive or expensive in the former. Our analysis based on the concave-convex shape and utilization-concavity coefficients of throughput profiles indicates an overall agreement of performance between the two networks, thereby justifying the use of conventional network emulations to analyze cloud networks. In terms of practical use, our study establishes that BBR and BBRv2 alpha TCP achieve higher throughput compared to loss-based congestion control algorithms under most network configurations, especially, under losses at large RTT.

Phanekham, Derek [Southern Methodist Univ., Dallas↗

DOE OSTI2022

GEOMWRITER - A Workflow for Automatically Generating MCNP Geometry for Neutron Guide Simulations

This report describes the functionality of the geomwriter.py script, which is a python script for producing complex MCNP CSG geometries from the IGES CAD format. It is specifically written to handle neutron supermirror guides, but can handle more complex objects through utilizing a convex hull algorithm. This work flow reduces the amount of time spent on generating the surface definitions for a complex neutron guide system with hundreds of segments such that changes to the neutron guide system design in McStas can be rapidly incorporated into an MCNP model and integrated with the shielding geometry present in that model.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2023

Data-driven, structure-preserving approximations to entropy-based moment closures for kinetic equations

In this study, we present a data-driven approach for approximating entropy-based closures of moment systems from kinetic equations. The proposed closure learns the entropy function by fitting the map between the moments and the entropy of the moment system, and thus does not depend on the spacetime discretization of the moment system or specific problem configurations such as initial and boundary conditions. With convex and C 2 approximations, this data-driven closure inherits several structural properties from entropy-based closures, such as entropy dissipation, hyperbolicity, and H-Theorem. We construct convex approximations to the Maxwell–Boltzmann entropy using convex splines and neural networks, test them on the plane source benchmark problem for linear transport in slab geometry, and compare the results to the standard, entropy-based systems which solve a convex optimization problem to find the closure. Numerical results indicate that these data-driven closures provide accurate solutions in much less computation time than that required by the optimization routine.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Fourier-DeepONet: Fourier-enhanced deep operator networks for full waveform inversion with improved accuracy, generalizability, and robustness

In this article, full waveform inversion (FWI) infers the subsurface structure information from seismic waveform data by solving a non-convex optimization problem. Data-driven FWI has been increasingly studied with various neural network architectures to improve accuracy and computational efficiency. Nevertheless, the applicability of pre-trained neural networks is severely restricted by potential discrepancies between the source function used in the field survey and the one utilized during training. Here, we develop a Fourier-enhanced deep operator network (Fourier-DeepONet) for FWI with the generalization of seismic sources, including the frequencies and locations of sources. Specifically, we employ the Fourier neural operator as the decoder of DeepONet, and we utilize source parameters as one input of Fourier-DeepONet, facilitating the resolution of FWI with variable sources. To test Fourier-DeepONet, we develop three new and realistic FWI benchmark datasets (FWI-F, FWI-L, and FWI-FL) with varying source frequencies, locations, or both. Our experiments demonstrate that compared with existing data-driven FWI methods, Fourier-DeepONet obtains more accurate predictions of subsurface structures in a wide range of source parameters. Moreover, the proposed Fourier-DeepONet exhibits superior robustness when handling data with Gaussian noise or missing traces and sources with Gaussian noise, paving the way for more reliable and accurate subsurface imaging across diverse real conditions.

42 ENGINEERING↗

DOE OSTI2024

Efficient First-Order Algorithms for Large-Scale, Non-Smooth Maximum Entropy Models with Application to Wildfire Science

Maximum entropy (MaxEnt) models are a class of statistical models that use the maximum entropy principle to estimate probability distributions from data. Due to the size of modern data sets, MaxEnt models need efficient optimization algorithms to scale well for big data applications. State-of-the-art algorithms for MaxEnt models, however, were not originally designed to handle big data sets; these algorithms either rely on technical devices that may yield unreliable numerical results, scale poorly, or require smoothness assumptions that many practical MaxEnt models lack. In this paper, we present novel optimization algorithms that overcome the shortcomings of state-of-the-art algorithms for training large-scale, non-smooth MaxEnt models. Our proposed first-order algorithms leverage the Kullback–Leibler divergence to train large-scale and non-smooth MaxEnt models efficiently. For MaxEnt models with discrete probability distribution of n elements built from samples, each containing m features, the stepsize parameter estimation and iterations in our algorithms scale on the order of O(mn) operations and can be trivially parallelized. Moreover, the strong ℓ1 convexity of the Kullback–Leibler divergence allows for larger stepsize parameters, thereby speeding up the convergence rate of our algorithms. To illustrate the efficiency of our novel algorithms, we consider the problem of estimating probabilities of fire occurrences as a function of ecological features in the Western US MTBS-Interagency wildfire data set. Our numerical results show that our algorithms outperform the state of the art by one order of magnitude and yield results that agree with physical models of wildfire occurrence and previous statistical analyses of wildfire drivers.

Physics↗

DOE OSTI2026

An information-matching approach to optimal experimental design and active learning

The efficacy of mathematical models heavily depends on the quality of the training data, yet collecting sufficient data is often expensive and challenging. Many modeling applications require inferring parameters only as a means to predict other quantities of interest (QoI). Because models often contain many unidentifiable (sloppy) parameters, QoIs often depend on a relatively small number of parameter combinations. Therefore, we introduce an information-matching criterion based on the Fisher information matrix to select the most informative training data from a candidate pool. This method ensures that the selected data contain sufficient information to learn only those parameters that are needed to constrain downstream QoIs. It is formulated as a convex optimization problem, making it scalable to large models and datasets. Here, we demonstrate the effectiveness of this approach across various modeling problems in diverse scientific fields, including power systems and underwater acoustics. Finally, we use information-matching as a query function within an active learning (AL) loop for materials science applications. In all these applications, we find that a relatively small set of optimal training data can provide the necessary information for achieving precise predictions. These results are encouraging for diverse future applications, particularly AL in large machine-learning models.

Materials science↗

DOE OSTI2020

Effects of surface undulations on asymmetric X-ray diffraction: a rocking-curve topography study

The results are reported of an X-ray diffraction study of an Si crystal designed and fabricated for very asymmetric diffraction from the 333 reflection for X-ray energies of 8.100 and 8.200 keV. A crystal with an asymmetry angle of 46 ± 0.1° between the surface and the (111) planes was studied. The grazing angles of incidence were near 1.08 and 0.33° for these two energies, respectively. Features arising from surface undulations were not observed at 8.100 keV, but were observed at 8.200 keV. The results at 8.100 keV allow an alternative explanation based on strain near the surface to be ruled out. Topographic images were obtained as a function of rocking angle, and in the case of 8.200 keV the surface morphology is evident. Finally, the results are found to be in agreement with dynamical X-ray diffraction calculations made with the Takagi–Taupin equations specialized to a surface having convex or concave features, as reported in the accompanying paper [Macrander (2020). J. Appl. Cryst. 53 , 793–799].

36 MATERIALS SCIENCE↗

DOE OSTI2025

The latent variable proximal point algorithm for variational problems with inequality constraints

The latent variable proximal point (LVPP) algorithm is a framework for solving infinite-dimensional variational problems with pointwise inequality constraints. The algorithm is a saddle point reformulation of the Bregman proximal point algorithm. At the continuous level, the two formulations are equivalent, but the saddle point formulation is more amenable to discretization because it introduces a structure-preserving transformation between a latent function space and the feasible set. Working in this latent space is much more convenient for enforcing inequality constraints than the feasible set, as discretizations can employ general linear combinations of suitable basis functions, and nonlinear solvers can involve general additive updates. LVPP yields numerical methods with observed mesh-independence for obstacle problems, contact, fracture, plasticity, and others besides; in many cases, for the first time. The framework also extends to more complex constraints, providing means to enforce convexity in the Monge–Ampère equation and handling quasi-variational inequalities, where the underlying constraint depends implicitly on the unknown solution. Here, in this paper, we describe the LVPP algorithm in a general form and apply it to ten problems from across mathematics.

Inequality constraints↗

DOE OSTI2026

Data mining the missing ordered phases of Li/Na metal oxides

Data-driven discovery of Li-ion and Na-ion battery materials has been pioneered by generic materials data platforms such as the Materials Project. After decades of progress, it is timely to ask whether there remain underexplored compositional spaces. Here, in this work, we present a systematic data-mining effort to uncover missing ordered binary, ternary and quaternary Li/Na-containing metal oxides using high-throughput density functional theory (DFT). Building on 19,120 stable and metastable oxides entries from the Materials Project, we performed 13,245 additional calculations through isovalent substitutions of known ground states, experimentally reported compounds, and specific prototype structures. Our study identifies 36 new ground states within the GGA/GGA + U convex hull and 45 within the r 2 SCAN convex hull. Additionally, we identified 840 metastable compounds from GGA/GGA + U and 979 from r 2 SCAN that are absent in the present Materials Project databases. Moreover, we have tripled the metastable materials in compositional spaces with a molar ratio of cation/anion >1, highlighting the overlooked opportunities in this compositional space.

25 ENERGY STORAGE↗

DOE OSTI2021

Effect of workpiece curvature on the tool influence function during hemispherical sub-aperture tool glass polishing

The influence of workpiece curvature on the tool influence function spot during polishing of fused silica glass with cerium oxide slurry, while using a rotating hemispherical pad-foam tool for a wide variety of process conditions (tool displacement, inclination angle, and rotation rate), has been investigated. (Workpiece curvature ranged from 500 mm radius concave to 43 mm radius convex.) The TIF spot decreases in diameter and increases in the peak removal rate on more convex workpieces. In contrast, the TIF spot increases both in diameter and peak removal rate on more concave workpieces. For the range of workpiece curvatures investigated, both the spot size and the peak removal rate changed significantly, as much as 2 times. An elastic sphere–sphere contact mechanics model, which utilizes both a modified displacement (that leads to a change in the applied load) as well as a mismatch factor (that influences the pressure distribution shape), has been developed. Furthermore, the model was validated using both offline load-displacement measurements and finite-element analysis simulations. The model quantitatively describes the measured change in the relative contact diameter and relative pressure distribution, as well as semiquantitively describes the change in the relative volumetric removal rate on a large variety of TIF spots. The change in the volumetric removal rate for convex workpieces is a result of the balance between a decreasing spot size (reducing removal) and an increasing peak pressure (increasing removal), which usually results in relatively small changes in volumetric removal. In the case of concave workpieces, the volumetric removal rate change is also governed by a similar balance, but the spot size increase contribution dominates, resulting in a significant increase in volumetric removal rate. Understanding these trends can enable methods to add greater determinism during the fabrication of freeform optics by adjusting polishing parameters (such as dwell time) while the tool translates along a workpiece surface with different local curvatures.

47 OTHER INSTRUMENTATION↗

DOE OSTI2020

Formulation and solution approach for calibrating activity-based travel demand model-system via microsimulation

This study addresses the problem of calibrating utility-maximizing nested logit activity-based travel demand model-systems. After estimation, it is common practice to use aggregate measurements to calibrate the estimated model-system’s parameters prior to their application in transportation planning, policy making, and operations. However, calibration of activity-based model-systems has received much less attention. Existing calibration approaches are myopic heuristics in the sense that they do not consider the fundamental inter-dependencies among choice-models and do not have a systematic way to adjust model parameters. Also, other purely simulation-based approaches do not perform well in large-scale applications. In this study, we focus on utility-maximizing nested logit activity-based model-systems and calibrating aggregate statistics such as activity shares, mode shares, time-dependent & mode-specific OD flows, and time-dependent & mode-specific sensor counts. We formulate the calibration problem as a simulation-based optimization problem and propose a stochastic gradient-based solution procedure to solve it. The solution procedure relies on microsimulation to calculate expectations of the aggregate statistics of interest to the calibration problem. Additionally, we derive approximate analytical expressions for the gradient of the objective function —that are evaluated through microsimulation on mini-batches of the population. The proposed solution procedure is sensitive to the fundamental structure of the activity-based model-system and is non-myopic in considering the dependencies across its model components. The formulated optimization problem is non-convex, highly nonlinear, and potentially has multiple-minima. Lastly, we show —through a real-world application— that the proposed solution procedure outperforms other state-of-the-art purely simulation-based optimization approaches in terms of computational efficiency, stability, and convergence. We also compare various gradient-based solution algorithms to determine the best algorithm to update the parameters. This work has the potential to facilitate wider and easier application of activity-based model-systems.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2026

ZEUS: An Efficient GPU Optimization Method Integrating PSO, BFGS, and Automatic Differentiation

We introduce a novel, efficient computational method, ZEUS, for numerical optimization, and provide an open-source implementation. It has four key ingredients: (1) particle swarm optimization (PSO), (2) the use of the Broyden-Fletcher-Goldfarb-Shanno (BFGS) method, (3) automatic differentiation (AD), and (4) GPUs. Our approach addresses the computational challenges inherent in high-dimensional, non-convex optimization problems. In the first phase of the algorithm, we get a potentially good set of starting points using PSO. Thereafter, we run BFGS independently in parallel from these starting points. BFGS is one of the best-performing algorithms for numerical optimization. However, it requires the gradient of the function being optimized. ZEUS integrates automatic differentiation into BFGS thus avoiding the need for the user to calculate derivatives explicitly. The use of GPUs allows ZEUS to speed up the calculations substantially. We carry out systematic studies to explore the trade-offs between the number of PSO iterations taken, starting points, and BFGS iteration depth. We show that a handful of iterations of PSO can improve global convergence when combined with BFGS. We also present performance studies using common test functions. The source code can be found at https://github.com/fnal-numerics/global-optimizer-gpu.

Soos, Dominik [Old Dominion U.]↗

DOE OSTI2024

Comparison of excess free energy at an interface according to the applied interpolation scheme for elasticity: A phase-field method

Phase-field modeling is an effective simulation technique for modeling microstructure evolution of elastically anisotropic systems. To introduce the elastic energy contribution in a phase field model, an interpolation scheme is used to define the mechanical properties within the phases and across the continuous interface. Several existing interpolation schemes introduce a potential excess elastic energy at the interface, which undesirable effect on microstructure evolution needs to be evaluated. In this study, we focused on three interpolation schemes including Khachaturyan’ scheme (KHS), Voigt–Taylor’s scheme (VTS), and Steinbach–Apel’s scheme (SAS). Comparisons of these schemes’ performances were performed in three configuration types using the MOOSE (Multiphysics Object-Oriented Simulation Environment) framework: bi-crystal, isotropic particle-matrix and anisotropic particle-matrix. The contribution of excess elastic energy on the interface energy as a function of interface width and the computational time to steady-state were evaluated in these three configurations. SAS introduces the lowest excess elastic energy contribution and the VTS has the biggest contribution amongst the considered schemes. Moreover, when modeling precipitation in an anisotropic elastic material, the SAS approach seems to predict more physical convex shapes during growth, making it preferable to KHS and VTS. Finally, as currently implemented, SAS requires the largest computational time and KHS requires the smallest time to reach steady-state amongst the considered schemes.

36 MATERIALS SCIENCE↗

DOE OSTI2020

HPC-enabled computation of demand models at scale

The purpose of this project is to examine the energy impact of urban-scale traffic for the Los Angeles Basin by developing and implementing a scalable traffic assignment model. An energy optimization function will be posed and when integrated into the optimization code for travel assignment it can be mathematically proven to converge. The energy optimization function can then be compared to the typical travel time optimization that is traditionally used in traffic assignment models. The analysis will begin with static traffic assignment models with the routing for all origin and destinations computed in parallel on high performance computing facilities. Convergence of the numerical methods rely on the solution of convex programs (or extensions of these). This step will mostly consist of demonstrating the ability to parallelize the Frank Wolfe algorithm on various platforms.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

DOE OSTI2020

HPC4Mobilty w/ UCB

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

DOE OSTI2025

A method for bounding high-order finite element functions: Applications to mesh validity and bounds-preserving limiters

We introduce a novel method for bounding high-order multi-dimensional polynomials in finite element approximations. The method involves precomputing optimal piecewise-linear bounding boxes for polynomial basis functions, which can then be used to locally bound any combination of these basis functions. This approach can be applied to any element/basis type at any approximation order, can provide local (i.e., subcell) extremum bounds to a desired level of accuracy, and can be evaluated efficiently on-the-fly in simulations. Furthermore, we show that this approach generally yields more accurate bounds in comparison to traditional methods based on convex hull properties (e.g., Bernstein polynomials). Furthermore, the efficacy of this technique is shown in applications such as mesh validity checks and optimization for high-order curved meshes, where positivity of the element Jacobian determinant can be ensured throughout the entire element, and continuously bounds-preserving limiters for hyperbolic systems, which can enforce maximum principle bounds across the entire solution polynomial.

Bounding box↗

DOE OSTI2020

Application of Koopman operator for model-based control of fracture propagation and proppant transport in hydraulic fracturing operation

This work explores the application of the recently developed Koopman operator approach for model identification and feedback control of a hydraulic fracturing process. Controlling fracture propagation and proppant transport with precision is a challenge due in large part to the difficulty of constructing approximate models that accurately capture the characteristic moving boundary and highly-coupled dynamics exhibited by the process. Koopman operator theory is particularly attractive here as it offers a way to explicitly construct linear representations for even highly nonlinear dynamics. The method is data-driven and relies on lifting the states to an infinite-dimensional space of functions called observables where the dynamics are governed by a linear Koopman operator. Here this work considers two problems: (a) fracture geometry control, and (b) proppant concentration control. In both cases, an approximate linear model of the corresponding dynamics is constructed and used to design a model predictive controller (MPC). The manuscript shows that in the case of highly nonlinear dynamics, as observed in the proppant concentration, use of canonical functions in the observable basis fails. In such cases, a priori system knowledge can be leveraged to choose the required basis. The numerical experiments demonstrate that the Koopman linear model shows excellent agreement with the real system and successfully achieves the desired target values maximizing the oil and gas productivity. Additionally, due to its linear structure, the Koopman models allow convex MPC formulations that avoid any issues associated with nonlinear optimization.

42 ENGINEERING↗

DOE OSTI2026

Machine-learning guided search for phonon-mediated superconductivity in boron and carbon compounds

We present a workflow that iteratively combines ab-initio calculations with a machine-learning (ML) guided search for superconducting compounds with both dynamical stability and instability from imaginary phonon modes, the latter of which have been largely overlooked in previous studies. Electron-phonon coupling (EPC) properties and critical temperature (T c ) of 417 boron, carbon, and borocarbide compounds have been calculated with density functional perturbation theory (DFPT) and isotropic Eliashberg approximation. Our study addresses T c convergence of Brillouin zone sampling with an ansatz test, stabilizing imaginary phonon modes for significant EPC contributions, and comparing the performance of two ML models, especially when including compounds of dynamical instability. We predict a few promising superconducting compounds with formation energy just above the ground state convex hull, such as Ca 5 B 3 N 6 (35 K), TaNbC 2 (28.4 K), Nb 3 B 3 C (16.4 K), Y 2 B 3 C 2 (4.0 K), Pd 3 CaB (7.0 K), MoRuB 2 (15.6 K), RuVB 2 (15.0 K), RuSc 3 C 4 (6.6 K) among others.

Nepal, Niraj K. [Ames Laboratory (AMES), Ames, IA ↗