SEARCH · Search NASA

Results for “Iterative”

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 343 records · Page 19

All sources NASA NTRS DOE OSTI

DOE OSTI2024

Measurement of the primary Lund jet plane density in proton-proton collisions at $ \sqrt{\textrm{s}} $ = 13 TeV

A measurement is presented of the primary Lund jet plane (LJP) density in inclusive jet production in proton-proton collisions. The analysis uses 138 fb$^{−1}$ of data collected by the CMS experiment at $ \sqrt{s} $ = 13 TeV. The LJP, a representation of the phase space of emissions inside jets, is constructed using iterative jet declustering. The transverse momentum k$_{T}$ and the splitting angle ∆R of an emission relative to its emitter are measured at each step of the jet declustering process. The average density of emissions as function of ln(k$_{T}$/GeV) and ln(R/∆R) is measured for jets with distance parameters R = 0.4 or 0.8, transverse momentum p$_{T}$> 700 GeV, and rapidity |y| < 1.7. The jet substructure is measured using the charged-particle tracks of the jet. The measured distributions, unfolded to the level of stable charged particles, are compared with theoretical predictions from simulations and with perturbative quantum chromodynamics calculations. Due to the ability of the LJP to factorize physical effects, these measurements can be used to improve different aspects of the physics modeling in event generators.[graphic not available: see fulltext]

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2024

The soaring kite: a tale of two punctured tori

We consider the 5-mass kite family of self-energy Feynman integrals and present a systematic approach for constructing an ε-form basis, along with its differential equation pulled back onto the moduli space of two tori. Each torus is associated with one of the two distinct elliptic curves this family depends on. We demonstrate how the locations of relevant punctures, which are required to parametrize the full image of the kinematic space onto this moduli space, can be extracted from integrals over maximal cuts. A boundary value is provided such that the differential equation is systematically solved in terms of iterated integrals over g-kernels and modular forms. Then, the numerical evaluation of the master integrals is discussed, and important challenges in that regard are emphasized. In an appendix, we introduce new relations between g-kernels.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2026

Exploring small-angle emissions in charm quark jets in proton-proton collisions at $\sqrt{s}=5.02$ TeV

A measurement of the angular structure of inclusive jets and those containing a prompt D 0 meson in proton-proton collisions at the LHC at a center-of-mass energy of 5.02 TeV is presented. The data corresponding to an integrated luminosity of 301 pb −1 were collected by the CMS experiment in 2017. Two jet grooming algorithms, late-k T and soft drop, are used to study the intrajet radiation pattern using iterative Cambridge-Aachen declustering. The splitting-angle distributions of jets with transverse momentum (p T ) of around 100 GeV, obtained with these two algorithms, show that there is a shift of the distribution for jets containing a prompt D 0 meson with respect to inclusive jets. The suppression of emissions at small angles observed in the late-k T grooming approach is consistent with the dead-cone effect, whereas the similar suppression for splittings selected with the soft-drop algorithm appears to be induced by gluon splitting to charm quark-antiquark pairs at large angles. The measured distributions are corrected to the particle level and can be used to constrain model predictions for the substructure of high-p T charm quark jets.

Charm Physics↗

DOE OSTI2024

The 1 → 3 massive splitting functions from QCD factorization and SCET

Splitting functions are universal functions describing the collinear dynamics of gauge theories, and as such are crucial ingredients for a wide variety of calculations in perturbative QCD. We present analytic results for the triple collinear splitting functions in QCD with a single massive parton. We derive the splitting functions using two distinct methods; first by expanding the squared matrix elements in the collinear limit, and secondly by using soft-collinear effective theory with massive quarks. We find agreement between these two approaches, providing a strong check of our results. Additionally, we also check all iterated and soft limits of our results, finding agreement with predictions from factorization. Our results provide an important ingredient for higher order perturbative calculations involving massive partons, and for the description of the collinear dynamics of heavy flavor jets.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2024

