SEARCH · Search NASA

Results for “EXPLICIT PHYSICS ALGORITHMS”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 37 records · Page 2

All sources NASA NTRS DOE OSTI

NASA NTRS1985

Finite element algorithms for compressible flow computation on a supercomputer

Methods of applying computational fluid dynamics techniques to engineering problems are discussed. The linking factors between theoretical and applied research are the shape and weight functions which produce the Galerkin finite element schemes. The flow is unsteady, viscous, heat conducting and compressible, and steady-state flows are the asymptotic limit of unsteady flows. All flows are described by the time-averaged Navier-Stokes equations (NSE) with mass and energy conservation. Local curvilinear intrinsic coordinates are applied to discretize the NSE in arbitrary geometric domains. A modified weighted residuals approach defines the discrete analogs of the physical systems modeled and a general interpolants method is used to derive families of numerical models, both implicit and explicit, finite difference and finite elemnt, from a single point of departure. Time-dependent element approximations are achieved with a progressive assembly of generalized elements method. Hyperbolic steady-state Euler algorithms and quasi-parabolic are spatial marching algorithms for solving the discretized equations. Application of the techniques is illustrated through calculation of the compressible flow around a hypersonic flight vehicle at 100,000 ft at zero angle of attack at speeds of Mach 4-10.

Spradley, L. W.↗

NASA NTRS1977

An explicit solution to the exoatmospheric powered flight guidance and trajectory optimization problem for rocket propelled vehicles

A derivation of an explicit solution to the two point boundary-value problem of exoatmospheric guidance and trajectory optimization is presented. Fixed initial conditions and continuous burn, multistage thrusting are assumed. Any number of end conditions from one to six (throttling is required in the case of six) can be satisfied in an explicit and practically optimal manner. The explicit equations converge for off nominal conditions such as engine failure, abort, target switch, etc. The self starting, predictor/corrector solution involves no Newton-Rhapson iterations, numerical integration, or first guess values, and converges rapidly if physically possible. A form of this algorithm has been chosen for onboard guidance, as well as real time and preflight ground targeting and trajectory shaping for the NASA Space Shuttle Program.

Jaggers, R. F.↗

NASA NTRS1993

Distributed parallel processing applied to an implicit multigrid Euler/Navier-Stokes algorithm

An implicit multigrid algorithm for the solution of the Euler and Navier-Stokes equations has been implemented within the framework of multiple block-structured grids in which the physical domain is spatially decomposed into several blocks and the solution is advanced in parallel on each block. Utilities have been developed to implement such a scheme in a distributed computing environment. The multi-block algorithm is designed so that the explicit residual calculation is identical to that of single-block scheme, and therefore converged solutions for both schemes must be the same. To accelerate convergence, synchronous and asynchronous multigrid strategies are implemented. Significant speedups have been achieved in a multiple processor environment, while convergence rates similar to those of the single-block scheme are observed.

Tysinger, T. L.↗

NASA NTRS2014

A Physically Based Algorithm for Non-Blackbody Correction of Cloud-Top Temperature and Application to Convection Study

Cloud-top temperature (CTT) is an important parameter for convective clouds and is usually different from the 11-micrometers brightness temperature due to non-blackbody effects. This paper presents an algorithm for estimating convective CTT by using simultaneous passive [Moderate Resolution Imaging Spectroradiometer (MODIS)] and active [CloudSat 1 Cloud-Aerosol Lidar and Infrared Pathfinder Satellite Observations (CALIPSO)] measurements of clouds to correct for the non-blackbody effect. To do this, a weighting function of the MODIS 11-micrometers band is explicitly calculated by feeding cloud hydrometer profiles from CloudSat and CALIPSO retrievals and temperature and humidity profiles based on ECMWF analyses into a radiation transfer model.Among 16 837 tropical deep convective clouds observed by CloudSat in 2008, the averaged effective emission level (EEL) of the 11-mm channel is located at optical depth; approximately 0.72, with a standard deviation of 0.3. The distance between the EEL and cloud-top height determined by CloudSat is shown to be related to a parameter called cloud-top fuzziness (CTF), defined as the vertical separation between 230 and 10 dBZ of CloudSat radar reflectivity. On the basis of these findings a relationship is then developed between the CTF and the difference between MODIS 11-micrometers brightness temperature and physical CTT, the latter being the non-blackbody correction of CTT. Correction of the non-blackbody effect of CTT is applied to analyze convective cloud-top buoyancy. With this correction, about 70% of the convective cores observed by CloudSat in the height range of 6-10 km have positive buoyancy near cloud top, meaning clouds are still growing vertically, although their final fate cannot be determined by snapshot observations.

Physical Algorithm↗

NASA NTRS2006

User-Defined Data Distributions in High-Level Programming Languages

