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 199 records · Page 11
All sourcesNASA NTRSDOE OSTI
NASA NTRS2004

Large-Eddy Simulation of Laminar-Turbulent Transition in a Swept-Wing Boundary Layer

A continuous adjoint approach for obtaining sensitivity derivatives on unstructured grids is developed and analyzed. The derivation of the costate equations is presented, and a second-order accurate discretization method is described. The relationship between the continuous formulation and a discrete formulation is explored for inviscid, as well as for viscous flow. Several limitations in a strict adherence to the continuous approach are uncovered, and an approach that circumvents these difficulties is presented. The issue of grid sensitivities, which do not arise naturally in the continuous formulation, is investigated and is observed to be of importance when dealing with geometric singularities. A method is described for modifying inviscid and viscous meshes during the design cycle to accommodate changes in the surface shape. The accuracy of the sensitivity derivatives is established by comparing with finite-difference gradients and several design examples are presented.

Huai, X.↗
DOE OSTI2023

A sharp immersed method for 2D flow-body interactions using the vorticity-velocity Navier-Stokes equations

Immersed methods discretize boundary conditions for complex geometries on background Cartesian grids. Here, this makes such methods especially suitable for two-way coupled flow-body problems, where the body mechanics are partially driven by hydrodynamic forces. However, for the vorticity-velocity form of the Navier-Stokes equations, existing immersed geometry discretizations for two-way coupled problems only achieve first order spatial accuracy near solid boundaries. Here we introduce a sharp-interface approach based on the immersed interface method to handle the one- and two-way coupling between an incompressible flow and one or more rigid bodies using the 2D vorticity-velocity Navier-Stokes equations. Our main contributions are three-fold. First, we develop and analyze a moving boundary treatment for sharp immersed methods that can be applied to PDEs with implicitly defined boundary conditions, such as those commonly imposed on the vorticity field. Second, we develop a two-way coupling methodology for the vorticity-velocity Navier-Stokes equations based on control-volume momentum balance that does not require the pressure field. Third, we show through extensive testing and validation that our resulting flow-body solver reaches second-order accuracy for most practical scenarios, and provides significant efficiency benefits compared to a representative first-order approach.

42 ENGINEERING↗
NASA NTRS1991

A comparison of numerical methods for the Rayleigh equation in unbounded domains

A second-order finite difference and two spectral methods, including a Chebyshev tau and a Chebyshev collocation method were implemented to determine the linear hydrodynamic stability of an unbounded shear flow. The velocity profile of the basic flow in the stability analysis mimicks that of a one-stream free mixing layer. Local and global eigenvalue solution methods are used to determine individual eigenvalues and the eigenvalue spectrum, respectively. The calculated eigenvalue spectrum includes a discrete mode, a continuous spectrum associated with the equation singularity and a continuous spectrum associated with the domain unboundedness. The efficiency and the accuracy of these discretization methods in the prediction of the eigensolutions of the discrete mode were evaluated by comparison with a conventional shooting procedure. Their capabilities in mapping out the continuous eigenvalue spectra are also discussed.

Liou, W. W.↗
DOE OSTI2020

A conservative, consistent, and scalable meshfree mimetic method

Mimetic methods discretize divergence by restricting the Gauss theorem to mesh cells. Because point clouds lack such geometric entities, construction of a compatible meshfree divergence remains a challenge. In this work, we define an abstract Meshfree Mimetic Divergence (MMD) operator on point clouds by contraction of field and virtual face moments. This MMD satisfies a discrete divergence theorem, provides a discrete local conservation principle, and is first-order accurate. We consider two MMD instantiations. The first one assumes a background mesh and uses generalized moving least squares (GMLS) to obtain the necessary field and face moments. This MMD instance is appropriate for settings where a mesh is available but its quality is insufficient for a robust and accurate mesh-based discretization. The second MMD operator retains the GMLS field moments but defines virtual face moments using computationally efficient weighted graph-Laplacian equations. This MMD instance does not require a background grid and is appropriate for applications where mesh generation creates a computational bottleneck. It allows one to trade an expensive mesh generation problem for a scalable algebraic one, without sacrificing compatibility with the divergence operator. We demonstrate the approach by using the MMD operator to obtain a virtual finite-volume discretization of conservation laws on point clouds. Finally, numerical results in the paper confirm the mimetic properties of the method and show that it behaves similarly to standard finite volume methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2016

Divergence preserving reconstruction of the nodal components of a vector field from its normal components to edges

