Search NASA⌕ Search

SEARCH · Search NASA

Results for “Numerical algorithm”

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,387 records · Page 77

The Discrete Equation Method (DEM) for Fully Compressible, Two-Phase Flows in Ducts of Spatially Varying Cross-Section

For the simulation of light water nuclear reactor coolant flows, general two-phase models (valid for all volume fractions) have been generally used which, while allowing for velocity disequilibrium, normally force pressure equilibrium between the phases (see, for example, the numerous models of this type described in H. Städtke, Gasdynamic Aspects of Two-Phase Flow, Wiley-VCH, 2006). These equations are not hyperbolic, their physical wave dynamics are incorrect, and their solution algorithms rely on dubious truncation error induced artificial viscosity to render them numerically well posed over a portion of the computational spectrum. The inherent problems of the traditional approach to multiphase modeling, which begins with an averaged system of (ill-posed) partial differential equations (PDEs) which are then discretized to form a numerical scheme, are avoided by employing a new homogenization method known as the Discrete Equation Method (DEM) (R. Abgrall and R. Saurel, Discrete Equations for Physical and Numerical Compressible Multiphase Mixtures, J. Comp. Phys. 186, 361-396, 2003). This method results in well-posed hyperbolic systems, this property being important for transient flows. This also allows a clear treatment of non-conservative terms (terms involving interfacial variables and volume fraction gradients) permitting the solution of interface problems without conservation errors, this feature being important for the direct numerical simulation of two-phase flows. Unlike conventional methods, the averaged system of PDEs for the mixture are not used, and the DEM method directly obtains a well-posed discrete equation system from the single-phase conservation laws, producing a numerical scheme which accurately computes fluxes for arbitrary number of phases and solves non-conservative products. The method effectively uses a sequence of single phase Riemann problem solutions. Phase interactions are accounted for by Riemann solvers at each interface. Non-conservative terms are correctly approximated. Some of the closure relations missing from the traditional approach are automatically obtained. Lastly, the continuous equation system resulting from the discrete equations can be identified by taking the continuous limit with weak-wave assumptions. In this work, this approach is tested by constructing a DEM model for the flow of two compressible phases in 1-D ducts of spatially varying cross-section with explicit time integration. An analytical equation of state is included for both water vapor and liquid phases, and a realistic interphase mass transfer model is developed based on interphase heat transfer. A robust compliment of boundary conditions are developed and discussed. Though originally conceived as a first step toward implict time integration of the DEM method (to relieve time step size restrictions due to stiffness and to achieve tighter coupling of equations) in multidimensions, this model offers some unique capabilities for incorporation into next generation light water reactor safety analysis codes. We demonstrate, on a converging-diverging two-phase nozzle, that this well-posed, 2-pressure, 2-velocity DEM model can be integrated to a realistic and meaningful steady-state with both phases treated as compressible.

42 ENGINEERING↗

V&V for turbulent mixing in the intermediate asymptotic regime

Turbulent fluid flow interacts nonlinearly with a number of processes, including reactive flow (chemistry), radiation, and the transport of particles embedded in the flow. Subgrid scale modeling of these nonlinear processes is a major challenge to computational science. To this end, turbulent mixing of dissimilar fluids is a driver. Here we study validation issues for a class of turbulent mixing simulations. In previous work, we have obtained agreement between simulation and experiment. The present paper addresses a remaining issue, the role of meniscus related boundary effects for immiscible fluids in the validation process. Validation and even verification has been controversial for turbulent mixing flows, as commonly used numerical models are diffusive and the resulting numerical diffusion modifies the parameters of the problem and its solution. Additionally, numerical diffusion of concentration and temperature is well documented in the scientific literature for Eulerian simulations. Lagrangian simulations, which might appear to avoid this problem, are subject to mesh tangling, ensuing regridding and use of Arbitrary Lagrangian Eulerian codes to substitute for a pure Lagrangian algorithm. In practice, Lagrangian methods are potentially subject to the same numerical diffusion issues when used to study complex interface instabilities.

