SEARCH · Engineering Papers

Results for “QUADRATURE APPROXIMATION”

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 19 records

All sources NASA NTRS DOE OSTI

DOE OSTI2024

Quadrature Based Neural Network Learning of Stochastic Hamiltonian Systems

Hamiltonian Neural Networks (HNNs) provide structure-preserving learning of Hamiltonian systems. In this paper, we extend HNNs to structure-preserving inversion of stochastic Hamiltonian systems (SHSs) from observational data. We propose the quadrature-based models according to the integral form of the SHSs’ solutions, where we denoise the loss-by-moment calculations of the solutions. The integral pattern of the models transforms the source of the essential learning error from the discrepancy between the modified Hamiltonian and the true Hamiltonian in the classical HNN models into that between the integrals and their quadrature approximations. This transforms the challenging task of deriving the relation between the modified and the true Hamiltonians from the (stochastic) Hamilton–Jacobi PDEs, into the one that only requires invoking results from the numerical quadrature theory. Meanwhile, denoising via moments calculations gives a simpler data fitting method than, e.g., via probability density fitting, which may imply better generalization ability in certain circumstances. Numerical experiments validate the proposed learning strategy on several concrete Hamiltonian systems. The experimental results show that both the learned Hamiltonian function and the predicted solution of our quadrature-based model are more accurate than that of the corrected symplectic HNN method on a harmonic oscillator, and the three-point Gaussian quadrature-based model produces higher accuracy in long-time prediction than the Kramers–Moyal method and the numerics-informed likelihood method on the stochastic Kubo oscillator as well as other two stochastic systems with non-polynomial Hamiltonian functions. Moreover, the Hamiltonian learning error εH arising from the Gaussian quadrature-based model is lower than that from Simpson’s quadrature-based model. These demonstrate the superiority of our approach in learning accuracy and long-time prediction ability compared to certain existing methods and exhibit its potential to improve learning accuracy via applying precise quadrature formulae.

Mathematics↗

DOE OSTI2022

Monolithic Multigrid for a Reduced-Quadrature Discretization of Poroelasticity

Advanced finite-element discretizations and preconditioners for models of poroelasticity have attracted significant attention in recent years. The equations of poroelasticity offer significant challenges in both areas, due to the potentially strong coupling between unknowns in the system, saddle-point structure, and the need to account for wide ranges of parameter values, including limiting behavior such as incompressible elasticity. This paper was motivated by an attempt to develop monolithic multigrid preconditioners for the discretization developed in [C. Rodrigo et al., Comput. Methods App. Mech. Engrg, 341 (2018), pp. 467--484]; we show here why this is a difficult task and, as a result, we modify the discretization in [Rodrigo et al.] through the use of a reduced-quadrature approximation, yielding a more “solver-friendly” discretization. Local Fourier analysis is used to optimize parameters in the resulting monolithic multigrid method, allowing a fair comparison between the performance and costs of methods based on Vanka and Braess--Sarazin relaxation. Further, numerical results are presented to validate the local Fourier analysis predictions and demonstrate efficiency of the algorithms. Finally, a comparison to existing block-factorization preconditioners is also given.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Exploiting Kronecker structure in exponential integrators: Fast approximation of the action of φ $-$functions of matrices via quadrature

Here, in this article, we propose an algorithm for approximating the action of φ $-$ functions of matrices against vectors, which is a key operation in exponential time integrators. In particular, we consider matrices with Kronecker sum structure, which arise from problems admitting a tensor product representation. The method is based on quadrature approximations of the integral form of the φ $-$ functions combined with a scaling and modified squaring method. Owing to the Kronecker sum representation, only actions of 1D matrix exponentials are needed at each quadrature node and assembly of the full matrix can be avoided. Additionally, we derive a priori bounds for the quadrature error, which show that, as expected by classical theory, the rate of convergence of our method is supergeometric. Guided by our analysis, we construct a fast and robust method for estimating the optimal scaling factor and number of quadrature nodes that minimizes the total cost for a prescribed error tolerance. We investigate the performance of our algorithm by solving several linear and semilinear time-dependent problems in 2D and 3D. The results show that our method is accurate and orders of magnitude faster than the current state-of-the-art.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Optimized Auxiliary Functions for Robust Mitigation of Finite-Size Errors in Periodic Hybrid Density Functional Theory

