Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “APPROXIMATIONS”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

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

At least 1,081 records · Page 60

Nb3Sn Superconducting Radiofrequency Cavity Fabricated by Sputter Deposition from a Stoichiometric Target

Nb$_3$Sn is a promising coating material for superconducting radiofrequency cavities in next-generation accelerators due to its higher superconducting transition temperature (~18.3 K) and superheating field (~400 mT), offering the potential to surpass the intrinsic performance limits of bulk niobium. We developed a sputter coating technique employing a stoichiometric target to fabricate Nb$_3$Sn films on the inner surfaces of niobium cavities. A Nb$_3$Sn tube target, prepared by growing a >20 m thick Nb$_3$Sn coating on the surface of a Nb tube via a Sn vapor diffusion process, was used in a DC cylindrical magnetron sputtering system. Approximately 170 nm thick Nb-Sn films were sputter-coated onto flat Nb substrates positioned to replicate the beam tube and equator regions of a 2.6 GHz cavity, followed by annealing at 950 °C for 3 hours to form Nb$_3$Sn. The composition, morphology, and structure of the annealed Nb$_3$Sn films were examined. Then, a ~1.2 m-thick film was sputter-coated onto the interior of a 2.6 GHz Nb cavity following the procedure developed for the flat samples. The cavity was subsequently annealed under the same conditions used for the flat samples. Cryogenic RF testing of the sputter-coated cavity demonstrated a T$_c$ of approximately 17.8 K, consistent with Nb$_3$Sn layer. Subsequently, the cavity underwent a light Sn recoating followed by a vapor diffusion Nb$_3$Sn coating process, achieving a quality factor of approximately 8.5 × 10$^9$ and an accelerating gradient of up to 11.3 MV/m at 4.2 K.

