Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Smooth 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.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 37 records · Page 2

A Scalable Gradient Free Method for Bayesian Experimental Design with Implicit Models

Bayesian experimental design (BED) is to answer the question that how to choose designs that maximize the information gathering. For implicit models, where the likelihood is intractable but sampling is possible, conventional BED methods have difficulties in efficiently estimating the posterior distribution and maximizing the mutual information (MI) between data and parameters. Recent work proposed the use of gradient ascent to maximize a lower bound on MI to deal with these issues. However, the approach requires a sampling path to compute the pathwise gradient of the MI lower bound with respect to the design variables, and such a pathwise gradient is usually inaccessible for implicit models. In this paper, we propose a novel approach that leverages recent advances in stochastic approximate gradient ascent incorporated with a smoothed variational MI estimator for efficient and robust BED. Without the necessity of pathwise gradients, our approach allows the design process to be achieved through a unified procedure with an approximate gradient for implicit models. Several experiments show that our approach outperforms baseline methods, and significantly improves the scalability of BED in high-dimensional problems.

Zhang, Jiaxin↗

Diffuse X-ray scattering from polished silicon: application of the distorted wave Born approximation

Measured diffuse X-ray scattering data for a `smooth' as well as for a `rough' silicon sample were fit to theoretical expressions within the distorted wave Born approximation (DWBA). Data for the power spectral density (PSD) for both samples were also obtained by means of atomic force microscopy and optical interferometry. The Fourier transforms of trial correlation functions were fit to the PSD data and then applied to the DWBA formalism. The net correlation functions needed to fit the PSD data for each sample comprised the sum of two terms with different cutoff lengths and different self-affine fractal exponents. At zero distance these correlation functions added up to yield net values of σ 2 = (2) 2 and (71) 2 Å 2 for the smooth and rough samples, respectively. X-ray scattering data were obtained at beamline 1-BM of the Advanced Photon Source. Data and fits at values of q z = 0.05 and 0.10 Å −1 for the smooth sample are reported. Good fits for the smooth sample were obtained at both q z values simultaneously, that is, identical fitting parameters were applied at both values of q z . The smooth sample also exhibited weak Yoneda wings and a clear distinction between the strong specular scattering and the weak diffuse scattering. Data for the rough sample were qualitatively different and exhibited very weak scattering at the specular condition in contrast to extremely large Yoneda wings. Fits for the rough sample are reported for q z = 0.04, 0.05, and 0.06 Å −1 . Although the large Yoneda wings could be fit quite well in both position and amplitude, scattering near the specular condition could not be equally well fit by applying the same fitting parameters at all values of q z . Albeit imperfect, best-fitting results at the specular condition were obtained by invoking only diffuse scattering, that is, without including a separate theoretical expression for specular scattering.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Overset-Grid Method with Smooth Orbital Partitioning for Molecular Scattering Calculations

To solve molecular photoionization and electron scattering problems, we use an overset-grid representation of electronic continuum functions, which has an extended central spherical grid that overlaps small spherical grids (subgrids) centered on each atom of a polyatomic molecule. Here, in this work, we present an improved algorithm that smoothly partitions the total wave function between the central grid and the atomic subgrids. The smooth partitioning allows one to use approximately one-fourth the number of partial waves on the central grid compared to our previous implementation with switching functions. The resulting numerical method for treating electron scattering and photoionization of polyatomic molecules combines the accuracy and flexibility of pure numerical grid representations with the rapid convergence of hybrid combinations of atom-centered basis-set expansions and grid methods. The overset-grid representation is implemented using the complex Kohn variational principle for scattering and photoionization amplitudes. The faster convergence with respect to the number of central grid partial waves is demonstrated and accuracy is verified by comparisons with the previous implementation and with far more computationally demanding single-center numerical expansions in electron-molecule scattering and photoionization calculations on the neon dimer (Ne 2 ) system, carbon tetrafluoride (CF 4 ) molecule, and the pyridine (C 5 H 5 N) molecule in the static-exchange approximation.

Molecules↗

Position-dependent Voronoi probability distribution functions for matter and halos

