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,783 records · Page 99
All sourcesNASA NTRSDOE OSTI
NASA NTRS2002

Very Large Scale Optimization

The purpose of this research under the NASA Small Business Innovative Research program was to develop algorithms and associated software to solve very large nonlinear, constrained optimization tasks. Key issues included efficiency, reliability, memory, and gradient calculation requirements. This report describes the general optimization problem, ten candidate methods, and detailed evaluations of four candidates. The algorithm chosen for final development is a modern recreation of a 1960s external penalty function method that uses very limited computer memory and computational time. Although of lower efficiency, the new method can solve problems orders of magnitude larger than current methods. The resulting BIGDOT software has been demonstrated on problems with 50,000 variables and about 50,000 active constraints. For unconstrained optimization, it has solved a problem in excess of 135,000 variables. The method includes a technique for solving discrete variable problems that finds a "good" design, although a theoretical optimum cannot be guaranteed. It is very scalable in that the number of function and gradient evaluations does not change significantly with increased problem size. Test cases are provided to demonstrate the efficiency and reliability of the methods and software.

Vanderplaats, Garrett↗
DOE OSTI2012

A hybrid transport-diffusion Monte Carlo method for frequency-dependent radiative-transfer simulations

Discrete Diffusion Monte Carlo (DDMC) is a technique for increasing the efficiency of Implicit Monte Carlo radiative-transfer simulations in optically thick media. In DDMC, particles take discrete steps between spatial cells according to a discretized diffusion equation. Each discrete step replaces many smaller Monte Carlo steps, thus improving the efficiency of the simulation. In this paper, we present an extension of DDMC for frequency-dependent radiative transfer. We base our new DDMC method on a frequency-integrated diffusion equation for frequencies below a specified threshold, as optical thickness is typically a decreasing function of frequency. Above this threshold we employ standard Monte Carlo, which results in a hybrid transport-diffusion scheme. With a set of frequency-dependent test problems, we confirm the accuracy and increased efficiency of our new DDMC method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2013

Second-order discretization in space and time for radiation hydrodynamics

We present a method for solving the equations of radiation hydrodynamics that is second-order accurate in space and time. This method combines the MUSCL-Hancock method for solving the Euler equations with the TR/BDF2 scheme in time for solving the equations of radiative transfer. We use an LDFEM to discretize the radiative transfer equations in space, which, though uncommon for radiation diffusion calculations, is a standard for radiation transport applications. We address the challenges inherent to using different spatial discretizations for the hydrodynamics and radiation and demonstrate how these may be overcome. We define our method for a 1-D model of compressible fluid dynamics coupled with grey radiation diffusion. Using the method of manufactured solutions, we show that the method is second-order accurate in space and time for both the equilibrium diffusion and streaming limit. (authors)

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Low-Order Preconditioning for the High-Order Finite Element de Rham Complex

Here, we present a unified framework for constructing spectrally equivalent low-order-refined discretizations for the high-order finite element de Rham complex. This theory covers diffusion problems in H 1 , H(curl), and H(div) and is based on combining a low-order discretization posed on a refined mesh with a high-order basis for Nédélec and Raviart–Thomas elements that makes use of the concept of polynomial histopolation (polynomial fitting using prescribed mean values over certain regions). This spectral equivalence, coupled with algebraic multigrid methods constructed using the low-order discretization, results in highly scalable matrix-free preconditioners for high-order finite element problems in the full de Rham complex. Additionally, a new lowest-order (piecewise constant) preconditioner is developed for high-order interior penalty discontinuous Galerkin (DG) discretizations, for which spectral equivalence results and convergence proofs for algebraic multigrid methods are provided. In all cases, the spectral equivalence results are independent of polynomial degree and mesh size; for DG methods, they are also independent of the penalty parameter. These new solvers are flexible and easy to use; any “black-box” preconditioner for low-order problems can be used to create an effective and efficient preconditioner for the corresponding high-order problem. A number of numerical experiments are presented, based on an implementation in the finite element library MFEM. A range of challenging three-dimensional problems are used to corroborate the theoretical properties and demonstrate the flexibility and scalability of the method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Generating one-column grids with fractal flow dimension