Shakel, Md Sharifuzzaman [Old Dominion U.; Jeffers↗

Tank 11H Low Temperature Aluminum Dissolution and Inhalation Dose Potential Analyses at Savannah River Site – 26018

Currently, there is approximately 34 million gallons of high-level radioactive tank waste in the Tank Farm at the Savannah River Site (SRS). The ultimate goal of operations at the Tank Farm is to remove the high level waste (HLW) from the tanks followed by stabilization of the waste through vitrification of the HLW into glass or grouting the decontaminated waste into saltstone. After bulk removal of the HLW consisting of sludge, saltcake, and supernatant, further efforts are made to reduce the residual waste present in the tank in order to declare preliminary cease waste removal (PCWR) signifying completion of HLW removal. These reduction efforts can include tank washing to remove soluble salts and radioisotopes and dissolution of solids including aluminum. Aluminum in the form of gibbsite and boehmite is relatively insoluble in water. Through addition of aqueous sodium hydroxide, the aluminum can be dissolved at mild temperatures. In order for the waste tank to meet closure mode requirements of the Concentration, Storage, and Transfer Facilities (CSTF), which includes the Tank Farm, Documented Safety Analysis (DSA), a component of the safety basis, the inhalation dose potential (IDP) and the radiolytic hydrogen generation rate of the stored waste must be demonstrated to be lower than their respective designated limits. These parameters are calculated from measured radiochemical analyses of isotopes that emit a high amount of radioactivity including Cs-137, Sr-90, Pu-238, Pu-239, Pu-240, Pu-241, Am-241, and Cm-244. Following the low temperature aluminum dissolution (LTAD) process, Tank 11H slurry samples were pulled from the tank and sent to Savannah River National Laboratory (SRNL) to measure the extent of aluminum dissolution, hydroxide concentration, densities of slurry and supernatant, weight percent solids analyses, and radionuclide activities. The analyses of the composite sample found that approximately 90% of the total aluminum in the slurry was dissolved, indicating successful reduction of the insoluble aluminum in the waste tank. Additionally, the weight percent insoluble solids (slurry basis) measurement of the composite sample was found to be approximately 1%, demonstrating that minimal solids still remain in the tank. Finally, the radiochemical analyses of the composite sample determined that the waste contents of the tank met the IDP and radiolytic hydrogen generation rate requirements of the CSTF DSA. These measurements have shown that the LTAD process in Tank 11H was successful in waste reduction efforts and a positive step towards declaring PCWR and tank closure at SRS.

Dekarske, John [Savannah River National Laboratory↗

Fast All-sky Radiation Model for Solar applications (FARMS) 2023 [SWR-16-18]

The Fast All-sky Radiation Model for Solar applications (FARMS) is used to compute cloudy irradiance. Radiative transfer (RT) models simulating broadband solar radiation have been widely used by atmospheric scientists to model solar resources for various energy applications such as operational forecasting. Due to the complexity of solving the RT equation, the computation under cloudy conditions can be extremely time consuming though many approximations (e.g. two-stream approach and delta-M truncation scheme) have been utilized. Thus, a more efficient RT model is crucial for model developers as a new option for approximating solar radiation at the land surface with minimal loss of accuracy. We have developed a fast all-sky radiation model for solar applications (FARMS) using the simplified clear-sky RT model, REST2, and simulated cloud transmittances and reflectances from the Rapid Radiation Transfer Model (RRTM) with a sixteen-stream Discrete Ordinates Radiative Transfer (DISORT). Simulated lookup tables (LUTs) of cloud transmittances and reflectances were created by varying cloud optical thicknesses, cloud particle sizes, and solar zenith angles. Equations with optimized parameters were fitted to the cloud transmittances and reflectances to develop the model. Using this model the all-sky solar irradiance at the land surface can be computed rapidly by combining REST2 with the cloud transmittances and reflectances. This new RT model is more than 1000 times faster than those currently utilized in solar resource assessment and forecasting since it does not explicitly solve the RT equation for each individual cloud condition. Our results indicate the accuracy of the fast radiative transfer model is comparable to or better than two-stream approximation in term of computing cloud transmittance and solar radiation.

Xie, Yu↗

GenMod: A generative modeling approach for spectral representation of PDEs with random inputs

Here, we propose a method for quantifying uncertainty in high-dimensional PDE systems with random parameters, where the number of solution evaluations is small. Parametric PDE solutions are often approximated using a spectral decomposition based on polynomial chaos expansions. For the class of systems we consider (i.e., high dimensional with limited solution evaluations) the coefficients are given by an underdetermined linear system in a regression formulation. This implies additional assumptions, such as sparsity of the coefficient vector, are needed to approximate the solution. Here, we present an approach where we assume the coefficients are close to the range of a generative model that maps from a low to a high dimensional space of coefficients. Our approach is inspired be recent work examining how generative models can be used for compressed sensing in systems with random Gaussian measurement matrices. Using results from PDE theory on coefficient decay rates, we construct an explicit generative model that predicts the polynomial chaos coefficient magnitudes. The algorithm we developed to find the coefficients, which we call GenMod, is composed of two main steps. First, we predict the coefficient signs using Orthogonal Matching Pursuit. Then, we assume the coefficients are within a sparse deviation from the range of a sign-adjusted generative model. This allows us to find the coefficients by solving a nonconvex optimization problem, over the input space of the generative model and the space of sparse vectors. We obtain theoretical recovery results for a Lipschitz continuous generative model and for a more specific generative model, based on coefficient decay rate bounds. We examine three high-dimensional problems and show that, for all three examples, the generative model approach outperforms sparsity promoting methods at small sample sizes.

97 MATHEMATICS AND COMPUTING↗

TURBOMOLE: Modular program suite for ab initio quantum-chemical and condensed-matter simulations

TURBOMOLE is a collaborative, multi-national software development project aiming to provide highly efficient and stable computational tools for quantum chemical simulations of molecules, clusters, periodic systems, and solutions. The TURBOMOLE software suite is optimized for widely available, inexpensive, and resource-efficient hardware such as multi-core workstations and small computer clusters. TURBOMOLE specializes in electronic structure methods with outstanding accuracy–cost ratio, such as density functional theory including local hybrids and the random phase approximation (RPA), GW-Bethe–Salpeter methods, second-order Møller–Plesset theory, and explicitly correlated coupled-cluster methods. TURBOMOLE is based on Gaussian basis sets and has been pivotal for the development of many fast and low-scaling algorithms in the past three decades, such as integral-direct methods, fast multipole methods, the resolution-of-the-identity approximation, imaginary frequency integration, Laplace transform, and pair natural orbital methods. This review focuses on recent additions to TURBOMOLE’s functionality, including excited-state methods, RPA and Green’s function methods, relativistic approaches, high-order molecular properties, solvation effects, and periodic systems. A variety of illustrative applications along with accuracy and timing data are discussed. Moreover, available interfaces to users as well as other software are summarized. TURBOMOLE’s current licensing, distribution, and support model are discussed, and an overview of TURBOMOLE’s development workflow is provided. Challenges such as communication and outreach, software infrastructure, and funding are highlighted.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Transient behavior of drift and ionization in atmospheric pressure nitrogen discharge

The fluid models are frequently used to describe a non-thermal plasma such as a streamer discharge. The required electron transport data and rate coefficients for the fluid model are parametrized using the local field approximation (LFA) in first order models and the local-mean-energy approximation (LMEA) in second order models. We performed Monte Carlo simulations in Nitrogen gas with step changes in the E/N (reduced electric field) to study the behavior of the transport properties in the transient phase. During the transient phase of the simulation, we extract the instantaneous electron mean energy, which is different from the steady state mean electron energy, and the corresponding transport parameters and rate coefficients. Our results indicate that the mean electron energy is not a suitable parameter for mobility/drift of electrons due to big difference in momentum relaxation and energy relaxation. Furthermore, the high energy threshold rates such as ionization show a strong correlation to mean electron energy. In second order models where the energy-balance equation is solved, we suggest that it would rather be appropriate to use the local electric field to find electron drift velocity in gases such as Nitrogen and the local mean electron energy to determine the ionization and excitation rates.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Nonlinear dimension reduction for surrogate modeling using gradient information

We introduce a method for the nonlinear dimension reduction of a high-dimensional function $u:{\mathbb{R}}^d\rightarrow{\mathbb{R}}$, $d\gg 1$. Our objective is to identify a nonlinear feature map $g:{\mathbb{R}}^d\rightarrow{\mathbb{R}}^m$, with a prescribed intermediate dimension $m\ll d$, so that $u$ can be well approximated by $f\circ g$ for some profile function $f:{\mathbb{R}}^m\rightarrow{\mathbb{R}}$. We propose to build the feature map by aligning the Jacobian $\nabla g$ with the gradient $\nabla u$, and we theoretically analyze the properties of the resulting $g$. Once $g$ is built, we construct $f$ by solving a gradient-enhanced least squares problem. Our practical algorithm uses a sample $\{{\textbf{x}}^{(i)},u({\textbf{x}}^{(i)}),\nabla u({\textbf{x}}^{(i)})\}_{i=1}^N$ and builds both $g$ and $f$ on adaptive downward-closed polynomial spaces, using cross validation to avoid overfitting. We numerically evaluate the performance of our algorithm across different benchmarks, and explore the impact of the intermediate dimension $m$. We show that building a nonlinear feature map $g$ can permit more accurate approximation of $u$ than a linear $g$, for the same input data set.

97 MATHEMATICS AND COMPUTING↗

Improving the five-point bootstrap

We present a new algorithm for the numerical evaluation of five-point conformal blocks in d-dimensions, greatly improving the efficiency of their computation. To do this we use an appropriate ansatz for the blocks as a series expansion in radial coordinates, derive a set of recursion relations for the unknown coefficients in the ansatz, and evaluate the series using a Padé approximant to accelerate its convergence. We then study the 〈σσϵσσ〉 correlator in the 3d critical Ising model by truncating the operator product expansion (OPE) and only including operators with conformal dimension below a cutoff ∆ ⩽ ∆cutoff. We approximate the contributions of the operators above the cutoff by the corresponding contributions in a suitable disconnected five-point correlator. Using this approach, we compute a number of OPE coefficients with greater accuracy than previous methods.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Robust Implicit Adaptive Low Rank Time-Stepping Methods for Matrix Differential Equations

In this work, we develop implicit rank-adaptive schemes for time-dependent matrix differential equations. The dynamic low rank approximation (DLRA) is a well-known technique to capture the dynamic low rank structure based on Dirac–Frenkel time-dependent variational principle. In recent years, it has attracted a lot of attention due to its wide applicability. Our schemes are inspired by the three-step procedure used in the rank adaptive version of the unconventional robust integrator (the so called BUG integrator) (Ceruti et al. in BIT Numer Math 62(4):1149–1174, 2022) for DLRA. First, a prediction (basis update) step is made computing the approximate column and row spaces at the next time level. Second, a Galerkin evolution step is invoked using an implicit solves for the small core matrix. Finally, a truncation is made according to a prescribed error threshold. Since the DLRA is evolving the differential equation projected on to the tangent space of the low rank manifold, the error estimate of the BUG integrator contains the tangent projection (modeling) error which cannot be easily controlled by mesh refinement. This can cause convergence issue for equations with cross terms. To address this issue, we propose a simple modification, consisting of merging the row and column spaces from the explicit step truncation method together with the BUG spaces in the prediction step. In addition, we propose an adaptive strategy where the BUG spaces are only computed if the residual for the solution obtained from the prediction space by explicit step truncation method, is too large. Here, we prove stability and estimate the local truncation error of the schemes under assumptions. We benchmark the schemes in several tests, such as anisotropic diffusion, solid body rotation and the combination of the two, to show robust convergence properties.

97 MATHEMATICS AND COMPUTING↗

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↗

An optimization-based approach to parameter learning for fractional type nonlocal models

Nonlocal operators of fractional type are a popular modeling choice for applications that do not adhere to classical diffusive behavior; however, one major challenge in nonlocal simulations is the selection of model parameters. In this study we propose an optimization-based approach to parameter identification for fractional models with an optional truncation radius. We formulate the inference problem as an optimal control problem where the objective is to minimize the discrepancy between observed data and an approximate solution of the model, and the control variables are the fractional order and the truncation length. For the numerical solution of the minimization problem we propose a gradient-based approach, where we enhance the numerical performance by an approximation of the bilinear form of the state equation and its derivative with respect to the fractional order. Several numerical tests in one and two dimensions illustrate the theoretical results and show the robustness and applicability of our method.

97 MATHEMATICS AND COMPUTING↗

Hydro-chemo-mechanical phase field formulation for corrosion induced cracking in reinforced concrete

Steel corrosion induced cracking in reinforced concrete structures is often caused by volumetric straining at the steel-concrete interface. This volumetric strain is mainly controlled by the rate of generation of corrosion product, which depends on the diffusion of Cl{sup −} and dissolved O{sub 2} as well as the chemical reaction at the steel-concrete interface. While many numerical modeling techniques have been proposed to tackle this complex phenomenon, most have been limited to using staggered solution schemes, where the diffusion, chemical reaction, mechanical strain, and crack fields are solved for separately. Unfortunately, such approaches introduce numerical errors that can lead to unrealistic predictions. Therefore, a coupled solution, is needed to remove the formulation induced errors and understand this complex phenomenon. To provide a unifying solution framework for corrosion induced cracking in reinforced concrete, a phase field formulation is presented and implemented with FEM algorithms. The governing equations are derived from the system's free energy and Fick's law of diffusion. The proposed formulation was first validated in 1D by comparing the modeling results with the semi-analytical solution approximated via Laurent series to avoid singularities in the complex domain. 2D plane strain solutions to the embedded rebar undergoing corrosion induced cracking with pre-cracks are also presented and compared with the approximated solutions from linear elastic fracture mechanics theory (LEFM). The modeling of crack propagation enabled by the proposed formulation is also presented along with parametric studies to reveal the roles of the fracture toughness and permeability of the concrete on the corrosion induced cracking. A case study was also conducted on H-pile steel with concrete jackets to demonstrate the feasibility of modeling corrosion induced fracture in reinforced concrete structures with complex steel-concrete interfaces.

36 MATERIALS SCIENCE↗

Scalable Bayesian optimization with randomized prior networks

Several fundamental problems in science and engineering consist of global optimization tasks involving unknown high-dimensional (black-box) functions that map a set of controllable variables to the outcomes of an expensive experiment. Bayesian Optimization (BO) techniques are known to be effective in tackling global optimization problems using a relatively small number objective function evaluations, but their performance suffers when dealing with high-dimensional outputs. To overcome the major challenge of dimensionality, here we propose a deep learning framework for BO and sequential decision making based on bootstrapped ensembles of neural architectures with randomized priors. Using appropriate architecture choices, we show that the proposed framework can approximate functional relationships between design variables and quantities of interest, even in cases where the latter take values in high-dimensional vector spaces or even infinite-dimensional function spaces. In the context of BO, we augmented the proposed probabilistic surrogates with re-parameterized Monte Carlo approximations of multiple-point (parallel) acquisition functions, as well as methodological extensions for accommodating black-box constraints and multi-fidelity information sources. We test the proposed framework against state-of-the-art methods for BO and demonstrate superior performance across several challenging tasks with high-dimensional outputs, including a constrained multi-fidelity optimization task involving shape optimization of rotor blades in turbo-machinery.

97 MATHEMATICS AND COMPUTING↗

Online randomized interpolative decomposition with a posteriori error estimator for temporal PDE data reduction

Traditional low-rank approximation is a powerful tool for compressing large data matrices that arise in simulations of partial differential equations (PDEs), but suffers from high computational cost and requires several passes over the PDE data. The compressed data may also lack interpretability thus making it difficult to identify feature patterns from the original data. Here, to address these issues, we present an online randomized algorithm to compute the interpolative decomposition (ID) of large-scale data matrices in situ. Compared to previous randomized IDs that used the QR decomposition to determine the column basis, we adopt a streaming ridge leverage score-based column subset selection algorithm that dynamically selects proper basis columns from the data and thus avoids an extra pass over the data to compute the coefficient matrix of the ID. In particular, we adopt a single-pass error estimator based on the non-adaptive Hutch++ algorithm to provide real-time error approximation for determining the best coefficients. As a result, our approach only needs a single pass over the original data and thus is suitable for large and high-dimensional matrices stored outside of core memory or generated in PDE simulations. A strategy to improve the accuracy of the reconstructed data gradient, when desired, within the ID framework is also presented. We provide numerical experiments on turbulent channel flow and ignition simulations, and on the NSTX Gas Puff Image dataset, comparing our algorithm with the offline ID algorithm to demonstrate its utility in real-world applications.

Column subset selection↗

From zonal to nodal capacity expansion planning: Spatial aggregation impacts on a realistic test-case

Solving power system capacity expansion planning (CEP) problems at realistic spatial resolutions is computationally challenging. Thus, a common practice is to solve CEP over zonal models with low spatial resolution rather than over full-scale nodal power networks. Due to improvements in solving large-scale stochastic mixed integer programs, these computational limitations are becoming less relevant, and the assumption that zonal models are realistic and useful approximations of nodal CEP is worth revisiting. Here, this work is the first to conduct a systematic computational study on the assumption that spatial aggregation can reasonably be used for ISO-scale CEP. By considering a realistic, large-scale test network based on the state of California with over 8000 buses, we find that well-designed small spatial aggregations can yield good approximations but that coarser zonal models may result in large distortions of investment decisions, e.g., capacity under-investment of up to 41% for the lowest resolution model considered.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Accelerating eigenvalue computation for nuclear structure calculations via perturbative corrections

Subspace projection methods utilizing perturbative corrections have been proposed for computing the lowest few eigenvalues and corresponding eigenvectors of large Hamiltonian matrices. In this paper, we build upon these methods and introduce the term Subspace Projection with Perturbative Corrections (SPPC) method to refer to this approach. We tailor the SPPC for nuclear many-body Hamiltonians represented in a truncated configuration interaction subspace, i.e., the no-core shell model (NCSM). We use the hierarchical structure of the NCSM Hamiltonian to partition the Hamiltonian as the sum of two matrices. The first matrix corresponds to the Hamiltonian represented in a small configuration space, whereas the second is viewed as the perturbation to the first matrix. Eigenvalues and eigenvectors of the first matrix can be computed efficiently. Because of the split, perturbative corrections to the eigenvectors of the first matrix can be obtained efficiently from the solutions of a sequence of linear systems of equations defined in the small configuration space. These correction vectors can be combined with the approximate eigenvectors of the first matrix to construct a subspace from which more accurate approximations of the desired eigenpairs can be obtained. We show by numerical examples that the SPPC method can be more efficient than conventional iterative methods for solving large-scale eigenvalue problems such as the Lanczos, block Lanczos and the locally optimal block preconditioned conjugate gradient (LOBPCG) method. The method can also be combined with other methods to avoid convergence stagnation.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Asymptotic-preserving dynamical low-rank method for the stiff nonlinear Boltzmann equation

In kinetic theory, numerically solving the full Boltzmann equation is extremely expensive. This is because the Boltzmann collision operator involves a high-dimensional, nonlinear integral that must be evaluated at each spatial grid point and every time step. The challenge becomes even more pronounced in the fluid (strong collisionality) regime, where the collision operator exhibits strong stiffness, causing explicit time integrators to impose severe stability restrictions. In this paper, we propose addressing this problem through a dynamical low-rank (DLR) approximation. The resulting algorithm requires evaluating the Boltzmann collision operator only r 2 times, where r, the rank of the approximation, is much smaller than the number of spatial grid points. We propose a novel DLR integrator, called the XL integrator, which reduces the number of steps compared to the available alternatives (such as the projector splitting or basis update & Galerkin (BUG) integrator). For a class of problems including the Boltzmann collision operator which enjoys a separation property between physical and velocity space, we further propose a specialized version of the XL integrator, called the sXL integrator. This version requires solving only one differential equation to update the low-rank factors. Furthermore, the proposed low-rank schemes are asymptotic-preserving, meaning they can capture the asymptotic fluid limit in the case of strong collisionality. Our numerical experiments demonstrate the efficiency and accuracy of the proposed methods across a wide range of regimes, from non-stiff (kinetic) to stiff (fluid).

97 MATHEMATICS AND COMPUTING↗

Fast permeability measurement for tight reservoir cores using only initial data of the one chamber pressure pulse decay test

Here, in this study, a mathematical model for fast determination of the permeabilities of tight rocks using measurements taken from the initial period of the One Chamber Pressure Pulse Decay (OC-PPD) test is presented. The model applies to measurements taken both before and after the pressure pulse front has reached the downstream end of the specimen. The analytical solutions for the pressure decay in the upstream chamber are derived based on a parabolic arc approximation of pore pressure distribution along the test specimen. This approximation allows converting the initial–boundary value problem of fluid diffusion in the specimen, governed by partial differential equations, to a system of ordinary differential equations that can be easily solved by explicit formulae. Thus, an explicit formula for the pressure decay rate is obtained, which enables inverse analysis of the initial experimental data to estimate the rock permeability. The proposed method expedites the pulse decay test as it does not require the system to reach equilibrium. The method is validated with three sets of experimental data of the OC-PPD test using helium as the diffusing fluid, for which the relative error of the permeability is found to be less than 6%. This method is particularly useful if the equilibrium time of the pulse decay test for rock specimens with permeabilities in the range of nano-Darcy takes hours or days.

early-time solution↗