Two-loop master integrals for leading-color $$ pp\to t\overline{t}H $$ amplitudes with a light-quark loop

Abstract We compute the two-loop master integrals for leading-color QCD scattering amplitudes including a closed light-quark loop in$$ t\overline{t}H $$ t t ¯ H production at hadron colliders. Exploiting numerical evaluations in modular arithmetic, we construct a basis of master integrals satisfying a system of differential equations inϵ-factorized form. We present the analytic form of the differential equations in terms of a minimal set of differential one-forms. We explore properties of the function space of analytic solutions to the differential equations in terms of iterative integrals which can be exploited for studying the analytic form of related scattering amplitudes. Finally, we solve the differential equations using generalized series expansions to numerically evaluate the master integrals in physical phase space. As the first computation of a set of two-loop seven-scale master integrals, our results provide valuable input for analytic studies of scattering amplitudes in processes involving massive particles and a large number of kinematic scales.

Physics↗

DOE OSTI2024

Massive twistor worldline in electromagnetic fields

We study the (ambi-)twistor model for spinning particles interacting via electromagnetic field, as a toy model for studying classical dynamics of gravitating bodies including effects of both spins to all orders. We compute the momentum kick and spin kick up to one-loop order and show precisely how they are encoded in the classical eikonal. The all-orders-in-spin effects are encoded as a dynamical implementation of the Newman-Janis shift, and we find that the expansion in both spins can be resummed to simple expressions in special kinematic configurations, at least up to one-loop order. We confirm that the classical eikonal can be understood as the generator of canonical transformations that map the in-states of a scattering process to the out-states. We also remark that cut contributions for converting worldline propagators from time-symmetric to retarded amount to the iterated action of the leading eikonal at one-loop order.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2024

Helicity evolution at small x : quark to gluon and gluon to quark transition operators

We include the quark to gluon and gluon to quark shock-wave transition operators into the small Bjorken-x evolution equations for helicity in the flavor-singlet channel derived earlier in [1,2,3]. While such transitions do not affect the large-N c version of the evolution equations for helicity, the large-N c & N f equations are affected. (N c and N f are the numbers of quark colors and flavors, respectively.) We derive the corresponding corrected large-N c & N f equations for the polarized dipole amplitudes contributing to the flavor-singlet quark and gluon helicity distributions in the double-logarithmic approximation (DLA), resumming powers of α s ln 2 (1/x) with αs the strong coupling constant. We solve these equations iteratively and extract the polarized splitting functions up to four loops. We show that our splitting functions agree with the fixed-order perturbative calculations up to and including the existing three-loops results [4,5,6,7]. Similar to the large-Nc helicity evolution in the shock-wave approach [8], our large-N c & N f small-x splitting functions agree with those obtained in the infrared evolution equations framework from [9, 10] up to three loops, but appear to slightly disagree at four loops.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2024

Analytic amplitudes for a pair of Higgs bosons in association with three partons

The pair production of Higgs bosons at the LHC can give information about the triple Higgs boson coupling. We perform an analytic one-loop calculation of the amplitudes for a pair of Higgs bosons in association with three partons, retaining the exact dependence on the quark mass circulating in the loop. These amplitudes constitute the real radiation corrections in the calculation of Higgs boson pair production at next-to-leading order in the strong coupling. The results of an analytic generalised-unitarity computation are simplified via analytic reconstruction in spinor variables. Compact ansätze for kinematic pole residues are iteratively fitted via p-adic evaluations near said poles and subtracted until no pole remains. A new ansatz construction is introduced to minimally parametrise coefficients of amplitudes with multiple massive external legs. The simplified expressions are faster to evaluate than automatic codes and can lead to more stable results near singular regions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2025

Measurement of the top-quark pole mass in dileptonic $t\overline{t}$ + 1-jet events at $\sqrt{s}=13$ TeV with the ATLAS experiment

