Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “regularity”

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 1,153 records · Page 64
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

KKT Preconditioners for PDE-Constrained Optimization with the Helmholtz Equation

This paper considers preconditioners for the linear systems that arise from optimal control and inverse problems involving the Helmholtz equation. Specifically, we explore an all-at-once approach. The main contribution centers on the analysis of two block preconditioners. Variations of these preconditioners have been proposed and analyzed in prior works for optimal control problems where the underlying partial differential equation is a Laplace-like operator. In this paper, we extend some of the prior convergence results to Helmholtz-based optimization applications. Our analysis examines situations where control variables and observations are restricted to subregions of the computational domain. We prove that solver convergence rates do not deteriorate as the mesh is refined or as the wavenumber increases. More specifically, for one of the preconditioners we prove accelerated convergence as the wavenumber increases. Additionally, in situations where the control and observation subregions are disjoint, we observe that solver convergence rates have a weak dependence on the regularization parameter. We give a partial analysis of this behavior. We illustrate the performance of the preconditioners on control problems motivated by acoustic testing.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Stochastic Learning Approach for Binary Optimization: Application to Bayesian Optimal Design of Experiments

Here, we present a novel stochastic approach to binary optimization suited for optimal experimental design (OED) for Bayesian inverse problems governed by mathematical models such as partial differential equations. The OED utility function, namely, the regularized optimality criterion, is cast into a stochastic objective function in the form of an expectation over a multivariate Bernoulli distribution. The probabilistic objective is then solved by using a stochastic optimization routine to find an optimal observational policy. This formulation (a) is generally applicable to binary optimization problems with soft constraints and is ideal for OED and sensor placement problems; (b) does not require differentiability of the original objective function (e.g., a utility function in OED applications) with respect to the design variable, and thus it enables direct employment of sparsity-enforcing penalty functions such as $\ell_0$, without needing to utilize a continuation procedure or apply a rounding technique; (c) exhibits much lower computational cost than traditional gradient-based relaxation approaches; and (d) can be applied to both linear and nonlinear OED problems with proper choice of the utility function. The proposed approach is analyzed from an optimization perspective with detailed convergence analysis of the optimization approach and is also analyzed from a machine learning perspective with correspondence to policy gradient reinforcement learning. The approach is demonstrated numerically by using an idealized two-dimensional Bayesian linear inverse problem and validated by extensive numerical experiments carried out for sensor placement in a parameter identification setup.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A Trajectory-Driven Algorithm for Differentiating SRB Measures on Unstable Manifolds

Sinai-Ruelle-Bowen (SRB) measures are limiting stationary distributions describing the statistical behavior of chaotic dynamical systems. Directional derivatives of SRB measure densities conditioned on unstable manifolds are critical in the sensitivity analysis of hyperbolic chaos. These derivatives, known as the SRB density gradients, are by-products of the regularization of Lebesgue integrals appearing in the original linear response expression. In this paper, we propose a novel trajectory- driven algorithm for computing the SRB density gradient defined for systems with high-dimensional unstable manifolds. We apply the concept of measure preservation together with the chain rule on smooth manifolds. Due to the recursive one-step nature of our derivations, the proposed procedure is memory-efficient and can be naturally integrated with existing Monte Carlo schemes widely used in computational chaotic dynamics. Here, we numerically show the exponential convergence of our scheme, analyze the computational cost, and present its use in the context of Monte Carlo integration.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A New Semistructured Algebraic Multigrid Method

Multigrid methods are well suited to large massively parallel computer architectures because they are mathematically optimal and display good parallelization properties. Since current architecture trends are favoring regular compute patterns to achieve high performance, the ability to express structure has become much more important. The hypre software library provides high-performance multigrid preconditioners and solvers through conceptual interfaces, including a semistructured interface that describes matrices primarily in terms of stencils and logically structured grids. This paper presents a new semistructured algebraic multigrid (SSAMG) method built on this interface. The numerical convergence and performance of a CPU implementation of this method are evaluated for a set of semistructured problems. In conclusion, SSAMG achieves significantly better setup times than hypre’s unstructured AMG solvers and comparable convergence. In addition, the new method is capable of solving more complex problems than hypre’s structured solvers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A Variational Inference Approach to Inverse Problems with Gamma Hyperpriors

