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 397 records · Page 22

Inverse problems in diffraction

A two-dimensional problem of diffraction of a plane electromagnetic wave on a smooth 2 pi-periodic surface is considered. A numerical algorithm solving this problem is developed. An inverse problem of determination of the shape of 2 pi-periodic surface using the performance data of reverse scattering is considered. The inverse problem was solved by means of minimization of the residual functional with the help of the gradient descent method. The initial data were calculated with the help of the numerical method. On each step of the iterative method of minimization, the residual functional was calculated approximately with the help of the small slope method. The examples of the shape determination are considered.

Mikheev, Andrew G.↗

Polarized Bidirectional Reflectance of Optically Thick Sparse Particulate Layers: an Efficient Numerically Exact Radiative-Transfer Solution

We describe a simple yet efficient numerical algorithm for computing polarized bidirectional reflectance of an optically thick (semi-infinite), macroscopically flat layer composed of statistically isotropic and mirror symmetric random particles. The spatial distribution of the particles is assumed to be sparse, random, and statistically uniform. The 44 Stokes reflection matrix is calculated by iterating the Ambartsumian's vector nonlinear integral equation. The result is a numerically exact solution of the vector radiative transfer equation and as such fully satisfies the energy conservation law and the fundamental reciprocity relation. Since this technique bypasses the computation of the internal radiation field, it is very fast and highly accurate. The FORTRAN implementation of the technique is publicly available on the World Wide Web at http://www.giss.nasa.gov/staff/ mmishchenko/brf. It can be combined with several existing computer programs providing the requisite single-scattering properties of spherical or morphologically complex particles and applied to a wide range of optical characterization problems. Benchmark results obtained with this program can be used for testing alternative solvers of the vector radiative transfer equation.

radiative transfer↗

Domain decomposition solution of nonlinear two-dimensional parabolic problems by random trees

A domain decomposition method is developed for the numerical solution of nonlinear parabolic partial differential equations in any space dimension, based on the probabilistic representation of solutions as an average of suitable multiplicative functionals. Such a direct probabilistic representation requires generating a number of random trees, whose role is that of the realizations of stochastic processes used in the linear problems. First, only few values of the sought solution inside the space-time domain are computed (by a Monte Carlo method on the trees). An interpolation is then carried out, in order to approximate interfacial values of the solution inside the domain. Thus, a fully decoupled set of sub-problems is obtained. The algorithm is suited to massively parallel implementation, enjoying arbitrary scalability and fault tolerance properties. Pruning the trees is shown to increase appreciably the efficiency of the algorithm. Numerical examples conducted in 2D, including some for the KPP equation, are given.

97 MATHEMATICS AND COMPUTING↗

Numerical Simulations of Homogeneous Turbulence Using Lagrangian-Averaged Navier-Stokes Equations

The Lagrangian-averaged Navier-Stokes (LANS) equations are numerically evaluated as a turbulence closure. They are derived from a novel Lagrangian averaging procedure on the space of all volume-preserving maps and can be viewed as a numerical algorithm which removes the energy content from the small scales (smaller than some a priori fixed spatial scale alpha) using a dispersive rather than dissipative mechanism, thus maintaining the crucial features of the large scale flow. We examine the modeling capabilities of the LANS equations for decaying homogeneous turbulence, ascertain their ability to track the energy spectrum of fully resolved direct numerical simulations (DNS), compare the relative energy decay rates, and compare LANS with well-accepted large eddy simulation (LES) models.

Mohseni, Kamran↗

Sparse approximation of fitting surface by elastic net

The goal of this paper is to develop a computational model and corresponding efficient algorithm for obtaining a sparse representation of the fitting surface to the given scattered data. The basic idea of the model is to utilize the principal shift invariant space and the balanced l{sub 1},l{sub 2} norm minimization (named elastic net). The elastic net can be solved efficiently by an adapted split Bregman iteration algorithm. Numerical experiments indicate that by choosing appropriate regularization parameters, the model can efficiently provide an acceptable compromise between the minimization of the data mismatch term and the sparsity of the solution.

97 MATHEMATICS AND COMPUTING↗

GentenMPI: Distributed Memory Sparse Tensor Decomposition

