Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Smoothing methods”

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 199 records · Page 11

High precision control of laser energy for laser–matter interaction studies

Precise, highly reproducible control of the laser energy is required for high confidence laser–matter interaction research such as in dynamic compression science and high energy density physics. The energy must be adjustable without affecting the pulse shape (time varying intensity) or beam smoothness. We have developed a convenient two-stage energy tuning method for a nominal 100 J, 351 nm (UV) laser. The energy is adjusted in 10 J (10%) increments by operating the laser at full energy and inserting a beam splitter in the laser output. As the splitter is located after the final frequency tripling optics, the UV pulse shape is unchanged. The energy is varied by substituting a splitter of different reflectivity. For finer 3 J (3%) increments, the infrared pulse is attenuated inside the laser before the final amplifier. This requires modest tuning to preserve the pulse shape. The demonstrated variation in shot-to-shot reproducibility is less than +/–2.5 J (5% of the full energy), irrespective of the laser output energy. These approaches can be adapted to most ~100 J class lasers. We describe these techniques and show two examples where they have elucidated the underlying physics in laser shock compression experiments. One used only the beam splitters to establish the pressure for melting in iron. The other combined both techniques to finely increment the peak stress (~2 GPa steps) in germanium to precisely determine the onset and completion of melting—including the melting kinetics. Furthermore, these unambiguous results would not be possible without the developments described here.

47 OTHER INSTRUMENTATION↗

A General Spatiotemporal Imputation Framework for Missing Sensor Data

Many applications from precision agriculture, environmental monitoring and transportation networks rely on data collected across space and time over a large geographic area. Missing data poses a significant challenge for any data-driven inference and control tasks. Data imputation or the estimation of missing data can help fill these gaps by utilizing inherent spatial relationships and temporal patterns. A variety of spatiotemporal imputation models have been developed to address missing data in spatiotemporal datasets. However, these classical methods rely on the assumption that the underlying data follows a smooth trend and fail to provide accurate estimates when there is a large number of missing points in the data. Even though there are machine learning driven tensor completion approaches such as convolutional neural network based tensor completion (CoSTCo) that capture the non-linear relationships in the dataset, the transductive nature makes the algorithm less scalable. Thus, existing approaches for estimating the missing information do not effectively capture all dimensions of the spatiotemporal data structure, resulting in erroneous predictions and poor performance. The main contributions of this paper are: (1) We propose a novel inductive framework (G-LSTM) for missing data imputation that integrates a graph neural network with LSTMs to effectively capture both spatial and temporal dependencies. (2) Experimental results on a traffic dataset demonstrate that the proposed GNN integrated with an LSTM framework achieves improved imputation and maintains steady performance even when there are extreme missing conditions in comparison with the state-of-the-art imputation framework (i.e, CoSTCo). (3) The simulation results on a traffic network show up to 69% reduction in mean absolute error and 61% reduction in root mean square error when compared to CoSTCo.

Tharzeen, Aabila↗

The Squeezed Bispectrum from CHIME H I Emission and Planck Cosmic Microwave Background Lensing: Current Sensitivity and Forecasts

Line intensity mapping using atomic hydrogen (H I) has the potential to efficiently map large volumes of the Universe if the signal can be successfully separated from overwhelmingly bright radio foreground emission. This motivates cross correlations, to ascertain the cosmological nature of measured H I fluctuations, and to study their connections with galaxies and the underlying matter density field. However, these same foregrounds render the cross correlation with projected fields such as the lensing of the cosmic microwave background (CMB) difficult. Indeed, the correlated Fourier modes vary slowly along the line of sight and are thus most contaminated by the smooth-spectrum radio continuum foregrounds. In this paper, we implement a method that avoids this issue by attempting to measure the nonlinear gravitational coupling of the small-scale 21 cm power from the Canadian Hydrogen Intensity Mapping Experiment (CHIME) with large-scale Planck CMB lensing. This measurement is a position-dependent power spectrum, i.e., a squeezed integrated bispectrum. Using 94 nights of CHIME data between 1.0 < z < 1.3 and aggressive foreground filtering, we find that the expected signal is 5 times smaller than the current noise. We forecast that incorporating the additional nights of CHIME data already collected would enable a signal-to-noise ratio of 3, without any further improvements in filtering for foreground cleaning.

