Search NASA⌕ Search

SEARCH · Search NASA

Results for “generalized 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 487 records · Page 27

Implicit-explicit evolution of single black holes

Numerical simulations of binary black holes - an important predictive tool for the detection of gravitational waves - are computationally expensive, especially for binaries with high mass ratios or with rapidly spinning constituent holes. Existing codes for evolving binary black holes rely on explicit time-stepping methods, for which the time-step size is limited by the smallest spatial scale through the Courant-Friedrichs-Lewy condition. Binary inspiral typically involves spatial scales (the spatial resolution required by a small or rapidly spinning hole) which are orders of magnitude smaller than the relevant (orbital, precession, and radiation-reaction) time scales characterizing the inspiral. Therefore, in explicit evolutions of binary black holes, the time-step size is typically orders of magnitude smaller than the relevant physical time scales. Implicit time-stepping methods allow for larger time steps, and they often reduce the total computational cost (without significant loss of accuracy) for problems dominated by spatial rather than temporal error, such as for binary-black-hole inspiral in corotating coordinates. However, fully implicit methods can be difficult to implement for nonlinear evolution systems like the Einstein equations. Therefore, in this paper we explore implicit-explicit (IMEX) methods and use them for the first time to evolve black-hole spacetimes. Specifically, as a first step toward IMEX evolution of a full binary-black-hole spacetime, we develop an IMEX algorithm for the generalized harmonic formulation of the Einstein equations and use this algorithm to evolve stationary and perturbed single-black-hole spacetimes. Numerical experiments explore the stability and computational efficiency of our method.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A Multigrid Framework for SN Discretizations of the Boltzmann Transport Equation with Application to Spatially Unstructured Grids

The space-angle multiple/semi-coarsening multigrid methods of [3] for S n discretizations of the Boltzmann transport equation was developed assuming rediscretizations of the streaming collision operators on the coarser spatial grids. These rediscretized operators are directly used in the kernels of the spatial coarse-level scalar flux integral equations, which undergo the multigrid process. Since the computation is essentially performed on these integral equations, it appears that the multigrid procedure is applied directly to the finest level scalar flux integral equation, rather than to the finest level S n system. However, this procedure is actually applied implicitly to the finest level S n system, though it would be beneficial to directly relate the multiple/semi-coarsening methods to the full S n system: being able to relate the multigrid procedure directly to the full S n system will lead to a general framework that can help guide the development of multigrid algorithms for more general S n discretization settings, such as when spatial rediscretization of the integral equation kernel can not be applied. In this latter case, applying an operator-dependent Galerkin coarsening procedure to the integral operator is difficult, if not realizable, because the kernel is dense and often given by its action of numerically sweeping over all the streaming-collision operators. In this paper, we develop and analyze such a multigrid framework for the S n system. We further relate this framework to a multigrid scheme that directly coarsens the scalar flux integral equation using a Galerkin coarsening approach. For this approach, we show that an intricate operator-dependent Galerkin coarsening procedure may not be needed. In particular, this paper develops a Galerkin-principle framework for S n discretizations of the Boltzmann equation, of which the analysis shows that simple interpolation operators can be used to coarsen the integral equations operators arising from the space-angle multiple/semi-coarsening methods.

97 MATHEMATICS AND COMPUTING↗

A simple suboptimal least-squares algorithm for attitude determination with multiple sensors

