Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithm complexity analysis”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

Using Lomb–Scargle Analysis to Derive Empirical Orthogonal Functions from Gappy Meteorological Data

The Lomb–Scargle discrete Fourier transform (LSDFT) is a well-known technique for analyzing time series. In this study, a solution for empirical orthogonal functions (EOFs) based on irregularly sampled data is derived from the LSDFT. It is demonstrated that this particular algorithm has no hard limit on its accuracy and yields results comparable to those of complex Hilbert EOF analysis. Two LSDFT algorithms are compared in terms of their performance in evaluating EOFs for precipitation observations from the Tropical Rainfall Measuring Mission satellite. Both are shown to be able to capture the pattern of the diurnal cycle of rainfall over the complex topography and diverse land cover of South America, and both also show other consistent features in the 0–12-day frequency band.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS1989

Unsteady Euler algorithm with unstructured dynamic mesh for complex-aircraft aeroelastic analysis

A finite-volume unstructured-grid FEM scheme with multistage Runge-Kutta time stepping is applied to the three-dimensional time-dependent Euler equations for inviscid flows on complex aircraft configurations undergoing structural deformation. The derivation of the model, the solution procedure, and the computer implementation are described, and results are presented graphically for a NASA Langley supersonic fighter aircraft model in steady and unsteady (harmonic oscillation in complete-vehicle bending mode) flow regimes. Good agreement between FEM predictions and experimental data is demonstrated.

Batina, John T.↗
NASA NTRS1996

Error and Complexity Analysis for a Collocation-Grid-Projection Plus Precorrected-FFT Algorithm for Solving Potential Integral Equations with LaPlace or Helmholtz Kernels

In this paper we derive error bounds for a collocation-grid-projection scheme tuned for use in multilevel methods for solving boundary-element discretizations of potential integral equations. The grid-projection scheme is then combined with a precorrected FFT style multilevel method for solving potential integral equations with 1/r and e(sup ikr)/r kernels. A complexity analysis of this combined method is given to show that for homogeneous problems, the method is order n natural log n nearly independent of the kernel. In addition, it is shown analytically and experimentally that for an inhomogeneity generated by a very finely discretized surface, the combined method slows to order n(sup 4/3). Finally, examples are given to show that the collocation-based grid-projection plus precorrected-FFT scheme is competitive with fast-multipole algorithms when considering realistic problems and 1/r kernels, but can be used over a range of spatial frequencies with only a small performance penalty.

Phillips, J. R.↗
NASA NTRS1990

Analysis and design of algorithm-based fault-tolerant systems

An important consideration in the design of high performance multiprocessor systems is to ensure the correctness of the results computed in the presence of transient and intermittent failures. Concurrent error detection and correction have been applied to such systems in order to achieve reliability. Algorithm Based Fault Tolerance (ABFT) was suggested as a cost-effective concurrent error detection scheme. The research was motivated by the complexity involved in the analysis and design of ABFT systems. To that end, a matrix-based model was developed and, based on that, algorithms for both the design and analysis of ABFT systems are formulated. These algorithms are less complex than the existing ones. In order to reduce the complexity further, a hierarchical approach is developed for the analysis of large systems.

Nair, V. S. Sukumaran↗
NASA NTRS1989

Computational fluid dynamics research in three-dimensional zonal techniques

Patched-grid algorithms for the analysis of complex configurations with an implicit, upwind-biased Navier-Stokes solver were investigated. Conservative and non-conservative approaches for performing zonal interpolations were implemented. The latter approach yields the most flexible technique in that it can handle both patched and overlaid grids. Results for a two-dimensional blunt body problem show that either approach yield accurate steady-state shock locations and jump conditions. In addition, calculations of the turbulent flow through a hypersonic inlet on a three-zone grid show that the numerical prediction is in good agreement with the experimental results. Through the use of a generalized coordinate transformation at the zonal interface between two or more blocks, the algorithm can be applied to highly stretched viscous grids and to arbitrarily-shaped zonal boundaries. Applications were made to the F-18 aircraft at subsonic, high-alpha conditions, in support of the NASA High-Alpha Research Program. The calculations were compared to ground-based and flight test experiments and were used as a guide to understanding the ground-based tests, which are laminar and transitional, and their relationship to flight. Calculations about a complete reconnaissance aircraft were also performed in order to further demonstrate the capability of the patched-grid algorithm.

Walters, Robert W.↗
DOE OSTI2025

String instability mitigation of adaptive cruise control without modifying control laws: trajectory shaper and parameter estimation

