SEARCH · Engineering Papers

Results for “Finite differences”

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.

SourceResearch connectionFrom yearThrough year

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

At least 703 records · Page 39

All sources NASA NTRS DOE OSTI

DOE OSTI2022

An immersed interface method for the 2D vorticity-velocity Navier-Stokes equations with multiple bodies

We present an immersed interface method for the vorticity-velocity form of the 2D Navier Stokes equations that directly addresses challenges posed by nonconvex immersed bodies, multiply connected domains, and the calculation of force distributions on immersed surfaces. The immersed interface method is re-interpreted as a polynomial extrapolation of flow quantities and boundary conditions into the immersed solid bodies, reducing computational cost and enabling simulations with nonconvex bodies that could not be discretized with previous immersed interface methods. In the flow, the vorticity transport equation is discretized using a conservative finite difference scheme and explicit Runge-Kutta time integration. The velocity reconstruction problem is transformed to a scalar Poisson equation that is discretized with conservative finite differences, and solved using an FFT-accelerated iterative algorithm. The use of conservative differencing throughout leads to exact enforcement of a discrete Kelvin's theorem, allowing for simulations with multiply connected domains and outflow boundaries that have challenged other immersed interface vortex methods. We also explore novel methods for recovering time-dependent pressure distributions on immersed bodies within a vorticity-based method and present a novel control volume formulation for recovering aerodynamic moments from only the vorticity and velocity fields. The method achieves second order spatial accuracy and third order temporal accuracy, and is validated on a variety of 2D flows in internal and free-space domains.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1976

Accelerated iterative calculation of transonic nacelle flowfields

A method is presented for the calculation of inviscid, supercritical flowfields about axisymmetric inlet cowls. A finite-difference calculation is performed in a simple, rectangular domain obtained from the nacelle geometry by a nearly-conformal mapping procedure. Type-dependent finite-differences are constructed using a coordinate-independent, 'rotated' differencing scheme. Methods of accelerating convergence of the iterative solution are demonstrated including a hybrid fast-Poisson-solver/relaxation scheme and an extrapolated relaxation procedure. Calculated pressure distributions are compared with experimental data for a variety of Mach numbers and mass-flow ratios, and show generally good agreement.

Caughey, D. A.↗

NASA NTRS1990

An alternative formulation of the global sensitivity equations

To optimize the performance of any system, the sensitivity derivatives of the system's output variables with respect to its input variables must be readily available. It is also desirable that these derivatives be inexpensive to calculate as the optimization process requires many evaluations of the output variables and their derivatives. Optimization methods that have been developed for use in automated structural design programs may not be extended for use in integrated multidisciplinary design programs until adequate means of calculating accurate sensitivity derivatives of complex, internally coupled systems have been developed. Until the development of the Global Sensitivity Equations (GSE), the only method of determining the sensitivity derivatives of coupled systems has been by using finite differences. Analytical or semi-analytical derivatives do not exist as there is no analytical solution to the coupled problem. Also, difficulties arise because the finite difference method is expensive as the system has to iterate to a converged solution for each incremental input variable. The method may not be accurate, and the choice of the input variable increment may cause the difference in the output variable to be insignificant compared to computer numerical error if the choice is too small, or the process may not predict the true value of the output variable if the increment is too large. The GSE allow the system's sensitivity derivatives to be calculated as functions of the component subsystem's (local) sensitivity derivatives. These local sensitivity derivatives are calculated from specifically decoupled subsystems, whereas the GSE account for total system coupling. Since the subsystems are decoupled, it may be possible for the local derivatives to be calculated by analytical or semi-analytical methods, which generally reduce cost and improve accuracy. Several academic problems have been solved using GSE and have demonstrated encouraging results.

James, Benjamin B.↗

NASA NTRS1995

Second-order numerical solution of time-dependent, first-order hyperbolic equations

A finite difference scheme is developed to find an approximate solution of two similar hyperbolic equations, namely a first-order plane wave and spherical wave problem. Finite difference approximations are made for both the space and time derivatives. The result is a conditionally stable equation yielding an exact solution when the Courant number is set to one.

