Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “multilevel”

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 649 records · Page 36
All sourcesNASA NTRSDOE OSTI
NASA NTRS1992

Spacecraft COst REduction Team (SCORE): TQM/CI on a massive scale

The business of building satellites and space systems has matured. Few missions require, or can afford, excellent performance at any price. The new paradigm is doing more with less, providing quality systems at lower cost--in other words, doing our job 'Faster-Better-Cheaper.' The TRW Spacecraft COst REduction (SCORE) initiative was launched in 1990 by Daniel S. Goldin, then general manager of TRW's Space & Technology Group. The SCORE mission is to apply continuous improvement (CI) techniques to effect major reductions in the cost (our primary goal) and span time (as a corollary) required for the production of spacecraft. SCORE is a multi-year initiative that is having a profound effect on both the procedural and the cultural aspects of how we do business. The objectives of this initiative are being realized. The focus of this paper is not on the results of SCORE per se, but rather on the things we have leaned about how to do continuous improvement on a massive scale, with multilevel (hierarchical) CI teams. The following sections summarize the chronology of the SCORE initiative, from team formation to development of the year-end report for 1991. Lessons learned, the core of this presentation, are discussed--with particular focus on the unique aspects of SCORE. The SCORE initiative is continuing and, as a part of our evolving culture, will never end. It has resulted in profound insights into the way we do work and (the topic at hand) how to do CI for large and complex multidisciplinary development activities.

Bullard, Jerry D.↗
NASA NTRS1993

Multigrid methods for flow transition in three-dimensional boundary layers with surface roughness

The efficient multilevel adaptive method has been successfully applied to perform direct numerical simulations (DNS) of flow transition in 3-D channels and 3-D boundary layers with 2-D and 3-D isolated and distributed roughness in a curvilinear coordinate system. A fourth-order finite difference technique on stretched and staggered grids, a fully-implicit time marching scheme, a semi-coarsening multigrid method associated with line distributive relaxation scheme, and an improved outflow boundary-condition treatment, which needs only a very short buffer domain to damp all order-one wave reflections, are developed. These approaches make the multigrid DNS code very accurate and efficient. This allows us not only to be able to do spatial DNS for the 3-D channel and flat plate at low computational costs, but also to do spatial DNS for transition in the 3-D boundary layer with 3-D single and multiple roughness elements, which would have extremely high computational costs with conventional methods. Numerical results show good agreement with the linear stability theory, the secondary instability theory, and a number of laboratory experiments. The contribution of isolated and distributed roughness to transition is analyzed.

Liu, Chaoqun↗
NASA NTRS1993

Optimal resolution in maximum entropy image reconstruction from projections with multigrid acceleration

We consider the problem of image reconstruction from a finite number of projections over the space L(sup 1)(Omega), where Omega is a compact subset of the set of Real numbers (exp 2). We prove that, given a discretization of the projection space, the function that generates the correct projection data and maximizes the Boltzmann-Shannon entropy is piecewise constant on a certain discretization of Omega, which we call the 'optimal grid'. It is on this grid that one obtains the maximum resolution given the problem setup. The size of this grid grows very quickly as the number of projections and number of cells per projection grow, indicating fast computational methods are essential to make its use feasible. We use a Fenchel duality formulation of the problem to keep the number of variables small while still using the optimal discretization, and propose a multilevel scheme to improve convergence of a simple cyclic maximization scheme applied to the dual problem.

Limber, Mark A.↗
NASA NTRS1993

Automated cloud classification with a fuzzy logic expert system