21cm↗

Matrix-free subcell residual distribution for Bernstein finite elements: Monolithic limiting

This paper is focused on the aspects of limiting in residual distribution (RD) schemes for high-order finite element approximations to advection problems. Both continuous and discontinuous Galerkin methods are considered in this work. Discrete maximum principles are enforced using algebraic manipulations of element contributions to the global nonlinear system. The required modifications can be carried out without calculating the element matrices and assembling their global counterparts. The components of element vectors associated with the standard Galerkin discretization are manipulated directly using localized subcell weights to achieve optimal accuracy. Low-order nonlinear RD schemes of this kind were originally developed to calculate local extremum diminishing predictors for flux-corrected transport (FCT) algorithms. In the present paper, we incorporate limiters directly into the residual distribution procedure, which makes it applicable to stationary problems and leads to well-posed nonlinear discrete problems. To circumvent the second-order accuracy barrier, the correction factors of monolithic limiting approaches and FCT schemes are adjusted using smoothness sensors based on second derivatives. Finally, the convergence behavior of presented methods is illustrated by numerical studies for two-dimensional test problems.

97 MATHEMATICS AND COMPUTING↗

Simulating magnetized neutron stars with discontinuous Galerkin methods

Discontinuous Galerkin methods are popular because they can achieve high order where the solution is smooth, because they can capture shocks while needing only nearest-neighbor communication, and because they are relatively easy to formulate on complex meshes. We perform a detailed comparison of various limiting strategies presented in the literature applied to the equations of general relativistic magnetohydrodynamics. We compare the standard minmod /ΛΠ N limiter, the hierarchical limiter of Krivodonova, the simple WENO limiter, the HWENO limiter, and a discontinuous Galerkin-finite-difference hybrid method. The ultimate goal is to understand what limiting strategies are able to robustly simulate magnetized Tolman-Oppenheimer-Volkoff stars without any fine-tuning of parameters. Among the limiters explored in the paper, the only limiting strategy we can endorse is a discontinuous Galerkin-finite-difference hybrid method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A short note on the accuracy of the discontinuous Galerkin method with reentrant faces

In this work, we study the convergence of the discontinuous Galerkin (DG) method applied to the advection–reaction equation on meshes with reentrant faces. On such meshes, the upwind numerical flux is not smooth, and so the numerical integration of the resulting face terms can only be expected to be first-order accurate. Despite this inexact integration, we prove that the DG method converges with order $\mathscr{O}$(h p+1/2 ), which is the same rate as in the case of exact integration. Consequently, specialized quadrature rules that accurately integrate the non-smooth numerical fluxes are not required for high-order accuracy. These results are numerically corroborated on examples of linear advection and discrete ordinates transport equations.

97 MATHEMATICS AND COMPUTING↗

Deep kernel methods learn better: from cards to process optimization

Abstract The ability of deep learning methods to perform classification and regression tasks relies heavily on their capacity to uncover manifolds in high-dimensional data spaces and project them into low-dimensional representation spaces. In this study, we investigate the structure and character of the manifolds generated by classical variational autoencoder (VAE) approaches and deep kernel learning (DKL). In the former case, the structure of the latent space is determined by the properties of the input data alone, while in the latter, the latent manifold forms as a result of an active learning process that balances the data distribution and target functionalities. We show that DKL with active learning can produce a more compact and smooth latent space which is more conducive to optimization compared to previously reported methods, such as the VAE. We demonstrate this behavior using a simple cards dataset and extend it to the optimization of domain-generated trajectories in physical systems. Our findings suggest that latent manifolds constructed through active learning have a more beneficial structure for optimization problems, especially in feature-rich target-poor scenarios that are common in domain sciences, such as materials synthesis, energy storage, and molecular discovery. The Jupyter Notebooks that encapsulate the complete analysis accompany the article.