Three-axis attitude determination is equivalent to finding a coordinate transformation matrix which transforms a set of reference vectors fixed in inertial space to a set of measurement vectors fixed in the spacecraft. The attitude determination problem can be expressed as a constrained optimization problem. The constraint is that a coordinate transformation matrix must be proper, real, and orthogonal. A transformation matrix can be thought of as optimal in the least-squares sense if it maps the measurement vectors to the reference vectors with minimal 2-norm errors and meets the above constraint. This constrained optimization problem is known as Wahba's problem. Several algorithms which solve Wahba's problem exactly have been developed and used. These algorithms, while steadily improving, are all rather complicated. Furthermore, they involve such numerically unstable or sensitive operations as matrix determinant, matrix adjoint, and Newton-Raphson iterations. This paper describes an algorithm which minimizes Wahba's loss function, but without the constraint. When the constraint is ignored, the problem can be solved by a straightforward, numerically stable least-squares algorithm such as QR decomposition. Even though the algorithm does not explicitly take the constraint into account, it still yields a nearly orthogonal matrix for most practical cases; orthogonality only becomes corrupted when the sensor measurements are very noisy, on the same order of magnitude as the attitude rotations. The algorithm can be simplified if the attitude rotations are small enough so that the approximation sin(theta) approximately equals theta holds. We then compare the computational requirements for several well-known algorithms. For the general large-angle case, the QR least-squares algorithm is competitive with all other know algorithms and faster than most. If attitude rotations are small, the least-squares algorithm can be modified to run faster, and this modified algorithm is faster than all but a similarly specialized version of the QUEST algorithm. We also introduce a novel measurement averaging technique which reduces the n-measurement case to the two measurement case for our particular application, a star tracker and earth sensor mounted on an earth-pointed geosynchronous communications satellite. Using this technique, many n-measurement problems reduce to less than or equal to 3 measurements; this reduces the amount of required calculation without significant degradation in accuracy. Finally, we present the results of some tests which compare the least-squares algorithm with the QUEST and FOAM algorithms in the two-measurement case. For our example case, all three algorithms performed with similar accuracy.

Brozenec, Thomas F.↗

Verifying Algorithms for Autonomous Aircraft by Simulation Generalities and Example

An open question in Air Traffic Management is what procedures can be validated by simulation where the simulation shows that the probability of undesirable events is below the required level at some confidence level. The problem is including enough realism to be convincing while retaining enough efficiency to run the large number of trials needed for high confidence. The paper first examines the probabilistic interpretation of a typical requirement by a regulatory agency and computes the number of trials needed to establish the requirement at an equivalent confidence level. Since any simulation is likely to consider only one type of event and there are several types of events, the paper examines under what conditions this separate consideration is valid. The paper establishes a separation algorithm at the required confidence level where the aircraft operates under feedback control as is subject to perturbations. There is a discussion where it is shown that a scenario three of four orders of magnitude more complex is feasible. The question of what can be validated by simulation remains open, but there is reason to be optimistic.

White, Allan L.↗

A new FFT-based algorithm to compute Born radii in the generalized Born theory of biomolecule solvation

In this paper, a new method for calculating effective atomic radii within the generalized Born (GB) model of implicit solvation is proposed, for use in computer simulations of biomolecules. First, a new formulation for the GB radii is developed, in which smooth kernels are used to eliminate the divergence in volume integrals intrinsic in the model. Next, the fast Fourier transform (FFT) algorithm is applied to integrate smoothed functions, taking advantage of the rapid spectral decay provided by the smoothing. The total cost of the proposed algorithm scales as O(N{sup 3}logN+M) where M is the number of atoms comprised in a molecule and N is the number of FFT grid points in one dimension, which depends only on the geometry of the molecule and the spectral decay of the smooth kernel but not on M. To validate our algorithm, numerical tests are performed for three solute models: one spherical object for which exact solutions exist and two protein molecules of differing size. The tests show that our algorithm is able to reach the accuracy of other existing GB implementations, while offering much lower computational cost.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

MarmotViz User Guide

MarmotViz is an illustrative visualization plug-in for ParaView. It is intended for generating enhanced visualizations of time-varying datasets on unstructured connected meshes. A detailed description of the implemented algorithms and program structure can be found in the related document: Generalized framework and algorithms for illustrative visualization of time-varying data on unstructured meshes . This document provides details for compiling/building MarmotViz, using the MarmotViz plug-in in ParaView, and extending the MarmotViz plug-in.

42 ENGINEERING↗

Accompanying coordinate expansion and recurrence relation method using a transfer relation scheme for electron repulsion integrals with high angular momenta and long contractions

An efficient algorithm for the rapid evaluation of electron repulsion integrals is proposed. The present method, denoted by accompanying coordinate expansion and transferred recurrence relation (ACE-TRR), is constructed using a transfer relation scheme based on the accompanying coordinate expansion and recurrence relation method. Furthermore, the ACE-TRR algorithm is extended for the general-contraction basis sets. Numerical assessments clarify the efficiency of the ACE-TRR method for the systems including heavy elements, whose orbitals have long contractions and high angular momenta, such as f- and g-orbitals.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Probabilistic Cosmological Mass Mapping from Weak Lensing Shear