GentenMPl is a toolkit of sparse canonical polyadic (CP) tensor decomposition algorithms that is designed to run effectively on distributed-memory high-performance computers. Its use of distributed-memory parallelism enables it to efficiently decompose tensors that are too large for a single compute node's memory. GentenMPl leverages Sandia's decades-long investment in the Trilinos solver framework for much of its parallel-computation capability. Trilinos contains numerical algorithms and linear algebra classes that have been optimized for parallel simulation of complex physical phenomena. This work applies these tools to the data science problem of sparse tensor decomposition. In this report, we describe the use of Trilinos in GentenMPl, extensions needed for sparse tensor decomposition, and implementations of the CP-ALS (CP via alternating least squares) and GCP-SGD (generalized CP via stochastic gradient descent) sparse tensor decomposition algorithms. We show that GentenMPl can decompose sparse tensors of extreme size, e.g., a 12.6-terabyte tensor on 8192 computer cores. We demonstrate that the Trilinos backbone provides good strong and weak scaling of the tensor decomposition algorithms.

97 MATHEMATICS AND COMPUTING↗

Empirical validation and comparison of methodologies to simulate micro and macro-encapsulated PCMs in the building envelope

Thermal Energy Storage (TES) has the potential to shift peak electricity demand. Passive TES is usually implemented in building envelope as micro and macro encapsulated phase change materials (PCM) to shift electric energy demand and therefore requires careful heat transfer analysis. Whole building energy modelling with simplified heat transfer analysis has become extremely important for designers, architects, engineers, and researchers to predict energy performance of buildings. It is important to validate PCM modelling algorithms used in building energy programs to quantify their error and prove their capacity to model different PCM encapsulation types. This study uses data from a microencapsulated PCM and two macroencapsulated PCMs (Bio based PCM and hydrate salts) tested in full-scale using the Advanced Multiscale Building Energy Research (AMBER) Lab located at the Colorado School of Mines and is used to validate a numerical algorithm written in MATLAB language. To approximate the heat transfer through a wall assembly with macroencapsulated PCM pouches, several modelling techniques that can reduce 3D heat transfer characteristics to 1D are explored in this research. A parallel path heat transfer modelling approach is found to give the closest agreement with the experimental data for the pouched PCMs in building envelope applications.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Evaluation of numerical schemes for the analysis of sound generation by blade-gust interaction

In this investigation three different numerical algorithms have been utilized to compute the flow about a flat plate in the presence of a transverse gust described by a sinusoidal disturbance. The three schemes include the MacCormack explicit finite difference scheme which is second order accurate in both time and space, the Gottlieb and Turkel modification of MacCormack's scheme which is fourth order accurate in space and second order accurate in time, (referred to as the 2-4 scheme), and a two step scheme developed by Bayliss et al. which has second order temporal accuracy and sixth order spatial accuracy (a 2-6 scheme). The flow field results are obtained with these schemes by using the same code with the only difference being the implementation of the respective solution algorithms. The problem is set up so that the sinusoidal disturbance is imposed at the surface of the flat plate as a surface boundary condition. Thus the problem is treated as scattering problem. The computed results include the time average of the acoustic pressure squared along grid lines five points away from the boundaries; distribution throughout the computational domain is monitored at various times. The numerical results are compared with an exact solution obtained by Atassi, Dusey, and Davis.

Scott, J. N.↗

Concomitant modulated superfluidity in polarized Fermi gases

Recent ground-breaking experiments studying the effects of spin polarization on pairing in unitary Fermi gases encountered mutual qualitative and quantitative discrepancies which seem to be a function of the confining geometry. Using numerical algorithms we study the solution space for a three-dimensional fully self-consistent formulation of realistic systems with up to 10{sup 5} atoms. A study of the three types of solutions obtained demonstrates a tendency toward metastability as the confining geometry is elongated. One of these solutions, which is consistent with Rice experiments at high trap aspect ratio, supports a state strikingly similar to the long sought Fulde-Ferrel-Larkin-Ovchinnikov state. Our study helps to resolve the long-standing controversy concerning the discrepancies between the findings from two different experimental groups and highlights the versatility of actual-size numerical calculations for investigating inhomogeneous fermionic superfluids.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Homogenizing atomic dynamics by fractional differential equations