The grid generation capability built into the numerical simulator TOUGH for multi-phase fluid and heat flow through geologic media can create one-column grids with linear or radial geometry, corresponding to one-dimensional or two-dimensional radial flow, respectively. The integral-finite-difference-method that TOUGH employs for spatial discretization makes it very simple to generalize the grid-generation algorithm from integer to non-integer (fractal) flow dimension. Here the grid-generation algorithm is generalized to create one-column grids with fractal flow dimension ranging from less than 1 to 3. The fractal grid generation method is verified by comparing numerical simulation results to an analytical solution for a generalized Theis solution for integer and non-integer flow dimensions between 0.4 and 3. It is then applied to examine gas production decline curves from hydraulically fractured shale that is modeled as a fractal-dimensioned fracture network with flow dimensions between 0.25 and 3. Grids with fractal flow dimension are useful for representing flow through fracture networks or highly heterogeneous geologic media with fractal geometry, and may be particularly useful for inverse methods.

58 GEOSCIENCES↗
DOE OSTI2021

Modeling and Simulation of Inrush Currents in Harmonic Domain

Modeling and simulation capabilities are critical to the stability analysis and evaluation of power distribution systems, with respect to the emphasis on resiliency, microgrids, and distributed energy resources. In this paper, a computational method in the harmonic domain is proposed for the periodic steady-state analysis of the nonlinear inrush current phenomenon. The efficient inrush calculation facilitates the predictions of current amplitudes for the power system operation and control. To demonstrate the accuracy and efficiency, simulation results in the harmonic domain are compared with results from PSCAD in an electromagnetic timescale, as well as the authors’ previous works in the frequency-domain. Impacts of the settings of both offset flux and interested harmonic order are discussed. In addition, within the proposed harmonic-domain method, a general approach that utilizes the discrete Fourier transform to obtain the response of a nonlinear device from a stimulus represented in the frequency-domain is utilized. This method can also be extended to perform the transient analysis in future, using trapezoidal rule for the integration.

Xie, Jing↗
DOE OSTI2023

MPACT 4.4 Theory Manual

MPACT is a three-dimensional (3D) full-core neutron transport code capable of calculating subpin power distributions. Calculations are based on the Boltzmann transport equation for neutron fluxes for problems in which the detailed geometrical configuration of fuel components such as the pellet and cladding are explicitly retained. The cross-section data needed for the neutron transport calculation are obtained directly from a multigroup cross section library, which has traditionally been used by lattice physics codes to generate few-group homogenized cross sections for nodal core simulators. Hence, MPACT assumes neither a priori homogenization nor group condensation for the full core spatial solution. The 3D MPACT transport solution can be obtained using the method of characteristics (MOC), which employs discrete ray tracing within each fuel pin. However, for practical reactor applications, the direct application of MOC to 3D core configurations requires an excessive amount of memory and computing time due to the very large number of rays. For practical 3D full-core calculations, MPACT commonly uses an approximate “2D/1D” method that treats the radial (x and y) variables differently from the axial (z) variable. In particular, the radial dependence of the solution is calculated using transport theory, and the axial dependence is calculated using diffusion or P 3 theory. The 2D/1D method requires the core to be divided into a vertical stack of axial slices with a thickness of Δ z ≈ 5–10 cm. Each axial slice is divided radially into coarse spatial cells with boundaries that usually constitute the pin cell boundaries, for which Δ x = Δ y ≈ 1.5 cm. Then, each coarse radial cell (pin cell) is divided into 50–100 fine radial cells, which resolve the angular flux in the fuel, cladding, and moderator regions.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2018

Bayesian Static Parameter Estimation for Partially Observed Diffusions via Multilevel Monte Carlo