Vehicle automation technologies equip vehicles with adaptive cruise control (ACC) systems, which relieve driving fatigue. However, recent studies have shown that the current ACC systems are string-unstable (i.e., exacerbate traffic congestion). To achieve string stability, most existing studies directly modify the control algorithms of ACC systems. Alternatively, this study proposes a trajectory shaper (TS)-based method, which only modifies the trajectory information of the predecessor vehicle, so that the ego vehicle driven by a string-unstable ACC system leverages the modified trajectory information to achieve string stability. To devise the TS-based method, an offline-online parameter estimation method integrating batch optimization and an extended Kalman filter is applied to estimate the parameters of an ACC system. The proposed TS-based method is cost-effective during implementation, as it avoids modifying existing ACC control algorithms (which entails a complex analysis of control systems and parameter tuning). In conclusion, the effectiveness of the proposed TS-based method is validated through extensive numerical experiments.

33 ADVANCED PROPULSION SYSTEMS↗
NASA NTRS1990

Application of a patched-grid algorithm to the F/A-18 forebody-leading-edge extension configuration

A patched-grid algorithm for the analysis of complex configurations with an implicit, upwind-biased Navier-Stokes solver is presented. Results from both a spatial-flux and a time-flux conservation approach to patching across zonal boundaries are presented. A generalized coordinate transformation with a biquadratic geometric element is used at the zonal interface in order to treat highly stretched viscous grids and arbitrarily shaped zonal boundaries. Applications are made to the F/A-18 forebody-Ieading-edge extension configuration at subsonic, high-alpha conditions. Computed surface flow patterns compare well with ground-based and flight-test results; the large effect of Reynolds number on the forebody flowfield is shown.

Leading edge extension↗
DOE OSTI2020

Hierarchical Phenomena in Multicomponent Liquids: Simulation Methods, Analysis, Chemistry

Complex, multicomponent, solutions have often been studied solely through the lens of specific applications of interest. Yet advances to both simulation methodologies (enhanced sampling, etc.) and analysis techniques (network analysis algorithms and others), are creating a trove of data that reveal transcending characteristics across vast compositional phase space. This perspective discusses technical considerations of the reliable and accurate simulations of complex solutions, followed by the advances to analysis algorithms that elucidate coupling of different length and timescale behavior (hierarchical phenomena). The different manifestations of hierarchical phenomena are presented across an array of solution environments, emphasizing fundamental and ongoing science questions. With a more advanced molecular understanding in hand, a quintessential application (solvent extraction) is discussed, where significant opportunities exist to re-imagine the technical scope of an established technology.

Servis, Michael J.↗
NASA NTRS1984

Development of numerical procedures for analysis of complex structures

The paper is concerned with the development of novel numerical procedures for the solution of static, stability, free vibration and dynamic response analysis of large, complex practical structures. Thus, details of numerical algorithms evolved for dynamic analysis of usual non-rotating and also rotating structures as well as finite dynamic elements are presented in the paper. Furthermore, the article provides some description of a general-purpose computer program STARS specifically developed for efficient analysis of complex practical structures.

Gupta, K. K.↗
NASA NTRS1990

High order sensitivity analysis of complex, coupled systems

The Sobieszczanski-Sobieski (1988) algorithm is extended to include second- and higher-order derivatives while retaining the obviation of finite-differencing of the system analysis. This is accomplished by means of a recursive application of the same implicit function theorem as in the original algorithm. In optimization, the computational cost of the higher-order derivatives is relative to the aggregate cost of analysis together with a repetition of the first-order sensitivity analysis as often as is required to produce the equivalent information by successive linearizations within move limits.

Sobieszczanski-Sobieski, Jaroslaw↗
NASA NTRS1996

Generating Voronoi Diagrams for Curved Shapes with Divide-and-Conquer

Voronoi diagrams have been used in many practical applications including solid modeling, Numerical Control machining, Finite Element mesh generation, etc. Investigating the properties of these diagrams is an active research topic with many fruitful results. Computational techniques for Voronoi diagrams, however, have been concentrated on low order elements, for points, lines, polygons, quadratic curves and surfaces. This paper presents a divide-and-conquer scheme computing the diagrams for planar shapes bounded by closed curves commonly encountered in Computer Aided Design. These curves include analytical curves and splines. The algorithm first divides the boundary curve into sections, delimited by curve points with the minimal curvatures. Bisector branches for these sections are then generated and merged recursively to obtain the final diagram. A detailed example in the paper shows the steps of the generation and merging of the bisectors. A simple analysis of the complexity of the algorithm is also presented.

Chou, Jin J.↗
NASA NTRS1999

Scientific Programming Using Java: A Remote Sensing Example