When calculating properties of periodic systems at the thermodynamic limit (TDL), the dominant source of finite size error (FSE) arises from the long-range Coulomb interaction, and can manifest as a slowly converging quadrature error when approximating an integral in the reciprocal space by a finite sum. The singularity subtraction (SS) method offers a systematic approach for reducing this quadrature error and thus the FSE. Here, in this work, we first investigate the performance of the SS method in the simplest setting, aiming at reducing the FSE in exact exchange calculations by subtracting the Coulomb contribution with a single, adjustable Gaussian auxiliary function. We demonstrate that a simple fitting method can robustly estimate the optimal Gaussian width and leads to rapid convergence toward the TDL. Furthermore, we suggest new forms of the auxiliary function, whose optimal parameters could also be determined through least-squares fitting. For a range of semiconductors and insulators, the proposed auxiliary functions achieve robust, millihartree-level accuracy in hybrid density functional theory calculations, including cases with sparse k-meshes and large basis sets.

Quiton, Stephen Jon [University of California, Ber↗

DOE OSTI2024

Tensor network representation of non-abelian gauge theory coupled to reduced staggered fermions

We show how to construct a tensor network representation of the path integral for reduced staggered fermions coupled to a non-abelian gauge field in two dimensions. The resulting formulation is both memory and computation efficient because reduced staggered fermions can be represented in terms of a minimal number of tensor indices while the gauge sector can be approximated using Gaussian quadrature with a truncation. Numerical results obtained using the Grassmann TRG algorithm are shown for the case of SU(2) lattice gauge theory and compared to Monte Carlo results.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2024

Calibrating two jets at once

Jet-energy calibration is an important aspect of many measurements and searches at the LHC. Currently, these calibrations are performed on a per-jet basis, i.e., agnostic to the properties of other jets in the same event. In this work, we propose taking advantage of the correlations induced by momentum conservation between jets in order to improve their jet-energy calibration. By fitting the p T asymmetry of dijet events in simulation, while remaining agnostic to the p T spectra themselves, we are able to obtain correlation-improved maximum likelihood estimates. This approach is demonstrated with simulated jets from the CMS detector, yielding a 3%–5% relative improvement in the jet-energy resolution, corresponding to a quadrature improvement of approximately 35%. Published by the American Physical Society 2024

Gambhir, Rikab (ORCID:0000000251080448)↗

DOE OSTI2023

QuadConv: Quadrature-based convolutions with applications to non-uniform PDE data compression

We present a new convolution layer for deep learning architectures which we call QuadConv — an approximation to continuous convolution via quadrature. Our operator is developed explicitly for use on non-uniform, mesh-based data, and accomplishes this by learning a continuous kernel that can be sampled at arbitrary locations. Moreover, the construction of our operator admits an efficient implementation which we detail and construct. As an experimental validation of our operator, we consider the task of compressing partial differential equation (PDE) simulation data from fixed meshes. Here, we show that QuadConv can match the performance of standard discrete convolutions on uniform grid data by comparing a QuadConv autoencoder (QCAE) to a standard convolutional autoencoder (CAE). Further, we show that the QCAE can maintain this accuracy even on non-uniform data. In both cases, QuadConv also outperforms alternative unstructured convolution methods such as graph convolution.

Compression↗

DOE OSTI2022

Metaplectic geometrical optics for ray-based modeling of caustics: Theory and algorithms

The optimization of radio frequency-wave (RF) systems for fusion experiments is often performed using ray-tracing codes, which rely on the geometrical-optics (GO) approximation. However, GO fails at caustics such as cutoffs and focal points, erroneously predicting the wave intensity to be infinite. This is a critical shortcoming of GO, since the caustic wave intensity is often the quantity of interest, e.g., RF heating. Full-wave modeling can be used instead, but the computational cost limits the speed at which such optimizations can be performed. Here, we have developed a less expensive alternative called metaplectic geometrical optics (MGO). Instead of evolving waves in the usual x (coordinate) or k (spectral) representation, MGO uses a mixed X$\equiv$Ax+Bk representation. By continuously adjusting the matrix coefficients A and B along the rays, one can ensure that GO remains valid in the X coordinates without caustic singularities. The caustic-free result is then mapped back onto the original x space using metaplectic transforms. Here, we overview the MGO theory and review algorithms that will aid the development of an MGO-based ray-tracing code. We show how using orthosymplectic transformations leads to considerable simplifications compared to previously published MGO formulas. We also prove explicitly that MGO exactly reproduces standard GO when evaluated far from caustics (an important property that until now has only been inferred from numerical simulations), and we relate MGO to other semiclassical caustic-removal schemes published in the literature. Finally this discussion is then augmented by an explicit comparison of the computed spectrum for a wave bounded between two cutoffs.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2025

Weak Form Scientific Machine Learning: Test Function Construction for System Identification

Weak form Scientific Machine Learning (WSciML) is a recently developed framework for data-driven modeling and scientific discovery. It leverages the weak form of equation error residuals to provide enhanced noise robustness in system identification via convolving model equations with test functions, reformulating the problem to avoid direct differentiation of data. The performance, however, relies on wisely choosing a set of compactly supported test functions. In this work, we mathematically motivate a novel data-driven method for constructing Single-scale-Local reference functions for creating the set of test functions. Our approach numerically approximates the integration error introduced by the quadrature and identifies the support size for which the error is minimal, without requiring access to the model parameter values. Through numerical experiments across various models, noise levels, and temporal resolutions, we demonstrate that the selected supports consistently align with regions of minimal parameter estimation error. We also compare the proposed method against the strategy for constructing Multi-scale-Global (and orthogonal) test functions introduced in our prior work, demonstrating the improved computational efficiency.

FOS: Computer and information sciences↗

DOE OSTI2025

Untangling Sources of Error in the Density-Functional Many-Body Expansion

The many-body expansion provides a framework for data-driven applications of electronic structure theory, including parametrization of classical force fields and machine learning. In this article, we demonstrate that its use significantly amplifies quadrature grid errors when modern density-functional approximations are employed. Standard grids that work well in conventional density-functional calculations result in runaway error accumulation when used with the many-body expansion. At the same time, delocalization error is also exacerbated, leading to exaggerated estimates of nonadditive n-body interactions. This is illustrated for anion–water clusters using the SCAN, r2SCAN, ωB97X-V and ωB97M-V functionals. By employing dense quadrature grids, the inherent self-interaction error is exposed, which can then be mitigated using a variety of other strategies.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2023

Energy conserving quadrature based dimensionality reduction for nonlinear hydrodynamics problems

Projection based dimensionality reduction is used to approximate the full discretiza tion of a PDE problem in order to reduce the cost of its numerical simulation while staying faithful to the full dynamics. For nonlinear problems, hyperreduction methods are additionally needed to remove the dependence of the nonlinear terms on the full problem’s size. In this project, we develop an energy conserving hyperreduction method and apply it to Eulerian-Lagrangian hydrodynamics problems, demonstrating that the reduced model successfully accelerates the numerical simulations while conserving the problem’s total energy with high accuracy.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Projective Integral Updates for High-Dimensional Variational Inference

Variational inference is an approximation framework for Bayesian inference that seeks to improve quantified uncertainty in predictions by optimizing a simplified distribution over parameters to stand in for the full posterior. Capturing model variations that remain consistent with training data enables more robust predictions by reducing parameter sensitivity. This work introduces a fixed-point optimization for variational inference that is applicable when every feasible log density can be expressed as a linear combination of functions from a given basis. In such cases, the optimizer becomes a fixed-point of projective integral updates. When the basis spans univariate quadratics in each parameter, the feasible distributions are Gaussian mean-fields and the projective integral updates yield quasi-Newton variational Bayes (QNVB). Other bases and updates are also possible. Since these updates require high-dimensional integration, this work begins by proposing an efficient quasirandom sequence of quadratures for mean-field distributions. Each iterate of the sequence contains two evaluation points that combine to correctly integrate all univariate quadratic functions and, if the mean-field factors are symmetric, all univariate cubics. More importantly, averaging results over short subsequences achieves periodic exactness on a much larger space of multivariate polynomials of quadratic total degree. The corresponding variational updates require four loss evaluations with standard (not second-order) backpropagation to eliminate error terms from over half of all multivariate quadratic basis functions. Furthermore, this integration technique is motivated by first proposing stochastic blocked mean-field quadratures, which may be useful in other contexts. A PyTorch implementation of QNVB allows for better control over model uncertainty during training than competing methods. Experiments demonstrate superior generalizability for multiple learning problems and architectures.

Gaussian mean-field↗

DOE OSTI2024

Spectral scheme for atomic structure calculations in density functional theory

In this study, we present a spectral scheme for atomic structure calculations in pseudopotential Kohn-Sham density functional theory. In particular, after applying an exponential transformation of the radial coordinates, we employ global polynomial interpolation on a Chebyshev grid, with derivative operators approximated using the Chebyshev differentiation matrix, and integrations using Clenshaw-Curtis quadrature. We demonstrate the accuracy and efficiency of the scheme through spin-polarized and unpolarized calculations for representative atoms, while considering local, semilocal, and hybrid exchange-correlation functionals. In particular, we find that $\mathcal{O}$(200) grid points are sufficient to achieve an accuracy of 1 microhartree in the eigenvalues for optimized norm conserving Vanderbilt pseudopotentials spanning the periodic table from atomic number Ζ = 1 to 83.

74 ATOMIC AND MOLECULAR PHYSICS↗

DOE OSTI2023

Projection pursuit adaptation on polynomial chaos expansions

Here, the present work addresses the issue of accurate stochastic approximations in high-dimensional parametric space using tools from uncertainty quantification (UQ). The basis adaptation method and its accelerated algorithm in polynomial chaos expansions (PCE) were recently proposed to construct low-dimensional approximations adapted to specific quantities of interest (QoI). The present paper addresses one difficulty with these adaptations, namely their reliance on quadrature point sampling, which limits the reusability of potentially expensive samples. Projection pursuit (PP) is a statistical tool to find the “interesting” projections in high-dimensional data and thus bypass the curse-of-dimensionality. In the present work, we combine the fundamental ideas of basis adaptation and projection pursuit regression (PPR) to propose a novel method to simultaneously learn the optimal low-dimensional spaces and PCE representation from given data. While this projection pursuit adaptation (PPA) can be entirely data-driven, the constructed approximation exhibits mean-square convergence to the solution of an underlying governing equation and thus captures the supports and probability distributions associated with the physics constraints. The proposed approach is demonstrated on a borehole problem and a structural dynamics problem, demonstrating the versatility of the method and its ability to discover low-dimensional manifolds with high accuracy with limited data. In addition, the method can learn surrogate models for different quantities of interest while reusing the same data set.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

FLOWERS AEP: An Analytical Model for Wind Farm Layout Optimization

Annual energy production (AEP) is commonly used in objective functions for wind farm layout optimization. AEP is proportional to wind farm power production integrated over an annual distribution of free-stream wind conditions. Physics-based estimates of wind farm power production typically rely on low-fidelity engineering wake models that approximate the steady-state wind farm flow field. AEP estimates are then obtained by performing independent simulations for discrete wind conditions and using rectangular quadrature to account for each condition's expected frequency of occurrence. Depending on the number of simulated discrete wind conditions, this numerical integral could be hampered by poor accuracy or high computational costs. The FLOWERS AEP model instead poses an analytical integral of the engineering wake model over the variable wind conditions, yielding a closed-form, analytical function for wind farm AEP. This paper derives the analytical functions for FLOWERS AEP and its derivatives with respect to turbine position, which are useful for gradient-based wind farm layout optimization, in nondimensional form. We then analyze the benefits of the FLOWERS AEP model over conventional reference models, focusing on its low cost, adequate wake loss predictions, and smooth design space. Although the FLOWERS approach is found to predict the exact value of AEP with some error relative to the reference model (within 14% on average), it dramatically reduces computation time by an order of magnitude, produces a qualitatively similar design space at relatively low resolution, and yields comparable optimal layouts. This significant speed improvement is critical in layout optimization applications, where determining an optimal layout in an efficient manner is more important than precise AEP prediction.

17 WIND ENERGY↗

DOE OSTI2022

Deterministic and Monte Carlo Nuclear Data Adjustment Methods [Slides]

For the Bayesian Monte Carlo methodology, a need to understand convergence of the posterior moments as a function of the number of parameter realizations is required. In high-dimensional systems, it can be very costly to sample entire parameter space and perform functional evaluation for every realization. Bayesian Monte Carlo allows one to relax the GLLS approximations of model linearity and prior/posterior PDF shape. The Bayesian Stochastic Collocation Method is a deterministic approach to “sample” the parameter space. It allows one to relax the GLLS approximations of model linearity and posterior PDF shape. Higher-order posterior moments (i.e., skewness, kurtosis, etc.) can be studied through polynomial expansion. Tensor product quadrature scales poorly and can use sparse grid quadrature methods.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2025

OpenSn: A massively parallel, open-source simulation environment for discrete ordinates radiation transport

OpenSn is an open-source, massively parallel deterministic radiation transport code for solving the discrete-ordinates ( S N ) form of the Boltzmann transport equation on unstructured, arbitrary polyhedral meshes. It supports high-fidelity simulations involving steady-state, eigenvalue, and adjoint problems for neutral particles (e.g., neutrons, photons, multi-particles), using the multigroup approximation in energy. OpenSn combines angular discretization via discrete ordinates with a discontinuous Galerkin finite element method (DGFEM) in space, enabling accurate resolution of transport physics on arbitrary polyhedral cells, included locally refined spatial grids. It includes multiple angular quadrature types, including locally refined angular quadratures. Written in modern C++ with a Python API, OpenSn runs efficiently on platforms ranging from laptops to supercomputers. The transport sweep algorithm is implemented using a task-based, directed-acyclic-graph (DAG) approach for each angle and supports asynchronous parallelism across thousands of MPI ranks. Group-set aggregation improves compute intensity, and synthetic acceleration techniques (e.g., diffusion synthetic acceleration, second-moment method) enhance solver convergence. OpenSn has been verified on reactor physics problems and demonstrated excellent weak and strong scaling performance on more than 32,768 processes, making it a versatile and robust platform for large-scale transport simulations in complex geometries.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2022

Equatorial Origin of the Observed Tropical Pacific Quasi-Decadal Variability From ENSO Nonlinearity

Quasi-decadal (QD) climate variability is detected in the tropical Pacific based on the recent 70 years of observations. This QD variability is identified in equatorial sea surface temperatures (SSTs), the pattern of which resembles the Central Pacific (CP) El Niño-Southern Oscillation (ENSO) but extends further meridionally to the northeastern subtropical Pacific. Whereas equatorial upper-ocean heat content and SSTs are in quadrature for ENSO, these two quantities are almost in phase on the QD timescale. Further analysis shows that nonlinear dynamical heating, primarily originating from strong El Niño events, tends to lead QD SSTs by a quarter of its dominant period (approximately 30 months) and shapes the dominant QD periodicity in observations. Here, our results suggest that the observed QD variability largely originates from ENSO nonlinearity and thus is fundamentally different from ENSO's oscillatory nature.

54 ENVIRONMENTAL SCIENCES↗