Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Numerical 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 163 records · Page 9

Spherical Parameter Estimation and MPDV Applications

A new algebraic least square approach is presented for estimating effective zero center for verification of MPDV(Multichannel Photon Doppler Velocimetry) probe designs. Unlike previous algebraic least square methods for spherical parameter estimation, the new method can be shown to be concise in mathematic formulations, easy of computations, invariant under rigid -body transformations, no need for numerical approximations, and precise in dealing with precise data.

97 MATHEMATICS AND COMPUTING↗

Domain Adaptive Graph Neural Networks for Constraining Cosmological Parameters Across Multiple Data Sets

Deep learning models have been shown to outperform methods that rely on summary statistics, like the power spectrum, in extracting information from complex cosmological data sets. However, due to differences in the subgrid physics implementation and numerical approximations across different simulation suites, models trained on data from one cosmological simulation show a drop in performance when tested on another. Similarly, models trained on any of the simulations would also likely experience a drop in performance when applied to observational data. Training on data from two different suites of the CAMELS hydrodynamic cosmological simulations, we examine the generalization capabilities of Domain Adaptive Graph Neural Networks (DA-GNNs). By utilizing GNNs, we capitalize on their capacity to capture structured scale-free cosmological information from galaxy distributions. Moreover, by including unsupervised domain adaptation via Maximum Mean Discrepancy (MMD), we enable our models to extract domain-invariant features. We demonstrate that DA-GNN achieves higher accuracy and robustness on cross-dataset tasks (up to $28\%$ better relative error and up to almost an order of magnitude better $\chi^2$). Using data visualizations, we show the effects of domain adaptation on proper latent space data alignment. This shows that DA-GNNs are a promising method for extracting domain-independent cosmological information, a vital step toward robust deep learning for real cosmic survey data.

79 ASTRONOMY AND ASTROPHYSICS↗

Domain Adaptive Graph Neural Networks for Constraining Cosmological Parameters Across Multiple Data Sets

State of the art astronomical simulations have provided datasets which enabled the training of novel deep learning techniques for constraining cosmological parameters. However, differences in subgrid physics implementation and numerical approximations among simulation suites lead to differences in simulated datasets, which pose a hard challenge when trying to generalize across diverse data domains and ultimately when applying models to observational data. Recent work reveals deep learning algorithms are able to extract more information from complex cosmological simulations than summary statistics like power spectra. We introduce Domain Adaptive Graph Neural Networks (DA-GNNs), trained on CAMELS data, inspired by CosmoGraphNet (Villanueva-Domingo et al 2023). By utilizing GNNs, we can capitalize on their capacity to capture both astrophysical and topological features of galaxy distributions. Mixing these capabilities with domain adaptation techniques such as Maximum Mean Discrepancy (MMD), which enable extraction of domain-invariant features, our framework demonstrates enhanced accuracy and robustness. We present experimental results, including the alignment of distributions across domains through data visualization. These findings suggest that DA-GNNs are an efficient way of extracting domain independent cosmological information, a vital step toward robust deep learning for real cosmic survey data.

79 ASTRONOMY AND ASTROPHYSICS↗

Radiative transfer in highly scattering materials - numerical solution and evaluation of approximate analytic solutions

Numerical solutions for radiative transport in a class of anisotropically scattering materials are presented. Conditions for convergence and divergence of the iterative method are given and supported by computed results. The relation of two flux theories to the equation of radiative transfer for isotropic scattering is discussed. The adequacy of the two flux approach for the reflectance, radiative flux and radiative flux divergence of highly scattering media is evaluated with respect to solutions of the radiative transfer equation.

Weston, K. C.↗

Comparison of an analytical approximation for particle motion in a current sheet with precise numerical calculations

Approximate analytic solutions exist for particle motion in a one-dimensional current sheet with a constant normal magnetic field component. These solutions are tested against precise numerical calculations, and a range of validity of the analytic solutions is inferred. For example, in the geomagnetic tail neutral sheet, for a dawn-dusk electric field of 0.1-1 mV/m, lobe field of 10-40 nT, and sheet thickness of 1000 km, the analytic solutions serve as a good predictor of particle motion when the normal magnetic field component is less than 3 or 4 nT. By using the analytic solutions, initial distribution functions are mapped into final (accelerated) distributions, and the analytic mappings are compared with numerical mappings.

Speiser, T. W.↗

Approximation concepts for numerical airfoil optimization

An efficient algorithm for airfoil optimization is presented. The algorithm utilizes approximation concepts to reduce the number of aerodynamic analyses required to reach the optimum design. Examples are presented and compared with previous results. Optimization efficiency improvements of more than a factor of 2 are demonstrated. Improvements in efficiency are demonstrated when analysis data obtained in previous designs are utilized. The method is a general optimization procedure and is not limited to this application. The method is intended for application to a wide range of engineering design problems.

