SEARCH · Engineering Papers

Results for “Dynamic clustering 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 37 records · Page 2

All sources NASA NTRS DOE OSTI

NASA NTRS2012

Classification of Ascension Island and Natal Ozonesondes Using Self-Organizing Maps

Ozone profiles from balloon-borne ozonesondes are used for development of satellite algorithms and in chemistry-climate model initialization, assimilation and evaluation. An important issue in the application of these profiles is how best to treat variations where varying photochemical and dynamical influences can cause the ozone mixing ratio in the tropospheric segments of the profile to change by of a factor of 2-3 within a day. Clustering techniques are an ideal way to approach the statistical classification of profile data and we apply self-organizing maps to tropical tropospheric SHADOZ data, hypothesizing that the data will sort according to various influences on ozone, namely anthropogenic sources like biomass burning, meteorological conditions, and stratospheric or extra-tropical intrusions. Self-organizing maps, that use a learning algorithm to reveal the most prominent features of a data set according to a specified number of clusters, have been determined for the 1998-2009 SHADOZ profiles over Ascension Island (512 profiles, 7.98 deg. S, 14.42 deg. W) and Natal, Brazil (425 profiles, 5.42degS, 35.38degW). The 2 × 2 self-organizing map, which creates 4 clusters, reveals that deviations from the average ozone in the free troposphere include both increased ozone resulting from seasonal biomass burning in Africa and locally reduced ozone brought about by convective lifting of unpolluted boundary-layer air. Expanding to a 4 × 4 self-organizing map shows how biomass burning influences the yearly cycle of tropospheric ozone at Ascension Island and captures the seasonality of ozone at both Ascension Island and Natal. Comparing Ascension Island and Natal using a 4 × 4 self-organizing map at each site reveals similarities in mid-tropospheric ozone, but shows differences in lower-tropospheric ozone due to Ascension Island being closer to African biomass burning and more affected by descent from the mean Walker circulation, with less convective activity, than Natal.

algorithms↗

NASA NTRS2012

Particle Filtering for Model-Based Anomaly Detection in Sensor Networks

A novel technique has been developed for anomaly detection of rocket engine test stand (RETS) data. The objective was to develop a system that postprocesses a csv file containing the sensor readings and activities (time-series) from a rocket engine test, and detects any anomalies that might have occurred during the test. The output consists of the names of the sensors that show anomalous behavior, and the start and end time of each anomaly. In order to reduce the involvement of domain experts significantly, several data-driven approaches have been proposed where models are automatically acquired from the data, thus bypassing the cost and effort of building system models. Many supervised learning methods can efficiently learn operational and fault models, given large amounts of both nominal and fault data. However, for domains such as RETS data, the amount of anomalous data that is actually available is relatively small, making most supervised learning methods rather ineffective, and in general met with limited success in anomaly detection. The fundamental problem with existing approaches is that they assume that the data are iid, i.e., independent and identically distributed, which is violated in typical RETS data. None of these techniques naturally exploit the temporal information inherent in time series data from the sensor networks. There are correlations among the sensor readings, not only at the same time, but also across time. However, these approaches have not explicitly identified and exploited such correlations. Given these limitations of model-free methods, there has been renewed interest in model-based methods, specifically graphical methods that explicitly reason temporally. The Gaussian Mixture Model (GMM) in a Linear Dynamic System approach assumes that the multi-dimensional test data is a mixture of multi-variate Gaussians, and fits a given number of Gaussian clusters with the help of the wellknown Expectation Maximization (EM) algorithm. The parameters thus learned are used for calculating the joint distribution of the observations. However, this GMM assumption is essentially an approximation and signals the potential viability of non-parametric density estimators. This is the key idea underlying the new approach.

Solano, Wanda↗

NASA NTRS2006

Diurnal Variability of Vertical Structure from a TRMM Passive Microwave "Virtual Radar" Retrieval