We have developed a new divergence preserving method for the reconstruction of the Cartesian components of a vector field from the orthogonal projection of a vector field to the normals to edges in two dimensional. In this method, discrete divergences computed from the nodal components and from the normal ones are exactly the same. Our new method consists of two stages. At the first stage, we use an extended version of the local procedure described in [J. Comput. Phys., 139:406–409, 1998] to obtain a ‘reference’ nodal vector. This local procedure is exact for linear vector fields; however, the discrete divergence is not preserved. Then, we formulate a constrained optimization problem, in which this reference vector plays the role of a target, and the divergence constraints are enforced by using Lagrange multipliers. It leads to the solution of ‘elliptic’ like discrete equations for the cell-centered Lagrange multipliers. The new global divergence preserving method is exact for linear vector fields. Here in this paper, we describe all details of our new method and present numerical results, which confirm our theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1991

Time-dependent solutions of viscous incompressible flows in moving co-ordinates

A time-accurate solution method for the incompressible Navier-Stokes equations in generalized moving coordinates is presented. A finite-volume discretization method that satisfies the geometric conservation laws for time-varying computational cells is used. The discrete equations are solved by a fractional-step solution procedure. The solution is second-order-accurate in space and first-order-accurate in time. The pressure and the volume fluxes are chosen as the unknowns to facilitate the formulation of a consistent Poisson equation and thus to obtain a robust Poisson solver with favorable convergence properties. The method is validated by comparing the solutions with other numerical and experimental results. Good agreement is obtained in all cases.

Rosenfeld, Moshe↗
NASA NTRS1978

Solution of axisymmetric and two-dimensional inviscid flow over blunt bodies by the method of lines

Comparisons with experimental data and the results of other computational methods demonstrated that very accurate solutions can be obtained by using relatively few lines with the method of lines approach. This method is semidiscrete and has relatively low core storage requirements as compared with fully discrete methods since very little data were stored across the shock layer. This feature is very attractive for three dimensional problems because it enables computer storage requirements to be reduced by approximately an order of magnitude. In the present study it was found that nine lines was a practical upper limit for two dimensional and axisymmetric problems. This condition limits application of the method to smooth body geometries where relatively few lines would be adequate to describe changes in the flow variables around the body. Extension of the method to three dimensions was conceptually straightforward; however, three dimensional applications would also be limited to smooth body geometries although not necessarily to total of nine lines.

Hamilton, H. H., II↗
NASA NTRS1996

Multigrid and Krylov Subspace Methods for the Discrete Stokes Equations

Discretization of the Stokes equations produces a symmetric indefinite system of linear equations. For stable discretizations, a variety of numerical methods have been proposed that have rates of convergence independent of the mesh size used in the discretization. In this paper, we compare the performance of four such methods: variants of the Uzawa, preconditioned conjugate gradient, preconditioned conjugate residual, and multigrid methods, for solving several two-dimensional model problems. The results indicate that where it is applicable, multigrid with smoothing based on incomplete factorization is more efficient than the other methods, but typically by no more than a factor of two. The conjugate residual method has the advantage of being both independent of iteration parameters and widely applicable.

Elman, Howard C.↗
DOE OSTI2019

Thermal Analysis Of Saltstone Disposal Units

SRR requested that SRNL develop a two-dimensional computer simulation model to be capable of predicting grout temperatures attained in Saltstone Disposal Units (SDUs) during the transient addition of saltstone grout and its subsequent storage period. A simulation model was developed to calculate the transient grout temperatures of the SDU facility by taking an axisymmetric and two-dimensional Computational Fluid Dynamics (CFD) approach. The final performance calculations were based on the conduction and radiation model without a convection cooling mechanism for conservative estimate of the grout temperatures and computational efficiency. While convection within the SDU is disabled in the current calculations, the simulation model has the capability of turning convection back on if desired by the user. Hence, the thermal model in its current configuration is best characterized as a finite-volume heat transfer model. However, given that the model can account for convection if desired by the user, it will be referred to as a CFD model. The grout material contains a transient heat source due to the exothermic hydration reactions of the cementitious material mixed with salt solution. The model can predict the transient temperatures at point locations within the poured grout and the overlying vapor space, and at the interior and exterior surfaces of the structure. The thermal model has been developed for two SDUs at the Savannah River Site (SRS); namely, SDU 2A and SDU 6. SDU 2A is a cylindrical unit measuring 150 feet (ft) in diameter, 22 ft tall, and holds approximately three million gallons of grout. SDU 6 is 375 ft in diameter and 43 ft high with a capacity of over thirty million gallons. Prior to performing the thermal calculations for the SDU 6 facility, the benchmarking test for the smaller SDU 2A unit was performed to establish the solution method and to verify the computational results using existing thermocouple data. Based on the Lagrangian discrete method and boundary conditions established by the SDU 2A benchmarking test, the CFD calculations were performed to predict the transient temperatures at local positions of the poured grout and air spaces within the SDU 6 structure.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2022

A scalable DG solver for the electroneutral Nernst-Planck equations