Shah, Patricia L.↗

NASA NTRS1992

Numerical simulation of aerothermal loads in hypersonic engine inlets due to shock impingement

The effect of shock impingement on an axial corner simulating the inlet of a hypersonic vehicle engine is modeled using a finite-difference procedure. A three-dimensional dynamic grid adaptation procedure is utilized to move the grids to regions with strong flow gradients. The adaptation procedure uses a grid relocation stencil that is valid at both the interior and boundary points of the finite-difference grid. A linear combination of spatial derivatives of specific flow variables, calculated with finite-element interpolation functions, are used as adaptation measures. This computational procedure is used to study laminar and turbulent Mach 6 flows in the axial corner. The description of flow physics and qualitative measures of heat transfer distributions on cowl and strut surfaces obtained from the analysis are compared with experimental observations. Conclusions are drawn regarding the capability of the numerical scheme for enhanced modeling of high-speed compressible flows.

Ramakrishnan, R.↗

DOE OSTI2023

(U) A General-Purpose Code for Correlated Sampling Using Batch Statistics with MCNP6 for Fixed-Source Problems

Correlated sampling can be used to reduce the uncertainty of a difference of tallies by taking advantage of the negative covariance term in the sandwich formula. Booth first showed how correlated sampling can be applied with batch statistics using MCNP’s tally fluctuation chart (TFC) to reduce the uncertainty of a difference of tallies in fixed-source problems. Booth presented a problem in which a 1273% uncertainty in a difference was reduced to 8% by accounting for correlations. Researchers He and Su recently studied correlated sampling using the TFC in MCNP version 5. They determined that the code did not print enough digits in the TFC tally means for accurate batch statistics in some cases. After modifying the source code, they concluded that “correlated sampling can yield a standard deviation of about one magnitude smaller than that predicted by the direct, un-correlated simulation when the changes in system response are small (say about 1%), which is equivalent to saving in CPU time by a factor of 100. Such saving [sic] becomes less significant as the change in system response becomes larger.” He and Su provided the formulas needed to apply batch statistics to compute the correlated uncertainty of a difference of tallies. In this report, we follow up on their work by providing the formulas needed to apply batch statistics to compute the correlated uncertainty of a ratio of tallies and of a difference of two tallies divided by a third tally. We extend these formulas to differences and ratios of ratios. These formulas are applied to reduce the uncertainty associated with calculating a relative sensitivity. He and Su did not investigate the accuracy of their correlated sampling uncertainty estimates. We use their test problems and evaluate the accuracy of the uncertainty estimates by comparing with results obtained from random sampling, and, in simple cases, with theoretical values of the “exact” uncertainties. We find that the uncertainties obtained from batch statistics are accurate as long as at least 100 batches are used. We present a new computer code, COSUBS (COrrelated Sampling Using Batch Statistics), that reads MCNP6 TFCs and applies correlated sampling using batch statistics for the tally combinations that the user specifies. COSUBS is a very general tool that compares all TFCs for a base case and one or two perturbed cases. It computes uncertainties for ratios if given only a base case. This report is organized as follows. The equations to apply batch statistics to the difference of random tallies are reviewed in Sec. II. Section III presents the equations for applying batch statistics to a ratio of random tallies; this is useful for computing relative sensitivities using a one-sided finite difference and the relative sensitivity using the differential operator method. Section IV presents the equations for applying batch statistics to a difference of two random tallies divided by a third; this is useful for computing a relative sensitivities using a central difference. Section V presents the equations for applying batch statistics to a difference of two ratios with four random tallies. Section VI presents the equations for applying batch statistics to a one-sided finite difference estimate of the relative sensitivity of a ratio (this uses four random tallies). Section VII presents the equations for applying batch statistics to a central difference estimate of the relative sensitivity of a ratio (this uses six random tallies). Section VIII presents the equations for applying batch statistics to a sum of random tallies. Section IX discusses how to apply batch statistics using MCNP6. Section X presents COSUBS, describing its command-line options and logic. Sections XI through XVI present numerical results for various test problems. Section XVII is a summary and conclusions. Appendix A derives the theoretical Monte Carlo tally variance given certain assumptions; these variances are used to verify the batch statistics for some of the problems. Appendix B lists the MCNP6 input for the unperturbed example problem. Appendix C presents modifications made to MCNP6.3 to support this work.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1976

