Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Quadrature”

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 19 records
All sourcesNASA NTRSDOE 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 OSTI2021

High-Accuracy Mesh-Free Quadrature for Trimmed Parametric Surfaces and Volumes

This work presents a high-accuracy, mesh-free, generalized Stokes theorem-based numerical quadrature scheme for integrating functions over trimmed parametric surfaces and volumes. The algorithm relies on two fundamental steps: (1) We iteratively reduce the dimensionality of integration using the generalized Stokes theorem to line integrals over trimming curves, and (2) we employ numerical antidifferentiation in the generalized Stokes theorem using high-order quadrature rules. Additionally, the scheme achieves exponential convergence up to trimming curve approximation error and has applications to computation of geometric moments, immersogeometric analysis, conservative field transfer between high-order curvilinear meshes, and initialization of multi-material simulations. We compare the quadrature scheme to commonly-used quadrature schemes in the literature and show that our scheme is much more efficient in terms of number of quadrature points used. We provide an open-source implementation of the scheme in MATLAB as part of QuaHOG, a software package for Quadrature of High-Order Geometries.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A New Galerkin Quadrature Method Not Requiring a Matrix Inverse

We derive a new Galerkin quadrature (GQ) method for S 𝑛 calculations that differs from the two methods preceding it in that a matrix inverse for an 𝑁 𝑑 × 𝑁 𝑑 matrix, where 𝑁𝑑 is the number of directions in the quadrature set, is no longer required. Galerkin quadrature methods are designed for calculations with highly anisotropic scattering. Such methods are not simply special angular quadratures but also are methods for representing the S 𝑛 scattering source that offers several advantages relative to the standard scattering source representation when highly truncated Legendre cross-section expansions must be used. Galerkin quadrature methods are also useful when the scattering is moderately anisotropic, but the quadrature being used is not sufficiently accurate for the order of the scattering source expansion that is required. Furthermore, we derive the new method and present computational results showing that its performance for two challenging problems is comparable to those of the two GQ methods that preceded it.

Galerkin quadrature↗
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 OSTI2022

Nonvanishing quadrature derivatives in the analytical gradients of density functional energies in crystals and helices

It is shown that the quadrature derivatives in some analytical gradients of energies evaluated with a multi-centre radial-angular grid do not vanish even in the limit of an infinitely dense grid, causing severe errors when neglected. The gradients in question are those with respect to a lattice constant of a crystal or to the helical angle of a chain with screw axis symmetry. Furthermore, this is in contrast with the quadrature derivatives in atomic gradients, which can be made arbitrarily small by grid extension. The disparate behaviour is traced to whether the grid points depend on the coordinate with respect to which the derivative of energy is taken. Whereas the nonvanishing quadrature derivative in the lattice-constant gradient is identified as the surface integral arising from an expanding integration domain, the analytical origin of the nonvanishing quadrature derivative in the helical-angle gradient remains unknown.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2021

Galerkin formulations of isogeometric shell analysis: Alleviating locking with Greville quadratures and higher-order elements

Here we propose new quadrature schemes that asymptotically require only four in-plane points for Reissner–Mindlin shell elements and nine in-plane points for Kirchhoff–Love shell elements in B-spline and NURBS-based isogeometric shell analysis, independent of the polynomial degree p of the elements. The quadrature points are Greville abscissae associated with pth-order B-spline basis functions whose continuities depend on the specific Galerkin formulations, and the quadrature weights are calculated by solving a linear moment fitting problem in each parametric direction. The proposed shell element formulations are shown through numerical studies to be rank sufficient and to be free of spurious modes. The studies reveal comparable accuracy, in terms of both displacement and stress, compared with fully integrated spline-based shell elements, while at the same time reducing storage and computational cost associated with forming element stiffness and mass matrices and force vectors. The high accuracy with low computational cost makes the proposed quadratures along with higher-order spline bases, in particular polynomial orders, p = 5 and 6, good choices for alleviating membrane and shear locking in shells.

42 ENGINEERING↗
DOE OSTI2021

SCEPTRE 2.2 Angular Quadrature Sets

This document includes details of the angular quadrature sets available in SCEPTRE for performing numerical integrations in the angular phase space. The angular dependence of the boundary and fixed-source terms an d initial angular flux are specified by angular index rather than by direction. It is, therefore, necessary to know the mapping from a specific direction to a direction index. This document includes angular quadrature weights and direction cosines for most of the quadrature sets available in SCEPTRE.

