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,189 records · Page 66

Fast non-overlapping Schwarz domain decomposition methods for solving the neutron diffusion equation

Studying numerically the steady state of a nuclear core reactor is expensive, in terms of memory storage and computational time. In order to address both requirements, one can use a domain decomposition method, implemented on a parallel computer. We present here such a method for the mixed neutron diffusion equations, discretized with Raviart–Thomas–Nédélec finite elements. This method is based on the Schwarz iterative algorithm with Robin interface conditions to handle communications. We analyse this method from the continuous point of view to the discrete point of view, and we give some numerical results in a realistic highly heterogeneous 3D configuration. Computations are carried out with the MINOS solver of the APOLLO3® neutronics code.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Iterative Discrete Ordinates Solution of the Equation for the Surface-Reflected Radiance

This paper presents a new method of numerical solution of the integral equation for the radiance reflected from an anisotropic surface. The equation relates the radiance at the surface level with BRDF and solutions of the standard radiative transfer problems for a slab with no reflection on its surfaces. It is also shown that the kernel of the equation satisfies the condition of the existence of a unique solution and the convergence of the successive approximations to that solution. The developed method features two basic steps: discretization on a 2D quadrature, and solving the resulting system of algebraic equations with successive over-relaxation method based on the Gauss-Seidel iterative process. Presented numerical examples show good coincidence between the surface-reflected radiance obtained with DISORT and the proposed method. Analysis of contributions of the direct and diffuse (but not yet reflected) parts of the downward radiance to the total solution is performed. Together, they represent a very good initial guess for the iterative process. This fact ensures fast convergence. The numerical evidence is given that the fastest convergence occurs with the relaxation parameter of 1 (no relaxation). An integral equation for BRDF is derived as inversion of the original equation. The potential of this new equation for BRDF retrievals is analyzed. The approach is found not viable as the BRDF equation appears to be an ill-posed problem, and it requires knowledge the surface-reflected radiance on the entire domain of both Sun and viewing zenith angles.

Alexander Radkevich↗

A self-consistent Hamiltonian model of the ponderomotive force and its structure preserving discretization

In the presence of an inhomogeneous oscillatory electric field, charged particles experience a net force, averaged over the oscillatory timescale, known as the ponderomotive force. We derive a one-dimensional Hamiltonian model which self-consistently couples the electromagnetic field to a plasma which experiences the ponderomotive force. We derive a family of structure preserving discretizations of the model of varying order in space and time using conforming and broken finite element exterior calculus spectral element methods. In all variants of our discretization framework, the method is found to conserve the Casimir invariants of the continuous model to machine precision and the energy to the order of the splitting method used.

Physics↗

Helicopter rotor loads using matched asymptotic expansions: User's manual

Computer programs were developed to implement the computational scheme arising from Van Holten's asymptotic method for calculating airloads on a helicopter rotor blade in forward flight, and a similar technique which is based on a discretized version of the method. The basic outlines of the two programs are presented, followed by separate descriptions of the input requirements and output format. Two examples illustrating job entry with appropriate input data and corresponding output are included. Appendices contain a sample table of lift coefficient data for the NACA 0012 air foil and listings of the two programs.

Pierce, G. A.↗

Lattice Boltzmann model for simulation of magnetohydrodynamics

A numerical method, based on a discrete Boltzmann equation, is presented for solving the equations of magnetohydrodynamics (MHD). The algorithm provides advantages similar to the cellular automaton method in that it is local and easily adapted to parallel computing environments. Because of much lower noise levels and less stringent requirements on lattice size, the method appears to be more competitive with traditional solution methods. Examples show that the model accurately reproduces both linear and nonlinear MHD phenomena.

Chen, Shiyi↗

A Tomographic Method for the Reconstruction of Local Probability Density Functions

A method of obtaining the probability density function (PDF) of local properties from path integrated measurements is described. The approach uses a discrete probability function (DPF) method to infer the PDF of the local extinction coefficient from measurements of the PDFs of the path integrated transmittance. The local PDFs obtained using the method are compared with those obtained from direct intrusive measurements in propylene/air and ethylene/air diffusion flames. The results of this comparison are good.