One of the characteristic features of today s high performance computing systems is a physically distributed memory. Efficient management of locality is essential for meeting key performance requirements for these architectures. The standard technique for dealing with this issue has involved the extension of traditional sequential programming languages with explicit message passing, in the context of a processor-centric view of parallel computation. This has resulted in complex and error-prone assembly-style codes in which algorithms and communication are inextricably interwoven. This paper presents a high-level approach to the design and implementation of data distributions. Our work is motivated by the need to improve the current parallel programming methodology by introducing a paradigm supporting the development of efficient and reusable parallel code. This approach is currently being implemented in the context of a new programming language called Chapel, which is designed in the HPCS project Cascade.

physically distributed memory↗

NASA NTRS1989

Development of a Navier-Stokes algorithm for parallel-processing supercomputers

An explicit flow solver, applicable to the hierarchy of model equations ranging from Euler to full Navier-Stokes, is combined with several techniques designed to reduce computational expense. The computational domain consists of local grid refinements embedded in a global coarse mesh, where the locations of these refinements are defined by the physics of the flow. Flow characteristics are also used to determine which set of model equations is appropriate for solution in each region, thereby reducing not only the number of grid points at which the solution must be obtained, but also the computational effort required to get that solution. Acceleration to steady-state is achieved by applying multigrid on each of the subgrids, regardless of the particular model equations being solved. Since each of these components is explicit, advantage can readily be taken of the vector- and parallel-processing capabilities of machines such as the Cray X-MP and Cray-2.

Swisshelm, Julie M.↗

NASA NTRS1988

Development of an aerodynamics algorithm for parallel-processing supercomputers

Swisshelm, Julie M.↗

NASA NTRS1978

Supersonic flow over ablated nosetips using an unsteady, implicit numerical procedure

The axisymmetric supersonic flow over passive, that is, nonablating, indented nosetips of reentry vehicles is determined using an unsteady implicit numerical algorithm which solves either the inviscid Euler equations or the 'thin-layer' Navier-Stokes equations. A nonorthogonal independent variable transformation is used to map the distorted physical region, containing multiple zones of embedded subsonic flow into a rectangular computational domain at whose boundaries the required permeable or impermeable boundary conditions are simulated. Use of the implicit algorithm results in faster convergence to the steady state because of a larger allowable time step over conventional explicit schemes. The numerical results obtained compare favorably with existing experimental data for very mildly and severely indented blunt nosetips.

Kutler, P.↗

NASA NTRS2010

Adaptive Numerical Algorithms in Space Weather Modeling

Space weather describes the various processes in the Sun-Earth system that present danger to human health and technology. The goal of space weather forecasting is to provide an opportunity to mitigate these negative effects. Physics-based space weather modeling is characterized by disparate temporal and spatial scales as well as by different physics in different domains. A multi-physics system can be modeled by a software framework comprising of several components. Each component corresponds to a physics domain, and each component is represented by one or more numerical models. The publicly available Space Weather Modeling Framework (SWMF) can execute and couple together several components distributed over a parallel machine in a flexible and efficient manner. The framework also allows resolving disparate spatial and temporal scales with independent spatial and temporal discretizations in the various models. Several of the computationally most expensive domains of the framework are modeled by the Block-Adaptive Tree Solar wind Roe Upwind Scheme (BATS-R-US) code that can solve various forms of the magnetohydrodynamics (MHD) equations, including Hall, semi-relativistic, multi-species and multi-fluid MHD, anisotropic pressure, radiative transport and heat conduction. Modeling disparate scales within BATS-R-US is achieved by a block-adaptive mesh both in Cartesian and generalized coordinates. Most recently we have created a new core for BATS-R-US: the Block-Adaptive Tree Library (BATL) that provides a general toolkit for creating, load balancing and message passing in a 1, 2 or 3 dimensional block-adaptive grid. We describe the algorithms of BATL and demonstrate its efficiency and scaling properties for various problems. BATS-R-US uses several time-integration schemes to address multiple time-scales: explicit time stepping with fixed or local time steps, partially steady-state evolution, point-implicit, semi-implicit, explicit/implicit, and fully implicit numerical schemes. Depending on the application, we find that different time stepping methods are optimal. Several of the time integration schemes exploit the block-based granularity of the grid structure. The framework and the adaptive algorithms enable physics based space weather modeling and even forecasting.

Toth, Gabor↗

NASA NTRS1989

Solution of steady-state one-dimensional conservation laws by mathematical programming

