SEARCH · Engineering Papers

Results for “Decomposition 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.

SourceResearch connectionFrom yearThrough year

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

At least 343 records · Page 19

All sources NASA NTRS DOE OSTI

NASA NTRS2000

Automated Design of Quantum Circuits

In order to design a quantum circuit that performs a desired quantum computation, it is necessary to find a decomposition of the unitary matrix that represents that computation in terms of a sequence of quantum gate operations. To date, such designs have either been found by hand or by exhaustive enumeration of all possible circuit topologies. In this paper we propose an automated approach to quantum circuit design using search heuristics based on principles abstracted from evolutionary genetics, i.e. using a genetic programming algorithm adapted specially for this problem. We demonstrate the method on the task of discovering quantum circuit designs for quantum teleportation. We show that to find a given known circuit design (one which was hand-crafted by a human), the method considers roughly an order of magnitude fewer designs than naive enumeration. In addition, the method finds novel circuit designs superior to those previously known.

Williams, Colin P.↗

NASA NTRS1988

Extensions of the CSCM methodology for nonequilibrium reacting gas flows

The paper describes the extension of the CSCM flux difference splitting to produce conservative unconditionally stable implicit upwind methods for the extended equation set. The CSCM-S single data level relaxation algorithm is argued to be particularly advantageous for efficiently solving the set of equations. Attention is given to issues of alternative state variable representations and to complementary thermodynamic relations that parameterize and need to be effectively coupled with the solution procedure for the partial differential equations. Within the framework of iteration, consideration is given to more efficient approximate solution procedures than the full block coupled LU decomposition. Results of early numerical experiments are given to illustrate the developments.

Lombard, C. K.↗

NASA NTRS1989

Parallel implementation and evaluation of motion estimation system algorithms on a distributed memory multiprocessor using knowledge based mappings

Several techniques to perform static and dynamic load balancing techniques for vision systems are presented. These techniques are novel in the sense that they capture the computational requirements of a task by examining the data when it is produced. Furthermore, they can be applied to many vision systems because many algorithms in different systems are either the same, or have similar computational characteristics. These techniques are evaluated by applying them on a parallel implementation of the algorithms in a motion estimation system on a hypercube multiprocessor system. The motion estimation system consists of the following steps: (1) extraction of features; (2) stereo match of images in one time instant; (3) time match of images from different time instants; (4) stereo match to compute final unambiguous points; and (5) computation of motion parameters. It is shown that the performance gains when these data decomposition and load balancing techniques are used are significant and the overhead of using these techniques is minimal.

Choudhary, Alok Nidhi↗

NASA NTRS1988

Attitude determination and parameter estimation using vector observations

Procedures for attitude determination based on Wahba's loss function are generalized to include the estimation of parameters other than the attitude, such as sensor biases. Optimization with respect to the attitude requires either the singular value decomposition of a 3x3 matrix or finding the maximum eigenvalue and corresponding eigenvector of a 4x4 symmetric matrix, but does not require an a priori estimate of the attitude. Optimization with respect to the other parameters employs an iterative approach, which does require an a priori estimate of these parameters. Conventional state estimation methods require a priori estimates of both the parameters and the attitude, while the algorithms presented in this paper always compute the exact optimal attitude for given values of the parameters. The proposed method is shown to give the correct solution of an example problem. An expression for the covariance of the attitude and parameter estimates is derived.

Markley, F. Landis↗

NASA NTRS1990

Robust eigensystem assignment for second-order estimators

An approach for the robust eigensystem assignment of flexible structures using full state or output feedback is developed. Using the second-order dynamic equations, the approach can assign the eigenvalues of the system via velocity and displacement feedbacks, or acceleration and velocity feedbacks. The eigenvalues and eigenvectors of the system are assigned, via the second-order eigenvalue problem for the structural system, in two steps. First, an orthonormal basis spanning the attainable closed-loop eigenvector space corresponding to each desired closed-loop eigenvalue is generated using the Singular Value or QR decompositions. Second, a sequential procedure is used to choose a set of closed-loop eigenvectors that are as close as possible to the column space of a well-conditioned target matrix. Among the possible choices of the target matrix, the closest unitary matrix to the open-loop eigenvector matrix appears to be a suitable choice. A numerical example is given to illustrate the proposed algorithm.

Juang, Jer-Nan↗

NASA NTRS1990

Robust eigensystem assignment for second-order dynamic systems