Here, we measure the Voronoi density probability distribution function (PDF) for both dark matter and halos in N-body simulations. For the dark matter, Voronoi densities represent the matter density field smoothed on a uniform mass scale, which approximates the Lagrangian density field. For halos, the Voronoi densities contain information about the local environment of each halo. We measure the halo virial masses, the total amount of dark matter within each halo Voronoi cell, and the halo Voronoi cell volumes, and we show how halo abundances depend on these three quantities. We then study the position-dependent Voronoi density PDF, measured within finite subregions of the Universe, using separate universe simulations. We demonstrate that the spatial variation of the position-dependent PDF is due to large-scale density fluctuations, indicating that the position-dependent PDF is a biased tracer of large-scale structure. We measure this bias for the dark matter, and interpret it as the bias of regions of the Lagrangian density field that are selected based on density. For the halos, this bias can be interpreted as a form of assembly bias. We present the mapping from late-time to early-time Voronoi density for each simulation dark matter particle, which is highly stochastic. We compare the median of this stochastic map with spherical collapse calculations and discuss challenges involved in modeling the evolution of the density field on these scales.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

An Empirical Quantile Estimation Approach for Chance-Constrained Nonlinear Optimization Problems

We investigate an empirical quantile estimation approach to solve chance-constrained nonlinear optimization problems. Our approach is based on the reformulation of the chance constraint as an equivalent quantile constraint to provide stronger signals on the gradient. In this approach, the value of the quantile function is estimated empirically from samples drawn from the random parameters, and the gradient of the quantile function is estimated via a finite-difference approximation on top of the quantile-function-value estimation. We establish a convergence theory of this approach within the framework of an augmented Lagrangian method for solving general nonlinear constrained optimization problems. The foundation of the convergence analysis is a concentration property of the empirical quantile process, and the analysis is divided based on whether or not the quantile function is differentiable. In contrast to the sampling-and-smoothing approach used in the literature, the method developed in this paper does not involve any smoothing function and hence the quantile-function gradient approximation is easier to implement and there are less accuracy-control parameters to tune. Furthermore, we demonstrate the effectiveness of this approach and compare it with a smoothing method for the quantile-gradient estimation. Numerical investigation shows that the two approaches are competitive for certain problem instances.

Applied Probability↗

Customizable adaptive regularization techniques for B-spline modeling

B-spline models are a powerful way to represent scientific data sets with a functional approximation. However, these models can suffer from spurious oscillations when the data to be approximated are not uniformly distributed. Model regularization (i.e., smoothing) has traditionally been used to minimize these oscillations; unfortunately, it is sometimes impossible to sufficiently remove unwanted artifacts without smoothing away key features of the data set. In this article, we present a method of model regularization that preserves significant features of a data set while minimizing artificial oscillations. Our method varies the strength of a smoothing parameter throughout the domain automatically, removing artifacts in poorly-constrained regions while leaving other regions unchanged. Further, the proposed method selectively incorporates regularization terms based on first and second derivatives to maintain model accuracy while minimizing numerical artifacts. The behavior of our method is validated on a collection of two- and three-dimensional data sets produced by scientific simulations. In addition, a key tuning parameter is highlighted and the effects of this parameter are presented in detail. This paper is an extension of our previous conference paper at the 2022 International Conference on Computational Science (ICCS) (Lenz et al., 2022).

97 MATHEMATICS AND COMPUTING↗

Toward efficient elastocaloric systems: Predicting material thermal properties with high fidelity

A critical need to accurately model thermal behaviors of materials that exhibit strong elastocaloric effects, including predicting the effects themselves at varying stresses and temperatures, has been addressed using a simple and versatile physics-based approach. The key factor leading to the high precision is approximating the underlying elastic phase transition as a smooth modification of lattice entropy between coexisting phases. Once the phase transformation entropy is modeled to match experimentally measured strain as a function of temperature and applied stress, estimating the heat capacity, entropy, and isothermal entropy and adiabatic temperature changes in temperature-stress coordinates becomes straightforward. This approach provides insight into how thermal properties of elastocaloric materials vary through the transition based on strain measurements that are simple to perform and interpret. In addition to aiding in the rapid evaluation of new and existing elastocaloric materials, this advance is expected to prove invaluable for accurate heat transfer modeling aimed at designing efficient regenerative elastocaloric cooling devices.

36 MATERIALS SCIENCE↗

Evaluating route to impact convergence of the harmonic balance method for piecewise-smooth systems

Here in this work, we investigate the applicability of the harmonic balance method (HBM) to predict periodic solutions of a single degree-of-freedom forced Duffing oscillator with freeplay nonlinearity. By studying the route to impact, which refers to a parametric study as the contact stiffness increases from soft to hard, the convergence behavior of the HBM can be understood in terms of the strength of the non-smooth forcing term. HBM results are compared to time-integration results to facilitate an evaluation of the accuracy of nonlinear periodic responses. An additional contribution of this study is to perform convergence and stability analysis specifically for isolas generated by the non-smooth nonlinearity. Residual error analysis is used to determine the approximate number of harmonics required to get results accurate to a given error tolerance. Hill’s method and Floquet theory are employed to compute the stability of periodic solutions and identify the types of bifurcations in the system.