97 MATHEMATICS AND COMPUTING↗

Analytic and algorithmic aspects of generalized harmonic sums and polylogarithms

In recent three-loop calculations of massive Feynman integrals within Quantum Chromodynamics (QCD) and, e.g., in recent combinatorial problems the so-called generalized harmonic sums (in short S-sums) arise. They are characterized by rational (or real) numerator weights also different from ±1. In this article we explore the algorithmic and analytic properties of these sums systematically. We work out the Mellin and inverse Mellin transform which connects the sums under consideration with the associated Poincaré iterated integrals, also called generalized harmonic polylogarithms. In this regard, we obtain explicit analytic continuations by means of asymptotic expansions of the S-sums which started to occur frequently in current QCD calculations. In addition, we derive algebraic and structural relations, like differentiation with respect to the external summation index and different multi-argument relations, for the compactification of S-sum expressions. Finally, we calculate algebraic relations for infinite S-sums, or equivalently for generalized harmonic polylogarithms evaluated at special values. The corresponding algorithms and relations are encoded in the computer algebra package HarmonicSums.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Implementation and (Inverse Modified) Error Analysis for Implicitly Templated ODE-Nets

We focus on learning unknown dynamics from data using ODE-nets templated on implicit numerical initial value problem solvers. First, we perform inverse modified error analysis of the ODE-nets using unrolled implicit schemes for ease of interpretation. It is shown that training an ODE-net using an unrolled implicit scheme returns a close approximation of an inverse modified differential equation (IMDE). In addition, we establish a theoretical basis for hyperparameter selection when training such ODE-nets, whereas current strategies usually treat numerical integration of ODE-nets as a black box. We thus formulate an adaptive algorithm which monitors the level of error and adapts the number of (unrolled) implicit solution iterations during the training process, so that the error of the unrolled approximation is less than the current learning loss. This helps accelerate training while maintaining accuracy. Several numerical experiments are performed to demonstrate the advantages of the proposed algorithm compared to nonadaptive unrollings and validate the theoretical analysis. Here, we also note that this approach naturally allows for incorporating partially known physical terms in the equations, giving rise to what is termed “gray box” identification.

ODE-nets↗

A mixture-energy-consistent six-equation two-phase numerical model for fluids with interfaces, cavitation and evaporation waves

We model liquid–gas flows with cavitation by a variant of the six-equation single-velocity two-phase model with stiff mechanical relaxation of Saurel–Petitpas–Berry (Saurel et al., 2009) [9]. In our approach we employ phasic total energy equations instead of the phasic internal energy equations of the classical six-equation system. This alternative formulation allows us to easily design a simple numerical method that ensures consistency with mixture total energy conservation at the discrete level and agreement of the relaxed pressure at equilibrium with the correct mixture equation of state. Temperature and Gibbs free energy exchange terms are included in the equations as relaxation terms to model heat and mass transfer and hence liquid–vapor transition. The algorithm uses a high-resolution wave propagation method for the numerical approximation of the homogeneous hyperbolic portion of the model. In two dimensions a fully-discretized scheme based on a hybrid HLLC/Roe Riemann solver is employed. Thermo-chemical terms are handled numerically via a stiff relaxation solver that forces thermodynamic equilibrium at liquid–vapor interfaces under metastable conditions. We present numerical results of sample tests in one and two space dimensions that show the ability of the proposed model to describe cavitation mechanisms and evaporation wave dynamics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multi-fidelity modeling to predict the rheological properties of a suspension of fibers using neural networks and Gaussian processes