Hierarchical models with gamma hyperpriors provide a flexible, sparse-promoting framework to bridge L 1 and L 2 regularizations in Bayesian formulations to inverse problems. Despite the Bayesian motivation for these models, existing methodologies are limited to maximum a posteriori estimation. The potential to perform uncertainty quantification has not yet been realized. This paper introduces a variational iterative alternating scheme for hierarchical inverse problems with gamma hyperpriors. The proposed variational inference approach yields accurate reconstruction, provides meaningful uncertainty quantification, and is easy to implement. In addition, it lends itself naturally to conduct model selection for the choice of hyperparameters. Here, we illustrate the performance of our methodology in several computed examples, including a deconvolution problem and sparse identification of dynamical systems from time series data.

Bayesian shrinkage↗
DOE OSTI2024

TNet: A Model-Constrained Tikhonov Network Approach for Inverse Problems

Deep learning (DL), in particular deep neural networks, by default is purely data-driven and in general does not require physics. This is the strength of DL but also one of its key limitations when applied to science and engineering problems in which underlying physical properties—such as stability, conservation, and positivity—and accuracy are required. DL methods in their original forms are often not capable of respecting the underlying mathematical models or achieving desired accuracy even in big-data regimes. On the other hand, many data-driven science and engineering problems, such as inverse problems, typically have limited experimental or observational data, and DL would overfit the data in this case. Leveraging information encoded in the underlying mathematical models, we argue, not only compensates for missing information in low data regimes but also provides opportunities to equip DL methods with the underlying physics, hence promoting better generalization. This paper develops a model-constrained DL approach and its variant TNet—a Tikhonov neural network—which are capable of learning not only information hidden in the training data but also in the underlying mathematical models to solve inverse problems governed by partial differential equations in low data regimes. We provide the constructions and some theoretical results for the proposed approaches for both linear and nonlinear inverse problems. Since TNet is designed to learn inverse solutions with Tikhonov regularization, it is interpretable: in fact it recovers Tikhonov solutions for linear cases while potentially approximating Tikhonov solutions for nonlinear inverse problems. We also prove that data randomization can enhance not only the smoothness of the networks but also their generalizations. Comprehensive numerical results confirm the theoretical findings and show that with even as little as 1 training data sample for one-dimensional (1D) deconvolution, 5 for an inverse 2D heat conductivity problem, 100 for inverse initial conditions for a time-dependent 2D Burgers’s equation, and 50 for inverse initial conditions for 2D Navier–Stokes equations, TNet solutions can be as accurate as Tikhonov solutions while being several orders of magnitude faster. Furthermore, this is possible owing to the model-constrained term, replications, and randomization.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Leveraging Multitime Hamilton–Jacobi PDEs for Certain Scientific Machine Learning Problems

Hamilton-Jacobi partial differential equations (HJ PDEs) have deep connections with a wide range of fields, including optimal control, differential games, and imaging sciences. By considering the time variable to be a higher dimensional quantity, HJ PDEs can be extended to the multi-time case. In this paper, we establish a novel theoretical connection between specific optimization problems arising in machine learning and the multi-time Hopf formula, which corresponds to a representation of the solution to certain multi-time HJ PDEs. Through this connection, we increase the interpretability of the training process of certain machine learning applications by showing that when we solve these learning problems, we also solve a multi-time HJ PDE and, by extension, its corresponding optimal control problem. As a first exploration of this connection, we develop the relation between the regularized linear regression problem and the Linear Quadratic Regulator (LQR). We then leverage our theoretical connection to adapt standard LQR solvers (namely, those based on the Riccati ordinary differential equations) to design new training approaches for machine learning. Lastly, we provide some numerical examples that demonstrate the versatility and possible computational advantages of our Riccati-based approach in the context of continual learning, post-training calibration, transfer learning, and sparse dynamics identification.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Hierarchical Bayesian Inverse Problems: A High-Dimensional Statistics Viewpoint

This paper analyzes hierarchical Bayesian inverse problems using techniques from highdimensional statistics. Furthermore, our analysis leverages a property of hierarchical Bayesian regularizers that we call approximate decomposability to obtain non-asymptotic bounds on the reconstruction error attained by maximum a posteriori estimators. The new theory explains how hierarchical Bayesian models that exploit sparsity, group sparsity, and sparse representations of the unknown parameter can achieve accurate reconstructions in high-dimensional settings.