Solution techniques for a class of steady-state scalar conservation laws are developed analytically. Discretization by finite-volume formulas is employed to obtain an overdetermined system of algebraic equations, which are then perturbed nonsingularly (with perturbation coefficient = epsilon) and solved using the l(1) mathematical-programming algorithm of Seneta and Steiger (1984); this approach limits the matrix bandwidth to two, so that an explicit solution can be found efficiently. It is shown that, for small values of epsilon, the l(1) solutions exhibit sharp correctly located shocks and are nonoscillatory O(epsilon) approximations of the physically relevant solutions.

Lavery, J. E.↗

NASA NTRS2007

Estimating the Inertia Matrix of a Spacecraft

A paper presents a method of utilizing some flight data, aboard a spacecraft that includes reaction wheels for attitude control, to estimate the inertia matrix of the spacecraft. The required data are digitized samples of (1) the spacecraft attitude in an inertial reference frame as measured, for example, by use of a star tracker and (2) speeds of rotation of the reaction wheels, the moments of inertia of which are deemed to be known. Starting from the classical equations for conservation of angular momentum of a rigid body, the inertia-matrix-estimation problem is formulated as a constrained least-squares minimization problem with explicit bounds on the inertia matrix incorporated as linear matrix inequalities. The explicit bounds reflect physical bounds on the inertia matrix and reduce the volume of data that must be processed to obtain a solution. The resulting minimization problem is a semidefinite optimization problem that can be solved efficiently, with guaranteed convergence to the global optimum, by use of readily available algorithms. In a test case involving a model attitude platform rotating on an air bearing, it is shown that, relative to a prior method, the present method produces better estimates from few data.

Acikmese, Behcet↗

NASA NTRS1980

Supersonic flow over three-dimensional ablated nosetips using an unsteady implicit numerical procedure

The three-dimensional supersonic flow over passive, that is, nonablating, indented nosetips of reentry vehicles is determined using an unsteady implicit numerical algorithm which solves either the inviscid Euler equations or the 'thin-layer' Navier-Stokes equations. A nonorthogonal independent variable transformation is used to map the distorted physical domain, containing multiple zones of embedded subsonic flow and separated flow regions into a rectangular computational volume at whose boundaries the required permeable or impermeable boundary conditions are simulated. Use of the implicit algorithm results in faster convergence to the steady state because of a larger allowable time step over conventional explicit schemes. The numerical results obtained compare favorably with existing numerical solutions and experimental data for simple spheres which validates the program. Results are also presented for analytically defined indented bodies for both laminar and turbulent flow conditions that demonstrate the program's capability for computing such flows.

Kutler, P.↗

NASA NTRS2010

Ambiguity of Quality in Remote Sensing Data

This slide presentation reviews some of the issues in quality of remote sensing data. Data "quality" is used in several different contexts in remote sensing data, with quite different meanings. At the pixel level, quality typically refers to a quality control process exercised by the processing algorithm, not an explicit declaration of accuracy or precision. File level quality is usually a statistical summary of the pixel-level quality but is of doubtful use for scenes covering large areal extents. Quality at the dataset or product level, on the other hand, usually refers to how accurately the dataset is believed to represent the physical quantities it purports to measure. This assessment often bears but an indirect relationship at best to pixel level quality. In addition to ambiguity at different levels of granularity, ambiguity is endemic within levels. Pixel-level quality terms vary widely, as do recommendations for use of these flags. At the dataset/product level, quality for low-resolution gridded products is often extrapolated from validation campaigns using high spatial resolution swath data, a suspect practice at best. Making use of quality at all levels is complicated by the dependence on application needs. We will present examples of the various meanings of quality in remote sensing data and possible ways forward toward a more unified and usable quality framework.

Lynnes, Christopher↗

NASA NTRS2006

Development of Comprehensive Reduced Kinetic Models for Supersonic Reacting Shear Layer Simulations

Large-scale simulations of multi-dimensional unsteady turbulent reacting flows with detailed chemistry and transport can be computationally extremely intensive even on distributed computing architectures. With the development of suitable reduced chemical kinetic models, the number of scalar variables to be integrated can be decreased, leading to a significant reduction in the computational time required for the simulation with limited loss of accuracy in the results. A general MATLAB-based automated mechanism reduction procedure is presented to reduce any complex starting mechanism (detailed or skeletal) with minimal human intervention. Based on the application of the quasi steady-state (QSS) approximation for certain chemical species and on the elimination of the fast reaction rates in the mechanism, several comprehensive reduced models, capable of handling different fuels such as C2H4, CH4 and H2, have been developed and thoroughly tested for several combustion problems (ignition, propagation and extinction) and physical conditions (reactant compositions, temperatures, and pressures). A key feature of the present reduction procedure is the explicit solution of the concentrations of the QSS species, needed for the evaluation of the elementary reaction rates. In contrast, previous approaches relied on an implicit solution due to the strong coupling between QSS species, requiring computationally expensive inner iterations. A novel algorithm, based on the definition of a QSS species coupling matrix, is presented to (i) introduce appropriate truncations to the QSS algebraic relations and (ii) identify the optimal sequence for the explicit solution of the concentration of the QSS species. With the automatic generation of the relevant source code, the resulting reduced models can be readily implemented into numerical codes.