38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗
DOE OSTI2022

Spectral quadrature for the first principles study of crystal defects: Application to magnesium

In this work, we present an accurate and efficient finite-difference formulation and parallel implementation of Kohn-Sham Density (Operator) Functional Theory (DFT) for non periodic systems embedded in a bulk environment. Specifically, employing non-local pseudopotentials, local reformulation of electrostatics, and truncation of the spatial Kohn-Sham Hamiltonian, and the Linear Scaling Spectral Quadrature method to solve for the pointwise electronic fields in real-space and the non-local component of the atomic force, we develop a parallel finite difference framework suitable for distributed memory computing architectures to simulate non-periodic systems embedded in a bulk environment. Choosing examples from magnesium-aluminum alloys, we first demonstrate the convergence of energies and forces with respect to spectral quadrature polynomial order, and the width of the spatially truncated Hamiltonian. Next, we demonstrate the parallel scaling of our framework, and show that the computation time and memory scale linearly with respect to the number of atoms. Next, we use the developed framework to simulate isolated point defects and their interactions in magnesium-aluminum alloys. Our findings conclude that the binding energies of divacancies, Al solute-vacancy and two Al solute atoms are anisotropic and are dependent on cell size. Furthermore, the binding is favorable in all three cases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Towards Ab-Initio Simulations of Crystalline Defects at the Exascale Using Spectral Quadrature Density Functional Theory

Defects in crystalline solids play a crucial role in determining properties of materials at the nano, meso- and macroscales, such as the coalescence of vacancies at the nanoscale to form voids and prismatic dislocation loops or diffusion and segregation of solutes to nucleate precipitates, phase transitions in magnetic materials via disorder and doping. First principles Density Functional Theory (DFT) simulations can provide a detailed understanding of these phenomena. However, the number of atoms needed to correctly simulate these systems is often beyond the reach of many widely used DFT codes. The aim of this article is to discuss recent advances in first principles modeling of crystal defects using the spectral quadrature method. The spectral quadrature method is linear scaling with respect to the number of atoms, permits spatial coarse-graining, and is capable of simulating non-periodic systems embedded in a bulk environment, which allows the application of appropriate boundary conditions for simulations of crystalline defects. In this article, we discuss the state-of-the-art in ab-initio modeling of large metallic systems of the order of several thousand atoms that are suitable for utilizing exascale computing resourses.

36 MATERIALS SCIENCE↗
DOE OSTI2023

A fast, accurate and easy to implement Kapur–Rokhlin quadrature scheme for singular integrals in axisymmetric geometries

Many applications in magnetic confinement fusion require the efficient calculation of surface integrals with singular integrands. The singularity subtraction approaches typically used to handle such singularities are complicated to implement and low-order accurate. In contrast, we demonstrate that the Kapur–Rokhlin quadrature scheme is well-suited for the logarithmically singular integrals encountered for a toroidally axisymmetric confinement system, is easy to implement and is high-order accurate. As an illustration, we show how to apply this quadrature scheme for the efficient and accurate calculation of the normal component of the magnetic field due to the plasma current on the plasma boundary, via the virtual-casing principle.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Direct, simple and efficient computation of all components of the virtual-casing magnetic field in axisymmetric geometries with Kapur–Rokhlin quadrature

In a recent publication (Toler et al., J. Plasma Phys., vol. 89, issue 2, 2023, p. 905890210), we demonstrated that for axisymmetric geometries, the Kapur–Rokhlin quadrature rule provided an efficient and high-order accurate method for computing the normal component, on the plasma surface, of the magnetic field due to the toroidal current flowing in the plasma, via the virtual-casing principle. The calculation was indirect, as it required the prior computation of the magnetic vector potential from the virtual-casing principle, followed by the computation of its tangential derivative by Fourier differentiation, to obtain the normal component of the magnetic field. Our approach did not provide the other components of the virtual-casing magnetic field. In this letter, we show that a more direct and more general approach is available for the computation of the virtual-casing magnetic field. The Kapur–Rokhlin quadrature rule accurately calculates the principal value integrals in the expression for all the components of the magnetic field on the plasma boundary, and the numerical error converges at a rate nearly as high as the indirect method we presented previously.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Hybrid Quantum Networks with Discrete Polarizations and Continuous Quadrature Variables