MAP estimation↗
DOE OSTI2025

Efficient Neural Network Approaches for Conditional Optimal Transport with Applications in Bayesian Inference

In this work, we present two neural network approaches that approximate the solutions of static and dynamic conditional optimal transport (COT) problems. Both approaches enable conditional sampling and conditional density estimation, which are core tasks in Bayesian inference—particularly in the simulation-based (“likelihood-free”) setting. Our methods represent the target conditional distribution as a transformation of a tractable reference distribution. Obtaining such a transformation, chosen here to be an approximation of the COT map, is computationally challenging even in moderate dimensions. To improve scalability, our numerical algorithms use neural networks to parameterize candidate maps and further exploit the structure of the COT problem. Our static approach approximates the map as the gradient of a partially input convex neural network. It uses a novel numerical implementation to increase computational efficiency compared to state-of-the-art alternatives. Our dynamic approach approximates the conditional optimal transport via the flow map of a regularized neural ODE; compared to the static approach, it is slower to train but offers more modeling choices and can lead to faster sampling. We demonstrate both algorithms numerically, comparing them with competing state-of-the-art approaches, using benchmark datasets and simulation-based Bayesian inverse problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Multiscale Neural Networks for Approximating Green’s Functions

Neural networks (NNs) have been widely used to solve partial differential equations (PDEs) in the applications of physics, biology, and engineering. One effective approach for solving PDEs with a fixed differential operator is learning Green’s functions. However, Green’s functions are notoriously difficult to learn due to their poor regularity, which typically requires larger NNs and longer training times. In this work, we address these challenges by leveraging multiscale NNs to learn Green’s functions. Through theoretical analysis using multiscale Barron space methods and experimental validation, we show that the multiscale approach significantly reduces the necessary NN size and accelerates training.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Unveiling hidden physics at the LHC

The field of particle physics is at the crossroads. The discovery of a Higgs-like boson completed the Standard Model (SM), but the lacking observation of convincing resonances Beyond the SM (BSM) offers no guidance for the future of particle physics. On the other hand, the motivation for New Physics has not diminished and is, in fact, reinforced by several striking anomalous results in many experiments. Here we summarise the status of the most significant anomalies, including the most recent results for the flavour anomalies, the multi-lepton anomalies at the LHC, the Higgs-like excess at around 96 GeV, and anomalies in neutrino physics, astrophysics, cosmology, and cosmic rays. While the LHC promises up to 4 ab –1 of integrated luminosity and far-reaching physics programmes to unveil BSM physics, we consider the possibility that the latter could be tested with present data, but that systemic shortcomings of the experiments and their search strategies may preclude their discovery for several reasons, including: final states consisting in soft particles only, associated production processes, QCD-like final states, close-by SM resonances, and SUSY scenarios where no missing energy is produced. New search strategies could help to unveil the hidden BSM signatures, devised by making use of the CERN open data as a new testing ground. We discuss the CERN open data with its policies, challenges, and potential usefulness for the community. We showcase the example of the CMS collaboration, which is the only collaboration regularly releasing some of its data. We find it important to stress that individuals using public data for their own research does not imply competition with experimental efforts, but rather provides unique opportunities to give guidance for further BSM searches by the collaborations. Wide access to open data is paramount to fully exploit the LHCs potential.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Valence structures of light and strange mesons from the basis light-front quantization framework

In this work, we apply the basis light-front quantization (BLFQ) framework to solve for the structures of mesons with light and strange valence quarks. Our approach treats mesons as relativistic bound states with quarks confined in both the transverse direction and the light-front longitudinal direction. The spin-orbit interactions of these confined quarks are further specified by the Nambu–Jona-Lasinio model. We address the U(1)A axial anomaly by including the Kobayashi-Maskawa-’t Hooft interaction regularized by our basis. We present the structures of the pion, the kaon, the eta meson, and the eta-prime meson in terms of their valence light-front wave functions obtained from the eigenvalue problem of our light-front Hamiltonian.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

Logarithmic enhancements in conformal perturbation theory and their real time interpretation