Sivathanu, Y. R.↗

Discontinuous Galerkin algorithms for fully kinetic plasmas

Here, we present a new algorithm for the discretization of the non-relativistic Vlasov–Maxwell system of equations for the study of plasmas in the kinetic regime. Using the discontinuous Galerkin finite element method for the spatial discretization, we obtain a high order accurate solution for the plasma's distribution function. Time stepping for the distribution function is done explicitly with a third order strong-stability preserving Runge–Kutta method. Since the Vlasov equation in the Vlasov–Maxwell system is a high dimensional transport equation, up to six dimensions plus time, we take special care to note various features we have implemented to reduce the cost while maintaining the integrity of the solution, including the use of a reduced high-order basis set. A series of benchmarks, from simple wave and shock calculations, to a five dimensional turbulence simulation, are presented to verify the efficacy of our set of numerical methods, as well as demonstrate the power of the implemented features.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Sparse-grid discontinuous Galerkin methods for the Vlasov–Poisson–Lenard–Bernstein model

Sparse-grid methods have recently gained interest in reducing the computational cost of solving high-dimensional kinetic equations. In this paper, we construct adaptive and hybrid sparse-grid methods for the Vlasov–Poisson–Lenard–Bernstein (VPLB) model. This model has applications to plasma physics and is simulated in two reduced geometries: a 0x3v space homogeneous geometry and a 1x3v slab geometry. Here we use the discontinuous Galerkin (DG) method as a base discretization due to its high-order accuracy and ability to preserve important structural properties of partial differential equations. We utilize a multiwavelet basis expansion to determine the sparse-grid basis and the adaptive mesh criteria. We analyze the proposed sparse-grid methods on a suite of three test problems by computing the savings afforded by sparse-grids in comparison to standard solutions of the DG method. The results are obtained using the adaptive sparse-grid discretization library ASGarD.

97 MATHEMATICS AND COMPUTING↗

Fast Solution of Fully Implicit Runge--Kutta and Discontinuous Galerkin in Time for Numerical PDEs, Part II: Nonlinearities and DAEs

Fully implicit Runge--Kutta (IRK) methods have many desirable accuracy and stability properties as time integration schemes, but high-order IRK methods are not commonly used in practice with large-scale numerical PDEs because of the difficulty of solving the stage equations. This paper introduces a theoretical and algorithmic framework for solving the nonlinear equations that arise from IRK methods (and discontinuous Galerkin discretizations in time) applied to nonlinear numerical PDEs, including PDEs with algebraic constraints. Several new linearizations of the nonlinear IRK equations are developed, offering faster and more robust convergence than the often-considered simplified Newton, as well as an effective preconditioner for the true Jacobian if exact Newton iterations are desired. Inverting these linearizations requires solving a set of block 2 x 2 systems. Under quite general assumptions, it is proven that the preconditioned 2 x 2 operator's condition number is bounded by a small constant close to one, independent of the spatial discretization, spatial mesh, and time step, and with only weak dependence on the number of stages or integration accuracy. Moreover, the new method is built using the same preconditioners needed for backward Euler-type time stepping schemes, so can be readily added to existing codes. The new methods are applied to several challenging fluid flow problems, including the compressible Euler and Navier--Stokes equations, and the vorticity-streamfunction formulation of the incompressible Euler and Navier--Stokes equations. Up to 10th-order accuracy is demonstrated using Gauss IRK, while in all cases fourth-order Gauss IRK requires roughly half the number of preconditioner applications as required by standard Singly diagonally implicit Runge--Kutta methods.

97 MATHEMATICS AND COMPUTING↗

One-Dimensional Ablation with Pyrolysis Gas Flow Using a Full Newton's Method and Finite Control Volume Procedure