42 ENGINEERING↗

Coil optimization for quasi-helically symmetric stellarator configurations

Filament-based coil optimizations are performed for several quasi-helical stellarator configurations, beginning with the one from Landreman & Paul ( Phys. Rev. Lett. , vol. 128, 2022, 035001), demonstrating that precise quasi-helical symmetry can be achieved with realistic coils. Several constraints are placed on the shape and spacing of the coils, such as low curvature and sufficient plasma–coil distance for neutron shielding. The coils resulting from this optimization have a maximum curvature 0.8 times that of the coils of the Helically Symmetric eXperiment (HSX) and a mean squared curvature 0.4 times that of the HSX coils when scaled to the same plasma minor radius. When scaled up to reactor size and magnetic field strength, no fast particle losses were found in the free-boundary configuration when simulating 5000 alpha particles launched at $3.5\,\mathrm {MeV}$ on the flux surface with a normalized toroidal flux of $s=0.5$ . An analysis of the tolerance of the coils to manufacturing errors is performed using a Gaussian process model, and the coils are found to maintain low particle losses for smooth, large-scale errors up to amplitudes of approximately $0.15\,\mathrm {m}$ . Another coil optimization is performed for the Landreman–Paul configuration with the additional constraint that the coils are purely planar. Visual inspection of the Poincaré plot of the resulting magnetic field-lines reveal that the planar modular coils alone do a poor job of reproducing the target equilibrium. Additional non-planar coil optimizations are performed for the quasi-helical configuration with $5\,\%$ volume-averaged plasma beta from Landreman et al. ( Phys. Plasma , vol. 29, issue 8, 2022, 082501), and a similar configuration also optimized to satisfy the Mercier criterion. The finite beta configurations had larger fast-particle losses, with the free-boundary Mercier-optimized configuration performing the worst, losing approximately $5.5\,\%$ of alpha particles launched at $s=0.5$ .

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Automating NISQ Application Design with Meta Quantum Circuits with Constraints (MQCC)

Near-term intermediate scale quantum (NISQ) computers are likely to have very restricted hardware resources, where precisely controllable qubits are expensive, error-prone, and scarce. Programmers of such computers must therefore balance trade-offs among a large number of (potentially heterogeneous) factors specific to the targeted application and quantum hardware. To assist them, we propose Meta Quantum Circuits with Constraints (MQCC), a meta-programming framework for quantum programs. Programmers express their application as a succinct collection of normal quantum circuits stitched together by a set of (manually or automatically) added meta-level choice variables, whose values are constrained according to a programmable set of quantitative optimization criteria. MQCC’s compiler generates the appropriate constraints and solves them via an SMT solver, producing an optimized, runnable program. We showcase a few MQCC’s applications for its generality including an automatic generation of efficient error syndrome extraction schemes for fault-tolerant quantum error correction with heterogeneous qubits and an approach to writing approximate quantum Fourier transformation and quantum phase estimation that smoothly trades off accuracy and resource use. We also illustrate that MQCC can easily encode prior one-off NISQ application designs-–multi-programming (MP), crosstalk mitigation (CM)—as well as a combination of their optimization goals (i.e., a combined MP-CM).

97 MATHEMATICS AND COMPUTING↗

Efficient screening of rare large pit anomalies on polished surfaces using a minimalist sampling scheme

Lawrence Livermore National Laboratory (LLNL) has made significant strides in generating clean energy through its inertial confinement fusion (ICF) experiments. These experiments rely on high-density carbon (HDC) coated shells to encapsulate the fusion fuel. The success of these experiments is heavily dependent on the surface quality of these shells, as even minor imperfections, such as deep pits, can negatively impact fusion yield. Ensuring the required smoothness involves an extensive surface-finishing process that spans approximately 20 stages, making it both time-intensive and resource-demanding. A critical challenge in this process is the need for high-resolution scans to detect rare deep pits, which can be costly and impractical if performed on every shell. This highlights the necessity of developing more efficient scanning methods to optimize time and cost without compromising accuracy. To address these challenges, we introduce a novel approach that employs the multivariate Dvoretzky–Kiefer–Wolfowitz (DKW) inequality to provide a probabilistic upper bound on the error in estimating pit distribution characteristics via a Kernel Density Estimator (KDE). This error bound enables efficient and reliable estimation of pit distribution characteristics at a specified statistical confidence level using a minimal number of surface scans. The integrated DKW-KDE approach was validated through surface-finishing experiments across two batches of HDC-coated shells, demonstrating consistent and robust performance across multiple stages of the surface-finishing experiments. The validation studies suggest that the integrated DKW-KDE approach achieves comparable accuracy in estimating the risk of deleterious large pits with six scans, thus conserving time and resources. Further evaluations show that performance remains consistent across batches and over multiple polishing stages. In conclusion, based on these findings, one can leverage the minimal-scan insights to strategically improve the bottleneck inspection process, thus enhancing the productivity and quality of shell polishing and similar challenging manufacturing processes.