In this article we consider static Bayesian parameter estimation for partially observed diffusions that are discretely observed. We work under the assumption that one must resort to discretizing the underlying diffusion process, for instance, using the Euler--Maruyama method. Given this assumption, we show how one can use Markov chain Monte Carlo (MCMC) and particularly particle MCMC [C. Andrieu, A. Doucet, and R. Holenstein, J. R. Stat. Soc. Ser. B Stat. Methodol., 72 (2010), 269--342] to implement a new approximation of the multilevel (ML) Monte Carlo (MC) collapsing sum identity. Our approach comprises constructing an approximate coupling of the posterior density of the joint distribution over parameter and hidden variables at two different discretization levels and then correcting by an importance sampling method. The variance of the weights are independent of the length of the observed data set. The utility of such a method is that, for a prescribed level of mean square error, the cost of this MLMC method is provably less than i.i.d. sampling from the posterior associated to the most precise discretization. However the method here comprises using only known and efficient simulation methodologies. Finally, the theoretical results are illustrated by inference of the parameters of two prototypical processes given noisy partial observations of the process: the first is an Ornstein--Uhlenbeck process and the second is a more general Langevin equation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

A projection gradient method for computing ground state of spin-2 Bose–Einstein condensates

In this paper, a projection gradient method is presented for computing ground state of spin-2 Bose–Einstein condensates (BEC). We first propose the general projection gradient method for solving energy functional minimization problem under multiple constraints, in which the energy functional takes real functions as independent variables. We next extend the method to solve a similar problem, where the energy functional now takes complex functions as independent variables. We finally employ the method into finding the ground state of spin-2 BEC. The key of our method is: by constructing continuous gradient flows (CGFs), the ground state of spin-2 BEC can be computed as the steady state solution of such CGFs. We discretized the CGFs by a conservative finite difference method along with a proper way to deal with the nonlinear terms. We show that the numerical discretization is normalization and magnetization conservative and energy diminishing. Numerical results of the ground state and their energy of spin-2 BEC are reported to demonstrate the effectiveness of the numerical method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

A note on the reliability of goal-oriented error estimates for Galerkin finite element methods with nonlinear functionals

Here, we consider estimating the discretization error in a nonlinear functional J (u) in the setting of an abstract variational problem: find u ϵ $\mathscr{V}$ such that B (u, φ) = L (φ) ∀φ ϵ $\mathscr{V}$, as approximated by a Galerkin finite element method. Here, $\mathscr{V}$ is a Hilbert space, B (. , .) is a bilinear form, and L (∙) is a linear functional. We consider well-known error estimates η of the form J (u) - J (u h ) ≈ η = L (z) - B (u h , z), where u h denotes a finite element approximation to u, and z denotes the solution to an auxiliary adjoint variational problem. We show that there exist nonlinear functionals for which error estimates of this form are not reliable, even in the presence of an exact adjoint solution z. An estimate η is said to be reliable if there exists a constant C ϵ $\mathbb{R}$ >0 independent of u h such that |J (u) - J (u h )| ≤ C|η|. We present several example pairs of bilinear forms and nonlinear functionals where reliability of η is not achieved.

A posteriori↗
DOE OSTI2013

Subcell resolution in simplex stochastic collocation for spatial discontinuities

Subcell resolution has been used in the Finite Volume Method (FVM) to obtain accurate approximations of discontinuities in the physical space. Stochastic methods are usually based on local adaptivity for resolving discontinuities in the stochastic dimensions. However, the adaptive refinement in the probability space is ineffective in the non-intrusive uncertainty quantification framework, if the stochastic discontinuity is caused by a discontinuity in the physical space with a random location. The dependence of the discontinuity location in the probability space on the spatial coordinates then results in a staircase approximation of the statistics, which leads to first-order error convergence and an underprediction of the maximum standard deviation. To avoid these problems, we introduce subcell resolution into the Simplex Stochastic Collocation (SSC) method for obtaining a truly discontinuous representation of random spatial discontinuities in the interior of the cells discretizing the probability space. The presented SSC–SR method is based on resolving the discontinuity location in the probability space explicitly as function of the spatial coordinates and extending the stochastic response surface approximations up to the predicted discontinuity location. The applications to a linear advection problem, the inviscid Burgers’ equation, a shock tube problem, and the transonic flow over the RAE 2822 airfoil show that SSC–SR resolves random spatial discontinuities with multiple stochastic and spatial dimensions accurately using a minimal number of samples.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2014