A novel approach for the robust eigensystem assignment of flexible structures using full state or output feedback is developed. Using the second-order dynamic equations, the approach can assign the eigenvalues of the system via velocity and displacement feedbacks, or acceleration and velocity feedbacks. The eigenvalues and eigenvectors of the system are assigned, via the second-order eigenvalue problem for the structural system, in two steps. First, an orthonormal basis spanning the attainable closed-loop eigenvector space corresponding to each desired closed-loop eigenvalue is generated using the Singular Value or QR decompositions. Second, a sequential procedure is used to choose a set of closed-loop eigenvectors that are as close as possible to the column space of a well-conditioned target matrix. Among the possible choices of the target matrix, the closest unitary matrix to the open-loop eigenvector matrix appears to be a suitable choice. A numerical example is given to illustrate the proposed algorithm.

Juang, Jer-Nan↗

NASA NTRS1981

Prediction of laminar and turbulent primary and secondary flows in strongly curved ducts

The analysis is based on a primary secondary velocity decomposition in a given coordinate system, and leads to approximate governing equations which correct an a priori inviscid solution for viscous effects, secondary flows, total pressure distortion, heat transfer, and internal flow blockage and losses. Solution of the correction equations is accomplished as an initial value problem in space using an implicit forward marching technique. The overall solution procedure requires significantly less computational effort than Navier-Stokes algorithms. The solution procedure is effective even with the extreme local mesh resolution which is necessary to solve near wall sublayer regions in turbulent flow calculations. Computed solutions for both laminar and turbulent flow compared very favorably with available analytical and experimental results. The overall method appears very promising as an economical procedure for making detailed predictions of viscous primary and secondary flows in highly curved passages.

Kreskovsky, J. P.↗

NASA NTRS1993

Efficient partitioning and assignment on programs for multiprocessor execution

The general problem studied is that of segmenting or partitioning programs for distribution across a multiprocessor system. Efficient partitioning and the assignment of program elements are of great importance since the time consumed in this overhead activity may easily dominate the computation, effectively eliminating any gains made by the use of the parallelism. In this study, the partitioning of sequentially structured programs (written in FORTRAN) is evaluated. Heuristics, developed for similar applications are examined. Finally, a model for queueing networks with finite queues is developed which may be used to analyze multiprocessor system architectures with a shared memory approach to the problem of partitioning. The properties of sequentially written programs form obstacles to large scale (at the procedure or subroutine level) parallelization. Data dependencies of even the minutest nature, reflecting the sequential development of the program, severely limit parallelism. The design of heuristic algorithms is tied to the experience gained in the parallel splitting. Parallelism obtained through the physical separation of data has seen some success, especially at the data element level. Data parallelism on a grander scale requires models that accurately reflect the effects of blocking caused by finite queues. A model for the approximation of the performance of finite queueing networks is developed. This model makes use of the decomposition approach combined with the efficiency of product form solutions.

Standley, Hilda M.↗

NASA NTRS1981

Analysis and computation of three-dimensional flow in strongly curved ducts

Numerical solutions are presented for three-dimensional laminar and turbulent flow in curved ducts of rectangular cross section and significant curvature. The analysis is based on a primary-secondary velocity decomposition in a given coordinate system, and leads to approximate governing equations which correct an a priori inviscid solution for viscous effects, secondary flows, total pressure distortion, heat transfer, and internal flow blockage and losses. Solution of the correction equations is accomplished as an initial-value problem in space using an implicit forward-marching technique. The overall solution procedure requires significantly less computational effort than Navier-Stokes algorithms. The present solution procedure is effective even with the extreme local mesh resolution which is necessary to resolve near-wall sublayer regions in turbulent flow calculations. Computed solutions for both laminar and turbulent flow compare very favorably with available analytical and experimental results.

Kreskovsky, J. P.↗

NASA NTRS1998

Data Mining and Optimization Tools for Developing Engine Parameters Tools