Robust description of the diurnal cycle from TRMM observations is complicated by the limitations of Low Earth Orbit (LEO) sampling; from a 'climatological' perspective, sufficient sampling must exist to control for both spatial and seasonal variability, before tackling an additional diurnal component (e.g., with 8 additional 3-hourly or 24 1-hourly bins). For documentation of vertical structure, the narrow sample swath of the TRMM Precipitation Radar limits the resolution of any of these components. A neural-network based 'virtual radar" retrieval has been trained and internally validated, using multifrequency / multipolarization passive microwave(TM1) brightness temperatures and textures parameters and lightning (LIS) observations, as inputs, and PR volumetric reflectivity as targets (outputs). By training the algorithms (essentially highly multivariate, nonlinear regressions) on a very large sample of high-quality co-located data from the center of the TRMM swath, 3D radar reflectivity and derived parameters (VIL, IWC, Echo Tops, etc.) can be retrieved across the entire TMI swath, good to 8-9% over the dynamic range of parameters. As a step in the retrieval (and as an output of the process), each TMI multifrequency pixel (at 85 GHz resolution) is classified into one of the 25 archetypal radar profile vertical structure "types", previously identified using cluster analysis. The dynamic range of retrieved vertical structure appears to have higher fidelity than the current (Version 6) experimental GPROF hydrometeor vertical structure retrievals. This is attributable to correct representation of the prior probabilities of vertical structure variability in the neural network training data, unlike the GPROF cloud-resolving model training dataset used in the V6 algorithms. The LIS lightning inputs are supplementary inputs, and a separate offline neural network has been trained to impute (predict) LIS lightning from passive-microwave-only data. The virtual radar retrieval is thus, in principle, extensible to Aqua/AMSR-E and NPOESS/CMIS passive microwave instruments. The virtual radar approach yields a threefold increase in effective sampling from the mission, albeit of lower-quality "retrieved" data, reducing the variance of local estimates by one third (or the standard deviation by-0.57). In this talk, the variance reduction is leveraged to more finely resolve global diurnal variability in both space and time (local hour).

Boccippio, Dennis J.↗

NASA NTRS1995

Fast Multipole Methods for Three-Dimensional N-body Problems

We are developing computational tools for the simulations of three-dimensional flows past bodies undergoing arbitrary motions. High resolution viscous vortex methods have been developed that allow for extended simulations of two-dimensional configurations such as vortex generators. Our objective is to extend this methodology to three dimensions and develop a robust computational scheme for the simulation of such flows. A fundamental issue in the use of vortex methods is the ability of employing efficiently large numbers of computational elements to resolve the large range of scales that exist in complex flows. The traditional cost of the method scales as Omicron (N(sup 2)) as the N computational elements/particles induce velocities at each other, making the method unacceptable for simulations involving more than a few tens of thousands of particles. In the last decade fast methods have been developed that have operation counts of Omicron (N log N) or Omicron (N) (referred to as BH and GR respectively) depending on the details of the algorithm. These methods are based on the observation that the effect of a cluster of particles at a certain distance may be approximated by a finite series expansion. In order to exploit this observation we need to decompose the element population spatially into clusters of particles and build a hierarchy of clusters (a tree data structure) - smaller neighboring clusters combine to form a cluster of the next size up in the hierarchy and so on. This hierarchy of clusters allows one to determine efficiently when the approximation is valid. This algorithm is an N-body solver that appears in many fields of engineering and science. Some examples of its diverse use are in astrophysics, molecular dynamics, micro-magnetics, boundary element simulations of electromagnetic problems, and computer animation. More recently these N-body solvers have been implemented and applied in simulations involving vortex methods. Koumoutsakos and Leonard (1995) implemented the GR scheme in two dimensions for vector computer architectures allowing for simulations of bluff body flows using millions of particles. Winckelmans presented three-dimensional, viscous simulations of interacting vortex rings, using vortons and an implementation of a BH scheme for parallel computer architectures. Bhatt presented a vortex filament method to perform inviscid vortex ring interactions, with an alternative implementation of a BH scheme for a Connection Machine parallel computer architecture.