Unveiling the rheological properties of fiber suspensions is of paramount interest to many industrial applications. There are multiple factors, such as fiber aspect ratio and volume fraction, that play a significant role in altering the rheological behavior of suspensions. Three-dimensional (3D) numerical simulations of coupled differential equations of the suspension of fibers are computationally expensive and time-consuming. Machine learning algorithms can be trained on the available data and make predictions for the cases where no numerical data are available. However, some widely used machine learning surrogates, such as neural networks, require a relatively large training dataset to produce accurate predictions. Multi-fidelity models, which combine high-fidelity data from numerical simulations and less expensive lower fidelity data from resources such as simplified constitutive equations, can pave the way for more accurate predictions. Here, we focus on neural networks and the Gaussian processes with two levels of fidelity, i.e., high and low fidelity networks, to predict the steady-state rheological properties, and compare them to the single-fidelity network. High-fidelity data are obtained from direct numerical simulations based on an immersed boundary method to couple the fluid and solid motion. The low-fidelity data are produced by using constitutive equations. Multiple neural networks and the Gaussian process structures are used for the hyperparameter tuning purpose. Results indicate that with the best choice of hyperparameters, both the multi-fidelity Gaussian processes and neural networks are capable of making predictions with a high level of accuracy with neural networks demonstrating marginally better performance.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Iterative Algorithms for Ptychographic Phase Retrieval

Ptychography promises diffraction limited resolution without the need for high resolution lenses. To achieve high resolution one has to solve the phase problem for many partially overlapping frames. Here we review some of the existing methods for solving ptychographic phase retrieval problem from a numerical analysis point of view, and propose alternative methods based on numerical optimization.

97 MATHEMATICS AND COMPUTING↗

Efficient Projection onto the $\ell_{\infty,1}$ Mixed-Norm Ball Using a Newton Root Search Method

Mixed norms that promote structured sparsity have numerous applications in signal processing and machine learning problems. Here, we present a new algorithm, based on a Newton root search technique, for computing the projection onto the $\ell_{\infty,1}$ ball, which has found application in cognitive neuroscience and classification tasks. Numerical simulations show that our proposed method is between 8 and 10 times faster on average, and up to 20 times faster for very sparse solutions, than the previous state of the art. Lastly, tests on real functional magnetic resonance image data show that, for some data distributions, our algorithm can obtain speed improvements by a factor of between 10 and 100, depending on the implementation.

97 MATHEMATICS AND COMPUTING↗

Conservative explicit local time-stepping schemes for the shallow water equations

Here we develop explicit local time-stepping (LTS) schemes with second and third order accuracy for the shallow water equations. The system is discretized in space by a C-grid staggering method, namely the TRiSK scheme adopted in MPAS-Ocean, a global ocean model with the capability of resolving multiple resolutions within a single simulation. The time integration is designed based on the strong stability preserving Runge–Kutta (SSP-RK) methods, but different time step sizes can be used in different regions of the domain through the coupling of coarse-fine time discretizations on the interface, and are only restricted by respective local CFL conditions. The proposed LTS schemes are of predictor–corrector type in which the predictors are constructed based on Taylor series expansions and SSP-RK stepping algorithms. The schemes preserve some important physical quantities in the discrete sense, such as exact conservation of the mass and potential vorticity and conservation of the total energy within time truncation errors. Moreover, they inherit the natural parallelism of the original explicit global time-stepping schemes. Extensive numerical tests are presented to illustrate the performance of the proposed algorithms.

58 GEOSCIENCES↗

Numerical simulation of a thermodynamically consistent four‐species tumor growth model

We develop a thermodynamically consistent four‐species model of tumor growth on the basis of the continuum theory of mixtures. Unique to this model is the incorporation of nutrient within the mixture as opposed to being modeled with an auxiliary reaction‐diffusion equation. The formulation involves systems of highly nonlinear partial differential equations of surface effects through diffuse‐interface models. A mixed finite element spatial discretization is developed and implemented to provide numerical results demonstrating the range of solutions this model can produce. A time‐stepping algorithm is then presented for this system, which is shown to be first order accurate and energy gradient stable. The results of an array of numerical experiments are presented, which demonstrate a wide range of solutions produced by various choices of model parameters.

97 MATHEMATICS AND COMPUTING↗

High-Accuracy Mesh-Free Quadrature for Trimmed Parametric Surfaces and Volumes

