Search NASA⌕ Search

SEARCH · Search NASA

Results for “numerical algorithm computing”

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,747 records · Page 97

Three-Dimensional Modeling of Fracture Clusters in Geothermal Reservoirs

The objective of this is to develop a 3-D numerical model for simulating mode I, II, and III (tensile, shear, and out-of-plane) propagation of multiple fractures and fracture clusters to accurately predict geothermal reservoir stimulation using the virtual multi-dimensional internal bond (VMIB). Effective development of enhanced geothermal systems can significantly benefit from improved modeling of hydraulic fracturing. In geothermal reservoirs, where the temperature can reach or exceed 350oC, thermal and poro-mechanical processes play an important role in fracture initiation and propagation. In this project hydraulic fracturing of hot subsurface rock mass will be numerically modeled by extending the virtual multiple internal bond theory and implementing it in a finite element code, WARP3D, a three-dimensional finite element code for solid mechanics. The new constitutive model along with the poro-thermoelastic computational algorithms will allow modeling the initiation and propagation of clusters of fractures, and extension of pre-existing fractures. The work will enable the industry to realistically model stimulation of geothermal reservoirs. The project addresses the Geothermal Technologies Office objective of accurately predicting geothermal reservoir stimulation (GTO technology priority item). The project goal will be attained by: (i) development of the VMIB method for application to 3D analysis of fracture clusters; (ii) development of poro- and thermoelastic material sub-routines for use in 3D finite element code WARP3D; (iii) implementation of VMIB and the new material routines in WARP3D to enable simulation of clusters of fractures while accounting for the effects of the pore pressure, thermal stress and inelastic deformation; (iv) simulation of 3D fracture propagation and coalescence and formation of clusters, and comparison with laboratory compression tests; and (v) application of the model to interpretation of injection experiments (planned by our industrial partner) with reference to the impact of the variations in injection rate and temperature, rock properties, and in-situ stress.

15 GEOTHERMAL ENERGY↗

Factorization and reduction methods for optimal control of distributed parameter systems

A Chandrasekhar-type factorization method is applied to the linear-quadratic optimal control problem for distributed parameter systems. An aeroelastic control problem is used as a model example to demonstrate that if computationally efficient algorithms, such as those of Chandrasekhar-type, are combined with the special structure often available to a particular problem, then an abstract approximation theory developed for distributed parameter control theory becomes a viable method of solution. A numerical scheme based on averaging approximations is applied to hereditary control problems. Numerical examples are given.

Burns, J. A.↗

A coupled marching procedure for the partially parabolized Navier-Stokes equations

A coupled finite-difference formulation is described for solving a reduced form of the compressible Navier-Stokes equations by a multiple space marching procedure. The properties of the equations are discussed and the solution algorithm presented. The scheme is used to compute incompressible flows by taking the incompressible limit (M about 0.1) of the compressible formulation. A separate Poisson equation is not required for the pressure. Results are compared with experimental data and other numerical predictions for low Reynolds number channel inlet flow, flow over a rearward-facing step in a channel, and flow near the trailing edge of a flat plate.

Liu, Xuezong↗

Fresh look at floating shock fitting

A fast implicit upwind procedure for the two-dimensional Euler equations is described that allows accurate computations of shocked flows on nonadapted meshes. Away from shocks, the second-order accurate upwinding is based on the split-coefficient-matrix (SCM) method. In the presence of shocks, the difference stencils are modified using a floating shock fitting technique. Rapid convergence to steady-state solutions is attained with a diagonalized approximate factorization (AF) algorithm. Results are presented for Riemann's problem, for a regular shock reflection at an inviscid wall, for supersonic flow past a cylinder, and for a transonic airfoil. All computed shocks are ideally sharp and in excellent agreement with other numerical results or 'exact' solutions. Most importantly, this has been accomplished on unusually crude meshes without any attempt to align grid lines with shock fronts or to cluster grid lines around shocks.

Hartwich, PETER-M.↗

Numerical computation of steady-state acoustic disturbances in flow