A measurement of the top-quark pole mass $m$$^{pole}_{t}$ is presented in $t\bar{t}$ events with an additional jet, $t\bar{t}$+ 1-jet, produced in pp collisions at $\sqrt{s} = 13 TeV. The data sample, recorded with the ATLAS experiment during Run 2 of the LHC, corresponds to an integrated luminosity of 140 fb −1 . Events with one electron and one muon of opposite electric charge in the final state are selected to measure the $t\bar{t}$ + 1-jet differential cross-section as a function of the inverse of the invariant mass of the $t\bar{t}$ + 1-jet system. Iterative Bayesian Unfolding is used to correct the data to enable comparison with fixed-order calculations at next-to-leading-order accuracy in the strong coupling. The process pp → $t\bar{t}$j(2 → 3), where top quarks are taken as stable particles, and the process pp → $b\bar{b}$l + vl – $\overline{ν}$j (2 → 7), which includes top-quark decays to the dilepton final state and off-shell effects, are considered. The top-quark mass is extracted using a χ 2 fit of the unfolded normalized differential cross-section distribution. The results obtained with the 2 → 3 and 2 → 7 calculations are compatible within theoretical uncertainties, providing an important consistency check.

Hadron-Hadron Scattering↗

DOE OSTI2024

Level-set topology optimization with PDE generated conformal meshes

This paper presents a level-set topology optimization approach that uses conformal meshes for the analysis of the displacement field. The structure’s boundary is represented by the iso-contour of a level-set field discretized on a fixed background design mesh. The conformal mesh is updated for each design iteration via a PDE based mesh morphing process that identifies the set of facets in the background mesh that are homeomorphic to the boundary and relaxes the homeomorphic mesh to conform to the structure’s boundary and ensure high element quality. The conformal mesh allows for a more accurate computation of the response versus density and some level-set based methods which interpolate material properties using the volume fraction. Numerical examples illustrate the proposed approach by optimizing linear-elastic two- and three-dimensional structures, wherein insight into the performance of the mesh morphing process is provided. The examples also highlight the scalability of the approach.

42 ENGINEERING↗

DOE OSTI2025

A simple introduction to the SiMPL method for density-based topology optimization

We introduce a novel method for solving density-based topology optimization problems: Sigmoidal Mirror descent with a Projected Latent variable (SiMPL). The SiMPL method (pronounced as “the simple method”) optimizes a design using only first-order derivative information of the objective function. The bound constraints on the density field are enforced with the help of the (negative) Fermi–Dirac entropy, which is also used to define a non-symmetric distance function called a Bregman divergence on the set of admissible designs. This Bregman divergence leads to a simple update rule that is further simplified with the help of a so-called latent variable. Because the SiMPL method involves discretizing the latent variable, it produces a sequence of pointwise-feasible iterates, even when high-order finite elements are used in the discretization. Numerical experiments demonstrate that the method outperforms other popular first-order optimization algorithms. In conclusion, to outline the general applicability of the technique, we include examples with (self-load) compliance minimization and compliant mechanism optimization problems.

Calculus of Variations and Optimization↗

DOE OSTI2026

Toward real-time optimization through model reduction and model discrepancy sensitivities

Optimization problems arise in a range of scenarios, from optimal control to model parameter estimation. In many applications, such as the development of digital twins, it is essential to solve these optimization problems within wall-clock-time limitations. However, this is often unattainable for complex systems, such as those modeled by nonlinear partial differential equations. One strategy for mitigating this issue is to construct a reduced-order model (ROM) that enables more rapid optimization. In particular, the use of nonintrusive ROMs—those that do not require access to the full-order model at evaluation time—is popular because they facilitate the computation of optimization solutions within the wall-clock time requirements. However, the optimization solution will be unreliable if the iterates move outside the ROM training data. This article proposes the use of hyper-differential sensitivity analysis with respect to model discrepancy (HDSA-MD) as a computationally efficient tool to augment ROM-constrained optimization and improve its reliability. The proposed approach consists of two phases: (i) an offline phase where several full-order model evaluations are computed to train the ROM, and (ii) an online phase where a ROM-constrained optimization problem is solved, a limited number of full-order model evaluations are computed, and HDSA-MD is used to enhance the optimization solution. Numerical results are demonstrated for two examples, atmospheric contaminant control and wildfire ignition location estimation, in which a ROM is trained offline using inaccurate atmospheric data. In conclusion, the HDSA-MD update yields a significant improvement in the ROM-constrained optimization solution using only one full-order model evaluation online with corrected atmospheric data.