Conservative versus nonconservative differencing: Transonic streamline shape effects

Streamline patterns calculated from transonic flow solutions which were generated using a nonconservative finite difference scheme showed a net streamtube area increase far downstream of the disturbance indicating that the global mass balance was destroyed. Similar calculations using a conservative finite difference scheme did not show this defect. Comparative calculations were made at several free-stream Mach numbers for nonlifting flow over a 10% parabolic arc airfoil. In a transonic internal flow, this nonconservation of mass may be of greater concern than in an unconfined external flow.

Newman, P. A.↗

NASA NTRS1981

Multigrid solution of the Navier-Stokes equations on nonuniform grids

The numerical solution of the Navier-Stokes equations in general two dimensional domains is considered. A proper finite difference approximation to the governing equations, on nonstaggered grids, in a transformed plane is formulated. Several aspects of a multigrid method for the solution of the finite difference equations are described. The efficiency of some relaxation schemes and the transfer among the grids which are nonuniform in the physical plane are emphasized.

Fuchs, L.↗

NASA NTRS1985

Spectral methods for modeling supersonic chemically reacting flow fields

A numerical algorithm was developed for solving the equations describing chemically reacting supersonic flows. The algorithm employs a two-stage Runge-Kutta method for integrating the equations in time and a Chebyshev spectral method for integrating the equations in space. The accuracy and efficiency of the technique were assessed by comparison with an existing implicit finite-difference procedure for modeling chemically reacting flows. The comparison showed that the procedure presented yields equivalent accuracy on much coarser grids as compared to the finite-difference procedure with resultant significant gains in computational efficiency.

Drummond, J. P.↗

NASA NTRS1985

Spectral methods for modeling supersonic chemically reacting flow fields

A partial implicit numerical algorithm has been developed for solving the equations describing chemically reacting supersonic flows. The algorithm employs a two-stage Runge-Kutta method for integrating the equations in time and a Chebyshev spectral method for integrating the equations in space. The accuracy and efficiency of the new technique have been assessed by comparison with an existing implicit finite-difference procedure for modeling chemically reacting flows. The comparison showed that the new procedure yielded equivalent accuracy on much coarser grids as compared to the finite-difference procedure with resultant significant gains in computational efficiency.

Drummond, J. P.↗

NASA NTRS1989

Solving the shallow water equations on the Cray X-MP/48 and the connection machine 2

The shallow water equations in Cartesian coordinates and 2-D are solved on the Connection Machine 2 (CM-2) using both the spectral and finite difference methods. A description of these implementations is presented together with a brief discussion of the CM-2 as it relates to these specific computations. The finite difference code was written both in C* and *LISP and the spectral code was written in *LISP. The performance of the codes is compared with a FORTRAN version that was optimized for the Cray X-MP/48.

Swarztrauber, Paul N.↗

NASA NTRS1992

Integrated numerical methods for hypersonic aircraft cooling systems analysis

Numerical methods have been developed for the analysis of hypersonic aircraft cooling systems. A general purpose finite difference thermal analysis code is used to determine areas which must be cooled. Complex cooling networks of series and parallel flow can be analyzed using a finite difference computer program. Both internal fluid flow and heat transfer are analyzed, because increased heat flow causes a decrease in the flow of the coolant. The steady state solution is a successive point iterative method. The transient analysis uses implicit forward-backward differencing. Several examples of the use of the program in studies of hypersonic aircraft and rockets are provided.

Petley, Dennis H.↗

NASA NTRS1997

External Boundary Conditions for Three-Dimensional Problems of Computational Aerodynamics