Vanderplaats, G. N.↗

Combined strength and aeroelastic wing synthesis via constraint approximation

A numerical optimization program using constraint approximations for preliminary sizing of wing structural design parameters to satisfy simultaneous strength and aeroelastic requirements is described. The effects of wing flexibility on loads and flutter are included. The iterative procedure approximates wing internal load distributions and flutter response in generating design constraints. Though a linear Taylor series approximation to the variation of flutter speed is made, constraints in general are formulated as nonlinear and solved in a minimum weight problem using a feasible directions search. The technique is demonstrated for the determination of the optimal ply orientations and for simultaneous sizing for strength and flutter with simple constraint approximations.

Mullen, J., Jr.↗

Approximate and exact numerical computation of supersonic flow over an airfoil

The computation of inviscid supersonic flow over a two-dimensional airfoil is considered. There are two main nonlinear approaches which lead to approximate solutions. Small-amplitude theory gives valid solutions provided the airfoil thickness is not too great and the Mach number is not too high. The second type of approximation, shock expansion theory, employs the fact that even for flows with strong shocks the effect of the down-running characteristics remains small. This leads to an analytic solution at the airfoil. It is pointed out that the approximate solution is accurate enough for many cases of interest. The numerical method furnishes a rapid correction to the solution in those cases where it is not. The characteristic-streamline coordinate system is useful both for the computation of the approximate solution and the corrections, and is also convenient for displaying and interpreting the results.

Lewis, T. S.↗

Combined Uncertainty and A-Posteriori Error Bound Estimates for General CFD Calculations: Theory and Software Implementation

This workshop presentation discusses the design and implementation of numerical methods for the quantification of statistical uncertainty, including a-posteriori error bounds, for output quantities computed using CFD methods. Hydrodynamic realizations often contain numerical error arising from finite-dimensional approximation (e.g. numerical methods using grids, basis functions, particles) and statistical uncertainty arising from incomplete information and/or statistical characterization of model parameters and random fields. The first task at hand is to derive formal error bounds for statistics given realizations containing finite-dimensional numerical error [1]. The error in computed output statistics contains contributions from both realization error and the error resulting from the calculation of statistics integrals using a numerical method. A second task is to devise computable a-posteriori error bounds by numerically approximating all terms arising in the error bound estimates. For the same reason that CFD calculations including error bounds but omitting uncertainty modeling are only of limited value, CFD calculations including uncertainty modeling but omitting error bounds are only of limited value. To gain maximum value from CFD calculations, a general software package for uncertainty quantification with quantified error bounds has been developed at NASA. The package provides implementations for a suite of numerical methods used in uncertainty quantification: Dense tensorization basis methods [3] and a subscale recovery variant [1] for non-smooth data, Sparse tensorization methods[2] utilizing node-nested hierarchies, Sampling methods[4] for high-dimensional random variable spaces.

CFD↗

Efficient solution of parabolic equations by Krylov approximation methods

Numerical techniques for solving parabolic equations by the method of lines is addressed. The main motivation for the proposed approach is the possibility of exploiting a high degree of parallelism in a simple manner. The basic idea of the method is to approximate the action of the evolution operator on a given state vector by means of a projection process onto a Krylov subspace. Thus, the resulting approximation consists of applying an evolution operator of a very small dimension to a known vector which is, in turn, computed accurately by exploiting well-known rational approximations to the exponential. Because the rational approximation is only applied to a small matrix, the only operations required with the original large matrix are matrix-by-vector multiplications, and as a result the algorithm can easily be parallelized and vectorized. Some relevant approximation and stability issues are discussed. We present some numerical experiments with the method and compare its performance with a few explicit and implicit algorithms.

Gallopoulos, E.↗

UCLA parallel PIC framework

The UCLA Parallel PIC Framework (UPIC) has been developed to provide trusted components for the rapid construction of new, parallel Particle-in-Cell (PIC) codes. The Framework uses object-based ideas in Fortran95, and is designed to provide support for various kinds of PIC codes on various kinds of hardware. The focus is on student programmers. The Framework supports multiple numerical methods, different physics approximations, different numerical optimizations and implementations for different hardware. It is designed with "defensive" programming in mind, meaning that it contains many error checks and debugging helps. Above all, it is designed to hide the complexity of parallel processing. It is currently being used in a number of new Parallel PIC codes.

Norton, Charles D.↗

The selection of approximating functions for tabulated numerical data

A computer program was developed that selects, from a list of candidate functions, the approximating functions and associated coefficients which result in the best curve fit of a given set of numerical data. The advantages of the approach used here are: (1) Multivariable approximations can be performed. (2) Flexibility with respect to the type of approximations used is available. (3) The program is designed to choose the best terms to be used in the approximation from an arbitrary list of possible terms so that little knowledge of the proper approximating form is required. (4) Recursion relations are used in determining the coefficients of the approximating functions, which reduces the computer execution time of the program.

