Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximate computing”

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,567 records · Page 87
All sourcesNASA NTRSDOE OSTI
NASA NTRS1986

Navier-Stokes computations of lee-side flows over delta wings

Solutions to the Navier-Stokes equations for the flow over delta wings are computed with emphasis on the separated vortical flows developing on the lee side at high angles of attack. A recently developed implicit algorithm is used which employs upwind differencing for the pressure and convection terms and central differencing for the shear stress and heat transfer terms. Solutions to both the three-dimensional equations and the approximate conical flow equations are compared parametrically with an extensive experimental data base at supersonic speeds. The computations indicate that the conical flow approximation provides results in close agreement with the three-dimensional equations, even to angles of attack as high as 20 degrees. Good agreement with experimentally measured pressures and vapor screen photographs is obtained for the conditions investigated. The method predicts the classical pattern of vortical flow over a delta wing and transition to other flow patterns as the leading edge sweep angle and leading edge normal Mach number are varied.

Thomas, J. L.↗
NASA NTRS2005

Turbulent Vortex-Flow Simulation Over a 65 deg Sharp and Blunt Leading-Edge Delta Wing at Subsonic Speeds

Turbulent thin-layer, Reynolds-Averaged Navier-Stokes solutions, based on a multi-block structured grid, are presented for a 65 deg delta wing having either a sharp leading edge (SLE) or blunt leading edge (BLE) geometry. The primary objective of the study is to assess the prediction capability of the method for simulating the leading-edge flow separation and the ensuing vortex flow characteristics. Computational results are obtained for two angles of attack of approximately 13 and 20 deg, at free-stream Mach number of 0.40 and Reynolds number of 6 million based on the wing mean aerodynamic chord. The effects of two turbulence models of Baldwin-Lomax with Degani-Schiff (BL/DS) and the Spalart-Allmaras (SA) on the numerical results are also discussed. The computations also explore the effects of two numerical flux-splitting schemes, i.e., flux difference splitting (fds) and flux vector splitting (fvs), on the solution development and convergence characteristics. The resulting trends in solution sensitivity to grid resolution for the selected leading-edge geometries, angles of attack, turbulence models and flux splitting schemes are also presented. The validity of the numerical results is evaluated against a unique set of experimental wind-tunnel data that was obtained in the National Transonic Facility at the NASA Langley Research Center.

Ghaffari, Farhad↗
NASA NTRS1985

The slab geometry laser. II - Thermal effects in a finite slab

This paper presents two methods for calculating the thermally induced stress, focusing, and depolarization in a pumped zigzag-slab solid-state laser. A computer program capable of detailed calculations of thermal effects in the general case is described. An approximate analysis of slab thermal effects in many cases allows calculation of these effects without use of the computer model directly. The analysis predicts that slabs of square cross section can be designed to have low depolarization and thermal focusing compared to Nd:YAG laser rods.

Kane, T. J.↗
NASA NTRS1986

Comparative accuracy of the Albedo, transmission and absorption for selected radiative transfer approximations

Illustrations of both the relative and absolute accuracy of eight different radiative transfer approximations as a function of optical thickness, solar zenith angle and single scattering albedo are given. Computational results for the plane albedo, total transmission and fractional absorption were obtained for plane-parallel atmospheres composed of cloud particles. These computations, which were obtained using the doubling method, are compared with comparable results obtained using selected radiative transfer approximations. Comparisons were made between asymptotic theory for thick layers and the following widely used two stream approximations: Coakley-Chylek's models 1 and 2, Meador-Weaver, Eddington, delta-Eddington, PIFM and delta-discrete ordinates.

King, M. D.↗
DOE OSTI2023

Linear-depth quantum circuits for loading Fourier approximations of arbitrary functions