We consider an unbounded steady-state flow of viscous fluid over a three-dimensional finite body or configuration of bodies. For the purpose of solving this flow problem numerically, we discretize the governing equations (Navier-Stokes) on a finite-difference grid. The grid obviously cannot stretch from the body up to infinity, because the number of the discrete variables in that case would not be finite. Therefore, prior to the discretization we truncate the original unbounded flow domain by introducing some artificial computational boundary at a finite distance of the body. Typically, the artificial boundary is introduced in a natural way as the external boundary of the domain covered by the grid. The flow problem formulated only on the finite computational domain rather than on the original infinite domain is clearly subdefinite unless some artificial boundary conditions (ABC's) are specified at the external computational boundary. Similarly, the discretized flow problem is subdefinite (i.e., lacks equations with respect to unknowns) unless a special closing procedure is implemented at this artificial boundary. The closing procedure in the discrete case is called the ABC's as well. In this paper, we present an innovative approach to constructing highly accurate ABC's for three-dimensional flow computations. The approach extends our previous technique developed for the two-dimensional case; it employs the finite-difference counterparts to Calderon's pseudodifferential boundary projections calculated in the framework of the difference potentials method (DPM) by Ryaben'kii. The resulting ABC's appear spatially nonlocal but particularly easy to implement along with the existing solvers. The new boundary conditions have been successfully combined with the NASA-developed production code TLNS3D and used for the analysis of wing-shaped configurations in subsonic (including incompressible limit) and transonic flow regimes. As demonstrated by the computational experiments and comparisons with the standard (local) methods, the DPM-based ABC's allow one to greatly reduce the size of the computational domain while still maintaining high accuracy of the numerical solution. Moreover, they may provide for a noticeable increase of the convergence rate of multigrid iterations.

Tsynkov, Semyon V.↗

NASA NTRS1973

Decay of Far-Flowfield in Trailing Vortices

Methods for reduction of velocities in trailing vortices of large aircraft are of current interest for the purpose of shortening the waiting time between landings at central airports. We have made finite-difference calculations of the flow in turbulent wake vortices as an aid to interpretation of wind-tunnel and flight experiments directed toward that end. Finite-difference solutions are capable of adding flexibility to such investigations if they are based on an adequate model of turbulence. Interesting developments have been taking place in the knowledge of turbulence that may lead to a complete theory in the future. In the meantime, approximate methods that yield reasonable agreement with experiment are appropriate. The simplified turbulence model we have selected contains features that account for the major effects disclosed by more sophisticated models in which the parameters are not yet established. Several puzzles are thereby resolved that arose in previous theoretical investigations of wake vortices.

Baldwin, B. S.↗

NASA NTRS1994

A Navier-Strokes Chimera Code on the Connection Machine CM-5: Design and Performance

We have implemented a three-dimensional compressible Navier-Stokes code on the Connection Machine CM-5. The code is set up for implicit time-stepping on single or multiple structured grids. For multiple grids and geometrically complex problems, we follow the 'chimera' approach, where flow data on one zone is interpolated onto another in the region of overlap. We will describe our design philosophy and give some timing results for the current code. A parallel machine like the CM-5 is well-suited for finite-difference methods on structured grids. The regular pattern of connections of a structured mesh maps well onto the architecture of the machine. So the first design choice, finite differences on a structured mesh, is natural. We use centered differences in space, with added artificial dissipation terms. When numerically solving the Navier-Stokes equations, there are liable to be some mesh cells near a solid body that are small in at least one direction. This mesh cell geometry can impose a very severe CFL (Courant-Friedrichs-Lewy) condition on the time step for explicit time-stepping methods. Thus, though explicit time-stepping is well-suited to the architecture of the machine, we have adopted implicit time-stepping. We have further taken the approximate factorization approach. This creates the need to solve large banded linear systems and creates the first possible barrier to an efficient algorithm. To overcome this first possible barrier we have considered two options. The first is just to solve the banded linear systems with data spread over the whole machine, using whatever fast method is available. This option is adequate for solving scalar tridiagonal systems, but for scalar pentadiagonal or block tridiagonal systems it is somewhat slower than desired. The second option is to 'transpose' the flow and geometry variables as part of the time-stepping process: Start with x-lines of data in-processor. Form explicit terms in x, then transpose so y-lines of data are in-processor. Form explicit terms in y, then transpose so z-lines are in processor. Form explicit terms in z, then solve linear systems in the z-direction. Transpose to the y-direction, then solve linear systems in the y-direction. Finally transpose to the x direction and solve linear systems in the x-direction. This strategy avoids inter-processor communication when differencing and solving linear systems, but requires a large amount of communication when doing the transposes. The transpose method is more efficient than the non-transpose strategy when dealing with scalar pentadiagonal or block tridiagonal systems. For handling geometrically complex problems the chimera strategy was adopted. For multiple zone cases we compute on each zone sequentially (using the whole parallel machine), then send the chimera interpolation data to a distributed data structure (array) laid out over the whole machine. This information transfer implies an irregular communication pattern, and is the second possible barrier to an efficient algorithm. We have implemented these ideas on the CM-5 using CMF (Connection Machine Fortran), a data parallel language which combines elements of Fortran 90 and certain extensions, and which bears a strong similarity to High Performance Fortran. We make use of the Connection Machine Scientific Software Library (CMSSL) for the linear solver and array transpose operations.

Jespersen, Dennis C.↗

DOE OSTI2025

Explicit block encodings of boundary value problems for many-body elliptic operators

Simulation of physical systems is one of the most promising use cases of future digital quantum computers. In this work we systematically analyze the quantum circuit complexities of block encoding the discretized elliptic operators that arise extensively in numerical simulations for partial differential equations, including high-dimensional instances for many-body simulations. When restricted to rectangular domains with separable boundary conditions, we provide explicit circuits to block encode the many-body Laplacian with separable periodic, Dirichlet, Neumann, and Robin boundary conditions, using standard discretization techniques from low-order finite difference methods. To obtain high-precision, we introduce a scheme based on periodic extensions to solve Dirichlet and Neumann boundary value problems using a high-order finite difference method, with only a constant increase in total circuit depth and subnormalization factor. We then present a scheme to implement block encodings of differential operators acting on more arbitrary domains, inspired by Cartesian immersed boundary methods. We then block encode the many-body convective operator, which describes interacting particles experiencing a force generated by a pair-wise potential given as an inverse power law of the interparticle distance. This work provides concrete recipes that are readily translated into quantum circuits, with depth logarithmic in the total Hilbert space dimension, that block encode operators arising broadly in applications involving the quantum simulation of quantum and classical many-body mechanics.

Kharazi, Tyler [University of California, Berkeley↗

NASA NTRS1975

Forward marching procedure for separated boundary-layer flows

A forward-marching procedure for separated boundary-layer flows which permits the rapid and accurate solution of flows of limited extent is presented. The streamwise convection of vorticity in the reversed flow region is neglected, and this approximation is incorporated into a previously developed (Carter, 1974) inverse boundary-layer procedure. The equations are solved by the Crank-Nicolson finite-difference scheme in which column iteration is carried out at each streamwise station. Instabilities encountered in the column iterations are removed by introducing timelike terms in the finite-difference equations. This provides both unconditional diagonal dominance and a column iterative scheme, found to be stable using the von Neumann stability analysis.

Carter, J. E.↗

NASA NTRS1978

A finite element solution of transonic flow

The use of finite elements is explored in a field in which its use has previously not been deemed very feasible, that of transonic flow. The specific problem chosen is that of steady small-disturbance transonic flow. The nonlinear equations are formulated with an artificial viscosity term added to yield the proper domain of dependence and directional bias in supersonic regions and across imbedded shock waves. Justification is given for the problem and means of solution chosen, and the potential advantages of the finite element procedure over standard finite difference procedures are discussed. Several possible improvements on the method as presently derived are stated. Computational mesh requirements and certain mesh variations are described. Some results equivalent to finite difference calculations are given as a sample solution.

Tatum, K. E.↗