Search NASA⌕ Search

SEARCH · Search NASA

Results for “discretization methods”

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

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

At least 1,009 records · Page 56
All sourcesNASA NTRSDOE OSTI
NASA NTRS1976

A finite difference method of solving anisotropic scattering problems

A new method of solving radiative transfer problems is described including a comparison of its speed with that of the doubling method, and a discussion of its accuracy and suitability for computations involving variable optical properties. The method uses a discretization in angle to produce a coupled set of first-order differential equations which are integrated between discrete depth points to produce a set of recursion relations for symmetric and anti-symmetric angular sums of the radiation field at alternate depth points. The formulation given here includes depth-dependent anisotropic scattering, absorption, and internal sources, and allows arbitrary combinations of specular and non-Lambertian diffuse reflection at either or both boundaries. Numerical tests of the method show that it can return accurate emergent intensities even for large optical depths. The method is also shown to conserve flux to machine accuracy in conservative atmospheres

Barkstrom, B. R.↗
NASA NTRS2005

Computation of Symmetric Discrete Cosine Transform Using Bakhvalov's Algorithm

A number of algorithms for recursive computation of the discrete cosine transform (DCT) have been developed recently. This paper presents a new method for computing the discrete cosine transform and its inverse using Bakhvalov's algorithm, a method developed for evaluation of a polynomial at a point. In this paper, we will focus on both the application of the algorithm to the computation of the DCT-I and its complexity. In addition, Bakhvalov s algorithm is compared with Clenshaw s algorithm for the computation of the DCT.

Aburdene, Maurice F.↗
NASA NTRS1993

Navier-Stokes analysis of three-dimensional flow and heat transfer inside turbine blade rows

A numerical method for solving the three-dimensional, Navier-Stokes equations for unsteady, viscous flow and heat transfer through multiple turbomachinery blade rows is presented. The method solves the fully three-dimensional Navier-Stokes equations with an implicit scheme which is based on a control volume approach. A two-equation turbulence model with a low Reynolds number modification is employed. A third-order accurate upwinding scheme is used to approximate convection terms while a second order accurate central difference scheme is used for the discretization of viscous terms. A second-order accurate scheme is employed for the temporal discretization. The numerical method is applied to study the unsteady flow and heat transfer field of the High Pressure Fuel side Turbo-Pump (HPFTP) of the Space Shuttle Main Engine (SSME). The stage calculation is performed by coupling the stator and the rotor flow fields at each time step through an over-laid grid. Numerical results for the complete geometry with the vane trailing edge cutback are presented and compared with the available experimental data.

Hah, C.↗
NASA NTRS1973

A dynamic transformation method for modal synthesis.

This paper presents a condensation method for large discrete parameter vibration analysis of complex structures that greatly reduces truncation errors and provides accurate definition of modes in a selected frequency range. A dynamic transformation is obtained from the partitioned equations of motion that relates modes not explicity in the condensed solution to the retained modes at a selected system frequency. The generalized mass and stiffness matrices, obtained with existing modal synthesis methods, are reduced using this transformation and solved. Revised solutions are then obtained using new transformations at the calculated eigenvalues and are also used to assess the accuracy of the results. If all the modes of interest have not been obtained, the results are used to select a new set of retained coordinates and a new transformation frequency, and the procedure is repeated for another group of modes.

Kuhar, E. J.↗
NASA NTRS2016

Mesh Convergence Requirements for Composite Damage Models

The ability of the finite element method to accurately represent the response of objects with intricate geometry and loading renders the finite element method as an extremely versatile analysis technique for structural analysis. Finite element analysis is routinely used in industry to calculate deflections, stress concentrations, natural frequencies, buckling loads, and much more. The method works by discretizing complex problems into smaller, simpler approximations that are valid over small uniform domains. For common analyses, the maximum size of the elements that can be used is often be determined by experience. However, to verify the quality of a solution, analyses with several levels of mesh refinement should be performed to ensure that the solution has converged. In recent years, the finite element method has been used to calculate the resistance of structures, and in particular that of composite structures. A number of techniques such as cohesive zone modeling, the virtual crack closure technique, and continuum damage modeling have emerged that can be used to predict cracking, delaminations, fiber failure, and other composite damage modes that lead to structural collapse. However, damage models present mesh refinement requirements that are not well understood. In this presentation, we examine different mesh refinement issues related to the representation of damage in composite materials. Damage process zone sizes and their corresponding mesh requirements will be discussed. The difficulties of modeling discontinuities and the associated need for regularization techniques will be illustrated, and some unexpected element size constraints will be presented. Finally, some of the difficulties in constructing models of composite structures capable of predicting transverse matrix cracking will be discussed. It will be shown that to predict the initiation and propagation of transverse matrix cracks, their density, and their saturation may require models that are significantly more refined than those that have been contemplated in the past.