Abstract The ability to efficiently load functions on quantum computers with high fidelity is essential for many quantum algorithms, including those for solving partial differential equations and Monte Carlo estimation. In this work, we introduce the Fourier series loader (FSL) method for preparing quantum states that exactly encode multi-dimensional Fourier series using linear-depth quantum circuits. Specifically, the FSL method prepares a (Dn)-qubit state encoding the 2 Dn -point uniform discretization of aD-dimensional function specified by aD-dimensional Fourier series. A free parameter,m, which must be less thann, determines the number of Fourier coefficients, 2 D ( m + 1 ) , used to represent the function. The FSL method uses a quantum circuit of depth at most 2 ( n − 2 ) + ⌈ log 2 ( n − m ) ⌉ + 2 D ( m + 1 ) + 2 − 2 D ( m + 1 ) , which is linear in the number of Fourier coefficients, and linear in the number of qubits (Dn) despite the fact that the loaded function’s discretization is over exponentially many (2 Dn ) points. The FSL circuit consists of at most D n + 2 D ( m + 1 ) + 1 − 1 single-qubit and D n ( n + 1 ) / 2 + 2 D ( m + 1 ) + 1 − 3 D ( m + 1 ) − 2 two-qubit gates; we present a classical compilation algorithm with runtime O ( 2 3 D ( m + 1 ) ) to determine the FSL circuit for a given Fourier series. The FSL method allows for the highly accurate loading of complex-valued functions that are well-approximated by a Fourier series with finitely many terms. We report results from noiseless quantum circuit simulations, illustrating the capability of the FSL method to load various continuous 1D functions, and a discontinuous 1D function, on 20 qubits with infidelities of less than 10 −6 and 10 −3 , respectively. We also demonstrate the practicality of the FSL method for near-term quantum computers by presenting experiments performed on the Quantinuum H1-1 and H1-2 trapped-ion quantum computers: we loaded a complex-valued function on 3 qubits with a fidelity of over 95 % , as well as various 1D real-valued functions on up to 6 qubits with classical fidelities ≈99%, and a 2D function on 10 qubits with a classical fidelity ≈94%.

Physics↗
NASA NTRS2014

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↗
DOE OSTI2023

Collective neutrino oscillations on a quantum computer with hybrid quantum-classical algorithm

We simulate the time evolution of collective neutrino oscillations in two-flavor settings on a quantum computer. We explore the generalization of Trotter-Suzuki approximation to time-dependent Hamiltonian dynamics. The trotterization steps are further optimized using the Cartan decomposition of two-qubit unitary gates U ϵ SU(4) in the minimum number of controlled-NOT (CNOT) gates making the algorithm more resilient to the hardware noise. As a result, a more efficient hybrid quantum-classical algorithm is also explored to solve the problem on noisy intermediate-scale quantum devices.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS2004

Aerodynamic Optimization of Rocket Control Surface Geometry Using Cartesian Methods and CAD Geometry

Aerodynamic design is an iterative process involving geometry manipulation and complex computational analysis subject to physical constraints and aerodynamic objectives. A design cycle consists of first establishing the performance of a baseline design, which is usually created with low-fidelity engineering tools, and then progressively optimizing the design to maximize its performance. Optimization techniques have evolved from relying exclusively on designer intuition and insight in traditional trial and error methods, to sophisticated local and global search methods. Recent attempts at automating the search through a large design space with formal optimization methods include both database driven and direct evaluation schemes. Databases are being used in conjunction with surrogate and neural network models as a basis on which to run optimization algorithms. Optimization algorithms are also being driven by the direct evaluation of objectives and constraints using high-fidelity simulations. Surrogate methods use data points obtained from simulations, and possibly gradients evaluated at the data points, to create mathematical approximations of a database. Neural network models work in a similar fashion, using a number of high-fidelity database calculations as training iterations to create a database model. Optimal designs are obtained by coupling an optimization algorithm to the database model. Evaluation of the current best design then gives either a new local optima and/or increases the fidelity of the approximation model for the next iteration. Surrogate methods have also been developed that iterate on the selection of data points to decrease the uncertainty of the approximation model prior to searching for an optimal design. The database approximation models for each of these cases, however, become computationally expensive with increase in dimensionality. Thus the method of using optimization algorithms to search a database model becomes problematic as the number of design variables is increased.

Nelson, Andrea↗
DOE OSTI2022

CFD-trained ANN Model for Approximating Near-occupant Condition in Real-time Simulations