PDE-constrained optimization↗

DOE OSTI2025

On the Sampling-Based Computation of Nash Equilibria Under Uncertainty via the Nikaido–Isoda Function

We consider the computation of an equilibrium of a stochastic Nash equilibrium problem, where the player objectives are assumed to be L 0 -Lipschitz continuous and convex, given rival decisions with convex and closed player-specific feasibility sets. To address this problem, we consider minimizing a suitably defined value function defined using the Nikaido–Isoda function. Such an avenue does not necessitate either monotonicity properties of the concatenated gradient map or potentiality requirements on the game but does require a suitable regularity requirement under which a stationary point is a Nash equilibrium. We design and analyze a sampling-enabled projected-gradient-response method, reliant on inexact resolution of a player-level best-response subproblem. Here, by deriving suitable Lipschitzian guarantees on the value function, we derive both asymptotic guarantees for the sequence of generated iterates as well as rate and complexity guarantees for computing a stationary point by appropriate choices of the sampling rate and inexactness sequence.

Nikaido-Isoda function↗

DOE OSTI2025

A unified funnel restoration SQP algorithm

We consider nonlinearly constrained optimization problems and discuss a generic double-loop framework consisting of basic algorithmic ingredients that unifies a broad range of nonlinear optimization solvers. This framework has been implemented in the open-source solver Uno, a Swiss Army knife-like C++ optimization framework that unifies many nonlinearly constrained nonconvex optimization solvers. We illustrate the framework with a sequential quadratic programming (SQP) algorithm that maintains an acceptable upper bound on the constraint violation, called a funnel, that is monotonically decreased to control the feasibility of the iterates. Infeasible quadratic subproblems are handled by a feasibility restoration strategy. Globalization is controlled by a line search or a trust-region method. We prove global convergence of the trust-region funnel SQP method, building on known results from filter methods. We implement the algorithm in Uno, and we provide extensive test results for the trust-region line-search funnel SQP on small CUTEst instances.