In this paper, we propose two ways to construct fractional differential equations (FDE) for approximating atomic chain dynamics. Taking harmonic chain as an example, we add a power function of fractional order to Taylor expansion of the dispersion relation, and determine the parameters by matching two selected wave numbers. This approximate function leads to an FDE after considering both directions for wave propagation. As an alternative, we consider the symbol of the force term, and approximate it by a similar function. It also induces an FDE. Both approaches produce excellent agreement with the harmonic chain dynamics. The accuracy may be improved by optimizing the selected wave numbers, or starting with higher order Taylor expansions. When resolved in the lattice constant, the resulting FDE's faithfully reproduce the lattice dynamics. When resolved in a coarse grid instead, they systematically generate homogenized algorithms. Numerical tests are performed to verify the proposed approaches. Moreover, FDE's are also constructed for diatomic chain and anharmonic lattice, to illustrate the generality of the proposed approaches. - Highlights: • Match the dispersion relation of linear chain by power function of fractional order, added on low order Taylor expansion. • Design FDE by approximating dispersion relation, or the symbol for the force term. • Solve the FDE by algorithm of spectral accuracy. • Obtain faithful and systematical homogenization when resolved at coarser grid. • Applies to general lattices: complex, nonlinear and multidimensional.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DENSITY WAVES EXCITED BY LOW-MASS PLANETS IN PROTOPLANETARY DISKS. II. HIGH-RESOLUTION SIMULATIONS OF THE NONLINEAR REGIME

We investigate numerically the propagation of density waves excited by a low-mass planet in a protoplanetary disk in the nonlinear regime, using two-dimensional local shearing box simulations with the grid-based code Athena at high spatial resolution (256 grid points per scale height h). The nonlinear evolution results in the wave steepening into a shock, causing damping and angular momentum transfer to the disk. On long timescales this leads to spatial redistribution of the disk density, causing migration feedback and potentially resulting in gap opening. Previous numerical studies concentrated on exploring these secondary phenomena as probes of the nonlinear wave evolution. Here we focus on exploring the evolution of the basic wave properties, such as its density profile evolution, shock formation, and post-shock wave behavior, and provide comparison with analytical theory. The generation of potential vorticity at the shock is computed analytically and is subsequently verified by simulations and used to pinpoint the shock location. We confirm the theoretical relation between the shocking length and the planet mass (including the effect of the equation of state), and the post-shock decay of the angular momentum flux carried by the wave. The post-shock evolution of the wave profile is explored, and we quantitatively confirm its convergence to the theoretically expected N-wave shape. The accuracy of various numerical algorithms used to compute the nonlinear wave evolution is also investigated: we find that higher order spatial reconstruction and high resolution are crucial for capturing the shock formation correctly.

79 ASTRONOMY AND ASTROPHYSICS↗

A numerical simulation of vortex breakdown

A numerical simulation of vortex breakdown using the time-dependent Navier-Stokes equations is performed. Unlike previous studies, the numerical algorithm, formulated in terms of the velocity and vorticity, is not restricted by axisymmetry conditions. The vortex is parameterized in terms of the Reynolds number and Rossby number. The resulting breakdown structure is analyzed using contour plots of velocity, vorticity and pressure as well as axial, radial, and swirl velocity profiles at various streamwise locations. The relationship of these results to experimentally observed structures and previous numerical results is discussed.

Spall, R. E.↗

Numerical Stability and Accuracy of Temporally Coupled Multi-Physics Modules in Wind-Turbine CAE Tools

In this paper we examine the stability and accuracy of numerical algorithms for coupling time-dependent multi-physics modules relevant to computer-aided engineering (CAE) of wind turbines. This work is motivated by an in-progress major revision of FAST, the National Renewable Energy Laboratory's (NREL's) premier aero-elastic CAE simulation tool. We employ two simple examples as test systems, while algorithm descriptions are kept general. Coupled-system governing equations are framed in monolithic and partitioned representations as differential-algebraic equations. Explicit and implicit loose partition coupling is examined. In explicit coupling, partitions are advanced in time from known information. In implicit coupling, there is dependence on other-partition data at the next time step; coupling is accomplished through a predictor-corrector (PC) approach. Numerical time integration of coupled ordinary-differential equations (ODEs) is accomplished with one of three, fourth-order fixed-time-increment methods: Runge-Kutta (RK), Adams-Bashforth (AB), and Adams-Bashforth-Moulton (ABM). Through numerical experiments it is shown that explicit coupling can be dramatically less stable and less accurate than simulations performed with the monolithic system. However, PC implicit coupling restored stability and fourth-order accuracy for ABM; only second-order accuracy was achieved with RK integration. For systems without constraints, explicit time integration with AB and explicit loose coupling exhibited desired accuracy and stability.

17 WIND ENERGY↗

Formulation of numerical procedures for dynamic analysis of spinning structures