The development and verification of a one-dimensional material thermal response code with ablation is presented. The implicit time integrator, control volume finite element spatial discretization, and Newton's method for nonlinear iteration on the entire system of residual equations have been implemented and verified for the thermochemical ablation of internally decomposing materials. This study is a continuation of the work presented in "One-Dimensional Ablation with Pyrolysis Gas Flow Using a Full Newton's Method and Finite Control Volume Procedure" (AIAA-2006-2910), which described the derivation, implementation, and verification of the constant density solid energy equation terms and boundary conditions. The present study extends the model to decomposing materials including decomposition kinetics, pyrolysis gas flow through the porous char layer, and a mixture (solid and gas) energy equation. Verification results are presented for the thermochemical ablation of a carbon-phenolic ablator which involves the solution of the entire system of governing equations.

Amar, Adam J.↗

Implicitly solving phase appearance and disappearance problems using two-fluid six-equation model

Phase appearance and disappearance issue presents serious numerical challenges in two-phase flow simulations using the two-fluid six-equation model. Numerical challenges arise from the singular equation system when one phase is absent, as well as from the discontinuity in the solution space when one phase appears or disappears. In this work, a high-resolution spatial discretization scheme on staggered grids and fully implicit methods were applied for the simulation of two-phase flow problems using the two-fluid six-equation model. A Jacobian-free Newton-Krylov (JFNK) method was used to solve the discretized nonlinear problem. An improved numerical treatment was proposed and proved to be effective to handle the numerical challenges. The treatment scheme is conceptually simple, easy to implement, and does not require explicit truncations on solutions, which is essential to conserve mass and energy. Various types of phase appearance and disappearance problems relevant to thermal-hydraulics analysis have been investigated, including a sedimentation problem, an oscillating manometer problem, a non-condensable gas injection problem, a single-phase flow with heat addition problem and a subcooled flow boiling problem. Successful simulations of these problems demonstrate the capability and robustness of the proposed numerical methods and numerical treatments. As a result, volume fraction of the absent phase can be calculated effectively as zero.

42 ENGINEERING↗

Entropy stable modal discontinuous Galerkin schemes and wall boundary conditions for the compressible Navier-Stokes equations

Entropy stable schemes ensure that physically meaningful numerical solutions also satisfy a semi-discrete entropy inequality under appropriate boundary conditions. Here in this work, we describe a discretization of viscous terms in the compressible Navier-Stokes equations which enables a simple and explicit imposition of entropy stable no-slip and reflective (symmetry) wall boundary conditions for discontinuous Galerkin (DG) discretizations. Specifically, we derive methods for imposing adiabatic no-slip and reflective (symmetry) boundary conditions for modal entropy stable DG formulations which preserve a semi-discrete entropy inequality. Numerical results confirm the robustness and accuracy of the proposed approaches.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Conservative high-order data transfer method on generalized polygonal meshes

A conservative data transfer (remap) between two meshes is an important step of arbitrary Lagrangian-Eulerian (ALE) hydrodynamics simulations. High-order numerical methods for ALE simulations require both high-order (curvilinear) meshes and high-order remap algorithms. Here we develop a conservative and bounds-preserving method for accurate remapping of discrete fields on generalized polygonal meshes with curvilinear edges. The properties of the proposed method are studied theoretically and numerically for various (smooth and non-smooth) mesh deformations and discrete fields that represent smooth and discontinuous functions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Analytic method for calculating properties of random walks on networks

A method for calculating the properties of discrete random walks on networks is presented. The method divides complex networks into simpler units whose contribution to the mean first-passage time is calculated. The simplified network is then further iterated. The method is demonstrated by calculating mean first-passage times on a segment, a segment with a single dangling bond, a segment with many dangling bonds, and a looplike structure. The results are analyzed and related to the applicability of the Einstein relation between conductance and diffusion.

Goldhirsch, I.↗

Aerodynamic shape optimization using sensitivity analysis on third-order Euler equations