This work presents a high-accuracy, mesh-free, generalized Stokes theorem-based numerical quadrature scheme for integrating functions over trimmed parametric surfaces and volumes. The algorithm relies on two fundamental steps: (1) We iteratively reduce the dimensionality of integration using the generalized Stokes theorem to line integrals over trimming curves, and (2) we employ numerical antidifferentiation in the generalized Stokes theorem using high-order quadrature rules. Additionally, the scheme achieves exponential convergence up to trimming curve approximation error and has applications to computation of geometric moments, immersogeometric analysis, conservative field transfer between high-order curvilinear meshes, and initialization of multi-material simulations. We compare the quadrature scheme to commonly-used quadrature schemes in the literature and show that our scheme is much more efficient in terms of number of quadrature points used. We provide an open-source implementation of the scheme in MATLAB as part of QuaHOG, a software package for Quadrature of High-Order Geometries.

97 MATHEMATICS AND COMPUTING↗

Least-squares solutions of generalized inverse eigenvalue problem over Hermitian–Hamiltonian matrices with a submatrix constraint

In this paper, a gradient-based iterative algorithm is proposed for finding the least-squares solutions of the following constrained generalized inverse eigenvalue problem: given X∈C{sup n×m}, Λ=diag(λ{sub 1},λ{sub 2},…,λ{sub m})∈C{sup m×m}, find A{sup ∗},B{sup ∗}∈C{sup n×n}, such that ∥AX−BXΛ∥ is minimized, where A{sup ∗},B{sup ∗} are Hermitian–Hamiltonian except for a special submatrix. For any initial constrained matrices, a solution pair (A{sup ∗},B{sup ∗}) can be obtained in finite iteration steps by this iterative algorithm in the absence of roundoff errors. The least-norm solution can be obtained by choosing a special kind of initial matrix pencil. In addition, the unique optimal approximation solution to a given matrix pencil in the solution set of the above problem can also be obtained. A numerical example is given to show the efficiency of the proposed algorithm.

97 MATHEMATICS AND COMPUTING↗

Machine Learning for Conservative-to-Primitive in Relativistic Hydrodynamics

The numerical solution of relativistic hydrodynamics equations in conservative form requires root-finding algorithms that invert the conservative-to-primitive variables map. These algorithms employ the equation of state of the fluid and can be computationally demanding for applications involving sophisticated microphysics models, such as those required to calculate accurate gravitational wave signals in numerical relativity simulations of binary neutron stars. This work explores the use of machine learning methods to speed up the recovery of primitives in relativistic hydrodynamics. Artificial neural networks are trained to replace either the interpolations of a tabulated equation of state or directly the conservative-to-primitive map. The application of these neural networks to simple benchmark problems shows that both approaches improve over traditional root finders with tabular equation-of-state and multi-dimensional interpolations. In particular, the neural networks for the conservative-to-primitive map accelerate the variable recovery by more than an order of magnitude over standard methods while maintaining accuracy. Neural networks are thus an interesting option to improve the speed and robustness of relativistic hydrodynamics algorithms.

79 ASTRONOMY AND ASTROPHYSICS↗

The Binary Alkali Nitrate and Chloride Phase Diagrams: NaNO{sub 3}-KNO{sub 3}, LiNO{sub 3}-NaNO{sub 3}, LiNO{sub 3}-KNO{sub 3}, and NaCl-KCl

LiNO{sub 3}-NaNO{sub 3}, LiNO{sub 3}-KNO{sub 3,} NaNO{sub 3}-KNO{sub 3}, and NaCl-KCl phase relations were formulated using the regular solution model to obtain desired compositions for their potential application as a heat transfer fluid. The simultaneous nonlinear equations formed were solved numerically using a contour plot technique in Matlab. An algorithm was developed to determine the real roots of the coupled nonlinear equations and subsequent phase diagrams were constructed. The phase diagrams were compared with those predicted using FactSage thermochemical package and literature data from experimental studies. The calculated NaNO{sub 3}-KNO{sub 3} phase diagram shows that this system has a eutectic point at 0.5 mole fraction of KNO{sub 3} with a eutectic temperature of 220.85 °C, while the LiNO{sub 3}-KNO{sub 3} system was found to have a eutectic point at 0.44 mole fraction LiNO{sub 3} at 137 °C. The LiNO{sub 3}-NaNO{sub 3} system shows a eutectic at 0.524 mole fraction LiNO{sub 3} at 192.8 °C, and finally the NaCl-KCl system has a eutectic point at 0.48 mole fraction NaCl at 634 °C. The liquidus and solidus curves obtained fitted close against values obtained from the quasi-chemical model used in FactSage and experimental values from the literature. This study showed that the regular solution model combined with the contour plots approach can sufficiently describe the liquidus–solidus curves of the alkali binary nitrate and chloride systems and could be a useful method for predicting the phase diagrams for higher order alkali nitrates and chlorides.