The main drawback of Computational Fluid Dynamics (CFD) simulations has been the time and resource consuming nature which is not suitable for real-time applications. In this work, we first generated numerous CFD models of a given indoor space to obtain airspeed, temperature, and mean radiant temperature near an occupant as training data. Several artificial neural networks (ANN) models were trained using this CFD simulated data to approximate near real-time environmental conditions for a given occupant. This trained ANN model approach is a part of a real-time simulation of building operations using a combination of software and real hardware (HVAC equipment) approaches. The preliminary results suggest that the CFD- generated training data and the trained ANN model can accurately approximate such conditions in a real-time application, a method that has great potential in building simulation and building digital twin areas of research.

Zhang, Yun↗
DOE OSTI2023

Data assimilation in operator algebras

We develop an algebraic framework for sequential data assimilation of partially observed dynamical systems. In this framework, Bayesian data assimilation is embedded in a nonabelian operator algebra, which provides a representation of observables by multiplication operators and probability densities by density operators (quantum states). In the algebraic approach, the forecast step of data assimilation is represented by a quantum operation induced by the Koopman operator of the dynamical system. Moreover, the analysis step is described by a quantum effect, which generalizes the Bayesian observational update rule. Projecting this formulation to finite-dimensional matrix algebras leads to computational schemes that are i) automatically positivity-preserving and ii) amenable to consistent data-driven approximation using kernel methods for machine learning. Moreover, these methods are natural candidates for implementation on quantum computers. Applications to the Lorenz 96 multiscale system and the El Niño Southern Oscillation in a climate model show promising results in terms of forecast skill and uncertainty quantification.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1988

Integrated structural-aerodynamic design optimization

This paper focuses on the processes of simultaneous aerodynamic and structural wing design as a prototype for design integration, with emphasis on the major difficulty associated with multidisciplinary design optimization processes, their enormous computational costs. Methods are presented for reducing this computational burden through the development of efficient methods for cross-sensitivity calculations and the implementation of approximate optimization procedures. Utilizing a modular sensitivity analysis approach, it is shown that the sensitivities can be computed without the expensive calculation of the derivatives of the aerodynamic influence coefficient matrix, and the derivatives of the structural flexibility matrix. The same process is used to efficiently evaluate the sensitivities of the wing divergence constraint, which should be particularly useful, not only in problems of complete integrated aircraft design, but also in aeroelastic tailoring applications.

Haftka, R. T.↗
NASA NTRS1986

Effective medium approximation for effective propagation constant calculation in a dense random medium

The effective medium approximation (EMA) formalism developed for scalar wave calculations in solid state physics is generalized to electromagnetic wave scattering in a dense random medium. Results are applied to compute the effective propagation constant in a dense medium involving discrete spherical scatterers. When compared with a common quasicrystalline approximation (QCA), it is found that EMA accounts for backward scattering and the effect of correlation among three scatterers which are not available in QCA. It is also found that there is not much difference in the calculated normalized phase velocity between the use of these two approximations. However, there is a significant difference in the computed effective loss tangent in a nonabsorptive random medium. The computed effective loss tangent using EMA and measurements from a snow medium are compared, showing good agreement.

Zhu, P. Y.↗
NASA NTRS1993

Development of programmable artificial neural networks

Conventionally programmed digital computers can process numbers with great speed and precision, but do not easily recognize patterns or imprecise or contradictory data. Instead of being programmed in the conventional sense, artificial neural networks are capable of self-learning through exposure to repeated examples. However, the training of an ANN can be a time consuming and unpredictable process. A general method is being developed to mate the adaptability of the ANN with the speed and precision of the digital computer. This method was successful in building feedforward networks that can approximate functions and their partial derivatives from examples in a single iteration. The general method also allows the formation of feedforward networks that can approximate the solution to nonlinear ordinary and partial differential equations to desired accuracy without the need of examples. It is believed that continued research will produce artificial neural networks that can be used with confidence in practical scientific computing and engineering applications.

Meade, Andrew J.↗
DOE OSTI2023

Multi-fidelity Uncertainty Quantification for Homogenization Problems in Structure-Property Relationships from Crystal Plasticity Finite Elements