Two time domain methods for computing two dimensional steady-state acoustic disturbances propagating through internal subsonic viscous flow fields in the presence of variable area are investigated. The first method solves the Navier-Stokes equations for the combined steady and acoustic field together and subtracts the steady flow to obtain the acoustic field. The second method solves a system of perturbation equations to obtain the acoustic disturbances, making use of a separate steady flow computation as input to the system. In each case the periodic steady-state acoustic fluctuations are obtained numerically on a supercomputer using a second order unsplit explicit MacCormack predictor-corrector method. Results show that the first method is not very effective for computing acoustic disturbances of even moderate amplitude. It appears that more accurate steady flow algorithms are required for this method to succeed. On the other hand, linear and nonlinear acoustic disturbances extracted from the perturbation approach are shown to exhibit expected behavior for the problems considered. It is also found that inflow boundary conditions for an equivalent uniform duct can be successfully applied to a nonuniform duct to obtain steady-state acoustic disturbances.

Watson, W. R.↗

Navier-Stokes simulation of external/internal transonic flow on the forebody/inlet of the AV-8B Harrier II

In this work, the computation of combined external/internal transonic flow on the complex forebody/inlet configuration of the AV-8B Harrier II is performed. The actual aircraft has been measured and its surface and surrounding domain, in which the fuselage and inlet have a common wall, have been described using structured grids. The 'thin-layer' Navier-Stokes equations were used to model the flow along with the Chimera embedded multi-block technique. A fully conservative, alternating direction implicit (ADI), approximately factored, partially fluxsplit algorithm was employed to perform the computation. Comparisons to some experimental wind tunnel data yielded good agreement for flow at zero incidence and angle of attack. The aim of this paper is to provide a methodology or computational tool for the numerical solution of complex external/internal flows.

Mysko, Stephen J.↗

An Efficient Scheme for Updating Sparse Cholesky Factors

Raghavan had earlier developed the software package DCSPACK which can be used for solving sparse linear systems where the coefficient matrix is symmetric and positive definite (this project was not funded by NASA but by agencies such as NSF). DSCPACK-S is the serial code and DSCPACK-P is a parallel implementation suitable for multiprocessors or networks-of-workstations with message passing using MCI. The main algorithm used is the Cholesky factorization of a sparse symmetric positive positive definite matrix A = LL(T). The code can also compute the factorization A = LDL(T). The complexity of the software arises from several factors relating to the sparsity of the matrix A. A sparse N x N matrix A has typically less that cN nonzeroes where c is a small constant. If the matrix were dense, it would have O(N2) nonzeroes. The most complicated part of such sparse Cholesky factorization relates to fill-in, i.e., zeroes in the original matrix that become nonzeroes in the factor L. An efficient implementation depends to a large extent on complex data structures and on techniques from graph theory to reduce, identify, and manage fill. DSCPACK is based on an efficient multifrontal implementation with fill-managing algorithms and implementation arising from earlier research by Raghavan and others. Sparse Cholesky factorization is typically a four step process: (1) ordering to compute a fill-reducing numbering, (2) symbolic factorization to determine the nonzero structure of L, (3) numeric factorization to compute L, and, (4) triangular solution to solve L(T)x = y and Ly = b. The first two steps are symbolic and are performed using the graph of the matrix. The numeric factorization step is of dominant cost and there are several schemes for improving performance by exploiting the nested and dense structure of groups of columns in the factor. The latter are aimed at better utilization of the cache-memory hierarchy on modem processors to prevent cache-misses and provide execution rates (operations/second) that are close to the peak rates for dense matrix computations. Currently, EPISCOPACY is being used in an application at NASA directed by J. Newman and M. James. We propose the implementation of efficient schemes for updating the LL(T) or LDL(T) factors computed in DSCPACK-S to meet the computational requirements of their project. A brief description is provided in the next section.

Raghavan, Padma↗

Particle Swarm Optimization