An unresolved problem in current cloud retrieval algorithms concerns the analysis of scenes containing overlapping cloud layers. Cloud parameterizations are very important both in global climate models and in studies of the Earth's radiation budget. Most cloud retrieval schemes, such as the bispectral method used by the International Satellite Cloud Climatology Project (ISCCP), have no way of determining whether overlapping cloud layers exist in any group of satellite pixels. One promising method uses fuzzy logic to determine whether mixed cloud and/or surface types exist within a group of pixels, such as cirrus, land, and water, or cirrus and stratus. When two or more class types are present, fuzzy logic uses membership values to assign the group of pixels partially to the different class types. The strength of fuzzy logic lies in its ability to work with patterns that may include more than one class, facilitating greater information extraction from satellite radiometric data. The development of the fuzzy logic rule-based expert system involves training the fuzzy classifier with spectral and textural features calculated from accurately labeled 32x32 regions of Advanced Very High Resolution Radiometer (AVHRR) 1.1-km data. The spectral data consists of AVHRR channels 1 (0.55-0.68 mu m), 2 (0.725-1.1 mu m), 3 (3.55-3.93 mu m), 4 (10.5-11.5 mu m), and 5 (11.5-12.5 mu m), which include visible, near-infrared, and infrared window regions. The textural features are based on the gray level difference vector (GLDV) method. A sophisticated new interactive visual image Classification System (IVICS) is used to label samples chosen from scenes collected during the FIRE IFO II. The training samples are chosen from predefined classes, chosen to be ocean, land, unbroken stratiform, broken stratiform, and cirrus. The November 28, 1991 NOAA overpasses contain complex multilevel cloud situations ideal for training and validating the fuzzy logic expert system.

Tovinkere, Vasanth↗
NASA NTRS1993

Uniform convergence of multigrid V-cycle iterations for indefinite and nonsymmetric problems

In this paper, we present an analysis of a multigrid method for nonsymmetric and/or indefinite elliptic problems. In this multigrid method various types of smoothers may be used. One type of smoother which we consider is defined in terms of an associated symmetric problem and includes point and line, Jacobi, and Gauss-Seidel iterations. We also study smoothers based entirely on the original operator. One is based on the normal form, that is, the product of the operator and its transpose. Other smoothers studied include point and line, Jacobi, and Gauss-Seidel. We show that the uniform estimates for symmetric positive definite problems carry over to these algorithms. More precisely, the multigrid iteration for the nonsymmetric and/or indefinite problem is shown to converge at a uniform rate provided that the coarsest grid in the multilevel iteration is sufficiently fine (but not depending on the number of multigrid levels).

Bramble, James H.↗
NASA NTRS1993

An object-oriented approach for parallel self adaptive mesh refinement on block structured grids

Self-adaptive mesh refinement dynamically matches the computational demands of a solver for partial differential equations to the activity in the application's domain. In this paper we present two C++ class libraries, P++ and AMR++, which significantly simplify the development of sophisticated adaptive mesh refinement codes on (massively) parallel distributed memory architectures. The development is based on our previous research in this area. The C++ class libraries provide abstractions to separate the issues of developing parallel adaptive mesh refinement applications into those of parallelism, abstracted by P++, and adaptive mesh refinement, abstracted by AMR++. P++ is a parallel array class library to permit efficient development of architecture independent codes for structured grid applications, and AMR++ provides support for self-adaptive mesh refinement on block-structured grids of rectangular non-overlapping blocks. Using these libraries, the application programmers' work is greatly simplified to primarily specifying the serial single grid application and obtaining the parallel and self-adaptive mesh refinement code with minimal effort. Initial results for simple singular perturbation problems solved by self-adaptive multilevel techniques (FAC, AFAC), being implemented on the basis of prototypes of the P++/AMR++ environment, are presented. Singular perturbation problems frequently arise in large applications, e.g. in the area of computational fluid dynamics. They usually have solutions with layers which require adaptive mesh refinement and fast basic solvers in order to be resolved efficiently.

Lemke, Max↗
NASA NTRS1993

The nonlinear Galerkin method: A multi-scale method applied to the simulation of homogeneous turbulent flows

Using results of Direct Numerical Simulation (DNS) in the case of two-dimensional homogeneous isotropic flows, the behavior of the small and large scales of Kolmogorov like flows at moderate Reynolds numbers are first analyzed in detail. Several estimates on the time variations of the small eddies and the nonlinear interaction terms were derived; those terms play the role of the Reynolds stress tensor in the case of LES. Since the time step of a numerical scheme is determined as a function of the energy-containing eddies of the flow, the variations of the small scales and of the nonlinear interaction terms over one iteration can become negligible by comparison with the accuracy of the computation. Based on this remark, a multilevel scheme which treats differently the small and the large eddies was proposed. Using mathematical developments, estimates of all the parameters involved in the algorithm, which then becomes a completely self-adaptive procedure were derived. Finally, realistic simulations of (Kolmorov like) flows over several eddy-turnover times were performed. The results are analyzed in detail and a parametric study of the nonlinear Galerkin method is performed.