We study various corrections of correlation functions to leading order in conformal perturbation theory, both on the cylinder and on the plane. Many problems on the cylinder are mathematically equivalent to those in the plane if we give the perturbations a position dependent scaling profile. The integrals to be done are then similar to those in the study of correlation functions with one additional insertion at the center of the profile. We will be primarily interested in the divergence structure of these corrections when computed in dimensional regularization. In particular, we show that the logarithmic divergences (enhancements) that show up in the plane under these circumstances can be understood in terms of resonant behavior in time dependent perturbation theory, for a transition between states that is induced by an oscillatory perturbation on the cylinder.

Physics↗
DOE OSTI2021

Non-Wilsonian ultraviolet completion via transseries

We study some of the implications for the perturbative renormalization program when augmented with the Borel–Ecalle resummation. We show the emergence of a new kind of nonperturbative fixed point for the scalar [Formula: see text] model, representing an ultraviolet self-completion by transseries. We argue that this completion is purely non-Wilsonian and it depends on one arbitrary constant stemming from the transseries solution of the renormalization group equation. On the other hand, if no fixed points are demanded through the adjustment of this arbitrary constant, we end up with an effective theory in which the scalar mass is quadratically-sensitive to the cutoff, even working in dimensional regularization. Complete decoupling of the scalar mass to this energy scale can be used to determine a physical prescription for the Borel–Laplace resummation of the renormalons in nonasymptotically free models. We also comment on possible orthogonal scenarios available in the literature that might play a role when no fixed points exist.

Physics↗
DOE OSTI2022

Feasibility of crystal-assisted collimation in the CERN accelerator complex

Bent silicon crystals mounted on high-accuracy angular actuators were installed in the CERN Super Proton Synchrotron (SPS) and extensively tested to assess the feasibility of crystal-assisted collimation in circular hadron colliders. The adopted layout was exploited and regularly upgraded for about a decade by the UA9 Collaboration. The investigations provided the compelling evidence of a strong reduction of beam losses induced by nuclear inelastic interactions in the aligned crystals in comparison with amorphous orientation. A conceptually similar device, installed in the betatron cleaning insertion of CERN Large Hadron Collider (LHC), was operated through the complete acceleration and storage cycle and demonstrated a large reduction of the background leaking from the collimation region and radiated into the cold sections of the accelerator and the experimental detectors. The implemented layout and the relevant results of the beam tests performed in the SPS and in the LHC with stored proton and ion beams are extensively discussed.

43 PARTICLE ACCELERATORS↗
DOE OSTI2022

Entanglement entropy across the lattice-continuum correspondence

This paper revisits the standard calculations of free field entanglement entropy in light of the newly developed lattice-continuum correspondence. This correspondence prescribes an explicit method to extract an approximately continuum quantum field theory out of a fully regularized lattice theory. This prescription will here be extended to subregion algebras, and it will be shown how entropies of continuum boson and fermion theories can be computed by working purely with lattice quantities. This gives a clear picture of the origin of divergences in entanglement entropy while also presenting a concise and detailed recipe for calculating this important quantity in continuum theories.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

On the inevitable lightness of vacuum

In this essay, we present a new understanding of the cosmological constant problem, built upon the realization that the vacuum energy density can be expressed in terms of a phase space volume. We introduce a UV-IR regularization which implies a relationship between the vacuum energy and entropy. Combining this insight with the holographic bound on entropy then yields a bound on the cosmological constant consistent with observations. It follows that the universe is large, and the cosmological constant is naturally small, because the universe is filled with a large number of degrees of freedom.

Astronomy & Astrophysics↗
DOE OSTI2021

Visualization of Multi-Fidelity Approximations of Stochastic Economic Dispatch

As renewable energy generation deployment increases, the operation of electrical grids becomes more complex. Economic dispatch is part of a grid operator's regular decision process where the amount of energy to generate is determined based on the number of available generators and the actual level of energy demand. Renewable generators are inherently stochastic due to the chaotic nature of weather patterns, and thus, real-time decisions of economic dispatch become increasingly complex. Modeling efforts to assist in these decisions in the highest fidelity typically take hours to days to solve on leadership-class computers; too long for the 5-minute operational time-frame demanded of operators. Alternatively, multi-fidelity approximations can be used to predict generation levels quickly and with sufficient accuracy to be used for real-time operations. We have developed a visualization tool to demonstrate the utility of multi-fidelity approximations by displaying contextual results of economic dispatch approximations, comparisons across fidelity levels of generation levels and possible failures to meet demand, and meta-data on the modeling setup.

interactive visualization↗