Davila, Carlos G.↗
DOE OSTI2024

A Verification Suite of Test Cases for the Barotropic Solver of Ocean Models

Abstract The development of any atmosphere or ocean model warrants a suite of test cases (TCs) to verify its spatial and temporal discretizations, order of accuracy, stability, reproducibility, portability, scalability, etc. In this paper, we present a suite of shallow water TCs designed to verify the barotropic solver of atmosphere and ocean models. These include the non‐dispersive coastal Kelvin wave; the dispersive inertia‐gravity wave; the dispersive planetary and topographic Rossby waves; the barotropic tide; and a non‐linear manufactured solution. These TCs check the implementation of the linear pressure gradient term; the linear constant or variable‐coefficient Coriolis and bathymetry terms; and the non‐linear advection terms. Simulation results are presented for a variety of time‐stepping methods as well as two spatial discretizations: a mimetic finite volume method based on the TRiSK scheme, and a high‐order discontinuous Galerkin spectral element method. The experimental procedure for conducting these numerical experiments is detailed. It underscores several key considerations that vary depending on the chosen spatial discretization method. Finally, convergence studies of every TC are conducted with refinement in both space and time, only in space, and only in time. The convergence slopes match the expected theoretical predictions.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS1993

Three-dimensional flow analysis inside turbomachinery stages with steady and unsteady Navier-Stokes method

This study presents a numerical method for solving the three-dimensional, Navier-Stokes equations for unsteady, viscous flow through multiple turbomachinery blade rows. The method solves the fully three-dimensional Navier-Stokes equations with an implicit scheme which is based on a control volume approach. A two-equation turbulence model with a low Reynolds number modification is employed in the present study. A third-order accurate upwinding scheme is used to approximate convection terms while a second order accurate central difference scheme is used for the discretization of viscous terms. A second-order accurate scheme is employed for the temporal discretization. The numerical method is applied to study the unsteady flow field of a subsonic turbine stage and the unsteady flow field inside a transonic, high-through-flow, axial compressor stage. The stage calculation is performed by coupling the stator and the rotor flow fields at each time step through an over-laid grid.

Copenhaver, W. W.↗
NASA NTRS1976

Correction factory techniques for improving aerodynamic prediction methods

A method for correcting discrete element lifting surface theory to reflect given experimental data is presented. Theoretical pressures are modified such that imposed constraints are satisfied while minimizing the changes to the pressures. Several types of correction procedures are presented and correlated; (1) scaling of pressures; (2) scaling of downwash values; and (3) addition of an increment to the downwash that is proportioned to pressure. Some special features are included in these methods and they include: (1) consideration of experimental data from multiple deflection modes, (2) limitation of the amplitudes of the correction factors, and (3) the use of correction factor mode shapes. These methods are correlated for cases involving all three Mach Number ranges using a FORTRAN IV computer program. Subsonically, a wing with an oscillating partial span control surface and a wing with a leading edge droop are presented. Transonically a two-dimensional airfoil with an oscillating flap is considered. Supersonically an arrow wing with and without camber is analyzed. In addition to correction factor methods an investigation is presented dealing with a new simplified transonic modification of the two-dimensional subsonic lifting surface theory. Correlations are presented for an airfoil with an oscillating flap.

Giesing, J. P.↗
DOE OSTI2017

Direct S{sub N} Treatment of the Scattering Source with Phase Functions

In deterministic transport, the angular dependency of the scattering source is described using a so-called phase function. The scattering operator is commonly expressed using a spherical harmonics (P{sub N}) expansion of this phase function. Not only does this require minimal modifications if the problem dimensionality is changed, but it also contains little to no approximation whenever the scattering anisotropy degree is small. An alternative method relying on a discrete ordinates (S{sub N}) approach - essentially computing the angular integral of the phase function with a finite number of weighted directions - is theoretically possible and has shown some advantages. In particular, this method was introduced for neutron elastic scattering and was shown to be more accurate for highly anisotropic group-to-group transfer cross-sections. Benefits were further shown in the case of a collimated beam in highly forward peaked scattering media, particularly reducing the memory usage by storing an angle-to-angle collision matrix rather than a large number of angular moments. In addition, the scattering source was expressed using that same method, the phase function having been previously expanded using Legendre polynomials, in the context of achieving extreme precision while solving the 1D radiative transfer equation. Based on these previous works, we aim at exploring two questions. First, we wish to derive an expression of the phase function in reduced geometries that does not require any more angular quadrature points than for a standard S N calculation. This is particularly relevant because the reduced phase function does not solely depend on the product of the incoming and outgoing directions. Second, we wish to better understand the relationship between the S{sub N} and P{sub N} treatments. We in particular show equivalence if the phase function in the former case is expanded Legendre polynomials. This equivalence is verified numerically and the computational costs of the methods are compared on a test problem involving a Dirac delta phase function.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2012

