Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “numerical algorithms”

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 811 records · Page 45

"Recognizing Numerical Constants"

The advent of inexpensive, high performance computer and new efficient algorithms have made possible the automatic recognition of numerically computed constants. In other words, techniques now exist for determining, within certain limits, whether a computed real or complex number can be written as a simple expression involving the classical constants of mathematics. In this presentation, some of the recently discovered techniques for constant recognition, notably integer relation detection algorithms, will be presented. As an application of these methods, the author's recent work in recognizing "Euler sums" will be described in some detail.

Bailey, David H.↗

Kalman estimation for SEDS measurements

The first on-orbit experiment of the Small Expendable Deployer System (SEDS) for tethered satellites will collect telemetry data for tethered length, rate of deployment, and tether tension. The post-flight analysis will use this data to reconstruct the deployment history and determine payload position and tether shape. Two Kalman estimator algorithms were written, and output using simulated measurement data was compared. Both estimators exhibited the same estimated state histories, indicating that numerical instability in the traditional algorithm was not the cause of filter divergence. Estimation of acceleration biases was added, which reduced the error but did not correct the divergence. An add-a-bead estimator that adds lumped masses as the tether is deployed was written, which provides a state model that matches the BEADSIM simulation providing the true measurements and states. This twenty-one bead estimator produced state histories similar to those of the two-bead estimator, indicating that the filter divergence was not caused by a reduced-order model. The noise models used to date are relatively simple and may be the source of estimator divergence. The investigation of colored noise models, cross-correlated measurement and process covariances, and noise-adaptive filter techniques is recommended.

Carrington, Connie K.↗

Square-root algorithm for evaluating mismodeled process noise

As the application of sequential filters has grown, the need has arisen to evaluate the sensitivity of these filters to mismodeling of the random process. A numerically reliable square-root algorithm is developed for calculating the covariances of estimates from a sequential filter which incorrectly models process noise. Mismodeling is restricted to the correlation time and standard deviation of a random process represented as a first-order Gauss-Markov sequence. Using a computer program which employs this algorithm, a sensitivity analysis was performed for several types of earth-based tracking data from an interplanetary spacecraft.

Thornton, C. L.↗

FORTRAN subroutines for out-of-core solutions of large complex linear systems

The design and usage of two main subprograms using direct methods to solve large linear complex systems, of the form Ax = b, whose coeffficient matrices are too large to be stored in core are described. The first main subprogram is for systems whose coefficient matrices are of a particular sparse structure, namely, the matrix A can be written in the form B + D, where B is a block-banded system, and D has only a few columns of nonzeros. Key elements of the algorithms used in the subprograms include: the data structure, the strategy for preserving numerical stability, the adaptability of the algorithms for dense systems as well as for block-profile systems.

Yip, E. L.↗

Comparison of numerical techniques for integration of stiff ordinary differential equations arising in combustion chemistry