Debussche, A.↗
NASA NTRS1993

Value added data archiving

Researchers in the Molecular Sciences Research Center (MSRC) of Pacific Northwest Laboratory (PNL) currently generate massive amounts of scientific data. The amount of data that will need to be managed by the turn of the century is expected to increase significantly. Automated tools that support the management, maintenance, and sharing of this data are minimal. Researchers typically manage their own data by physically moving datasets to and from long term storage devices and recording a dataset's historical information in a laboratory notebook. Even though it is not the most efficient use of resources, researchers have tolerated the process. The solution to this problem will evolve over the next three years in three phases. PNL plans to add sophistication to existing multilevel file system (MLFS) software by integrating it with an object database management system (ODBMS). The first phase in the evolution is currently underway. A prototype system of limited scale is being used to gather information that will feed into the next two phases. This paper describes the prototype system, identifies the successes and problems/complications experienced to date, and outlines PNL's long term goals and objectives in providing a permanent solution.

Berard, Peter R.↗
NASA NTRS1994

Hierarchically Parallelized Constrained Nonlinear Solvers with Automated Substructuring

This paper develops a parallelizable multilevel multiple constrained nonlinear equation solver. The substructuring process is automated to yield appropriately balanced partitioning of each succeeding level. Due to the generality of the procedure,_sequential, as well as partially and fully parallel environments can be handled. This includes both single and multiprocessor assignment per individual partition. Several benchmark examples are presented. These illustrate the robustness of the procedure as well as its capability to yield significant reductions in memory utilization and calculational effort due both to updating and inversion.

Padovan, Joe↗
NASA NTRS1993

An observing system simulation experiment for the Laser Atmospheric Wind Sounder (LAWS)

The present observing system-simulation experiments evaluate the potential of a Laser Atmospheric Wind Sounder (LAWS) instrument for 5-day forecasting, using a primitive-equation multilevel spectral global circulation model. A 55-deg-inclined and a 98-deg sun-synchronous orbit are examined, by adding LAWS wind profiles into a global 4D data-assimilation system, and comparing both the analyses and forecasts to a control experiment. The 4D data-assimilation system consists of a multivariate optimum interpolation analysis and a nonlinear, normal-mode intialization, using the aforementioned global circulation model.

Rohaly, G. D.↗
NASA NTRS1993

A fast algorithm for parallel computation of multibody dynamics on MIMD parallel architectures

In this paper the implementation of a parallel O(LogN) algorithm for computation of rigid multibody dynamics on a Hypercube MIMD parallel architecture is presented. To our knowledge, this is the first algorithm that achieves the time lower bound of O(LogN) by using an optimal number of O(N) processors. However, in addition to its theoretical significance, the algorithm is also highly efficient for practical implementation on commercially available MIMD parallel architectures due to its highly coarse grain size and simple communication and synchronization requirements. We present a multilevel parallel computation strategy for implementation of the algorithm on a Hypercube. This strategy allows the exploitation of parallelism at several computational levels as well as maximum overlapping of computation and communication to increase the performance of parallel computation.

Fijany, Amir↗
NASA NTRS1994

Evaluation of iconic versus F-map microburst displays

Previous studies have shown graphical presentation methods of hazardous wind shear to be superior to textual or audible warnings alone. Positional information and the strength of the hazard were observed to be and were cited by pilots as the most important factors in a display. In this experiment the use of the three different graphical presentations of hazardous wind shear are examined. Airborne predictive detectors of wind shear enable the dissemination of varying levels of information. The effectiveness of iconic and mapping display modes of different complexities are addressed through simulation and analysis. Different positional and time-varying situations are presented in a 'part-task' Boeing 767 simulator using data from actual microburst events. Experienced airline pilots fly approach profiles using both iconic and F-map wind shear alerting displays. Microburst accompanied each event is also shown to the pilot. Mapping display types are expected to be found exceptionally efficient at conveying location comparison information while iconic displays simplify the threat recognition process. Preliminary results from the simulator study are presented. Recommendations concerning the suitability of multilevel iconic and mapping displays are made. Situational problems with current display prototypes are also addressed.