Koumoutsakos, P.↗

NASA NTRS1989

Structures cluster

The objective of this program is to develop technology needed for structural evaluation of alternative space construction concepts. Those concepts are as follows: interactive effects on dynamic performance of various environment and self-generated disturbance; new materials concepts, failure mechanisms, and non-destructive evaluation/failure detection; develop stable control algorithms and design effective combination of hierarchical and adaptive controls; and assess control-structure integrated performance and stability.

Datta, Subhendu K.↗

NASA NTRS2009

A Local Scalable Distributed Expectation Maximization Algorithm for Large Peer-to-Peer Networks

This paper offers a local distributed algorithm for expectation maximization in large peer-to-peer environments. The algorithm can be used for a variety of well-known data mining tasks in a distributed environment such as clustering, anomaly detection, target tracking to name a few. This technology is crucial for many emerging peer-to-peer applications for bioinformatics, astronomy, social networking, sensor networks and web mining. Centralizing all or some of the data for building global models is impractical in such peer-to-peer environments because of the large number of data sources, the asynchronous nature of the peer-to-peer networks, and dynamic nature of the data/network. The distributed algorithm we have developed in this paper is provably-correct i.e. it converges to the same result compared to a similar centralized algorithm and can automatically adapt to changes to the data and the network. We show that the communication overhead of the algorithm is very low due to its local nature. This monitoring algorithm is then used as a feedback loop to sample data from the network and rebuild the model when it is outdated. We present thorough experimental results to verify our theoretical claims.

Bhaduri, Kanishka↗

NASA NTRS1995

Numerical Simulations of High Enthalpy Pulse Facilities

Axisymmetric flows within shock tubes and expansion tubes are simulated including the effects of finite rate chemistry and both laminar and turbulent boundary layers. The simulations demonstrate the usefulness of computational fluid dynamics for characterizing the flows in high enthalpy pulse facilities. The modeling and numerical requirements necessary to simulate these flows accurately are also discussed. Although there is a large body of analysis which explains and quantifies the boundary layer growth between the shock and the interface in a shock tube, there is a need for more detailed solutions. Phenomena such as thermochemical nonequilibrium. or turbulent transition behind the shock are excluded in the assumptions of Mirels' analysis. Additionally there is inadequate capability to predict the influence of the boundary layer on the expanded gas behind the interface. Quantifying the gas in this region is particularly important in expansion tubes because it is the location of the test gas. Unsteady simulations of the viscous flow in shock tubes are computationally expensive because they must follow features such as a shock wave over the length of the facility and simultaneously resolve the small length scales within the boundary layer. As a result, efficient numerical algorithms are required. The numerical approach of the present work is to solve the axisymmetric gas dynamic equations using an finite-volume formulation where the inviscid fluxes are computed with a upwind TVD scheme. Multiple species equations are included in the formulation so that finite-rate chemistry can be modeled. The simulations cluster grid points at the shock and interface and translate this clustered grid with these features to minimize numerical errors. The solutions are advanced at a CFL number of less than one based on the inviscid gas dynamics. To avoid limitations on the time step due to the viscous terms, these terms are treated implicitly. This requires a block tri-diagonal matrix inversion along each line of cells normal to the wall. The cost of this inversion is more than offset by the larger allowable time step. The source terms representing the finite-rate chemical kinetics are also treated implicitly. An algebraic turbulence model for compressible flow is used. The flow in a low pressure shock tube is computed and the results are compared with Mirels'analysis. The driven gas is nitrogen at 70 Pa, and the incident shock speed is approximately 2.9 km/sec so that there is little dissociation. The simulations include a laminar boundary layer and are run until the limiting flow regime is achieved. At this limit, the shock and interface travel at the same velocity because the amount of driven gas between these two features remains the same: the mass flow across the shock is equal to the mass of gas being entrained at the interface by the boundary layer. Simulations with several grids are presented to establish the grid independence of the solution, Good agreement is achieved between Mirels' correlations and the computations. This is expected since the flow conditions are chosen to be consistent with the assumptions used in Mirels' analysis. This comparison adds credibility to the numerical approach and highlights some of the differences between the theory and the detailed simulations. In addition, simulations of the HYPULSE expansion tube are presented for two operating conditions and the computations are compared to experimental data. The operating gas for both cases is nitrogen. One test condition is at a total enthalpy of 15.2 MJ/Kg and a relatively low pressure of 2 kPa. This case is characterized by a laminar boundary layer and significant chemical nonequilibrium. in the acceleration gas. The second test condition is at a total enthalpy of 10.2 MJ/Kg and a pressure of 38 kPa and is characterized by a turbulent boundary layer. The simulations compare well with experiment and reveal that the nonuniformity in pressure observed during the test time is related to variations in the boundary layer displacement thickness.