We infer gravitational lensing shear and convergence fields from galaxy ellipticity catalogs under a spatial process prior for the lensing potential. We demonstrate the performance of our algorithm with simulated Gaussian-distributed cosmological lensing shear maps and a reconstruction of the mass distribution of the merging galaxy cluster Abell 781 using galaxy ellipticities measured with the Deep Lens Survey. Given interim posterior samples of lensing shear or convergence fields on the sky, we describe an algorithm to infer cosmological parameters via lens field marginalization. In the most general formulation of our algorithm we make no assumptions about weak shear or Gaussian-distributed shape noise or shears. Because we require solutions and matrix determinants of a linear system of dimension that scales with the number of galaxies, we expect our algorithm to require parallel high-performance computing resources for application to ongoing wide field lensing surveys.

79 ASTRONOMY AND ASTROPHYSICS↗

A highly parallel multigrid-like method for the solution of the Euler equations

We consider a highly parallel multigrid-like method for the solution of the two dimensional steady Euler equations. The new method, introduced as filtering multigrid, is similar to a standard multigrid scheme in that convergence on the finest grid is accelerated by iterations on coarser grids. In the filtering method, however, additional fine grid subproblems are processed concurrently with coarse grid computations to further accelerate convergence. These additional problems are obtained by splitting the residual into a smooth and an oscillatory component. The smooth component is then used to form a coarse grid problem (similar to standard multigrid) while the oscillatory component is used for a fine grid subproblem. The primary advantage in the filtering approach is that fewer iterations are required and that most of the additional work per iteration can be performed in parallel with the standard coarse grid computations. We generalize the filtering algorithm to a version suitable for nonlinear problems. We emphasize that this generalization is conceptually straight-forward and relatively easy to implement. In particular, no explicit linearization (e.g., formation of Jacobians) needs to be performed (similar to the FAS multigrid approach). We illustrate the nonlinear version by applying it to the Euler equations, and presenting numerical results. Finally, a performance evaluation is made based on execution time models and convergence information obtained from numerical experiments.

Tuminaro, Ray S.↗

A general explicit or semi-explicit algorithm for compressible and incompressible flows

A unified finite element algorithm is developed which is applicable to a wide range of problems of fluid mechanics without recourse to artificial, empirically determined factors. In its explicit form, the algorithm is similar to the Taylor-Galerkin scheme and is easily adopted to standard codes. The scheme proposed here possesses sufficient natural balancing diffusion and thus reduces and sometimes eliminates the need for special 'shock capturing' diffusion. The efficiency of the algorithm is demonstrated using several examples ranging from incompressible through transonic regions to supersonic flows.

Zienkiewicz, O. C.↗

An onboard star identification algorithm

The paper presents the autonomous Initial Stellar Acquisition (ISA) algorithm developed for the X-Ray Timing Explorer for prividing the attitude quaternion within the desired accuracy, based on the one-axis attitude knowledge (through the use of the Digital Sun Sensor, CCD Star Trackers, and the onboard star catalog, OSC). Mathematical analysis leads to an accurate measure of the performance of the algorithm as a function of various parameters, such as the probability of a tracked star being in the OSC, the sensor noise level, and the number of stars matched. It is shown that the simplicity, tractability, and robustness of the ISA algorithm, compared to a general three-axis attiude determination algorithm, make it a viable on-board solution.

Ha, Kong↗

Land Surface Temperature Measurements from EOS MODIS Data