Inertial confinement fusion↗

Approximation rates of DeepONets for learning operators arising from advection–diffusion equations

Here we present the analysis of approximation rates of operator learning in Chen and Chen (1995) and Lu et al. (2021), where continuous operators are approximated by a sum of products of branch and trunk networks. In this work, we consider the rates of learning solution operators from both linear and nonlinear advection–diffusion equations with or without reaction. We find that the approximation rates depend on the architecture of branch networks as well as the smoothness of inputs and outputs of solution operators.

97 MATHEMATICS AND COMPUTING↗

Cross-correlating radial peculiar velocities and CMB lensing convergence

We study, for the first time, the cross correlation between the angular distribution of radial peculiar velocities (PV) and the lensing convergence of cosmic microwave background (CMB) photons. We derive theoretical expectations for the signal and its covariance and assess its detectability with existing and forthcoming surveys. We find that such cross-correlations are expected to improve constraints on different gravitational models by partially breaking degeneracies with the matter density. We identify in the distance-scaling dispersion of the peculiar velocities the most relevant source of noise in the cross correlation. For this reason, we also study how the above picture changes assuming a redshift-independent scatter for the PV, obtained for example using a reconstruction technique. Our results show that the cross correlation might be detected in the near future combining PV measurements from DESI and the convergence map from CMB-S4. Using realistic direct PV measurements we predict a cumulative signal-to-noise ratio of approximately 3.8σ using data on angular scales 3 ≤ ℓ ≤ 200. For an idealized reconstructed peculiar velocity map extending up to redshift z = 0.15 and a smoothing scale of 4 Mpc h -1 we predict a cumulative signal-to-noise ratio of approximately 27σ from angular scales 3 ≤ ℓ ≤ 200. We conclude that currently reconstructed peculiar velocities have more constraining power than directly observed ones, even though they are more cosmological-model dependent.

79 ASTRONOMY AND ASTROPHYSICS↗

An adaptive Hessian approximated stochastic gradient MCMC method

Bayesian approaches have been successfully integrated into training deep neural networks. One popular family is stochastic gradient Markov chain Monte Carlo methods (SG-MCMC), which have gained increasing interest due to their ability to handle large datasets and the potential to avoid overfitting. Although standard SG-MCMC methods have shown great performance in a variety of problems, they may be inefficient when the random variables in the target posterior densities have scale differences or are highly correlated. Here, we present an adaptive Hessian approximated stochastic gradient MCMC method to incorporate local geometric information while sampling from the posterior. The idea is to apply stochastic approximation (SA) to sequentially update a preconditioning matrix at each iteration. The preconditioner possesses second-order information and can guide the random walk of a sampler efficiently. Instead of computing and saving the full Hessian of the log posterior, we use limited memory of the samples and their stochastic gradients to approximate the inverse Hessian-vector multiplication in the updating formula. Moreover, by smoothly optimizing the preconditioning matrix via SA, our proposed algorithm can asymptotically converge to the target distribution with a controllable bias under mild conditions. To reduce the training and testing computational burden, we adopt a magnitude-based weight pruning method to enforce the sparsity of the network. Our method is user-friendly and demonstrates better learning results compared to standard SG-MCMC updating rules. The approximation of inverse Hessian alleviates storage and computational complexities for large dimensional models. Numerical experiments are performed on several problems, including sampling from 2D correlated distribution, synthetic regression problems, and learning the numerical solutions of heterogeneous elliptic PDE. The numerical results demonstrate great improvement in both the convergence rate and accuracy.

97 MATHEMATICS AND COMPUTING↗

Numerical and Analytical Modeling of Flow Partitioning in Partially Saturated Fracture Networks