The robust, scalable simulation of flowing electrochemical systems is increasingly important due to the synergy between intermittent renewable energy and electrochemical technologies such as energy storage and chemical manufacturing. The high Péclet regime of many such applications prevents the use of off-the-shelf discretization methods. In this work, we present a high-order Discontinuous Galerkin scheme for the electroneutral Nernst-Planck equations. The chosen charge conservation formulation allows for the specific treatment of the different physics: upwinding for advection and migration, and interior penalty for diffusion of ionic species as well the electric potential. Similarly, the formulation enables different treatments in the preconditioner: AMG for the potential blocks and ILU-based methods for the advection-dominated concentration blocks. Here we evaluate the convergence rate of the discretization scheme through numerical tests. Strong scaling results for two preconditioning approaches are shown for a large 3D flow-plate reactor example.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS1994

New Developments in the Method of Space-Time Conservation Element and Solution Element-Applications to Two-Dimensional Time-Marching Problems

A new numerical discretization method for solving conservation laws is being developed. This new approach differs substantially in both concept and methodology from the well-established methods, i.e., finite difference, finite volume, finite element, and spectral methods. It is motivated by several important physical/numerical considerations and designed to avoid several key limitations of the above traditional methods. As a result of the above considerations, a set of key principles for the design of numerical schemes was put forth in a previous report. These principles were used to construct several numerical schemes that model a 1-D time-dependent convection-diffusion equation. These schemes were then extended to solve the time-dependent Euler and Navier-Stokes equations of a perfect gas. It was shown that the above schemes compared favorably with the traditional schemes in simplicity, generality, and accuracy. In this report, the 2-D versions of the above schemes, except the Navier-Stokes solver, are constructed using the same set of design principles. Their constructions are simplified greatly by the use of a nontraditional space-time mesh. Its use results in the simplest stencil possible, i.e., a tetrahedron in a 3-D space-time with a vertex at the upper time level and other three at the lower time level. Because of the similarity in their design, each of the present 2-D solvers virtually shares with its 1-D counterpart the same fundamental characteristics. Moreover, it is shown that the present Euler solver is capable of generating highly accurate solutions for a famous 2-D shock reflection problem. Specifically, both the incident and the reflected shocks can be resolved by a single data point without the presence of numerical oscillations near the discontinuity.

Chang, Sin-Chung↗
DOE OSTI2018

Two-Level Transport Methods with Independent Discretization

In this proposal, we introduce two-level nonlinear iteration methods for the transport equation in 1D slab geometry approximated by means of the linear discontinuous finite element method (LDFEM). We develop transport schemes based on the quasidiffusion (QD) method in which the low-order QD (LOQD) equations are discretized by the linear continuous finite element method (LCFEM). This requires a mapping of the LCFEM low-order solution to the LDFEM high-order solution to define the scattering term. Several mappings are proposed and analyzed. Another suggested transport discretization scheme is based on the step characteristics for the transport equation and LCFEM for the LOQD equations. We also develop new nonlinear synthetic acceleration (NSA) methods based on the LCFEM discretization of the QD equation. To gain iterative stability, the NSA algorithms are combined with the nonlinear Krylov acceleration method. We present numerical results that demonstrate performance and basic properties of the proposed discretization schemes and iterative solution methods.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Improvements to the Griffin Transport Solvers

Griffin is a Multiphysics Object-Oriented Simulation Environment (MOOSE) based reactor multiphysics analysis application jointly developed by Idaho National Laboratory and Argonne National Laboratory. The code includes a variety of steady-state solvers for fixed-source, k-eigenvalue, adjoint, and subcritical multiplication, as well as transient solvers for point-kinetics, improved quasi-static, and spatial dynamics. This document summarizes the transport solver development efforts pursued during Fiscal Year 2022. We added the multiphysics transient capability for the coarse-mesh finite difference accelerated Richardson iteration for discontinuous finite element method discrete ordinates (DFEM-SN) scheme to support high-order heterogeneous transport simulations. HFEM (hybrid finite element method) - PN (spherical harmonics expansion) was completed and red-black iteration was added for solving the HFEM-PN system with both preconditioned Jacobian-free Newton Krylov and Richardson iteration solvers. The HFEM-PN scheme, as one of the low-order transport schemes, is expected for supporting routine design simulations. Pin power reconstruction capability was also designed and implemented with the Griffin ISOXML module to enhance all the low-order transport solvers for more accurate multiphysics simulations. Numerical results are presented for demonstrating the capabilities and verifying their performance, and future works are discussed.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Continuous, One-pot Synthesis and Post-Synthetic Modification of NanoMOFs Using Droplet Nanoreactors