This project was awarded for understanding the problem and developing a plan for Data Mining tools for use in designing and implementing an Engine Condition Monitoring System. From the total budget of $5,000, Tricia and I studied the problem domain for developing ail Engine Condition Monitoring system using the sparse and non-standardized datasets to be available through a consortium at NASA Lewis Research Center. We visited NASA three times to discuss additional issues related to dataset which was not made available to us. We discussed and developed a general framework of data mining and optimization tools to extract useful information from sparse and non-standard datasets. These discussions lead to the training of Tricia Erhardt to develop Genetic Algorithm based search programs which were written in C++ and used to demonstrate the capability of GA algorithm in searching an optimal solution in noisy datasets. From the study and discussion with NASA LERC personnel, we then prepared a proposal, which is being submitted to NASA for future work for the development of data mining algorithms for engine conditional monitoring. The proposed set of algorithm uses wavelet processing for creating multi-resolution pyramid of the data for GA based multi-resolution optimal search. Wavelet processing is proposed to create a coarse resolution representation of data providing two advantages in GA based search: 1. We will have less data to begin with to make search sub-spaces. 2. It will have robustness against the noise because at every level of wavelet based decomposition, we will be decomposing the signal into low pass and high pass filters.

Dhawan, Atam P.↗

NASA NTRS1994

Parallel DSMC Solution of Three-Dimensional Flow Over a Finite Flat Plate

This paper describes a parallel implementation of the direct simulation Monte Carlo (DSMC) method. Runtime library support is used for scheduling and execution of communication between nodes, and domain decomposition is performed dynamically to maintain a good load balance. Performance tests are conducted using the code to evaluate various remapping and remapping-interval policies, and it is shown that a one-dimensional chain-partitioning method works best for the problems considered. The parallel code is then used to simulate the Mach 20 nitrogen flow over a finite-thickness flat plate. It is shown that the parallel algorithm produces results which compare well with experimental data. Moreover, it yields significantly faster execution times than the scalar code, as well as very good load-balance characteristics.

Nance, Robert P.↗

NASA NTRS1997

Parallelization of the Implicit RPLUS Algorithm

The multiblock reacting Navier-Stokes flow solver RPLUS2D was modified for parallel implementation. Results for non-reacting flow calculations of this code indicate parallelization efficiencies greater than 84% are possible for a typical test problem. Results tend to improve as the size of the problem increases. The convergence rate of the scheme is degraded slightly when additional artificial block boundaries are included for the purpose of parallelization. However, this degradation virtually disappears if the solution is converged near to machine zero. Recommendations are made for further code improvements to increase efficiency, correct bugs in the original version, and study decomposition effectiveness.

Orkwis, Paul D.↗

NASA NTRS2011

Quantifying Errors in TRMM-Based Multi-Sensor QPE Products Over Land in Preparation for GPM

Determining uncertainties in satellite-based multi-sensor quantitative precipitation estimates over land of fundamental importance to both data producers and hydro climatological applications. ,Evaluating TRMM-era products also lays the groundwork and sets the direction for algorithm and applications development for future missions including GPM. QPE uncertainties result mostly from the interplay of systematic errors and random errors. In this work, we will synthesize our recent results quantifying the error characteristics of satellite-based precipitation estimates. Both systematic errors and total uncertainties have been analyzed for six different TRMM-era precipitation products (3B42, 3B42RT, CMORPH, PERSIANN, NRL and GSMap). For systematic errors, we devised an error decomposition scheme to separate errors in precipitation estimates into three independent components, hit biases, missed precipitation and false precipitation. This decomposition scheme reveals hydroclimatologically-relevant error features and provides a better link to the error sources than conventional analysis, because in the latter these error components tend to cancel one another when aggregated or averaged in space or time. For the random errors, we calculated the measurement spread from the ensemble of these six quasi-independent products, and thus produced a global map of measurement uncertainties. The map yields a global view of the error characteristics and their regional and seasonal variations, reveals many undocumented error features over areas with no validation data available, and provides better guidance to global assimilation of satellite-based precipitation data. Insights gained from these results and how they could help with GPM will be highlighted.

Peters-Lidard, Christa D.↗

NASA NTRS1994

Parallelization of the Implicit RPLUS Algorithm

The multiblock reacting Navier-Stokes flow-solver RPLUS2D was modified for parallel implementation. Results for non-reacting flow calculations of this code indicate parallelization efficiencies greater than 84% are possible for a typical test problem. Results tend to improve as the size of the problem increases. The convergence rate of the scheme is degraded slightly when additional artificial block boundaries are included for the purpose of parallelization. However, this degradation virtually disappears if the solution is converged near to machine zero. Recommendations are made for further code improvements to increase efficiency, correct bugs in the original version, and study decomposition effectiveness.

Orkwis, Paul D.↗

NASA NTRS1989

A dual potential formulation of the Navier-Stokes equations