The paper presents the descriptions of recently developed numerical algorithms that prove to be useful for the solution of the free vibration problem of spinning structures. First, a generalized procedure for the computation of nodal centrifugal forces in a finite element owing to any specified spin rate is derived in detail. This is followed by a description of an improved eigenproblem solution procedure that proves to be economical for the free vibration analysis of spinning structures. Numerical results are also presented which indicate the efficacy of the currently developed procedures.

Gupta, K. K.↗

Coarse-grained simulations of vortex dynamics and transition in complex high-Re flows

Turbulent flow complexity in applications in engineering, geophysics and astrophysics typically requires achieving accurate and dependable large scale predictions of highly nonlinear processes with under-resolved computer simulation models. Laboratory observations typically demonstrate the end outcome of complex non-linear three-dimensional physical processes with many unexplained details and mechanisms. Carefully controlled computational experiments based on the numerical solution of the conservation equations for mass, momentum, and energy, provide insights into the underlying flow dynamics. Relevant computational fluid dynamics issues to be addressed relate to the modeling of the unresolved tlow conditions at the subgrid scale (SGS) level - within a computational cell, and at the supergrid (SPG) scale - at initialization and beyond computational boundaries. SGS and SPG information must be prescribed for closure of the equations solved numerically. SGS models appear explicitly or implicitly as additional source tenns in the modified flow equations solved by the numerical solutions being calculated, while SPG models provide the necessary set of initial and boundary conditions that must be prescribed to ensure unique well-posed solutions. From this perspective, it is clear that the simulation process is inherently determined by the SGS and SPG information prescription process. On the other hand, observables in laboratory experiments are always characterized by the finite scales of the instrumental resolution of measuring/visualizing devices, and subject as well to SPG issues. It is thus important to recognize the inherently intrusive nature of observations based on numerical or laboratory experiments. Ultimately, verification and validation (V & V) frameworks and appropriate metrics for the specific problems at hand are needed to establish predictability of the simulation model. Direct numerical simulation (DNS) - resolving all relevant space/time scales, is prohibitively expensive in the foreseeable future for most practical flows of interest at moderate-to-high Reynolds number (Re). On the other end of the simulation spectrum are the Reynolds-Averaged Navier-Stokes (RANS) approaches - which model the turbulent effects. In the coarsegrained large eddy simulation (LES) strategies, the large energy containing structures are resolved, the smaller structures are filtered out, and unresolved SGS effects are modeled. By necessity - rather than choice, LES effectively becomes the intermediate approach between DNS and RANS. Extensive work has demonstrated that predictive simulations of turbulent velocity fields are possible using a particular LES denoted implicit LES (ILES), using the class of nonoscillatory finite-volume (NFV) numerical algorithms. Use of the modified equation as framework for theoretical analysis, demonstrates that leading truncation tenns associated with NFV methods provide implicit SGS models of mixed anisotropic type and regularized motion of discrete observables. Tests in fundamental applications ranging from canonical to very complex flows indicate that ILES is competitive with conventional LES in the LES realm proper - flows driven by large scale features. High-Re flows are vortex dominated and governed by short convective timescales compared to those of diffusion, and kinematically characterized at the smallest scales by slender worm vortices with insignificant internal structure. This motivates nominally inviscid ILES methods capable of capturing the high-Re dissipation dynamics and of handling vortices as shocks in shock capturing schemes. Depending on flow regimes, initial conditions, and resolution, additional modeling may be needed to emulate SGS driven physics, such as backscatter, chemical reaction, material mixing, and near-wall flow-dynamics - where typically-intertwined SGS/SPG issues need to be addressed. A major research focus is recognizing when additional explicit models and/or numerical treatments are needed and ensuring that mixed explicit and implicit SGS models can effectively act in collaborative rather than interfering fashion. We survey our present understanding of the theoretical basis of lLES, including connections with the classical LES and finite-scale dynamics perspectives. Examples from recent lLES studies are presented, including canonical turbulence test cases and shock driven turbulence; relevant V & V issues are demonstrated in this context.

58 GEOSCIENCES↗

An accurate, stable and efficient domain-type meshless method for the solution of MHD flow problems