Crystal plasticity finite element method (CPFEM) has been an integrated computational materials engineering (ICME) workhorse to study materials behaviors and structure-property relationships for the last few decades. These relations are mappings from the microstructure space to the materials properties space. Due to the stochastic and random nature of microstructures, there is always some uncertainty associated with materials properties, for example, in homogenized stress-strain curves. For critical applications with strong reliability needs, it is often desirable to quantify the microstructure-induced uncertainty in the context of structure-property relationships. However, this uncertainty quantification (UQ) problem often incurs a large computational cost because many statistically equivalent representative volume elements (SERVEs) are needed. In this article, we apply a multi-level Monte Carlo (MLMC) method to CPFEM to study the uncertainty in stress-strain curves, given an ensemble of SERVEs at multiple mesh resolutions. By using the information at coarse meshes, we show that it is possible to approximate the response at fine meshes with a much reduced computational cost. We focus on problems where the model output is multi-dimensional, which requires us to track multiple quantities of interest (QoIs) at the same time. In conclusion, our numerical results show that MLMC can accelerate UQ tasks around 2.23x, compared to the classical Monte Carlo (MC) method, which is widely known as ensemble average in the CPFEM literature.

36 MATERIALS SCIENCE↗
DOE OSTI2026

Offline Maximizing Minimally Invasive Proper Orthogonal Decomposition for Reduced-Order Modeling of S n Radiation Transport

Deterministic solutions to the Sn radiation transport equation can be computationally expensive to calculate. Reduced-order modeling enables efficient approximation of the full-order model (FOM) solution. We propose a novel method for constructing reduced-order models (ROMs) of the S n radiation transport equation, offline maximizing minimally invasive (OMMI) proper orthogonal decomposition (POD). POD uses the method of snapshots to create a reduced-order basis for constructing an ROM. Minimally invasive POD leverages the sweep infrastructure existing in deterministic transport codes to create a POD-based ROM, even when infeasible by traditional methods. Offline maximizing minimally invasive proper orthogonal decomposition (OMMI-POD) extends minimally invasive POD by performing sweeps offline, therefore maximizing the potential speedup. OMMI-POD does so by creating a library of reduced systems from a training set. This library of reduced systems is then interpolated to provide a rapid approximate solution of the S n radiation transport equation. The model is evaluated on a set of test problems, achieving a low error with a 466 times speedup over the FOM. Also presented is a study of the effect of sampling method on the performance of OMMI-POD, specifically comparing naive uniform sampling to the more accurate and computationally expensive greedy sampling.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Many-Body Basis Set Amelioration Method for Incremental Full Configuration Interaction

Incremental full configuration interaction (iFCI) is a polynomial-cost electronic structure method that systematically approaches the FCI limit by employing the method of increments to solve the Schrödinger equation through a many-body expansion. This article introduces the many-body basis set amelioration (MBBSA) method, which is designed to allow iFCI to be applicable to larger atomic orbital basis sets. MBBSA uses a series of inexpensive iFCI calculations to approximate the correlation energy that would be found using a more expensive, highly accurate iFCI calculation. Here, when compared to standard iFCI computations on smaller molecules in triple-zeta and larger basis sets, MBBSA provides approximations to the total and relative energies within chemical accuracy. MBBSA exhibits a reduced cost of between 60-92% when compared to standard iFCI calculations, with larger systems experiencing the largest benefit. Tests of MBBSA on two reactions that involve highly correlated systems, the automerization of cyclobutadiene and a Criegee intermediate reaction, show that MBBSA has practical utility for studying realistic chemistries.

Basis sets↗
NASA NTRS1989

Computer-aided simulation study of photomultiplier tubes

A computer model that simulates the response of photomultiplier tubes (PMTs) and the associated voltage divider circuit is developed. An equivalent circuit that approximates the operation of the device is derived and then used to develop a computer simulation of the PMT. Simulation results are presented and discussed.

Zaghloul, Mona E.↗
NASA NTRS1988

Accelerating the computation of steady state solutions for non-equilibrium, chemically reacting flow fields

The objective of the study is to develop a technique for accelerating the computation of steady state solutions for nonequilibrium chemically reacting flow fields using the time marching method. To achieve this, a better initial condition is introduced for the time marching scheme to achieve a faster convergence to the steady state solution. This is done by replacing the source terms of the original system of equations, which are responsible for the sitffness, by approximate source terms. It is shown that the saving in computation time increases in direct proportion to the stiffness of the flow model, with a factor of 10 increase in convergence rate observed for the models tested in this study.

Krispin, Jacob↗