Here, metal-organic frameworks (MOFs); also known as porous coordination polymers (PCP) are a class of porous crystalline materials constructed by connecting metal clusters via organic linkers. The possibility of functionalization leads to virtually infinite MOF designs using generic modular methods. Functionalized MOFs can exhibit interesting physical and chemical properties including accelerated adsorption kinetics and catalysis. Although there are discrete methods to synthesize well-defined nanoscale MOFs, rapid and flexible methods are not available for continuous, one-pot synthesis and post synthesis modification (functionalization) of MOFs. Here, we show a continuous, scalable nanodroplet-based microfluidic route that not only facilitates the synthesis of MOFs at nanoscale, but also offers flexibility for direct functionalization with desired functional groups (e.g., -NH 2 , -COCH 3 , fluorescein isothiocyanate; FITC). In addition, the presented route of continuous manufacturing of functionalized MOFs takes significantly less time compared to state-of-the-art batch methods currently available (1 hr vs. several days). We envisage our approach to be a breakthrough method for synthesizing complex functionalized nanomaterials (metal, metal oxides, quantum dots and MOFs) that are not accessible by direct batch processing, and expand the range of a new class of functionalized MOF-based functional nanomaterials.

36 MATERIALS SCIENCE↗
NASA NTRS1998

Congruence Approximations for Entrophy Endowed Hyperbolic Systems

Building upon the standard symmetrization theory for hyperbolic systems of conservation laws, congruence properties of the symmetrized system are explored. These congruence properties suggest variants of several stabilized numerical discretization procedures for hyperbolic equations (upwind finite-volume, Galerkin least-squares, discontinuous Galerkin) that benefit computationally from congruence approximation. Specifically, it becomes straightforward to construct the spatial discretization and Jacobian linearization for these schemes (given a small amount of derivative information) for possible use in Newton's method, discrete optimization, homotopy algorithms, etc. Some examples will be given for the compressible Euler equations and the nonrelativistic MHD equations using linear and quadratic spatial approximation.

Barth, Timothy J.↗
DOE OSTI2015

A high-order vertex-based central ENO finite-volume scheme for three-dimensional compressible flows

High-order discretization methods offer the potential to reduce the computational cost associated with modeling compressible flows. However, it is difficult to obtain accurate high-order discretizations of conservation laws that do not produce spurious oscillations near discontinuities, especially on multi-dimensional unstructured meshes. A novel, high-order, central essentially non-oscillatory (CENO) finite-volume method that does not have these difficulties is proposed for tetrahedral meshes. The proposed unstructured method is vertex-based, which differs from existing cell-based CENO formulations, and uses a hybrid reconstruction procedure that switches between two different solution representations. It applies a high-order k-exact reconstruction in smooth regions and a limited linear reconstruction when discontinuities are encountered. Both reconstructions use a single, central stencil for all variables, making the application of CENO to arbitrary unstructured meshes relatively straightforward. The new approach was applied to the conservation equations governing compressible flows and assessed in terms of accuracy and computational cost. For all problems considered, which included various function reconstructions and idealized flows, CENO demonstrated excellent reliability and robustness. Up to fifth-order accuracy was achieved in smooth regions and essentially non-oscillatory solutions were obtained near discontinuities. The high-order schemes were also more computationally efficient for high-accuracy solutions, i.e., they took less wall time than the lower-order schemes to achieve a desired level of error. In one particular case, it took a factor of 24 less wall-time to obtain a given level of error with the fourth-order CENO scheme than to obtain the same error with the second-order scheme.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Extreme Scale Unstructured Adaptive CFD: From Multiphase Flow to Aerodynamic Flow Control

Understanding the flow of fluid, either liquid or gas, through and around solid bodies has challenged man since the dawn of scientific inquiry. Many of the great minds of science and math have progressively built up a hierarchy of fluid models. This report is concerned with the computational modeling of turbulent flow around aerodynamic bodies such as planes and wind turbines. In this case, viscous effects near the solid bodies create very thin boundary layers that yield highly anisotropic (gradients normal to the surface may be 10^6 times larger than gradients along the surface) solutions to the governing non-linear partial differential equations (PDE); the Navier-Stokes equations. Furthermore, turbulent flows develop extremely broad ranges of length and time scales.This disparity motivates the use of discretization methods capable of employing adaptivity and implicit time integration. The combination of these features (non-linear, anisotropy, adaptivity, andimplicit) dramatically raise the complexity of the discretization, posing large challenges to efficient scalable parallel implementation. However, through careful design, the more complex algorithms can provide great reductions in computational cost relative to simpler methods (e.g., Cartesian grids with explicit time integration) that are easier to mate efficiently to hardware. In this report, we not only describe our approach but we also address the fact that while complex algorithms may never be as efficient flop-for-flop as simple methods, in the important measure of science-per-core-hour, they can still win big by making complex features like adaptivity and implicit methods as efficient and scalable as possible.

42 ENGINEERING↗