This paper presents results of a project to port remote sensing code from the C programming language to Java. The advantages and disadvantages of using Java versus C as a scientific programming language in remote sensing applications are discussed. Remote sensing applications deal with voluminous data that require effective memory management, such as buffering operations, when processed. Some of these applications also implement complex computational algorithms, such as Fast Fourier Transformation analysis, that are very performance intensive. Factors considered include performance, precision, complexity, rapidity of development, ease of code reuse, ease of maintenance, memory management, and platform independence. Performance of radiometric calibration code written in Java for the graphical user interface and of using C for the domain model are also presented.

Prados, Don↗
NASA NTRS1985

Where are the parallel algorithms?

Four paradigms that can be useful in developing parallel algorithms are discussed. These include computational complexity analysis, changing the order of computation, asynchronous computation, and divide and conquer. Each is illustrated with an example from scientific computation, and it is shown that computational complexity must be used with great care or an inefficient algorithm may be selected.

Voigt, R. G.↗
DOE OSTI2021

Analysis of GPU Data Access Patterns on Complex Geometries for the D3Q19 Lattice Boltzmann Algorithm

GPU performance of the lattice Boltzmann method (LBM) depends heavily on memory access patterns. When implemented with GPUs on complex domains, typically, geometric data is accessed indirectly and lattice data is accessed lexicographically. Although there are a variety of other options, no study has examined the relative efficacy between them. Here, we examine a suite of memory access schemes via empirical testing and performance modeling. We find strong evidence that semi-direct is often better suited than the more common indirect addressing, providing increased computational speed and reducing memory consumption. For the layout, we find that the Collected Structure of Arrays (CSoA) and bundling layouts outperform the common Structure of Array layout; on V100 and P100 devices, CSoA consistently outperforms bundling, however the relationship is more complicated on K40 devices. When compared to state-of-the-art practices, our recommendations lead to speedups of 10–40 percent and reduce memory consumption up to 17 percent. Using performance modeling and computational experimentation, we determine the mechanisms behind the accelerations. We demonstrate that our results hold across multiple GPUs on two leadership class systems, and present the first near-optimal strong results for LBM with arterial geometries run on GPUs.

42 ENGINEERING↗
DOE OSTI2021

Machine Learning of Bacterial Transcriptomes Reveals Responses Underlying Differential Antibiotic Susceptibility

In vitro antibiotic susceptibility testing often fails to accurately predict in vivo drug efficacies, in part due to differences in the molecular composition between standardized bacteriologic media and physiological environments within the body. Here, we investigate the interrelationship between antibiotic susceptibility and medium composition in Escherichia coli K-12 MG1655 as contextualized through machine learning of transcriptomics data. Application of independent component analysis, a signal separation algorithm, shows that complex phenotypic changes induced by environmental conditions or antibiotic treatment are directly traced to the action of a few key transcriptional regulators, including RpoS, Fur, and Fnr. Integrating machine learning results with biochemical knowledge of transcription factor activation reveals medium-dependent shifts in respiration and iron availability that drive differential antibiotic susceptibility. By extension, the data generation and data analytics workflow used here can interrogate the regulatory state of a pathogen under any measured condition and can be applied to any strain or organism for which sufficient transcriptomics data are available.

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS1982

Control optimization, stabilization and computer algorithms for aircraft applications

The analysis and design of complex multivariable reliable control systems are considered. High performance and fault tolerant aircraft systems are the objectives. A preliminary feasibility study of the design of a lateral control system for a VTOL aircraft that is to land on a DD963 class destroyer under high sea state conditions is provided. Progress in the following areas is summarized: (1) VTOL control system design studies; (2) robust multivariable control system synthesis; (3) adaptive control systems; (4) failure detection algorithms; and (5) fault tolerant optimal control theory.

Athans, M.↗
DOE OSTI2025

Analysis of the Trusted Inertial Terrain-Aided Navigation Measurement Function

The trusted inertial terrain-aided navigation (TITAN) algorithm leverages an airborne vertical synthetic aperture radar to measure the range to the closest ground points along several prescribed iso-Doppler contours. These TITAN minimum-range, prescribed-Doppler measurements are the result of a constrained nonlinear optimization problem whose optimization function and constraints both depend on the radar position and velocity. Owing to the complexity of this measurement definition, analysis of the TITAN algorithm is lacking in prior work. This publication offers such an analysis, making the following three contributions: (1) an analytical solution to the TITAN constrained optimization measurement problem, (2) a derivation of the TITAN measurement function Jacobian, and (3) a derivation of the Cramér-Rao lower bound on the estimated position and velocity error covariance. These three contributions are verified via Monte Carlo simulations over synthetic terrain, which further reveal two remarkable properties of the TITAN algorithm: (1) the along-track positioning errors tend to be smaller than the cross-track positioning errors, and (2) the cross-track positioning errors are independent of the terrain roughness.

TITAN↗