Salzberger, Mark↗
NASA NTRS1994

The Design Manager's Aid for Intelligent Decomposition (DeMAID)

Before the design of new complex systems such as large space platforms can begin, the possible interactions among subsystems and their parts must be determined. Once this is completed, the proposed system can be decomposed to identify its hierarchical structure. The design manager's aid for intelligent decomposition (DeMAID) is a knowledge based system for ordering the sequence of modules and identifying a possible multilevel structure for design. Although DeMAID requires an investment of time to generate and refine the list of modules for input, it could save considerable money and time in the total design process, particularly in new design problems where the ordering of the modules has not been defined.

Rogers, James L.↗
NASA NTRS1994

On the application of under-decimated filter banks

Maximally decimated filter banks have been extensively studied in the past. A filter bank is said to be under-decimated if the number of channels is more than the decimation ratio in the subbands. A maximally decimated filter bank is well known for its application in subband coding. Another application of maximally decimated filter banks is in block filtering. Convolution through block filtering has the advantages that parallelism is increased and data are processed at a lower rate. However, the computational complexity is comparable to that of direct convolution. More recently, another type of filter bank convolver has been developed. In this scheme, the convolution is performed in the subbands. Quantization and bit allocation of subband signals are based on signal variance, as in subband coding. Consequently, for a fixed rate, the result of convolution is more accurate than is direct convolution. This type of filter bank convolver also enjoys the advantages of block filtering, parallelism, and a lower working rate. Nevertheless, like block filtering, there is no computational saving. In this article, under-decimated systems are introduced to solve the problem. The new system is decimated only by half the number of channels. Two types of filter banks can be used in the under-decimated system: the discrete Fourier transform (DFT) filter banks and the cosine modulated filter banks. They are well known for their low complexity. In both cases, the system is approximately alias free, and the overall response is equivalent to a tunable multilevel filter. Properties of the DFT filter banks and the cosine modulated filter banks can be exploited to simultaneously achieve parallelism, computational saving, and a lower working rate. Furthermore, for both systems, the implementation cost of the analysis or synthesis bank is comparable to that of one prototype filter plus some low-complexity modulation matrices. The individual analysis and synthesis filters have complex coefficients in the DFT filter banks but have real coefficients in the cosine modulated filter banks.

Lin, Y.-P.↗
NASA NTRS1995

Nonlinear structural analysis on distributed-memory computers

A computational strategy is presented for the nonlinear static and postbuckling analyses of large complex structures on massively parallel computers. The strategy is designed for distributed-memory, message-passing parallel computer systems. The key elements of the proposed strategy are: (1) a multiple-parameter reduced basis technique; (2) a nested dissection (or multilevel substructuring) ordering scheme; (3) parallel assembly of global matrices; and (4) a parallel sparse equation solver. The effectiveness of the strategy is assessed by applying it to thermo-mechanical postbuckling analyses of stiffened composite panels with cutouts, and nonlinear large-deflection analyses of HSCT models on Intel Paragon XP/S computers. The numerical studies presented demonstrate the advantages of nested dissection-based solvers over traditional skyline-based solvers on distributed memory machines.

Watson, Brian C.↗
NASA NTRS1995

Postbuckling and large-deflection nonlinear analyses on distributed-memory computers

A computational strategy is presented for postbuckling and nonlinear static analyses of large complex structures on distributed-memory parallel computers. The strategy is designed for message-passing parallel computer systems. The key elements of the proposed strategy are: (1) a multiple-parameter reduced basis technique; (2) a nested dissection (or multilevel substructuring) ordering scheme; (3) parallel assembly of global matrices; and (4) a parallel sparse equation solver. The effectiveness of the strategy is assessed by performing thermomechanical postbuckling analyses of stiffened composite panels with cutouts, and nonlinear large-deflection analyses of High Speed Civil Transport models on three distributed-memory computers. The numerical studies presented demonstrate the advantages of nested dissection-based solvers over traditional skyline-based solvers on distributed-memory machines.