Hybrid parallel code acceleration methods in full-core reactor physics calculations

When dealing with nuclear reactor calculation schemes, the need for three dimensional (3D) transport-based reference solutions is essential for both validation and optimization purposes. Considering a benchmark problem, this work investigates the potential of discrete ordinates (Sn) transport methods applied to 3D pressurized water reactor (PWR) full-core calculations. First, the benchmark problem is described. It involves a pin-by-pin description of a 3D PWR first core, and uses a 8-group cross-section library prepared with the DRAGON cell code. Then, a convergence analysis is performed using the PENTRAN parallel Sn Cartesian code. It discusses the spatial refinement and the associated angular quadrature required to properly describe the problem physics. It also shows that initializing the Sn solution with the EDF SPN solver COCAGNE reduces the number of iterations required to converge by nearly a factor of 6. Using a best estimate model, PENTRAN results are then compared to multigroup Monte Carlo results obtained with the MCNP5 code. Good consistency is observed between the two methods (Sn and Monte Carlo), with discrepancies that are less than 25 pcm for the k{sub eff}, and less than 2.1% and 1.6% for the flux at the pin-cell level and for the pin-power distribution, respectively. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2018

Discretization Procedure for Linear Dynamical Systems

We describe in detail a method of construction of a discrete linear dynamical model of a controllable object in the recurrent Cauchy form corresponding to an initial continuous dynamical system. We describe discretization algorithms for free and forced motion of a linear continuous dynamical system and propose methods of construction of the state, control, and perturbation transition matrices.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

COMPARISONS OF THE FINITE-ELEMENT-WITH-DISCONTIGUOUS-SUPPORT METHOD TO CONTINUOUS-ENERGY MONTE CARLO FOR PIN-CELL PROBLEMS

The standard multigroup (MG) method for energy discretization of the transport equation can be sensitive to approximations in the weighting spectrum chosen for cross-section averaging. As a result, MG often inaccurately treats important phenomena such as self-shielding variations across a material. From a finite-element viewpoint, MG uses a single fixed basis function (the pre-selected spectrum) within each group, with no mechanism to adapt to local solution behavior. In this work, we introduce the Finite-Element-with-Discontiguous-Support (FEDS) method, whose only approximation with respect to energy is that the angular flux is a linear combination of unknowns multiplied by basis functions. A basis function is non-zero only in the discontiguous set of energy intervals associated with its energy element. Discontiguous energy elements are generalizations of bands and are determined by minimizing a norm of the difference between snapshot spectra and their averages over the energy elements. We begin by presenting the theory of the FEDS method. We then compare to continuous-energy Monte Carlo for one-dimensional slab and two-dimensional pin-cell problem. We find FEDS to be accurate and efficient at producing quantities of interest such as reaction rates and eigenvalues. Results show that FEDS converges at a rate that is approximately first-order in the number of energy elements and that FEDS is less sensitive to weighting spectrum than standard MG.

Cross sections↗
DOE OSTI2015

Hybrid stochastic simulation of reaction-diffusion systems with slow and fast dynamics

In this paper, we present a novel hybrid method to simulate discrete stochastic reaction-diffusion models arising in biochemical signaling pathways. We study moderately stiff systems, for which we can partition each reaction or diffusion channel into either a slow or fast subset, based on its propensity. Numerical approaches missing this distinction are often limited with respect to computational run time or approximation quality. We design an approximate scheme that remedies these pitfalls by using a new blending strategy of the well-established inhomogeneous stochastic simulation algorithm and the tau-leaping simulation method. The advantages of our hybrid simulation algorithm are demonstrated on three benchmarking systems, with special focus on approximation accuracy and efficiency.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2014

A Novel Algorithm for Solving the Multidimensional Neutron Transport Equation on Massively Parallel Architectures