The purpose of this paper is to show how the search algorithm known as particle swarm optimization performs. Here, particle swarm optimization is applied to structural design problems, but the method has a much wider range of possible applications. The paper's new contributions are improvements to the particle swarm optimization algorithm and conclusions and recommendations as to the utility of the algorithm, Results of numerical experiments for both continuous and discrete applications are presented in the paper. The results indicate that the particle swarm optimization algorithm does locate the constrained minimum design in continuous applications with very good precision, albeit at a much higher computational cost than that of a typical gradient based optimizer. However, the true potential of particle swarm optimization is primarily in applications with discrete and/or discontinuous functions and variables. Additionally, particle swarm optimization has the potential of efficient computation with very large numbers of concurrently operating processors.

Venter, Gerhard↗

High Resolution Aerospace Applications using the NASA Columbia Supercomputer

This paper focuses on the parallel performance of two high-performance aerodynamic simulation packages on the newly installed NASA Columbia supercomputer. These packages include both a high-fidelity, unstructured, Reynolds-averaged Navier-Stokes solver, and a fully-automated inviscid flow package for cut-cell Cartesian grids. The complementary combination of these two simulation codes enables high-fidelity characterization of aerospace vehicle design performance over the entire flight envelope through extensive parametric analysis and detailed simulation of critical regions of the flight envelope. Both packages. are industrial-level codes designed for complex geometry and incorpor.ats. CuStomized multigrid solution algorithms. The performance of these codes on Columbia is examined using both MPI and OpenMP and using both the NUMAlink and InfiniBand interconnect fabrics. Numerical results demonstrate good scalability on up to 2016 CPUs using the NUMAIink4 interconnect, with measured computational rates in the vicinity of 3 TFLOP/s, while InfiniBand showed some performance degradation at high CPU counts, particularly with multigrid. Nonetheless, the results are encouraging enough to indicate that larger test cases using combined MPI/OpenMP communication should scale well on even more processors.

Mavriplis, Dimitri J.↗

Performance of the Community Earth System Model

The Community Earth System Model (CESM), released in June 2010, incorporates new physical process and new numerical algorithm options, significantly enhancing simulation capabilities over its predecessor, the June 2004 release of the Community Climate System Model. CESM also includes enhanced performance tuning options and performance portability capabilities. This paper describes the performance engineering aspects of the CESM and reports performance and performance scaling on both the Cray XT5 and the IBM BG/P for four representative production simulations, varying both problem size and enabled physical processes. The paper also describes preliminary performance results for high resolution simulations using over 200,000 processor cores, indicating the promise of ongoing work in numerical algorithms and where further work is required.

99 GENERAL AND MISCELLANEOUS↗

GPU Accelerated Event Detection Algorithm

Smart grid external require new algorithmic approaches as well as parallel formulations. One of the critical components is the prediction of changes and detection of anomalies within the power grid. The state-of-the-art algorithms are not suited to handle the demands of streaming data analysis. (i) need for events detection algorithms that can scale with the size of data, (ii) need for algorithms that can not only handle multi dimensional nature of the data, but also model both spatial and temporal dependencies in the data, which, for the most part, are highly nonlinear, (iii) need for algorithms that can operate in an online fashion with streaming data. The GAEDA code is a new online anomaly detection techniques that take into account spatial, temporal, multi-dimensional aspects of the data set. The basic idea behind the proposed approach is to (a) to convert a multi-dimensional sequence into a univariate time series that captures the changes between successive windows extracted from the original sequence using singular value decomposition (SVD), and then (b) to apply known anomaly detection techniques for univariate time series. A key challenge for the proposed approach is to make the algorithm scalable to huge datasets by adopting techniques from perturbation theory, incremental SVD analysis. We used recent advances in tensor decomposition techniques which reduce computational complexity to monitor the change between successive windows and detect anomalies in the same manner as described above. Therefore we propose to develop the parallel solutions on many core systems such as GPUs, because these algorithms involve lot of numerical operations and are highly data-parallelizable.

Source record↗

Computation of neutron fluxes in clusters of fuel pins arranged in hexagonal assemblies (2D and 3D)