Ingram, H. L.↗

Numerical methods and hypoexponential approximations for gamma distributed delay differential equations

Abstract Gamma distributed delay differential equations (DDEs) arise naturally in many modelling applications. However, appropriate numerical methods for generic gamma distributed DDEs have not previously been implemented. Modellers have therefore resorted to approximating the gamma distribution with an Erlang distribution and using the linear chain technique to derive an equivalent system of ordinary differential equations (ODEs). In this work, we address the lack of appropriate numerical tools for gamma distributed DDEs in two ways. First, we develop a functional continuous Runge–Kutta (FCRK) method to numerically integrate the gamma distributed DDE without resorting to Erlang approximation. We prove the fourth-order convergence of the FCRK method and perform numerical tests to demonstrate the accuracy of the new numerical method. Nevertheless, FCRK methods for infinite delay DDEs are not widely available in existing scientific software packages. As an alternative approach to solving gamma distributed DDEs, we also derive a hypoexponential approximation of the gamma distributed DDE. This hypoexponential approach is a more accurate approximation of the true gamma distributed DDE than the common Erlang approximation but, like the Erlang approximation, can be formulated as a system of ODEs and solved numerically using standard ODE software. Using our FCRK method to provide reference solutions, we show that the common Erlang approximation may produce solutions that are qualitatively different from the underlying gamma distributed DDE. However, the proposed hypoexponential approximations do not have this limitation. Finally, we apply our hypoexponential approximations to perform statistical inference on synthetic epidemiological data to illustrate the utility of the hypoexponential approximation.

97 MATHEMATICS AND COMPUTING↗

Post-detonation fireball modeling: Validation of freeze out approximations

A numerical simulation study was performed to examine the post-detonation reaction processes produced by the detonation of a 12 mm diameter hemispherical pentaerythritol tetranitrate (PETN) explosive charge. The simulations used a finite rate detailed chemical reaction model consisting of 59 species and 368 reactions to capture post-detonation reaction processes including air dissociation from Mach 19+ shock waves that initially break out of the PETN charge, reactions within the detonation products during expansion, and afterburning when the detonation products mix with the shock heated air. The multi-species and thermodynamically complete Becker-Kistiakowsky-Wilson real-gas equation of state is used for the gaseous phase to allow for the mixing of reactive species. A recent simplified reactive burn model is used to propagate the detonation through the charge and allow for detailed post-detonation reaction processes. The computed blast, shock structures, and mole fractions of species within the detonation products agree well with experimental measurements. A comparison of the simulation results to equilibrium calculations indicates that the assumption of a local equilibrium is fairly accurate until the detonation products rapidly cool to temperatures in the range of 1500-1900 K by expansion waves. Below this range, the computed results show mole fractions that are nearly chemically frozen within the detonation products for a significant portion of expansion. In conclusion, these results are consistent with the freeze out approximation used in the blast modeling community.

97 MATHEMATICS AND COMPUTING↗

Measurement of persistence in 1D diffusion

Using a novel NMR scheme we observed persistence in 1D gas diffusion. Analytical approximations and numerical simulations have indicated that for an initially random array of spins undergoing diffusion, the probability p(t) that the average spin magnetization in a given region has not changed sign (i.e., "persists") up to time t follows a power law t(-straight theta), where straight theta depends on the dimensionality of the system. Using laser-polarized 129Xe gas, we prepared an initial "quasirandom" 1D array of spin magnetization and then monitored the ensemble's evolution due to diffusion using real-time NMR imaging. Our measurements are consistent with analytical and numerical predictions of straight theta approximately 0.12.

NASA Discipline Life Sciences Technologies↗

Parametric effects of CFL number and artificial smoothing on numerical solutions using implicit approximate factorization algorithm

An implicit approximate factorization algorithm is employed to quantify the parametric effects of Courant number and artificial smoothing on numerical solutions of the unsteady 3-D Euler equations for a windmilling propeller (low speed) flow field. The results show that propeller global or performance chracteristics vary strongly with Courant number and artificial dissipation parameters, though the variation is such less severe at high Courant numbers. Candidate sets of Courant number and dissipation parameters could result in parameter-dependent solutions. Parameter-independent numerical solutions can be obtained if low values of the dissipation parameter-time step ratio are used in the computations. Furthermore, it is realized that too much artificial damping can degrade numerical stability. Finally, it is demonstrated that highly resolved meshes may, in some cases, delay convergence, thereby suggesting some optimum cell size for a given flow solution. It is suspected that improper boundary treatment may account for the cell size constraint.

Daso, E. O.↗