36 MATERIALS SCIENCE↗

On spectral methods for solving variable-order fractional integro-differential equations

This paper applies the shifted Jacobi–Gauss collocation (SJ–G-C) method for solving variable-order fractional integro-differential equations (VO-FIDE) with initial conditions. The Riemann–Liouville fractional derivative, D{sup ν(x)}, and integral, I{sup ν(x)}, of variable order are combined, and the SJ–G-C applied to produce a system of algebraic equations. Numerical experiments demonstrate the applicability and reliability of the algorithm when compared with current methods.

97 MATHEMATICS AND COMPUTING↗

Array-based, parallel hierarchical mesh refinement algorithms for unstructured meshes

In this paper, we describe an array-based hierarchical mesh refinement capability through uniform refinement of unstructured meshes for efficient solution of PDE's using finite element methods and multigrid solvers. A multi-degree, multi-dimensional and multi-level framework is designed to generate the nested hierarchies from an initial coarse mesh that can be used for a variety of purposes such as in multigrid solvers/preconditioners, to do solution convergence and verification studies and to improve overall parallel efficiency by decreasing I/O bandwidth requirements (by loading smaller meshes and in memory refinement). We also describe a high-order boundary reconstruction capability that can be used to project the new points after refinement using high-order approximations instead of linear projection in order to minimize and provide more control on geometrical errors introduced by curved boundaries.The capability is developed under the parallel unstructured mesh framework "Mesh Oriented dAtaBase" (MOAB Tautges et al. (2004)). We describe the underlying data structures and algorithms to generate such hierarchies in parallel and present numerical results for computational efficiency and effect on mesh quality. Furthermore, we also present results to demonstrate the applicability of the developed capability to study convergence properties of different point projection schemes for various mesh hierarchies and to a multigrid finite-element solver for elliptic problems.

97 MATHEMATICS AND COMPUTING↗

Temporal coarse-graining method to simulate the movement of atoms

We propose a novel method to simulate the movement of atoms at finite temperature. The main idea of our method is to derive “renormalized,” or coarse-grained in time, dynamics from the Euler–Maruyama scheme, which is the standard method for solving the stochastic differential equations numerically. Based on this renormalization, we propose a new algorithm for solving overdamped Langevin equations. We test our renormalization scheme on two models and demonstrate that the results obtained by this method are consistent with those obtained by the standard method. Our algorithm performs better than the standard scheme, especially at low temperatures and with multiple processors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Variational integrators for the dynamics of thermo-elastic solids with finite speed thermal waves

This paper formulates variational integrators for finite element discretizations of deformable bodies with heat conduction in the form of finite speed thermal waves. The cornerstone of the construction consists in taking advantage of the fact that the Green–Naghdi theory of type II for thermo-elastic solids has a Hamiltonian structure. Thus, standard techniques to construct variational integrators can be applied to finite element discretizations of the problem. The resulting discrete-in-time trajectories are then consistent with the laws of thermodynamics for these systems: for an isolated system, they exactly conserve the total entropy, and nearly exactly conserve the total energy over exponentially long periods of time. Moreover, linear and angular momenta are also exactly conserved whenever the exact system does. For definiteness, we construct an explicit second-order accurate algorithm for affine tetrahedral elements in two and three dimensions, and demonstrate its performance with numerical examples.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