For computations of fluxes, we have used Carvik's method of collision probabilities. This method requires tracking algorithms. An algorithm to compute tracks (in 2D and 3D) has been developed for seven hexagonal geometries with cluster of fuel pins. This has been implemented in the NXT module of the code DRAGON. The flux distribution in cluster of pins has been computed by using this code. For testing the results, they are compared when possible with the EXCELT module of the code DRAGON. Tracks are plotted in the NXT module by using MATLAB, these plots are also presented here. Results are presented with increasing number of lines to show the convergence of these results. We have numerically computed volumes, surface areas and the percentage errors in these computations. These results show that 2D results converge faster than 3D results. The accuracy on the computation of fluxes up to second decimal is achieved with fewer lines. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A hybrid method for hydrodynamic-kinetic flow Part I: A particle-grid method for reducing stochastic noise in kinetic regimes

In this work we present a hybrid particle-grid Monte Carlo method for the Boltzmann equation, which is characterized by a significant reduction of the stochastic noise in the kinetic regime. The hybrid method is based on a first order splitting in time to separate the transport from the relaxation step. The transport step is solved by a deterministic scheme, while a hybrid DSMC-based method is used to solve the collision step. Such a hybrid scheme is based on splitting the solution in a collisional and a non-collisional part at the beginning of the collision step, and the DSMC method is used to solve the relaxation step for the collisional part of the solution only. This is accomplished by sampling only the fraction of particles candidate for collisions from the collisional part of the solution, performing collisions as in a standard DSMC method, and then projecting the particles back onto a velocity grid to compute a piecewise constant reconstruction for the collisional part of the solution. The latter is added to a piecewise constant reconstruction of the non-collisional part of the solution, which in fact remains unchanged during the relaxation step. Numerical results show that the stochastic noise is significantly reduced at large Knudsen numbers with respect to the standard DSMC method. Indeed in this algorithm, the particle scheme is applied only on the collisional part of the solution, so only this fraction of the solution is affected by stochastic fluctuations. But since the collisional part of the solution reduces as the Knudsen number increases, stochastic noise reduces as well at large Knudsen numbers.

97 MATHEMATICS AND COMPUTING↗

Analytical estimation of emission zone mean position and width in organic light-emitting diodes from emission pattern image-source interference fringes

We present an analytical method for evaluating the first and second moments of the effective exciton spatial distribution in organic light-emitting diodes (OLED) from measured emission patterns. Specifically, the suggested algorithm estimates the emission zone mean position and width, respectively, from two distinct features of the pattern produced by interference between the emission sources and their images (induced by the reflective cathode): the angles in which interference extrema are observed, and the prominence of interference fringes. The relations between these parameters are derived rigorously for a general OLED structure, indicating that extrema angles are related to the mean position of the radiating excitons via Bragg's condition, and the spatial broadening is related to the attenuation of the image-source interference prominence due to an averaging effect. The method is applied successfully both on simulated emission patterns and on experimental data, exhibiting a very good agreement with the results obtained by numerical techniques. We investigate the method performance in detail, showing that it is capable of producing accurate estimations for a wide range of source-cathode separation distances, provided that the measured spectral interval is large enough; guidelines for achieving reliable evaluations are deduced from these results as well. As opposed to numerical fitting tools employed to perform similar tasks to date, our approximate method explicitly utilizes physical intuition and requires far less computational effort (no fitting is involved). Hence, applications that do not require highly resolved estimations, e.g., preliminary design and production-line verification, can benefit substantially from the analytical algorithm, when applicable. This introduces a novel set of efficient tools for OLED engineering, highly important in the view of the crucial role the exciton distribution plays in determining the device performance.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Understanding the Effects of Tapering on Gaussian Process Regression