Kiessling, David [Katholieke Univ. Leuven, Heverle↗

DOE OSTI2024

Proximal Galerkin: A Structure-Preserving Finite Element Method for Pointwise Bound Constraints

The proximal Galerkin finite element method is a high-order, low iteration complexity, nonlinear numerical method that preserves the geometric and algebraic structure of pointwise bound constraints in infinite-dimensional function spaces. This paper introduces the proximal Galerkin method and applies it to solve free boundary problems, enforce discrete maximum principles, and develop a scalable, mesh-independent algorithm for optimal design with pointwise bound constraints. This paper also introduces the latent variable proximal point (LVPP) algorithm, from which the proximal Galerkin method derives. When analyzing the classical obstacle problem, we discover that the underlying variational inequality can be replaced by a sequence of second-order partial differential equations (PDEs) that are readily discretized and solved with, e.g., the proximal Galerkin method. Throughout this work, we arrive at several contributions that may be of independent interest. These include (1) a semilinear PDE we refer to as the entropic Poisson equation; (2) an algebraic/geometric connection between high-order positivity-preserving discretizations and certain infinite-dimensional Lie groups; and (3) a gradient-based, bound-preserving algorithm for two-field, density-based topology optimization. The complete proximal Galerkin methodology combines ideas from nonlinear programming, functional analysis, tropical algebra, and differential geometry and can potentially lead to new synergies among these areas as well as within variational and numerical analysis. Open-source implementations of our methods accompany this work to facilitate reproduction and broader adoption.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Convergence analysis for a nonlocal gradient descent method via directional Gaussian smoothing

We analyze the convergence of a nonlocal gradient descent method for minimizing a class of high-dimensional non-convex functions, where a directional Gaussian smoothing (DGS) is proposed to define the nonlocal gradient (also referred to as the DGS gradient). The method was first proposed in [Zhang et al., Enabling long-range exploration in minimization of multimodal functions, UAI 2021], in which multiple numerical experiments showed that replacing the traditional local gradient with the DGS gradient can help the optimizers escape local minima more easily and significantly improve their performance. However, a rigorous theory for the efficiency of the method on nonconvex landscape is lacking. In this work, we investigate the scenario where the objective function is composed of a convex function, perturbed by deterministic oscillating noise. We provide a convergence theory under which the iterates exponentially converge to a tightened neighborhood of the solution, whose size is characterized by the noise wavelength. Here, we also establish a correlation between the optimal values of the Gaussian smoothing radius and the noise wavelength, thus justifying the advantage of using moderate or large smoothing radii with the method. Furthermore, if the noise level decays to zero when approaching the global minimum, we prove that DGS-based optimization converges to the exact global minimum with linear rates, similarly to standard gradient-based methods in optimizing convex functions. Several numerical experiments are provided to confirm our theory and illustrate the superiority of the approach over those based on the local gradient.

Tran, Hoang [Oak Ridge National Laboratory (ORNL),↗

DOE OSTI2024

On the emerging potential of quantum annealing hardware for combinatorial optimization

Abstract Over the past decade, the usefulness of quantum annealing hardware for combinatorial optimization has been the subject of much debate. Thus far, experimental benchmarking studies have indicated that quantum annealing hardware does not provide an irrefutable performance gain over state-of-the-art optimization methods. However, as this hardware continues to evolve, each new iteration brings improved performance and warrants further benchmarking. To that end, this work conducts an optimization performance assessment of D-Wave Systems’ Advantage Performance Update computer, which can natively solve sparse unconstrained quadratic optimization problems with over 5,000 binary decision variables and 40,000 quadratic terms. We demonstrate that classes of contrived problems exist where this quantum annealer can provide run time benefits over a collection of established classical solution methods that represent the current state-of-the-art for benchmarking quantum annealing hardware. Although this work does not present strong evidence of an irrefutable performance benefit for this emerging optimization technology, it does exhibit encouraging progress, signaling the potential impacts on practical optimization tasks in the future.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

DOE OSTI2025

Thermal Response of a Lithium Vapor Divertor to Cyclical Operation

The lithium vapor divertor concept is being developed as a method to achieve detached divertor conditions in a tokamak while minimizing impurity radiation losses from the core plasma. SOLPS-ITER modeling has previously been used to identify some of the geometric constraints and required lithium evaporation rate of a lithium vapor divertor in a medium-sized tokamak during steady-state operation. Here an updated conceptual design based on these operating requirements is introduced and the thermal response of the system is modeled during cyclical operation, consistent with operation in a short-pulse tokamak. Controllability of the temperature of the lithium capillary porous system (CPS) is achieved by adopting a design where there is no line-of-sight for radiation from the plasma to reach the heated CPS surface. Operational strategies to minimize the amount of lithium evaporated between plasma discharges while achieving steady evaporation rates during plasma discharges are discussed and modeled here. The optimal feedforward control strategy demonstrated in this work is to ramp up the temperature of the evaporator as quickly as possible immediately before a plasma discharge and then reduce the heating to match the desired steady-state net evaporation rate just before the plasma discharge begins, allowing the thermal inertia of the system to stabilize the evaporation rate during the first second of the plasma discharge.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