Final Scientific/Technical Report for DOE Project DE-SC0022069. Quantum communication and computation systems have evolved along two largely independent paradigms: discrete-variable (DV) systems that encode information in qubits such as photon polarizations or photon-number states, and continuous-variable (CV) systems that encode information in optical field quadratures. Each approach offers distinct advantages—DVs provide low error rates and compatibility with single-photon platforms, while CVs support deterministic operations and efficient quantum state manipulation. A fundamental challenge for building a scalable Quantum Internet lies in interfacing these two regimes into a unified hybrid architecture that can coherently distribute and process quantum information across heterogeneous quantum nodes. This project aims to develop and demonstrate a hybrid optical quantum network that seamlessly integrates DV and CV systems. Specifically, we investigate a new class of hybrid entanglement between the discrete polarizations of single photons and the continuous quadrature variables of optical cat states, overcoming incompatibilities in existing DV–CV demonstrations. Using this new entanglement resource, the team investigates a multi-node hybrid quantum local area network (Q-LAN) testbed capable of DV–CV entanglement generation, swapping, and distribution across fiber links.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2021

Efficient quadrature rules for finite element discretizations of nonlocal equations

Here, in this paper, we design efficient quadrature rules for finite element (FE) discretizations of nonlocal diffusion problems with compactly supported kernel functions. Two of the main challenges in nonlocal modeling and simulations are the prohibitive computational cost and the nontrivial implementation of discretization schemes, especially in three-dimensional settings. In this work, we circumvent both challenges by introducing a parametrized mollifying function that improves the regularity of the integrand, utilizing an adaptive integration technique, and exploiting parallelization. We first show that the “mollified” solution converges to the exact one as the mollifying parameter vanishes, then we illustrate the consistency and accuracy of the proposed method on several two- and three-dimensional test cases. Furthermore, we demonstrate the good scaling properties of the parallel implementation of the adaptive algorithm and we compare the proposed method with recently developed techniques for efficient FE assembly.

97 MATHEMATICS AND COMPUTING↗
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 OSTI2023

Evaluation of the Abel inversion integral in O-mode plasma reflectometry using Chebyshev–Gauss quadrature

The Abel transform is often used to reconstruct plasma density profiles from O-Mode polarized reflectometry diagnostics. However, standard numerical trapezoidal evaluation of the Abel inversion integral can be computationally expensive for a large number of evaluation points, and an endpoint singularity exists on the upper-bound of the integral, which can result in an increased error. In this work, Chebyshev–Gauss quadrature is introduced as a new method to evaluate the Abel inversion integral for the problem of O-Mode plasma reflectometry. Here, the method does not require numerical evaluation of an integral singularity and is shown to have similar accuracy compared to existing methods while being computationally efficient.

47 OTHER INSTRUMENTATION↗
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 OSTI2021

Efficient quadrature rules for finite element discretizations of nonlocal equations

In this paper we design efficient quadrature rules for finite element discretizations of nonlocal diffusion problems with compactly supported kernel functions. Two of the main challenges in nonlocal modeling and simulations are the prohibitive computational cost and the nontrivial implementation of discretization schemes, especially in three-dimensional settings. In this work we circumvent both challenges by introducing a parametrized mollifying function that improves the regularity of the integrand, utilizing an adaptive integration technique, and exploiting parallelization. We first showthat the “mollified” solution converges to the exact one as the mollifying parameter vanishes, then we illustrate the consistency and accuracy of the proposed method on several two- and three-dimensional test cases. Furthermore, we demonstrate the good scaling properties of the parallel implementation of the adaptive algorithm and we compare the proposed method with recently developed techniques for efficient finite element assembly.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Ultra-broadband quadrature squeezing with thin-film lithium niobate nanophotonics

Squeezed light is a key quantum resource that enables quantum advantages for sensing, networking, and computing applications. The scalable generation and manipulation of squeezed light with integrated platforms are highly desired for the development of quantum technology with continuous variables. In this Letter, we demonstrate squeezed light generation with thin-film lithium niobate integrated photonics. Parametric down-conversion is realized with quasi-phase matching using ferroelectric domain engineering. With sub-wavelength mode confinement, efficient nonlinear processes can be observed with single-pass configuration. We measure 0.56 ± 0.09 dB quadrature squeezing (∼2.6 dB inferred on-chip). The single-pass configuration further enables the generation of squeezed light with large spectral bandwidth up to 7 THz. This work represents a significant step towards the on-chip implementation of continuous-variable quantum information processing.

Chen, Pao-Kang↗