Wilson, Gregory J.↗

NASA NTRS2007

Automated Knowledge Discovery From Simulators

A computational method, SimLearn, has been devised to facilitate efficient knowledge discovery from simulators. Simulators are complex computer programs used in science and engineering to model diverse phenomena such as fluid flow, gravitational interactions, coupled mechanical systems, and nuclear, chemical, and biological processes. SimLearn uses active-learning techniques to efficiently address the "landscape characterization problem." In particular, SimLearn tries to determine which regions in "input space" lead to a given output from the simulator, where "input space" refers to an abstraction of all the variables going into the simulator, e.g., initial conditions, parameters, and interaction equations. Landscape characterization can be viewed as an attempt to invert the forward mapping of the simulator and recover the inputs that produce a particular output. Given that a single simulation run can take days or weeks to complete even on a large computing cluster, SimLearn attempts to reduce costs by reducing the number of simulations needed to effect discoveries. Unlike conventional data-mining methods that are applied to static predefined datasets, SimLearn involves an iterative process in which a most informative dataset is constructed dynamically by using the simulator as an oracle. On each iteration, the algorithm models the knowledge it has gained through previous simulation trials and then chooses which simulation trials to run next. Running these trials through the simulator produces new data in the form of input-output pairs. The overall process is embodied in an algorithm that combines support vector machines (SVMs) with active learning. SVMs use learning from examples (the examples are the input-output pairs generated by running the simulator) and a principle called maximum margin to derive predictors that generalize well to new inputs. In SimLearn, the SVM plays the role of modeling the knowledge that has been gained through previous simulation trials. Active learning is used to determine which new input points would be most informative if their output were known. The selected input points are run through the simulator to generate new information that can be used to refine the SVM. The process is then repeated. SimLearn carefully balances exploration (semi-randomly searching around the input space) versus exploitation (using the current state of knowledge to conduct a tightly focused search). During each iteration, SimLearn uses not one, but an ensemble of SVMs. Each SVM in the ensemble is characterized by different hyper-parameters that control various aspects of the learned predictor - for example, whether the predictor is constrained to be very smooth (nearby points in input space lead to similar output predictions) or whether the predictor is allowed to be "bumpy." The various SVMs will have different preferences about which input points they would like to run through the simulator next. SimLearn includes a formal mechanism for balancing the ensemble SVM preferences so that a single choice can be made for the next set of trials.

Burl, Michael↗

NASA NTRS2004

Proceedings from the 2nd International Symposium on Formation Flying Missions and Technologies