97 MATHEMATICS AND COMPUTING↗

First Experimental Test of the Ratio Method

The ratio is a new reaction observable suggested to extract accurately structure information on halo nuclei. It corresponds to the ratio of differential cross sections for scattering and breakup, which is predicted to remove the uncertainty related to the reaction dynamics. We present here the first experimental test of the method for the 11 Be + 12 C collision at E Lab = 20A MeV performed at Texas A&M University. Differential cross sections for scattering and inclusive one-neutron breakup have been measured with the new detector array BlueSTEAl. The ratio of cross sections is very smooth and independent of the projectile-target interaction, which demonstrates the validity of the ratio method. We extend our analysis to existing 11 Be + 208 Pb data, confirming that the method works well on any target.

11Be↗

A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective

An optimization algorithm for nonsmooth nonconvex constrained optimization problems with upper- \({\boldsymbol{\mathcal{C}^2}}\) objective functions is proposed and analyzed. Upper- \({\boldsymbol{\mathcal{C}^2}}\) is a weakly concave property that exists in difference of convex (DC) functions and arises naturally in many applications, particularly certain classes of solutions to parametric optimization problems e.g., recourse of stochastic programming and projection onto closed sets. The algorithm can be viewed as an extension of sequential quadratic programming (SQP) to nonsmooth problems with upper- \({\boldsymbol{\mathcal{C}^2}}\) objectives or a simplified bundle method. It is globally convergent with bounded algorithm parameters that are updated with a trust-region criterion. The algorithm handles general smooth constraints through linearization and uses a line search to ensure progress. The potential inconsistencies from the linearization of the constraints are addressed through a penalty method. In conclusion, the capabilities of the algorithm are demonstrated by solving both simple upper- \({\boldsymbol{\mathcal{C}^2}}\) problems and a real-world optimal power flow problem used in current power grid industry practices.

97 MATHEMATICS AND COMPUTING↗

Derivative-free stochastic optimization via adaptive sampling strategies

In this paper, we present a novel derivative-free framework for solving unconstrained stochastic optimization problems. Many problems in fields ranging from simulation optimization to reinforcement learning to quantum computing involve settings where only stochastic function values are obtained via a zeroth-order oracle, which has no available gradient information and necessitates the usage of derivative-free optimization methodologies. Our approach includes estimating gradients using stochastic function evaluations and integrating adaptive sampling techniques to control the accuracy in these stochastic approximations. Our framework encapsulates several gradient estimation techniques, including standard finite-difference, Gaussian smoothing, sphere smoothing, randomized coordinate finite-difference, and randomized subspace finite-difference methods. We provide theoretical convergence guarantees for our framework and analyze the worst-case iteration and sample complexities associated with each gradient estimation method. Finally, we demonstrate the empirical performance of the methods on logistic regression and nonlinear least squares problems.

Adaptive sampling↗

A log-barrier Newton-CG method for bound constrained optimization with complexity guarantees

Abstract We describe an algorithm based on a logarithmic barrier function, Newton’s method and linear conjugate gradients that seeks an approximate minimizer of a smooth function over the non-negative orthant. We develop a bound on the complexity of the approach, stated in terms of the required accuracy and the cost of a single gradient evaluation of the objective function and/or a matrix-vector multiplication involving the Hessian of the objective. The approach can be implemented without explicit calculation or storage of the Hessian.

O’Neill, Michael↗

Time-Domain Extreme-Ultraviolet Diffuse Scattering Spectroscopy of Nanoscale Surface Phonons