Geometric multigrid for an implicit-time immersed boundary method

The immersed boundary (IB) method is an approach to fluid-structure interaction that uses Lagrangian variables to describe the deformations and resulting forces of the structure and Eulerian variables to describe the motion and forces of the fluid. Explicit time stepping schemes for the IB method require solvers only for Eulerian equations, for which fast Cartesian grid solution methods are available. Such methods are relatively straightforward to develop and are widely used in practice but often require very small time steps to maintain stability. Implicit-time IB methods permit the stable use of large time steps, but efficient implementations of such methods require significantly more complex solvers that effectively treat both Lagrangian and Eulerian variables simultaneously. Moreover, several different approaches to solving the coupled Lagrangian-Eulerian equations have been proposed, but a complete understanding of this problem is still emerging. This paper presents a geometric multigrid method for an implicit-time discretization of the IB equations. This multigrid scheme uses a generalization of box relaxation that is shown to handle problems in which the physical stiffness of the structure is very large. Numerical examples are provided to illustrate the effectiveness and efficiency of the algorithms described herein. Finally, these tests show that using multigrid as a preconditioner for a Krylov method yields improvements in both robustness and efficiency as compared to using multigrid as a solver. They also demonstrate that with a time step 100–1000 times larger than that permitted by an explicit IB method, the multigrid-preconditioned implicit IB method is approximately 50–200 times more efficient than the explicit method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

A non-conforming finite volume element method for the two-dimensional Navier–Stokes/Darcy system

We consider the discretization of the stationary Navier–Stokes/Darcy system in a two-dimensional domain by the non-conforming finite volume element method. We use the standard formulation of the Navier–Stokes/Darcy system in the primitive variables and take as approximation space the non-conforming P{sub 1} elements for velocity and piezometric head and piecewise constant elements for the hydrostatic pressure. We prove that the unique solution of the non-conforming finite volume element method converges to the true solution with optimal order for velocity and piezometric head in discrete H{sup 1} norm and for pressure in discrete L{sup 2} norm, respectively. Finally, some numerical experiments are presented to validate our theoretical results.

42 ENGINEERING↗
DOE OSTI2022

Vibrational levels of a generalized Morse potential

A Generalized Morse Potential (GMP) is an extension of the Morse Potential (MP) with an additional exponential term and an additional parameter that compensate for MP’s erroneous behavior in the long range part of the interaction potential. Because of the additional term and parameter, the vibrational levels of the GMP cannot be solved analytically, unlike the case for the MP. We present several numerical approaches for solving the vibrational problem of the GMP based on Galerkin methods, namely, the Laguerre Polynomial Method (LPM), the Symmetrized LPM, and the Polynomial Expansion Method (PEM), and apply them to the vibrational levels of the homonuclear diatomic molecules B 2 , O 2 , and F 2 , for which high level theoretical near full configuration interaction (CI) electronic ground state potential energy surfaces and experimentally measured vibrational levels have been reported. Overall, the LPM produces vibrational states for the GMP that are converged to within spectroscopic accuracy of 0.01 cm –1 in between 1 and 2 orders of magnitude faster and with much fewer basis functions/grid points than the Colbert–Miller Discrete Variable Representation (CN-DVR) method for the three homonuclear diatomic molecules examined in this study.

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

High order explicit local time stepping methods for hyperbolic conservation laws