A dual potential formulation for numerically solving the Navier-Stokes equations is developed and presented. The velocity field is decomposed using a scalar and vector potential. Vorticity and dilatation are used as the dependent variables in the momentum equations. Test cases in two dimensions verify the capability to solve flows using approximations from potential flow to full Navier-Stokes simulations. A three-dimensional incompressible flow formulation is also described. An interesting feature of this approach to solving the Navier-Stokes equations is the decomposition of the velocity field into a rotational part (vector potential) and an irrotational part (scalar potential). The Helmholtz decomposition theorem allows this splitting of the velocity field. This approach has had only limited use since it increases the number of dependent variables in the solution. However, it has often been used for incompressible flows where the solution scheme is known to be fast and accurate. This research extends the usage of this method to fully compressible Navier-Stokes simulations by using the dilatation variable along with vorticity. A time-accurate, iterative algorithm is used for the uncoupled solution of the governing equations. Several levels of flow approximation are available within the framework of this method. Potential flow, Euler and full Navier-Stokes solutions are possible using the dual potential formulation. Solution efficiency can be enhanced in a straightforward way. For some flows, the vorticity and/or dilatation may be negligible in certain regions (e.g., far from a viscous boundary in an external flow). It is possible to drop the calculation of these variables then and optimize the solution speed. Also, efficient Poisson solvers are available for the potentials. The relative merits of non-primitive variables versus primitive variables for solution of the Navier-Stokes equations are also discussed.

Gegg, S. G.↗

NASA NTRS1998

Charon Message-Passing Toolkit for Scientific Computations

The Charon toolkit for piecemeal development of high-efficiency parallel programs for scientific computing is described. The portable toolkit, callable from C and Fortran, provides flexible domain decompositions and high-level distributed constructs for easy translation of serial legacy code or design to distributed environments. Gradual tuning can subsequently be applied to obtain high performance, possibly by using explicit message passing. Charon also features general structured communications that support stencil-based computations with complex recurrences. Through the separation of partitioning and distribution, the toolkit can also be used for blocking of uni-processor code, and for debugging of parallel algorithms on serial machines. An elaborate review of recent parallelization aids is presented to highlight the need for a toolkit like Charon. Some performance results of parallelizing the NAS Parallel Benchmark SP program using Charon are given, showing good scalability.

VanderWijngaart, Rob F.↗

NASA NTRS1998

Charon Message-Passing Toolkit for Scientific Computations

VanderWijngarrt, Rob F.↗

NASA NTRS2009

Carbon Emissions from Deforestation in the Brazilian Amazon Region

A simulation model based on satellite observations of monthly vegetation greenness from the Moderate Resolution Imaging Spectroradiometer (MODIS) was used to estimate monthly carbon fluxes in terrestrial ecosystems of Brazilian Amazon and Cerrado regions over the period 2000-2002. The NASA-CASA (Carnegie Ames Stanford Approach) model estimates of annual forest production were used for the first time as the basis to generate a prediction for the standing pool of carbon in above-ground biomass (AGB; gC/sq m) for forested areas of the Brazilian Amazon region. Plot-level measurements of the residence time of carbon in wood in Amazon forest from Malhi et al. (2006) were interpolated by inverse distance weighting algorithms and used with CASA to generate a new regional map of AGB. Data from the Brazilian PRODES (Estimativa do Desflorestamento da Amazonia) project were used to map deforested areas. Results show that net primary production (NPP) sinks for carbon varied between 4.25 Pg C/yr (1 Pg=10(exp 15)g) and 4.34 Pg C for the region and were highest across the eastern and northern Amazon areas, whereas deforestation sources of CO2 flux from decomposition of residual woody debris were higher and less seasonal in the central Amazon than in the eastern and southern areas. Increased woody debris from past deforestation events was predicted to alter the net ecosystem carbon balance of the Amazon region to generate annual CO2 source fluxes at least two times higher than previously predicted by CASA modeling studies. Variations in climate, land cover, and forest burning were predicted to release carbon at rates of 0.5 to 1 Pg C/yr from the Brazilian Amazon. When direct deforestation emissions of CO2 from forest burning of between 0.2 and 0.6 Pg C/yr in the Legal Amazon are overlooked in regional budgets, the year-to-year variations in this net biome flux may appear to be large, whereas our model results implies net biome fluxes had actually been relatively consistent from year to year during the period 2000-2002. This is the first study to use MODIS data to model all carbon pools (wood, leaf, root) dynamically in simulations of Amazon forest deforestation from clearing and burning of all kinds.

Potter, C.↗