Here, we report the observation of dynamic fringe patterns in the diffuse scattering of extreme ultraviolet light from surfaces, following femtosecond optical excitation. At each point on the detector, the diffuse scattering intensity exhibits oscillations at well-defined frequencies that correspond to surface phonons with wave vectors determined by the scattering geometry, indicating that the optical excitation generates coherent surface phonons propagating in all directions and spanning a wavelength range from 60 to 300 nm. This phenomenon is observed on a variety of samples, including single-layer and multilayer metal films, as well as bulk semiconductors. The measured surface phonon dispersions show good agreement with theoretical calculations. By comparing signal amplitudes from samples with different surface morphologies, we find that the excitation mechanism is linked to the natural surface roughness of the samples. However, the signal is still detectable on extremely smooth surfaces with subnanometer roughness. Our findings demonstrate a simple and effective method for optically exciting coherent surface phonons with nanoscale wavelengths on a wide range of solid samples and establish a foundation for surface phonon spectroscopy in a wave vector range well beyond the limit of conventional surface Brillouin scattering.

Capotondi, F. [Elettra-Sincrotrone Trieste (Italy)↗

Velocity reconstruction in the era of DESI and Rubin/LSST. I. Exploring spectroscopic, photometric, and hybrid samples

Peculiar velocities of galaxies and halos can be reconstructed from their spatial distribution alone. This technique is analogous to the baryon acoustic oscillations reconstruction, using the continuity equation to connect density and velocity fields. The resulting reconstructed velocities can be used to measure imprints of galaxy velocities on the cosmic microwave background like the kinematic Sunyaev-Zel’dovich effect or the moving lens effect. As the precision of these measurements increases, characterizing the performance of the velocity reconstruction becomes crucial to allow unbiased and statistically optimal inference. In this paper, we quantify the relevant performance metrics: the variance of the reconstructed velocities and their correlation coefficient with the true velocities. We show that the relevant velocities to reconstruct for kSZ and moving lens are actually the halo—rather than galaxy—velocities. We quantify the impact of redshift-space distortions, photometric redshift errors, satellite galaxy fraction, incorrect cosmological parameter assumptions and smoothing scale on the reconstruction performance. Here, we also investigate hybrid reconstruction methods, where velocities inferred from spectroscopic samples are evaluated at the positions of denser photometric samples. We find that using exclusively the photometric sample is better than performing a hybrid analysis. The 2 Gpc/ℎ length simulations from abacussummit with realistic galaxy samples for DESI and Rubin LSST allow us to perform this analysis in a controlled setting. In the companion paper [B. Hadzhiyska, S. Ferraro, B. Ried Guachalla, and E. Schaan, companion paper, Phys. Rev. D 109, 103534 (2024).], we further include the effects of evolution along the light cone and give realistic performance estimates for DESI luminous red galaxies, emission line galaxies, and Rubin LSST-like samples.

79 ASTRONOMY AND ASTROPHYSICS↗

High-Field Ignition-Capable Stellarator i-ASTER: Initial Structural Evaluation

i-ASTER is a preliminary conceptual design of a high-field pulsed experimental stellarator aimed essentially at achieving and understanding plasma ignition. The averaged magnetic field on the axis of i-ASTER.v1 is B ~ 10 T and the plasma volume is 30 m 3 . A toroidal monolithic support structure, which is located externally to the modular coils, is defined to accurately arrange the coils and withstand the magnetic Lorentz forces from the high magnetic fields. The magnetic field in the coils and the resulting Lorentz forces on the coils were calculated and utilized for the stress calculation in monolithic support of constant thickness. Subsequently, a monolithic support of variable thickness is proposed and studied. The thickness of the structure is variable and adjusted to the magnitude of the mechanical stress in each area of the toroidal structure so as to smooth the stresses while minimizing the quantity of material used. A fabrication method for the monolithic structure has been tested. For that, a scaled-down mock-up of one period of stellarator has been additively manufactured and strengthened with fiber-reinforced resin. Unsurmountable difficulties have not been found for this fabrication method.

Queral, Vicente↗

Forward variable selection enables fast and accurate dynamic system identification with Karhunen-Loève decomposed Gaussian processes

A promising approach for scalable Gaussian processes (GPs) is the Karhunen-Loève (KL) decomposition, in which the GP kernel is represented by a set of basis functions which are the eigenfunctions of the kernel operator. Such decomposed kernels have the potential to be very fast, and do not depend on the selection of a reduced set of inducing points. However KL decompositions lead to high dimensionality, and variable selection thus becomes paramount. This paper reports a new method of forward variable selection, enabled by the ordered nature of the basis functions in the KL expansion of the Bayesian Smoothing Spline ANOVA kernel (BSS-ANOVA), coupled with fast Gibbs sampling in a fully Bayesian approach. It quickly and effectively limits the number of terms, yielding a method with competitive accuracies, training and inference times for tabular datasets of low feature set dimensionality. Theoretical computational complexities are O ( N P 2 ) in training and O ( P ) per point in inference, where N is the number of instances and P the number of expansion terms. The inference speed and accuracy makes the method especially useful for dynamic systems identification, by modeling the dynamics in the tangent space as a static problem, then integrating the learned dynamics using a high-order scheme. The methods are demonstrated on two dynamic datasets: a ‘Susceptible, Infected, Recovered’ (SIR) toy problem, along with the experimental ‘Cascaded Tanks’ benchmark dataset. Comparisons on the static prediction of time derivatives are made with a random forest (RF), a residual neural network (ResNet), and the Orthogonal Additive Kernel (OAK) inducing points scalable GP, while for the timeseries prediction comparisons are made with LSTM and GRU recurrent neural networks (RNNs) along with the SINDy package.

Hayes, Kyle↗

Two-Step Synthesis of Poly (urea formaldehyde) Microcapsules

Self-healing coatings have potential to reduce waste and minimize repair costs in industries where materials need to be protected from harsh environmental conditions and mechanical abrasion. These coatings can be created by embedding healing-agent filled microcapsules which release their contents and fill voids in the event of damage. To synthesize microcapsules that are ideal for self-healing coatings, they must have a diameter less than 100 microns, smooth surface morphology, and have improved dispersibility. Our current one-step method does not produce microcapsules within the desired size distribution, so a two-step route where oligomers of the shell wall material are formed prior to microcapsule formation was investigated. This was done by evaluating the effects of solution viscosity, size of reaction vessel, addition of poly (vinyl alcohol) (PVA), and core/shell ratio on microcapsule properties. Characterization of microcapsule size, morphology, and composition was done using optical microscopy, Fourier-transform infrared spectroscopy (FTIR), and thermogravimetric analysis (TGA). Microcapsules with an average diameter of 78 ± 16 microns were successfully synthesized. Further work must be done to minimize PUF crystallites on the surface of the microcapsules.

36 MATERIALS SCIENCE↗

Comparative Analysis of TRGBs (CATs) from Unsupervised, Multi-halo-field Measurements: Contrast is Key

The tip of the red giant branch (TRGB) is an apparent discontinuity of the luminosity function (LF) due to the end of the red giant evolutionary phase and is used to measure distances in the local universe. In practice, tip localization via edge detection response (EDR) relies on several methods applied on a case-by-case basis. It is hard to evaluate how individual choices affect a distance estimation using only a single host field while also avoiding confirmation bias. To devise a standardized approach, we compare unsupervised, algorithmic analyses of the TRGB in multiple halo fields per galaxy. We first optimize methods for the lowest field-to-field dispersion, including spatial filtering, smoothing, and weighting of LF, color band selection, and tip selection based on the number of likely RGB stars and the ratio of stars below versus above the tip (R). We find R, which we call the tip contrast, to be the most important indicator of the quality of EDR measurements; higher R selection can decrease field-to-field dispersion. Further, since R is found to correlate with the age or metallicity of the stellar population based on theoretical modeling, it might result in a displacement of the detected tip magnitude. We find a tip-contrast relation with a slope of -0.023 ± 0.0046 mag/ratio, an ~5σ result that can be used to correct these variations in the detections. When using TRGB to establish a distance ladder, consistent TRGB standardization using tip-contrast relation across rungs is vital to make robust cosmological measurements.

79 ASTRONOMY AND ASTROPHYSICS↗