Gaussian process regression is a computationally expensive machine learning algorithm that requires the solution of a system of linear equations with a dense covariance matrix. We propose a modification that uses tapering to introduce sparsity into the covariance matrix followed by matrix reordering schemes to reduce the bandwidth of the sparse matrix. We also apply iterative refinement to our approximate solution in order to recover some of the accuracy lost to tapering. Our numerical tests showed that this modification works best with datasets that have many small values in the covariance matrix. This restricts the usefulness of the modification, so other techniques to reduce computational time may be worth considering in the future.

97 MATHEMATICS AND COMPUTING↗

Second order multidimensional sign-preserving remapping for ALE methods

A second-order conservative sign-preserving remapping scheme for Arbitrary Lagrangian-Eulerian (ALE) methods is developed utilising concepts of the Multidimensional Positive Definite Advection Transport Algorithm (MPDATA). The algorithm is inherently multidimensional, and so does not introduce splitting errors. The remapping is implemented in a two-dimensional, finite element ALE solver employing staggered quadrilateral meshes. The MPDATA remapping uses a finite volume discretization developed for volume coordinates. It is applied for the remapping of density and internal energy arranged as cell centered, and velocity as nodal, dependent variables. In the paper, the advection of scalar fields is examined first for test cases with prescribed mesh movement. A direct comparison of MPDATA with the performance of the van Leer MUSCL scheme indicates advantages of a multidimensional approach. Furthermore, distinctly different performance between basic MPDATA and the infinite gauge option is illustrated using benchmarks involving transport of a sign changing velocity field. Further development extends the application of MPDATA remapping to the full ALE solver with a staggered mesh arrangement for density, internal energy and momentum using volume coordinates. At present, two options of the algorithm - basic and infinite gauge - are implemented. To ensure a meaningful assessment, an identical Lagrangian solver and computational mesh update routines are used with either MPDATA or van Leer MUSCL remapping. The evaluation places particular focus on the abilities of both schemes to accurately model multidimensional problems. Theoretical considerations are supported with numerical examples. In addition to the prescribed mesh movement cases for advection of scalars, the demonstrations include two-dimensional Eulerian and ALE flow simulations on quadrilateral meshes with both fixed and variable timestep control. The key comparisons include the standard test cases of Sod and Noh for single material problems. The results demonstrate that the MPDATA gauge option is suitable for providing accurate ALE remapping and preserves the multidimensionality and sign of both scalar and vector fields.

59 BASIC BIOLOGICAL SCIENCES↗

Numerical Study of Boundary Layer Interaction with Shocks: Method Improvement and Test Computation

The objective is the development of a high-order and high-resolution method for the direct numerical simulation of shock turbulent-boundary-layer interaction. Details concerning the spatial discretization of the convective terms can be found in Adams and Shariff (1995). The computer code based on this method as introduced in Adams (1994) was formulated in Cartesian coordinates and thus has been limited to simple rectangular domains. For more general two-dimensional geometries, as a compression corner, an extension to generalized coordinates is necessary. To keep the requirements or limitations for grid generation low, the extended formulation should allow for non-orthogonal grids. Still, for simplicity and cost efficiency, periodicity can be assumed in one cross-flow direction. For easy vectorization, the compact-ENO coupling algorithm as used in Adams (1994) treated whole planes normal to the derivative direction with the ENO scheme whenever at least one point of this plane satisfied the detection criterion. This is apparently too restrictive for more general geometries and more complex shock patterns. Here we introduce a localized compact-ENO coupling algorithm, which is efficient as long as the overall number of grid points treated by the ENO scheme is small compared to the total number of grid points. Validation and test computations with the final code are performed to assess the efficiency and suitability of the computer code for the problems of interest. We define a set of parameters where a direct numerical simulation of a turbulent boundary layer along a compression corner with reasonably fine resolution is affordable.

Adams, N. A.↗

Multilevel decomposition of complete vehicle configuration in a parallel computing environment

This research summarizes various approaches to multilevel decomposition to solve large structural problems. A linear decomposition scheme based on the Sobieski algorithm is selected as a vehicle for automated synthesis of a complete vehicle configuration in a parallel processing environment. The research is in a developmental state. Preliminary numerical results are presented for several example problems.

Bhatt, Vinay↗