The efficiency and accuracy of several algorithms recently developed for the efficient numerical integration of stiff ordinary differential equations are compared. The methods examined include two general-purpose codes, EPISODE and LSODE, and three codes (CHEMEQ, CREK1D, and GCKP84) developed specifically to integrate chemical kinetic rate equations. The codes are applied to two test problems drawn from combustion kinetics. The comparisons show that LSODE is the fastest code currently available for the integration of combustion kinetic rate equations. An important finding is that an interactive solution of the algebraic energy conservation equation to compute the temperature does not result in significant errors. In addition, this method is more efficient than evaluating the temperature by integrating its time derivative. Significant reductions in computational work are realized by updating the rate constants (k = at(supra N) N exp(-E/RT) only when the temperature change exceeds an amount delta T that is problem dependent. An approximate expression for the automatic evaluation of delta T is derived and is shown to result in increased efficiency.

Radhakrishnan, K.↗

Control of large flexible space structures using pole placement design techniques

A design approach via the pole placement techniques for the class of large flexible space structures is developed. The numerical problems in pole placement algorithm, arising from large dimension systems and the extremely low frequency eigenvalues which occur in large space structure models are examined. It shows these numerical difficulties may be overcome by properly selecting the sensor/actuator locations and introducing a frequency scaling scheme. The concepts of this paper are illustrated by some numerical studies on the linear feedback control design of a representative large spacecraft consisting of a small rigid core with ten radial booms (five booms 1000 ft long and five shorter booms 700 ft long) lying in a plane.

Wu, Y. W.↗

Improvement of mixed time implicit-explicit algorithms for thermal analysis of structures

Computer implementation aspects and numerical evaluation of the recently introduced mixed time implicit-explicit algorithms in thermal analysis of structures are presented. A computationally useful method of estimating the critical time step for a linear quadrilateral element is given herein for the methods introduced by Liu and co-workers. Numerical tests confirm the stability criterion and accuracy characteristics of the methods. The superiority of these mixed time methods to the fully implicit method or the fully explicit method is also demonstrated.

Liu, W. K.↗

UDU/T/ covariance factorization for Kalman filtering

There has been strong motivation to produce numerically stable formulations of the Kalman filter algorithms because it has long been known that the original discrete-time Kalman formulas are numerically unreliable. Numerical instability can be avoided by propagating certain factors of the estimate error covariance matrix rather than the covariance matrix itself. This paper documents filter algorithms that correspond to the covariance factorization P = UDU(T), where U is a unit upper triangular matrix and D is diagonal. Emphasis is on computational efficiency and numerical stability, since these properties are of key importance in real-time filter applications. The history of square-root and U-D covariance filters is reviewed. Simple examples are given to illustrate the numerical inadequacy of the Kalman covariance filter algorithms; these examples show how factorization techniques can give improved computational reliability.

Thornton, C. L.↗

Robust and real-time rotor control with magnetic bearings

This paper deals with the sliding mode control of a rigid rotor via radial magnetic bearings. The digital control algorithm and the results from numerical simulations are presented for an experimental rig. The experimental system which has been set up to digitally implement and validate the sliding mode control algorithm is described. Two methods for the development of control softwares are presented. Experimental results for individual rotor axis are discussed.

Sinha, A.↗

TPSAS-NF1676L-21193-DND

Researchers at NASA Langley Research Center have been developing an automated pattern recognition algorithm to identify overshooting convective cloud tops (OTs) in support of the GOES-R satellite program. This algorithm identify regions of overshooting at the individual 1-4 km geostationary satellite pixel scale using visible (during daytime only) and infrared channel imagery and numerical weather analysis data. The algorithm has been developed based upon analysis of 0.25-1 km spatial resolution Aqua MODIS imagery, using a database of over 2000 manually identified OT features throughout the world in storms with varying intensity and morphology. The OT database includes storms ranging from small, warm topped cells in Alaska and Mongolia, tornadic supercells over the U.S. Central Plains and Europe, large tropical mesoscale convective systems, and overshooting in the eyewalls and spiral bands of category 5 tropical cyclones. This database is available for use by the research community. The algorithm is designed to operate on data from any current and historical satellite imager, allowing for development of a highly accurate global OT detection climatology that extends back into the 1990's at up to a 15-30 min temporal resolution throughout the diurnal cycle. As members of the McIDAS Users Group, NASA LaRC has immediate access to the full global archive of geostationary imager data which would allows rapid development of OT climatologies and short-term databases. This type of capability has never been available within the weather and climate research community. Regional geostationary OT databases have been already developed over CONUS during SEAC4RS, for 18-years over the Eastern U.S., and for 5-10 years over Australia, Europe, Southeast Asia, and East Africa among many other regions. Some of these datasets are being used by climate researchers and private industry to examine UTLS-penetrating storm spatial distributions and their temporal variability, in addition to weather hazards associated with these storms at unprecedented spatial detail. This presentation will describe the OT pattern recognition algorithm and highlight recent product applications.

Kristopher Bedka↗

Integration-free interval doubling for Riccati equation solutions

Starting with certain identities obtained by Reid (1972) and Redheffer (1962) for general matrix Riccati equations (RE's), we give various algorithms for the case of constant coefficients. The algorithms are based on two ideas - first, relate the RE solution with general initial conditions to anchored RE solutions; and second, when the coefficients are constant, the anchored solutions have a basic shift-invariance property. These ideas are used to construct an integration-free, superlinearly convergent iterative solution to the algebraic RE. Preliminary numerical experiments show that our algorithms, arranged in square-root form, provide a method that is numerically stable and appears to be competitive with other methods of solving the algebraic RE.

Sidhu, G. S.↗

Flux-split algorithms for hypersonic flows

This study reviews numerical techniques for the simulation of fluid flows spanning the range of reactive regimes, from local chemical equilibrium to full thermochemical non-equilibrium. In particular, characteristic-based algorithms are considered, of the flux-vector and the flux-difference type, which are becoming ever more popular due to their accurate rendition of physically complicated, shock-wave dominated flows. Consideration is given to the problems associated with modeling the thermo-chemical behavior of reactive mixtures of thermally perfect gases, and a few topics of current research are outlined.

Cinnella, P.↗

Local multiplicative Schwarz algorithms for convection-diffusion equations

We develop a new class of overlapping Schwarz type algorithms for solving scalar convection-diffusion equations discretized by finite element or finite difference methods. The preconditioners consist of two components, namely, the usual two-level additive Schwarz preconditioner and the sum of some quadratic terms constructed by using products of ordered neighboring subdomain preconditioners. The ordering of the subdomain preconditioners is determined by considering the direction of the flow. We prove that the algorithms are optimal in the sense that the convergence rates are independent of the mesh size, as well as the number of subdomains. We show by numerical examples that the new algorithms are less sensitive to the direction of the flow than either the classical multiplicative Schwarz algorithms, and converge faster than the additive Schwarz algorithms. Thus, the new algorithms are more suitable for fluid flow applications than the classical additive or multiplicative Schwarz algorithms.

Cai, Xiao-Chuan↗

A Mixed Integer Efficient Global Optimization Algorithm with Multiple Infill Strategy - Applied to a Wing Topology Optimization Problem

With the advancement in high performance computing and numerical optimization techniques,engineering design optimization problems are becoming more complex, larger scale,higher fidelity, and computationally more demanding, requiring longer run times than ever before. There exists methodologies and techniques that can address some of these challenges but very few can address all, and most are limited in the extent that these concerns can be addressed. With the goal of addressing such challenging engineering problems, we developed anew optimization framework, named AMIEGO, that combines concepts from surrogate-based optimization approaches, gradient-based numerical methods, Partial Least Squares, evolutionary algorithms, and Branch-and-Bound, providing newer capabilities that were not previouslyperceived. However, the original version of this framework, in the process of adaptive samplingto explore and exploit the design space, finds only a single sample point per iteration. The efforthere builds upon this previously developed optimization framework to include multiple infillsampling capability that combines the concept of generalized expected improvement function,unsupervised learning, and multi-objective evolutionary technique. To demonstrate, AMIEGOwith the multiple infill capability (called AMIEGO-MIMOS) solves a series of increasingly difficultengineering design optimization problems. The results reveal the performance of the newapproach is problem dependent. When applied to a ten-bar truss problem, the newly proposedmultiple infill strategy consistently leads to a better design solutions when compared to theexisting CPTV method (implemented with the context of the AMIEGO framework). On theother hand, when applied to a mixed-integer high fidelity wing topology optimization problem- MIMOS, despite showing a steeper convergence at the start, eventually leads to an inferiorsolution as compared to CPTV approach. These results also reveal that a small number ofstarting points, in general, are sufficient to lead to a good overall solution.

Mixed-integer optimization↗

Applications of singular value analysis and partial-step algorithm for nonlinear orbit determination

An adaptive method in which cruise and nonlinear orbit determination problems can be solved using a single program is presented. It involves singular value decomposition augmented with an extended partial step algorithm. The extended partial step algorithm constrains the size of the correction to the spacecraft state and other solve-for parameters. The correction is controlled by an a priori covariance and a user-supplied bounds parameter. The extended partial step method is an extension of the update portion of the singular value decomposition algorithm. It thus preserves the numerical stability of the singular value decomposition method, while extending the region over which it converges. In linear cases, this method reduces to the singular value decomposition algorithm with the full rank solution. Two examples are presented to illustrate the method's utility.

Ryne, Mark S.↗

Error and Symmetry Analysis of Misner's Algorithm for Spherical Harmonic Decomposition on a Cubic Grid

In an earlier paper, Misner (2004, Class. Quant. Grav., 21, S243) presented a novel algorithm for computing the spherical harmonic components of data represented on a cubic grid. I extend Misner s original analysis by making detailed error estimates of the numerical errors accrued by the algorithm, by using symmetry arguments to suggest a more efficient implementation scheme, and by explaining how the algorithm can be applied efficiently on data with explicit reflection symmetries.

Fiske, David R.↗

An algorithm for the empirical optimization of antenna arrays

A numerical technique is presented to optimize the performance of arbitrary antenna arrays under realistic conditions. An experimental-computational algorithm is formulated in which n-dimensional minimization methods are applied to measured data obtained from the antenna array. A numerical update formula is used to induce partial derivative information without requiring special perturbations of the array parameters. The algorithm provides a new design for the antenna array, and the method proceeds in an iterative fashion. Test case results are presented showing the effectiveness of the algorithm.

Blank, S.↗