Two major advancements of an aerodynamic optimization method with two design variables are described. The first is represnted by an improved flow prediction method that uses the third-order accurate discretization of the Euler equations. This method makes it possible to predict the flowfield of a perturbed shape which generates shocks and other large gradients without intermediate CFD analysis. The second advancement is the use of every surface grid point as a design variable in the aerodynamic shape optimization problem. The improved algorithm is demonstrated by optimizing the ramp shape of a scramjet-afterbody configuration for maximum axial thrust. It is concluded that the improved flow-field prediction method eliminates most of the flow analysis and a priori guessing of all possible shapes from which the optimum is to be selected.

Baysal, Oktay↗

Using Directional Diffusion Coefficients for Nonlinear Diffusion Acceleration of the First Order SN Equations in Near-Void Regions

The common definition of the diffusion coeffcient as the inverse of three times the transport cross section is not compat- ible with voids. Morel introduced a non-local tensor diffusion coeffcient that remains finite in voids[1]. It can be obtained by solving an auxiliary transport problem without scattering or fission. Larsen and Trahan successfully applied this diffusion coeffcient for enhancing the accuracy of diffusion solutions of very high temperature reactor (VHTR) problems that feature large, optically thin channels in the z-direction [2]. It is demonstrated that a significant reduction of error can be achieved in particular in the optically thin region. Along the same line of thought, non-local diffusion tensors are applied modeling the TREAT reactor confirming the findings of Larsen and Trahan [3]. Previous work of the authors have introduced a flexible Nonlinear-Diffusion Acceleration (NDA) method for the first order S N equations discretized with the discontinuous finite element method (DFEM), [4], [5], [6]. This NDA method uses a scalar diffusion coeffcient in the low-order system that is obtained as the flux weighted average of the inverse transport cross section. Hence, it su?ers from very large and potentially unbounded diffusion coeffcients in the low order problem. However, it was noted that the choice of the diffusion coeffcient does not influence consistency of the method at convergence and hence the di?usion coeffcient is essentially a free parameter. The choice of the di?usion coeffcient does, however, affect the convergence behavior of the nonlinear di?usion iterations. Within this work we use Morel’s non-local di?usion coef- ficient in the aforementioned NDA formulation in lieu of the flux weighted inverse of three times the transport cross section. The goal of this paper is to demonstrate that significant en- hancement of the spectral properties of NDA can be achieved in near void regions. For testing the spectral properties of the NDA with non-local diffusion coeffcients, the periodical horizontal interface problem is used [7]. This problem consists of alternating stripes of optically thin and thick materials both of which feature scattering ratios close to unity.

97 MATHEMATICS AND COMPUTING↗

The Lattice Boltzmann Method applied to neutron transport

In this paper the applicability of the Lattice Boltzmann Method to neutron transport is investigated. One of the main features of the Lattice Boltzmann method is the simultaneous discretization of the phase space of the problem, whereby particles are restricted to move on a lattice. An iterative solution of the operator form of the neutron transport equation is presented here, with the first collision source as the starting point of the iteration scheme. A full description of the discretization scheme is given, along with the quadrature set used for the angular discretization. An angular refinement scheme is introduced to increase the angular coverage of the problem phase space and to mitigate lattice ray effects. The method is applied to a model problem to investigate its applicability to neutron transport and the results are compared to a reference solution calculated, using MCNP. (authors)

97 MATHEMATICS AND COMPUTING↗

On Multifunctional Collaborative Methods in Engineering Science

Multifunctional methodologies and analysis procedures are formulated for interfacing diverse subdomain idealizations including multi-fidelity modeling methods and multi-discipline analysis methods. These methods, based on the method of weighted residuals, ensure accurate compatibility of primary and secondary variables across the subdomain interfaces. Methods are developed using diverse mathematical modeling (i.e., finite difference and finite element methods) and multi-fidelity modeling among the subdomains. Several benchmark scalar-field and vector-field problems in engineering science are presented with extensions to multidisciplinary problems. Results for all problems presented are in overall good agreement with the exact analytical solution or the reference numerical solution. Based on the results, the integrated modeling approach using the finite element method for multi-fidelity discretization among the subdomains is identified as most robust. The multiple method approach is advantageous when interfacing diverse disciplines in which each of the method's strengths are utilized.

Ransom, Jonathan B.↗