The aim of the present paper is the development of an efficient numerical algorithm for the solution of magnetohydrodynamics flow problems for regular and irregular geometries subject to Dirichlet, Neumann and Robin boundary conditions. Toward this, the meshless point collocation method (MPCM) is used for MHD flow problems in channels with fully insulating or partially insulating and partially conducting walls, having rectangular, circular, elliptical or even arbitrary cross sections. MPC is a truly meshless and computationally efficient method. The maximum principle for the discrete harmonic operator in the meshfree point collocation method has been proven very recently, and the convergence proof for the numerical solution of the Poisson problem with Dirichlet boundary conditions have been attained also. Additionally, in the present work convergence is attained for Neumann and Robin boundary conditions, accordingly. The shape functions are constructed using the Moving Least Squares (MLS) approximation. The refinement procedure with meshless methods is obtained with an easily handled and fully automated manner. We present results for Hartmann number up to 10{sup 5}. The numerical evidences of the proposed meshless method demonstrate the accuracy of the solutions after comparing with the exact solution and the conventional FEM and BEM, for the Dirichlet, Neumann and Robin boundary conditions of interior problems with simple or complex boundaries.

97 MATHEMATICS AND COMPUTING↗

DFT algorithms for bit-serial GaAs array processor architectures

Systems and Processes Engineering Corporation (SPEC) has developed an innovative array processor architecture for computing Fourier transforms and other commonly used signal processing algorithms. This architecture is designed to extract the highest possible array performance from state-of-the-art GaAs technology. SPEC's architectural design includes a high performance RISC processor implemented in GaAs, along with a Floating Point Coprocessor and a unique Array Communications Coprocessor, also implemented in GaAs technology. Together, these data processors represent the latest in technology, both from an architectural and implementation viewpoint. SPEC has examined numerous algorithms and parallel processing architectures to determine the optimum array processor architecture. SPEC has developed an array processor architecture with integral communications ability to provide maximum node connectivity. The Array Communications Coprocessor embeds communications operations directly in the core of the processor architecture. A Floating Point Coprocessor architecture has been defined that utilizes Bit-Serial arithmetic units, operating at very high frequency, to perform floating point operations. These Bit-Serial devices reduce the device integration level and complexity to a level compatible with state-of-the-art GaAs device technology.

Mcmillan, Gary B.↗

Convergence acceleration of implicit schemes in the presence of high aspect ratio grid cells

The performance of Navier-Stokes codes are influenced by several phenomena. For example, the robustness of the code may be compromised by the lack of grid resolution, by a need for more precise initial conditions or because all or part of the flowfield lies outside the flow regime in which the algorithm converges efficiently. A primary example of the latter effect is the presence of extended low Mach number and/or low Reynolds number regions which cause convergence deterioration of time marching algorithms. Recent research into this problem by several workers including the present authors has largely negated this difficulty through the introduction of time-derivative preconditioning. In the present paper, we employ the preconditioned algorithm to address convergence difficulties arising from sensitivity to grid stretching and high aspect ratio grid cells. Strong grid stretching is particularly characteristic of turbulent flow calculations where the grid must be refined very tightly in the dimension normal to the wall, without a similar refinement in the tangential direction. High aspect ratio grid cells also arise in problems that involve high aspect ratio domains such as combustor coolant channels. In both situations, the high aspect ratio cells can lead to extreme deterioration in convergence. It is the purpose of the present paper to address the reasons for this adverse response to grid stretching and to suggest methods for enhancing convergence under such circumstances. Numerical algorithms typically possess a maximum allowable or optimum value for the time step size, expressed in non-dimensional terms as a CFL number or vonNeumann number (VNN). In the presence of high aspect ratio cells, the smallest dimension of the grid cell controls the time step size causing it to be extremely small, which in turn results in the deterioration of convergence behavior. For explicit schemes, this time step limitation cannot be exceeded without violating stability restrictions of the scheme. On the other hand, for implicit schemes, which are typically unconditionally stable, there appears to be room for improvement through careful tailoring of the time step definition based on results of linear stability analyses. In the present paper, we focus on the central-differenced alternating direction implicit (ADI) scheme. The understanding garnered from this analyses can then be applied to other implicit schemes. In order to systematically study the effects of aspect ratio and the methods of mitigating the associated problems, we use a two pronged approach. We use stability analyses as a tool for predicting numerical convergence behavior and numerical experiments on simple model problems to verify predicted trends. Based on these analyses, we determine that efficient convergence may be obtained at all aspect ratios by getting a combination of things right. Primary among these are the proper definition of the time step size, proper selection of viscous preconditioner and the precise treatment of boundary conditions. These algorithmic improvements are then applied to a variety of test cases to demonstrate uniform convergence at all aspect ratios.

Buelow, B. E. O.↗