Watson, Brian C.↗
NASA NTRS1992

Towards a fast implementation of spectral nested dissection

We describe the spectral nested dissection (SND) algorithm, a new algorithm for computing orderings appropriate for parallel factorization of sparse, symmetric matrices. The algorithm makes use of spectral properties of the Laplacian matrix associated with the given matrix to compute separators. We evaluate the quality of the spectral orderings with respect to several measures: fill, elimination tree height, height and weight balances of elimination trees, and clique tree heights. We use some very large structural analysis problems as test cases and demonstrate on these real applications (such as the Space Shuttle Solid Rocket Booster) that spectral orderings compare quite favorably with commonly used orderings, outperforming them by a wide margin for some of these measures. The only disadvantage of SND is its relatively long execution time. We will present some recent efforts to improve the execution time using both a multilevel and a hybrid approach. We use SND in computing a multifrontal numerical factorization with the different orderings on an eight processor Cray Y-MP and show its effectiveness. We believe that spectral nested dissection is a major breakthrough in terms of generating efficient sparse orderings for parallel machines.

Pothen, Alex↗
NASA NTRS1994

Emission-line studies of young stars. 4: The optical forbidden lines

Optical forbidden line strengths and profiles are discussed for a sample of 30 T Tauri stars and 12 Herbig Ae-Be stars. Transitions of (C I), (N II), (O I), (O II), (S II), (Ca II), (Cr II), (Fe II), and (Ni II) are detected. Profile variability occurred in DG Tau and probably other sources. The ensemble profiles can be divided into four generic components that may represent distinct emitting regions; (1) narrow rest-velocity lines, (2) 'low'-velocity lines (peaking at less than or approximately +/- 50 km s(exp -1)), (3) 'high'-velocity (usually greater than or approximately +/- 100 km s(exp -1)) blueshifted peaks or wings, and (4) high-velocity redshifted peaks. Among T Tauri stars, the rest-velocity lines appear most often in sources with weak and narrow permitted lines, such as the Ca II triplet. The low- and high-velocity blueshifted components usually appear together in sources with strong and broad Ca II triplet lines. If the velocity-shifted lines form in jets, the smallest (full) opening angles required by the profiles are less than or approximately 20 deg for the narrow, blueshifted (Ca II) lines of DG Tau and HL Tau. Other lines in DG Tau are much broader, implying larger opening angles or greater velocity dispersions. The variability in DG Tau also implies significant changes in the collimation or velocity coherence on timescales of a few years. RW Aur and AS 353A have blue- and redshifted line peaks that could form in oppositely directed jets. The strong (S II) lambda 6716 and lambda 6731 lines in RW Aur are exclusively redshifted and require opening angles less than or approximately 60 deg. Measurements of different profiles in the same spectrum show that the physical conditions change with the line-of-sight velocities. The most persistent trends are for more (N II) and (O II) and less (O I) lambda 5577 flux at high velocities. Constraints on the physical conditions are derived by modeling the emission lines via multilevel ions in 'coronal ionization equilibrium.' A single temperature and density cannot fully describe the line spectra in any velocity interval. Temperatures in the (O I) region are 9000 less than or approximately T(sub e) less than 14,000 K, and the ionization fraction (of H) is less than 35%. The densities derived from (O I) include n(sub e) less than or approximately 5 x 10(exp 5) to approximately 10(exp 7) cm(exp -3), but n(sub e) greater than or approximately 10(exp 6) cm(exp -3) obtains only at low velocities. In the (S II) regions the densities are lower, 10(exp 3) less than or approximately n(sub e) less than or approximately 7 x 10(exp 4) cm(exp -3), and the temperatures are probably higher, T(sub e) greater than or approximately 13,000 K. At high velocities (only) there is additional hot gas that produces (N II) and (O II), possibly most of the (S II), and little (O I). This region is characterized by T(sub e) greater than or approximately 15,000 K, n(sub e) less than or approximately 10(exp 5) cm(exp -3), and an ionization fraction greater than or approximately 50%. When combined with the spatially segregated emitting regions observed by others by spectral imaging, these results suggest decreasing n(sub e) and increasing T(sub e) away from the star in at least the high velocity gas.

Hamann, Fred↗