Topics discussed include: The Stellar Imager (SI) "Vision Mission"; First Formation Flying Demonstration Mission Including on Flight Nulling; Formation Flying X-ray Telescope in L2 Orbit; SPECS: The Kilometer-baseline Far-IR Interferometer in NASA's Space Science Roadmap Presentation; A Tight Formation for Along-track SAR Interferometry; Realization of the Solar Power Satellite using the Formation Flying Solar Reflector; SIMBOL-X : Formation Flying for High-Energy Astrophysics; High Precision Optical Metrology for DARWIN; Close Formation Flight of Micro-Satellites for SAR Interferometry; Station-Keeping Requirements for Astronomical Imaging with Constellations of Free-Flying Collectors; Closed-Loop Control of Formation Flying Satellites; Formation Control for the MAXIM Mission; Precision Formation Keeping at L2 Using the Autonomous Formation Flying Sensor; Robust Control of Multiple Spacecraft Formation Flying; Virtual Rigid Body (VRB) Satellite Formation Control: Stable Mode-Switching and Cross-Coupling; Electromagnetic Formation Flight (EMFF) System Design, Mission Capabilities, and Testbed Development; Navigation Algorithms for Formation Flying Missions; Use of Formation Flying Small Satellites Incorporating OISL's in a Tandem Cluster Mission; Semimajor Axis Estimation Strategies; Relative Attitude Determination of Earth Orbiting Formations Using GPS Receivers; Analysis of Formation Flying in Eccentric Orbits Using Linearized Equations of Relative Motion; Conservative Analytical Collision Probabilities for Orbital Formation Flying; Equations of Motion and Stability of Two Spacecraft in Formation at the Earth/Moon Triangular Libration Points; Formations Near the Libration Points: Design Strategies Using Natural and Non-Natural Ares; An Overview of the Formation and Attitude Control System for the Terrestrial Planet Finder Formation Flying Interferometer; GVE-Based Dynamics and Control for Formation Flying Spacecraft; GNC System Design for a New Concept of X-Ray Distributed Telescope; GNC System for the Deployment and Fine Control of the DARWIN Free-Flying Interferometer; Formation Algorithm and Simulation Testbed; and PLATFORM: A Formation Flying, RvD and Robotic Validation Test-bench.

Source record↗

NASA NTRS1988

The morphology of multiple-nucleus brightest cluster galaxies

The morphology of high SNR CCD images of 16 multiple-nucleus brightest cluster galaxies is studied using an algorithm that models images of the systems as the line-of-sight superposition of normal elliptical galaxies. The algorithm is applied initially to the classic multiple-nucleus cD galaxy in A2199. Evidence is found suggestive of deep interpenetrating high-speed encounters by its secondaries. The interactions effects studied include noncentric isophotes, brightness profile effects, excess light around primary galaxies, and dynamical friction wakes. The results show that in many cases multiple systems are interacting systems.

Lauer, Tod R.↗

NASA NTRS1999

SAGE: The Self-Adaptive Grid Code

The multi-dimensional self-adaptive grid code, SAGE, is an important tool in the field of computational fluid dynamics (CFD). It provides an efficient method to improve the accuracy of flow solutions while simultaneously reducing computer processing time. Briefly, SAGE enhances an initial computational grid by redistributing the mesh points into more appropriate locations. The movement of these points is driven by an equal-error-distribution algorithm that utilizes the relationship between high flow gradients and excessive solution errors. The method also provides a balance between clustering points in the high gradient regions and maintaining the smoothness and continuity of the adapted grid, The latest version, Version 3, includes the ability to change the boundaries of a given grid to more efficiently enclose flow structures and provides alternative redistribution algorithms.

Davies, Carol B.↗

NASA NTRS2004

Interactive Terascale Particle Visualization

This paper describes the methods used to produce an interactive visualization of a 2 TB computational fluid dynamics (CFD) data set using particle tracing (streaklines). We use the method introduced by Bruckschen et al. [2001] that pre-computes a large number of particles, stores them on disk using a space-filling curve ordering that minimizes seeks, and then retrieves and displays the particles according to the user's command. We describe how the particle computation can be performed using a PC cluster, how the algorithm can be adapted to work with a multi-block curvilinear mesh, and how the out-of-core visualization can be scaled to 296 billion particles while still achieving interactive performance on PG hardware. Compared to the earlier work, our data set size and total number of particles are an order of magnitude larger. We also describe a new compression technique that allows the lossless compression of the particles by 41% and speeds the particle retrieval by about 30%.