Infiltration processes in fractured-porous media remain a crucial, yet not very well understood component of recharge and vulnerability assessment. Under partially-saturated conditions flows in fractures, percolating fracture networks, and fault zones contribute to the fastest spectrum of infiltration velocities via preferential pathways. Specifically, the partitioning dynamics at fracture intersections determine the magnitude of flow fragmentation into vertical and horizontal components and hence the bulk flow velocity and dispersion of fracture networks. In this work, we derive an approximate analytical solution for the partitioning process and validate it using smoothed particle hydrodynamics simulations. The developed transfer function is conceptually based on simulation results and laboratory experiments carried out in previous works. It allows to efficiently simulate flow through fracture networks with simple cubic structure and arbitrary number of fractures and aperture sizes via linear response theory and convolution of a given input signal. We derive a non-dimensional bulk flow velocity ($\widetilde{v}$) and dispersion coefficient ($\widetilde{D}$) to characterize fracture networks in terms of dimensionless horizontal and vertical time scales $\tau_m$ and $\tau_0$. The dispersion coefficient is shown to strongly depend on the horizontal time scale and converges towards a constant value of $0.08$ within reasonable fluid and geometrical parameter ranges, while the non-dimensional velocity exhibits a characteristic $\widetilde{v} \sim \tau_m^{-1/2}$ scaling. Given that hydraulic information is often only available at limited places within (fractured-porous) aquifer system, such as boreholes or springs, our study intends to provide a rudimentary analytical concept to potentially reconstruct internal fracture network geometries from external boundary information, e.g., the dispersive properties of discharge (groundwater level fluctuations).

42 ENGINEERING↗

Bias-Variance Trade-Off in Physics-Informed Neural Networks with Randomized Smoothing for High-Dimensional PDEs

Physics-Informed Neural Networks (PINNs) have triggered a paradigm shift in scientific computing, leveraging mesh-free properties and robust approximation capabilities. While proving effective for low-dimensional partial differential equations (PDEs), the computational cost of PINNs remains a hurdle in high-dimensional scenarios. This is particularly pronounced when computing high-order and high-dimensional derivatives in the physics-informed loss. Randomized Smoothing PINN (RS-PINN) introduces Gaussian noise for stochastic smoothing of the original neural net model, enabling the use of Monte Carlo methods for derivative approximation, which eliminates the need for costly automatic differentiation. Despite its computational efficiency, especially in the approximation of high-dimensional derivatives, RS-PINN introduces biases in both loss and gradients, negatively impacting convergence, especially when coupled with stochastic gradient descent (SGD) algorithms. We present a comprehensive analysis of biases in RS-PINN, attributing them to the nonlinearity of the Mean Squared Error (MSE) loss as well as the intrinsic nonlinearity of the PDE itself. We propose tailored bias correction techniques, delineating their application based on the order of PDE nonlinearity. The derivation of an unbiased RS-PINN allows for a detailed examination of its advantages and disadvantages compared to the biased version. Specifically, the biased version has a lower variance and runs faster than the unbiased version, but it is less accurate due to the bias. To optimize the bias-variance trade-off, we combine the two approaches in a hybrid method that balances the rapid convergence of the biased version with the high accuracy of the unbiased version. In addition to methodological contributions, we present an enhanced implementation of RS-PINN. Extensive experiments on diverse high-dimensional PDEs, including Fokker-Planck, Hamilton-Jacobi-Bellman (HJB), viscous Burgers’, Allen-Cahn, and Sine-Gordon equations, illustrate the bias-variance trade-off and highlight the effectiveness of the hybrid RS-PINN. Empirical guidelines are provided for selecting biased, unbiased, or hybrid versions, depending on the dimensionality and nonlinearity of the specific PDE problem.

97 MATHEMATICS AND COMPUTING↗

On finite-dimensional smoothed-particle Hamiltonian reductions of the Vlasov equation

The inclusion of spatial smoothing in finite-dimensional particle-based Hamiltonian reductions of the Vlasov equation and related models is considered. Here, this work investigates the underlying Hamiltonian structure of such smoothed particle-based methods for Hamiltonian systems and the small-scale regularization such methods implicitly make in approximating the continuum theory. In the context of the Vlasov–Poisson equation and other mean-field Lie–Poisson systems, of which Vlasov–Poisson is a special case, smoothing amounts to a convolutive regularization of the Hamiltonian. This regularization may be interpreted as a change of the inner product structure used to identify the dual space in the Lie–Poisson Hamiltonian formulation. In particular, the shape function used for spatial smoothing may be identified as the kernel function of a reproducing kernel Hilbert space whose inner product is used to define the Lie–Poisson Hamiltonian structure. It is likewise possible to introduce smoothing in the Vlasov–Maxwell system, but in this case the Poisson bracket must be modified rather than the Hamiltonian. The smoothing applied to the Vlasov–Maxwell system is incorporated by inserting smoothing in the map from canonical to kinematic coordinates. In the filtered system, the Lorentz force law and the current, the two terms coupling the Vlasov equation with Maxwell’s equations, are spatially smoothed.

Hamiltonian mechanics↗