Zambon, A. C.↗

NASA NTRSDate not supplied

Generation of Continental Scale Percent Tree Cover Product Using Deep-learning and Multi-scale Remote Sensing Data

Spatially explicit percent tree cover (TC) estimation is critical for mapping forest aboveground biomass and its dynamics. While various TC products have been developed, there has not been a generalized framework that can be applied to diverse terrestrial ecosystems due to underlain extreme complexities. Deep learning algorithms can learn a spatial pattern and radiometric characteristics of tree canopy as a robust approximation of physical or empirical models, and thus have emerged as promising and efficient tools for large-scale TC mapping. In this study, we synergistically use very high-resolution aerial imageries (National Agriculture Imagery Program, NAIP) and medium resolution Landsat data to map continental-scale TC (CONUS and Mexico) through a hierarchical deep learning approach (Convolutional Neural Network), i.e., NAIP TC generated from a NAIP model is utilized to train a Landsat model. The produced TC product (hereafter, NEX-TC) is able to capture the spatial pattern of TC distribution and its changes driven by natural disturbance and human land management. We further explore and analyze the reliability and potential uncertainty of the NEX-TC by comparing it to lidar- (lidar-TC), National Land Cover Database (NLCD-TC), and MODIS Vegetation Continuous Field (MODIS-TC). This evaluation practice reveals that TC products based on passive optical sensors tend to underestimate TC across all land cover types while Landsat-based TCs (i.e., NEX-TC & NLCD-TC) perform better than the coarser MODIS TC estimate. Our results show that the NEX-TC is generally comparable to NLCD-TC but it particularly outperforms NLCD-TC and MODIS-TC over the dense forests where lidar-TC indicates >80% TC. These results indicate that our hierarchical deep learning approach and TC product will be effective and useful for characterizing large-scale tree cover and possibly associated carbon dynamics.

Landsat↗

NASA NTRS1984

Optical systolic solutions of linear algebraic equations

The philosophy and data encoding possible in systolic array optical processor (SAOP) were reviewed. The multitude of linear algebraic operations achievable on this architecture is examined. These operations include such linear algebraic algorithms as: matrix-decomposition, direct and indirect solutions, implicit and explicit methods for partial differential equations, eigenvalue and eigenvector calculations, and singular value decomposition. This architecture can be utilized to realize general techniques for solving matrix linear and nonlinear algebraic equations, least mean square error solutions, FIR filters, and nested-loop algorithms for control engineering applications. The data flow and pipelining of operations, design of parallel algorithms and flexible architectures, application of these architectures to computationally intensive physical problems, error source modeling of optical processors, and matching of the computational needs of practical engineering problems to the capabilities of optical processors are emphasized.

Neuman, C. P.↗

NASA NTRS1990

Enhanced thermochemical nonequilibrium computations of flow around the aeroassist flight experiment vehicle

A three-dimensional explicit, finite-rate, shock-capturing numerical algorithm is used to calculate thermochemical nonequilibrium flowfields about the Aeroassist Flight Experiment vehicle at one of its flight trajectory points. The full Navier-Stokes equations and an eleven species chemical model with the latest reaction rates are incorporated into the code. Results are compared against experimental data and other numerical solutions. The effects of changes to the physical model on the stagnation line and base region flow and surface quantities on the forebody are investigated.

Palmer, Grant↗

NASA NTRS2005

A Comparative Study of Probability Collectives Based Multi-agent Systems and Genetic Algorithms

We compare Genetic Algorithms (GA's) with Probability Collectives (PC), a new framework for distributed optimization and control. In contrast to GA's, PC-based methods do not update populations of solutions. Instead they update an explicitly parameterized probability distribution p over the space of solutions. That updating of p arises as the optimization of a functional of p. The functional is chosen so that any p that optimizes it should be p peaked about good solutions. The PC approach works in both continuous and discrete problems. It does not suffer from the resolution limitation of the finite bit length encoding of parameters into GA alleles. It also has deep connections with both game theory and statistical physics. We review the PC approach using its motivation as the information theoretic formulation of bounded rationality for multi-agent systems. It is then compared with GA's on a diverse set of problems. To handle high dimensional surfaces, in the PC method investigated here p is restricted to a product distribution. Each distribution in that product is controlled by a separate agent. The test functions were selected for their difficulty using either traditional gradient descent or genetic algorithms. On those functions the PC-based approach significantly outperforms traditional GA's in both rate of descent, trapping in false minima, and long term optimization.

Huang, Chien-Feng↗