Ellsworth, David↗

NASA NTRS2003

Archetypal TRMM Radar Profiles Identified Through Cluster Analysis

It is widely held that identifiable 'convective regimes' exist in nature, although precise definitions of these are elusive. Examples include land / Ocean distinctions, break / monsoon beahvior, seasonal differences in the Amazon (SON vs DJF), etc. These regimes are often described by differences in the realized local convective spectra, and measured by various metrics of convective intensity, depth, areal coverage and rainfall amount. Objective regime identification may be valuable in several ways: regimes may serve as natural 'branch points' in satellite retrieval algorithms or data assimilation efforts; one example might be objective identification of regions that 'should' share a similar 2-R relationship. Similarly, objectively defined regimes may provide guidance on optimal siting of ground validation efforts. Objectively defined regimes could also serve as natural (rather than arbitrary geographic) domain 'controls' in studies of convective response to environmental forcing. Quantification of convective vertical structure has traditionally involved parametric study of prescribed quantities thought to be important to convective dynamics: maximum radar reflectivity, cloud top height, 30-35 dBZ echo top height, rain rate, etc. Individually, these parameters are somewhat deficient as their interpretation is often nonunique (the same metric value may signify different physics in different storm realizations). Individual metrics also fail to capture the coherence and interrelationships between vertical levels available in full 3-D radar datasets. An alternative approach is discovery of natural partitions of vertical structure in a globally representative dataset, or 'archetypal' reflectivity profiles. In this study, this is accomplished through cluster analysis of a very large sample (0[107) of TRMM-PR reflectivity columns. Once achieved, the rainconditional and unconditional 'mix' of archetypal profile types in a given location and/or season provides a description of the local convective spectrum which retains vertical structure information. A further cluster analysis of these 'mixes' can identify recurrent convective spectra. These are a first step towards objective identification of convective regimes, and towards answering the question: 'What are the most convectively similar locations in the world?'

Boccippio, Dennis J.↗

NASA NTRS2008

Hail Size Distribution Mapping

A 3-D weather radar visualization software program was developed and implemented as part of an experimental Launch Pad 39 Hail Monitor System. 3DRadPlot, a radar plotting program, is one of several software modules that form building blocks of the hail data processing and analysis system (the complete software processing system under development). The spatial and temporal mapping algorithms were originally developed through research at the University of Central Florida, funded by NASA s Tropical Rainfall Measurement Mission (TRMM), where the goal was to merge National Weather Service (NWS) Next-Generation Weather Radar (NEXRAD) volume reflectivity data with drop size distribution data acquired from a cluster of raindrop disdrometers. In this current work, we adapted these algorithms to process data from a cluster of hail disdrometers positioned around Launch Pads 39A or 39B, along with the corresponding NWS radar data. Radar data from all NWS NEXRAD sites is archived at the National Climatic Data Center (NCDC). That data can be readily accessed at . 3DRadPlot plots Level III reflectivity data at four scan elevations (this software is available at Open Channel Software, ). By using spatial and temporal interpolation/extrapolation based on hydrometeor fall dynamics, we can merge the hail disdrometer array data coupled with local Weather Surveillance Radar-1988, Doppler (WSR-88D) radial velocity and reflectivity data into a 4-D (3-D space and time) picture of hail size distributions. Hail flux maps can then be generated and used for damage prediction and assessment over specific surfaces corresponding to structures within the disdrometer array volume. Immediately following a hail storm, specific damage areas and degree of damage can be identified for inspection crews.

Source record↗

NASA NTRS2019

Using Machine-Learning to Dynamically Generate Operationally Acceptable Strategic Reroute Options

The newly developed Trajectory Option Set (TOS), a preference-weighted set of alternative routes submitted by flight operators, is a capability in the U.S. traffic flow management system that enables automated trajectory negotiation between flight operators and Air Navigation Service Providers. The objective of this paper is to describe and demonstrate an approach for automatically generating pre-departure and airborne TOSs that have a high probability of operational acceptance. The approach uses hierarchical clustering of historical route data to identify route candidates. The probability of operational acceptance is then estimated using predictors trained on historical flight plan amendment data using supervised machine learning algorithms, allowing the routes with highest probability of operational acceptance to be selected for the TOS. Features used describe historical route usage, difference in flight time and downstream demand to capacity imbalance. A random forest was found to be the best performing algorithm for learning operational acceptability, with a model accuracy of 0.96. The approach is demonstrated for an historical pre-departure flight from Dallas/Fort Worth International Airport to Newark Liberty International Airport.

Evans, Antony↗

NASA NTRS2019

Using Machine-Learning to Dynamically Generate Operationally Acceptable Strategic Reroute Options

Evans, Antony↗

NASA NTRS2002

Parallel Computing Strategies for Irregular Algorithms

Parallel computing promises several orders of magnitude increase in our ability to solve realistic computationally-intensive problems, but relies on their efficient mapping and execution on large-scale multiprocessor architectures. Unfortunately, many important applications are irregular and dynamic in nature, making their effective parallel implementation a daunting task. Moreover, with the proliferation of parallel architectures and programming paradigms, the typical scientist is faced with a plethora of questions that must be answered in order to obtain an acceptable parallel implementation of the solution algorithm. In this paper, we consider three representative irregular applications: unstructured remeshing, sparse matrix computations, and N-body problems, and parallelize them using various popular programming paradigms on a wide spectrum of computer platforms ranging from state-of-the-art supercomputers to PC clusters. We present the underlying problems, the solution algorithms, and the parallel implementation strategies. Smart load-balancing, partitioning, and ordering techniques are used to enhance parallel performance. Overall results demonstrate the complexity of efficiently parallelizing irregular algorithms.

Biswas, Rupak↗

NASA NTRS1992

Research in computational fluid dynamics and analysis of algorithms

Recently, higher-order compact schemes have seen increasing use in the DNS (Direct Numerical Simulations) of the Navier-Stokes equations. Although they do not have the spatial resolution of spectral methods, they offer significant increases in accuracy over conventional second order methods. They can be used on any smooth grid, and do not have an overly restrictive CFL dependence as compared with the O(N(exp -2)) CFL dependence observed in Chebyshev spectral methods on finite domains. In addition, they are generally more robust and less costly than spectral methods. The issue of the relative cost of higher-order schemes (accuracy weighted against physical and numerical cost) is a far more complex issue, depending ultimately on what features of the solution are sought and how accurately they must be resolved. In any event, the further development of the underlying stability theory of these schemes is important. The approach of devising suitable boundary clusters and then testing them with various stability techniques (such as finding the norm) is entirely the wrong approach when dealing with high-order methods. Very seldom are high-order boundary closures stable, making them difficult to isolate. An alternative approach is to begin with a norm which satisfies all the stability criteria for the hyperbolic system, and look for the boundary closure forms which will match the norm exactly. This method was used recently by Strand to isolate stable boundary closure schemes for the explicit central fourth- and sixth-order schemes. The norm used was an energy norm mimicking the norm for the differential equations. Further research should be devoted to BC for high order schemes in order to make sure that the results obtained are reliable. The compact fourth order and sixth order finite difference scheme had been incorporated into a code to simulate flow past circular cylinders. This code will serve as a verification of the full spectral codes. A detailed stability analysis by Carpenter (from the fluid Mechanics Division) and Gottlieb gave analytic conditions for stability as well as asymptotic stability. This had been incorporated in the code in form of stable boundary conditions. Effects of the cylinder rotations had been studied. The results differ from the known theoretical results. We are in the middle of analyzing the results. A detailed analysis of the effects of the heating of the cylinder on the shedding frequency had been studied using the above schemes. It has been found that the shedding frequency decreases when the wire was heated. Experimental work is being carried out to affirm this result.

Gottlieb, David↗