We employ the Integral Transport Matrix Method (ITMM) as the kernel of new parallel solution methods for the discrete ordinates approximation of the within-group neutron transport equation. The ITMM abandons the repetitive mesh sweeps of the traditional source iterations (SI) scheme in favor of constructing stored operators that account for the direct coupling factors among all the cells' fluxes and between the cells' and boundary surfaces' fluxes. The main goals of this work are to develop the algorithms that construct these operators and employ them in the solution process, determine the most suitable way to parallelize the entire procedure, and evaluate the behavior and parallel performance of the developed methods with increasing number of processes, P. The fastest observed parallel solution method, Parallel Gauss-Seidel (PGS), was used in a weak scaling comparison with the PARTISN transport code, which uses the source iteration (SI) scheme parallelized with the Koch-baker-Alcouffe (KBA) method. Compared to the state-of-the-art SI-KBA with diffusion synthetic acceleration (DSA), this new method- even without acceleration/preconditioning-is completitive for optically thick problems as P is increased to the tens of thousands range. For the most optically thick cells tested, PGS reduced execution time by an approximate factor of three for problems with more than 130 million computational cells on P = 32,768. Moreover, the SI-DSA execution times's trend rises generally more steeply with increasing P than the PGS trend. Furthermore, the PGS method outperforms SI for the periodic heterogeneous layers (PHL) configuration problems. The PGS method outperforms SI and SI-DSA on as few as P = 16 for PHL problems and reduces execution time by a factor of ten or more for all problems considered with more than 2 million computational cells on P = 4.096.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS1994

The Dynamics of Some Iterative Implicit Schemes

The global asymptotic nonlinear behavior of some standard iterative procedures in solving nonlinear systems of algebraic equations arising from four implicit linear multistep methods (LMMs) in discretizing 2 x 2 systems of first-order autonomous nonlinear ordinary differential equations is analyzed using the theory of dynamical systems. With the aid of parallel Connection Machines (CM-2 and CM-5), the associated bifurcation diagrams as a function of the time step, and the complex behavior of the associated 'numerical basins of attraction' of these iterative implicit schemes are revealed and compared. Studies showed that all of the four implicit LMMs exhibit a drastic distortion and segmentation but less shrinkage of the basin of attraction of the true solution than standard explicit methods. The numerical basins of attraction of a noniterative implicit procedure mimic more closely the basins of attraction of the differential equations than the iterative implicit procedures for the four implicit LMMs.

Yee, H. C.↗
DOE OSTI2016

γ-ray decay from neutron-bound and unbound states in 95 Mo and a novel technique for spin determination

The emission of γ rays from neutron-bound and neutron-unbound states in 95 Mo, populated in the 94 Mo(d,p) reaction, has been investigated. Charged particles and γ radiation were detected with arrays of annular silicon and Clover-type high-purity Germanium detectors, respectively. Utilizing p-γ and p-γ-γ coincidences, the 95 Mo level scheme was greatly enhanced with 102 new transitions and 43 new states. It agrees well with shell model calculations for excitation energies below ≈2 MeV. From p-γ coincidence data, a new method for the determination of spins of discrete levels is proposed. The method exploits the suppression of high-angular momentum neutron emission from levels with high spins populated in the (d,p) reaction above the neutron separation energy. As a result, spins for almost all 95 Mo levels below 2 MeV (and for a few levels above) have been determined with this method.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2012

Moment-Preserving SN Discretizations for the One-Dimensional Fokker-Planck Equation

The Fokker-Planck equation: (1) Describes the transport and interactions of charged particles, (2) Many small-angle scattering collisions, (3) Asymptotic limit of the Boltzmann equation (Pomraning, 1992), and (4) The Boltzmann collision operator becomes the angular Laplacian. SN angular discretization: (1) Angular flux is collocated at the SN quadrature points, (2) The second-order derivatives in the Laplacian term must be discretized, and (3) Weighted finite-difference method preserves zeroth and first moments (Morel, 1985). Moment-preserving methods: (1) Collocate the Fokker-Planck operator at the SN quadrature points, (2) Develop several related and/or equivalent methods, and (3) Motivated by discretizations for the angular derivative appearing in the transport equation in one-dimensional spherical coordinates.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2025

Consistent Second Moment Methods with Scalable Linear Solvers for Radiation Transport

Second moment methods (SMMs) are developed that are consistent with the discontinuous Galerkin spatial discretization of the discrete ordinates (or S\(_N\)) transport equations. The low-order (LO) diffusion system of equations is discretized with fully consistent P\(_1\), local discontinuous Galerkin (LDG), and interior penalty (IP) methods. A discrete residual approach is used to derive SMM correction terms that make each of the LO systems consistent with the high-order discretization. We show that the consistent methods are more accurate and have better solution quality than independently discretized LO systems, that they preserve the diffusion limit, and that the LDG and IP consistent SMMs can be scalably solved in parallel on a challenging, multimaterial benchmark problem.

97 MATHEMATICS AND COMPUTING↗