In this paper we present and analyze a general framework for constructing high order explicit local time stepping (LTS) methods for hyperbolic conservation laws. In particular, we consider the model problem discretized by Runge-Kutta discontinuous Galerkin (RK-DG) methods and design LTS algorithms based on the strong stability preserving Runge-Kutta (SSP-RK) schemes, that allow spatially variable time step sizes to be used for time integration in different regions of the computational domain. The proposed algorithms are of predictor-corrector type, in which the interface information along the time direction is first predicted based on the SSP-RK approximations and Taylor expansions, and then the fluxes over the region of the interface are corrected to conserve mass exactly at each time step. Following the proposed framework, we detail the corresponding LTS schemes with accuracy up to the fourth order, and prove their conservation property and nonlinear stability for the scalar conservation laws. Numerical experiments are also presented to demonstrate excellent performance of the proposed LTS algorithms.

58 GEOSCIENCES↗
NASA NTRS1989

A Transient Response Method for Linear Coupled Substructures

A method is presented for determining the transient response of a discrete coordinate model of a linear structural system composed of substructures. The method is applicable to systems consisting of any number of substructures, both determinate and indeterminate interface boundaries, and any topological arrangement of the substructures. The method is simple to implement from a computational point of view because the equations of motion of each of the substructures are solved independently, and the interface boundary compatibility conditions are enforced at each integration time step by a matrix multiplication. The method is demonstrated for a structural system consisting of two beam segments and acted upon by a time dependent force. The numerical results from the demonstration problem validates the accuracy of the method. The application of this method to structural systems with changing interface boundary conditions between substructures is discussed.

Admire, J. R.↗
DOE OSTI2012

High-Order Curvilinear Finite Element Methods for Lagrangian Hydrodynamics [High Order Curvilinear Finite Elements for Lagrangian Hydrodynamics]

The numerical approximation of the Euler equations of gas dynamics in a movingLagrangian frame is at the heart of many multiphysics simulation algorithms. Here, we present a general framework for high-order Lagrangian discretization of these compressible shock hydrodynamics equations using curvilinear finite elements. This method is an extension of the approach outlined in [Dobrev et al., Internat. J. Numer. Methods Fluids, 65 (2010), pp. 1295--1310] and can be formulated for any finite dimensional approximation of the kinematic and thermodynamic fields, including generic finite elements on two- and three-dimensional meshes with triangular, quadrilateral, tetrahedral, or hexahedral zones. We discretize the kinematic variables of position and velocity using a continuous high-order basis function expansion of arbitrary polynomial degree which is obtained via a corresponding high-order parametric mapping from a standard reference element. This enables the use of curvilinear zone geometry, higher-order approximations for fields within a zone, and a pointwise definition of mass conservation which we refer to as strong mass conservation. Moreover, we discretize the internal energy using a piecewise discontinuous high-order basis function expansion which is also of arbitrary polynomial degree. This facilitates multimaterial hydrodynamics by treating material properties, such as equations of state and constitutive models, as piecewise discontinuous functions which vary within a zone. To satisfy the Rankine--Hugoniot jump conditions at a shock boundary and generate the appropriate entropy, we introduce a general tensor artificial viscosity which takes advantage of the high-order kinematic and thermodynamic information available in each zone. Finally, we apply a generic high-order time discretization process to the semidiscrete equations to develop the fully discrete numerical algorithm. Our method can be viewed as the high-order generalization of the so-called staggered-grid hydrodynamics (SGH) approach and we show that under specific low-order assumptions, we exactly recover the classical SGH method. We also present numerical results from an extensive series of verification tests that demonstrate several important practical advantages of using high-order finite elements in this context.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2016

Hierarchy of forward-backward stochastic Schrödinger equation

Driven by the impetus to simulate quantum dynamics in photosynthetic complexes or even larger molecular aggregates, we have established a hierarchy of forward-backward stochastic Schrödinger equation in the light of stochastic unravelling of the symmetric part of the influence functional in the path-integral formalism of reduced density operator. The method is numerically exact and is suited for Debye-Drude spectral density, Ohmic spectral density with an algebraic or exponential cutoff, as well as discrete vibrational modes. The power of this method is verified by performing the calculations of time-dependent population differences in the valuable spin-boson model from zero to high temperatures. By simulating excitation energy transfer dynamics of the realistic full FMO trimer, some important features are revealed.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