This report summarizes the accomplishments made by the MODIS LST (Land-Surface Temperature) group at University of California, Santa Barbara, under NASA Contract. Version 1 of the MODIS Land-Surface Temperature Algorithm Theoretical Basis Document (ATBD) was reviewed in June 1994, version 2 reviewed in November 1994, version 3.1 in August 1996, and version 3.3 updated in April 1999. Based on the ATBD, two LST algorithms were developed, one is the generalized split-window algorithm and another is the physics-based day/night LST algorithm. These two LST algorithms were implemented into the production generation executive code (PGE 16) for the daily standard MODIS LST products at level-2 (MODII-L2) and level-3 (MODIIA1 at 1 km resolution and MODIIB1 at 5km resolution). PGE codes for 8-day 1 km LST product (MODIIA2) and the daily, 8-day and monthly LST products at 0.05 degree latitude/longitude climate model grids (CMG) were also delivered. Four to six field campaigns were conducted each year since 2000 to validate the daily LST products generated by PGE16 and the calibration accuracies of the MODIS TIR bands used for the LST/emissivity retrieval from versions 2-4 of Terra MODIS data and versions 3-4 of Aqua MODIS data. Validation results from temperature-based and radiance-based methods indicate that the MODIS LST accuracy is better than 1 C in most clear-sky cases in the range from -10 to 58 C. One of the major lessons learn from multi- year temporal analysis of the consistent V4 daily Terra MODIS LST products in 2000-2003 over some selected target areas including lakes, snow/ice fields, and semi-arid sites is that there are variable numbers of cloud-contaminated LSTs in the MODIS LST products depending on surface elevation, land cover types, and atmospheric conditions. A cloud-screen scheme with constraints on spatial and temporal variations in LSTs was developed to remove cloud-contaminated LSTs. The 5km LST product was indirectly validated through comparisons to the 1 km LST product. Twenty three papers related to the LST research work were published in journals over the last decade.

Wan, Zheng-Ming↗

Linear Least Squares for Correlated Data

Throughout the literature authors have consistently discussed the suspicion that regression results were less than satisfactory when the independent variables were correlated. Camm, Gulledge, and Womer, and Womer and Marcotte provide excellent applied examples of these concerns. Many authors have obtained partial solutions for this problem as discussed by Womer and Marcotte and Wonnacott and Wonnacott, which result in generalized least squares algorithms to solve restrictive cases. This paper presents a simple but relatively general multivariate method for obtaining linear least squares coefficients which are free of the statistical distortion created by correlated independent variables.

Dean, Edwin B.↗

Conformal diagrams for the gravitational collapse of a spherically symmetric dust cloud

We present an algorithm for the construction of conformal coordinates in the interior of a spherically symmetric, collapsing matter cloud in general relativity. This algorithm is based on the numerical integration of radial null geodesics. As an application we generate conformal diagrams for collapsing spherical dust clouds and analyze the causal structure of the resulting spacetimes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A time-split finite-volume algorithm for three-dimensional flow-field simulation

A general finite-volume algorithm is developed for solving three-dimensional, time-dependent, compressible Navier-Stokes equations for high Reynolds number flows over an arbitrary geometry. This algorithm adapts MacCormack's (1982) explicit-implicit scheme to a time-split, three-dimensional finite-volume concept in a general coordinate system. It is shown that the thin-layer approximation in all three spatial directions significantly reduces the evaluation of viscous terms and allows the algorithm to solve more complicated geometries with all boundaries in two or all three directions. The calculated results using this method are found to be in good agreement with the experimental measurements of a blunt-fin induced shock wave and boundary-layer interaction problems. Observations of the existence of peak pressure, primary horseshoe and secondary vortices, and reversed supersonic zones show that computational fluid dynamics can effectively supplement the wind tunnel tests for aerodynamic design as well as for understanding basic fluid dynamics.

Hung, C. M.↗

Grid-Interactive Electric Vehicle and Building Coordination Using Coupled Distributed Control: Preprint

As an increasing number of controllable devices are introduced onto the grid, they can individually provide ancillary services in support of grid stability. However, the goals of each device differ due to their type and individual objectives, causing instances where they may conflict. To reduce the chances of these devices contributing to grid instability, these devices must effectively communicate in a cooperative manner to both meet their own needs while providing services to the grid. Previous work demonstrates that the NALD (Network Lasso-ADMM - Limited Communication - DMPC) algorithm allows coordination between two subsystems that use different control algorithms (building and charging stations) to provide services to the grid and individually optimize their performance in a specific scenario. The ideal NALD algorithm should be generalized to allow plug-and-play capabilities across devices of differing characteristics. This paper takes a step toward generalizability by updating the electric vehicle charging objective and re-defining the communication scheme compared to prior work to generalize the coordination and, as a result, improve the performance of the NALD algorithm.

ADVANCED PROPULSION SYSTEMS,ENERGY CONSERVATION, C↗