Search NASA⌕ Search

SEARCH · Search NASA

Results for “approximation 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 649 records · Page 36

Performance evaluation of fault tolerant systems represented by Markov models

A method to evaluate the performance of fault tolerant systems whose configuration can be represented by time-invariant, discrete-time, discrete-state Markov models is introduced. Each state is assumed to be associated with a constant qualitative measure of the system's performance. The method first computes the moments of the performance probability mass function (PMF) and then finds an approximating function that has the same moments. The form of this function is a maximum entropy solution of the moment matching problem. A simple algorithm for calculating the necessary moments is derived and a method for finding the approximate performance PMF is suggested. After some modification, the method is applied to an example, the Inertial Upper Stage navigation system.

Missana, Jean-Olivier A. A.↗

The k-space formulation of the n-dimensional scattering problem

The n-dimensional scattering problem is solved by means of a k-space formulation of the field equations, thereby replacing the conventional integral equation formulation by a set of two algebraic equations in two unknowns in two spaces (the constitutive equation being an algebraic equation in x-space). These equations are solved by an iterative method with the aid of the fast Fourier transform (FFT) algorithm connecting the two spaces, requiring very simple initial approximations. Since algebraic and FFT equations are used, the number of arithmetic multiple-add operations and storage allocations required for a numerical solution are reduced from the order of N sq (for solving the matrix equations resulting from the conventional integral equations) to the order of N(log base 2 of N) and N, respectively (where N is the number of data points required for the specification of the problem). The advantage gained in speed and storage is thus of the order of N/log base 2 of N and N, respectively. This method is thus considerably more efficient than the conventional matrix method, and permits exact numerical solutions for much larger problems. Arguments are presented toward the view that the field equations are more fundamental in k-space. The details and some numerical results of the application of this method to the three-dimensional electromagnetic scattering problems are presented as an example.

Bojarski, N. N.↗

Finite element representations for thin shell instability analysis

The development of finite element calculational procedures for thin-shell instability analysis has involved the definition of appropriate element representations (i.e. the geometric form of the element and the approximation of displacement and/or stress), constitutive expressions, and computational algorithms. Among these, the status of thin-shell finite element representations remains unsettled. This paper, therefore, emphasizes recent developments in the basic aspects of thin-shell finite element analysis and discusses one simplified approach in more detail. Formulative and computational procedures for elastic instability analysis are then summarized, and numerical results are shown for the simplified shell element formulation.

Gallagher, R. H.↗

Image gathering and processing - Information and fidelity

In this paper we formulate and use information and fidelity criteria to assess image gathering and processing, combining optical design with image-forming and edge-detection algorithms. The optical design of the image-gathering system revolves around the relationship among sampling passband, spatial response, and signal-to-noise ratio (SNR). Our formulations of information, fidelity, and optimal (Wiener) restoration account for the insufficient sampling (i.e., aliasing) common in image gathering as well as for the blurring and noise that conventional formulations account for. Performance analyses and simulations for ordinary optical-design constraints and random scences indicate that (1) different image-forming algorithms prefer different optical designs; (2) informationally optimized designs maximize the robustness of optimal image restorations and lead to the highest-spatial-frequency channel (relative to the sampling passband) for which edge detection is reliable (if the SNR is sufficiently high); and (3) combining the informationally optimized design with a 3 by 3 lateral-inhibitory image-plane-processing algorithm leads to a spatial-response shape that approximates the optimal edge-detection response of (Marr's model of) human vision and thus reduces the data preprocessing and transmission required for machine vision.

Huck, F. O.↗

Viscous calculations of supersonic flows past cylinders at angles of attack

Two- and three-dimensional separated flows around cylindrical sections and a body-of-revolution at angles of attack from -10 deg to +20 deg are computed. The blunt-nose-cylinders chosen for the analyses have different configurations, and one of them has a boat-tail. The freestream Mach numbers are 1.5 and 1.6, the unit Reynolds number and the total temperature are 2 million/ft, and 585 R, respectively. Among the possible areas of application for this study are the aerodynamics of separating stores and missiles. The Reynolds-averaged Navier-Stokes equations are solved by an approximately-factored, implicit, upwind-biased, finite-volume algorithm. The convergence to steady state was accelerated using a multigrid strategy. The results helped understanding the structure of the flowfield with varying incidence and configuration, and the suitability of the computational algorithm used for this class of flows. A two-layer algebraic eddy viscosity model is used for the two-dimensional turbulent flows. Laminar three-dimensional calculations are benchmarked through comparisons with wind tunnel test results.

Baysal, O.↗

Fully-coupled analysis of jet mixing problems. Three-dimensional PNS model, SCIP3D

Numerical procedures formulated for the analysis of 3D jet mixing problems, as incorporated in the computer model, SCIP3D, are described. The overall methodology closely parallels that developed in the earlier 2D axisymmetric jet mixing model, SCIPVIS. SCIP3D integrates the 3D parabolized Navier-Stokes (PNS) jet mixing equations, cast in mapped cartesian or cylindrical coordinates, employing the explicit MacCormack Algorithm. A pressure split variant of this algorithm is employed in subsonic regions with a sublayer approximation utilized for treating the streamwise pressure component. SCIP3D contains both the ks and kW turbulence models, and employs a two component mixture approach to treat jet exhausts of arbitrary composition. Specialized grid procedures are used to adjust the grid growth in accordance with the growth of the jet, including a hybrid cartesian/cylindrical grid procedure for rectangular jets which moves the hybrid coordinate origin towards the flow origin as the jet transitions from a rectangular to circular shape. Numerous calculations are presented for rectangular mixing problems, as well as for a variety of basic unit problems exhibiting overall capabilities of SCIP3D.

Wolf, D. E.↗

Improved shape-signature and matching methods for model-based robotic vision

Researchers describe new techniques for curve matching and model-based object recognition, which are based on the notion of shape-signature. The signature which researchers use is an approximation of pointwise curvature. Described here is curve matching algorithm which generalizes a previous algorithm which was developed using this signature, allowing improvement and generalization of a previous model-based object recognition scheme. The results and the experiments described relate to 2-D images. However, natural extensions to the 3-D case exist and are being developed.

Schwartz, J. T.↗

Intergration of system identification and robust controller designs for flexible structures in space

An approach is developed using experimental data to identify a reduced-order model and its model error for a robust controller design. There are three steps involved in the approach. First, an approximately balanced model is identified using the Eigensystem Realization Algorithm, which is an identification algorithm. Second, the model error is calculated and described in frequency domain in terms of the H(infinity) norm. Third, a pole placement technique in combination with a H(infinity) control method is applied to design a controller for the considered system. A set experimental data from an existing setup, namely the Mini-Mast system, is used to illustrate and verify the approach.

Juang, Jer-Nan↗

State-space design of low-order stabilizers

An algorithm is presented for stabilizing a linear multivariable system with a controller of fixed dynamic order. This is an output feedback stabilization problem. The algorithm attempts to solve this by a sequence of approximate pole assignment problems. The approximation is driven by the optimization of an objective function consisting of a weighted sum of the condition number of the closed-loop eigenvectors and the norm of the difference between the computed and actual equivalent state-feedback controls.

Keel, L. H.↗

Integration of system identification and robust controller designs for flexible structures in space

A novel approach is developed using experimental data from the structural testing of a physical system to identify a reduced-order model and its error for a robust controller design. There are three steps involved in the approach. First, an approximately balanced model is identified using the eigensystem realization algorithm, which is an identification algorithm. Second, the model error is calculated and described in frequency domain in terms of the H(infinity) norm. Third, a pole-placement technique in combination with an H(infinity) control method is applied to design a controller for the system. A set of experimental data from an existing setup, namely the Mini-Mast system, is used to illustrate and verify the approach development in this paper.

Juang, Jer-Nan↗

Resolution of the 1D regularized Burgers equation using a spatial wavelet approximation

The Burgers equation with a small viscosity term, initial and periodic boundary conditions is resolved using a spatial approximation constructed from an orthonormal basis of wavelets. The algorithm is directly derived from the notions of multiresolution analysis and tree algorithms. Before the numerical algorithm is described these notions are first recalled. The method uses extensively the localization properties of the wavelets in the physical and Fourier spaces. Moreover, the authors take advantage of the fact that the involved linear operators have constant coefficients. Finally, the algorithm can be considered as a time marching version of the tree algorithm. The most important point is that an adaptive version of the algorithm exists: it allows one to reduce in a significant way the number of degrees of freedom required for a good computation of the solution. Numerical results and description of the different elements of the algorithm are provided in combination with different mathematical comments on the method and some comparison with more classical numerical algorithms.

Liandrat, J.↗

Transonic adaptive flutter suppression using approximate unsteady time domain aerodynamics

A digital adaptive controller is applied to the active flutter suppression problem of a wing under time varying flight conditions in subsonic and transonic flow. Linear quadratic controller gain at each time step is obtained using an iterative Riccati solver. The digital adaptive optimal controller is robust with respect to the unknown external loads. Flutter and divergence instabilities are simultaneously suppressed using a trailing-edge control surface and displacement sensing. A new transonic unsteady aerodynamic approximation methodology is developed which enables one to carry out the rapid calculation required for transonic aeroservoelastic applications. This approximation is based on a combination of unsteady subsonic aerodynamics combined with a transonic correction procedure. Aeroservoelastic transient time response is obtained using Roger's approximation, state transition matrices and an iterative time marching algorithm. The aeroservoelastic system in the time domain is modeled using a deterministic ARMA model together with a parameter estimator. Transonic flutter boundaries of a wing structure are computed, in the time domain, using an estimated aeroelastic system matrix and are in good agreement with experimental data for the low transonic Mach number range.

Pak, Chan-Gi↗

Navier-Stokes simulation of flow through a highly contoured subsonic diffuser

The flow through a highly offset subsonic diffuser with cross-sectional profiles that varied from rectangular at the duct entrance to circular at the engine face was numerically simulated. A multizonal approach combined with a two-grid topology was used to represent both the internal and external flowfields, and an implicit, approximately-factored, partially flux-split finite-difference algorithm was used to solve the three-dimensional thin-layer Navier-Stokes equations. The computed static pressures along the inlet wall and total pressures on the engine face were compared with experimental data. In addition, the overall flowfield within the duct was examined in detail. Good agreement is shown between experiment and computations, with the limiting factor being the lack of a reliable turbulence model for internal flow problems.

Chyu, W. J.↗

A self-learning rule base for command following in dynamical systems

In this paper, a self-learning Rule Base for command following in dynamical systems is presented. The learning is accomplished though reinforcement learning using an associative memory called SAM. The main advantage of SAM is that it is a function approximator with explicit storage of training samples. A learning algorithm patterned after the dynamic programming is proposed. Two artificially created, unstable dynamical systems are used for testing, and the Rule Base was used to generate a feedback control to improve the command following ability of the otherwise uncontrolled systems. The numerical results are very encouraging. The controlled systems exhibit a more stable behavior and a better capability to follow reference commands. The rules resulting from the reinforcement learning are explicitly stored and they can be modified or augmented by human experts. Due to overlapping storage scheme of SAM, the stored rules are similar to fuzzy rules.

Tsai, Wei K.↗

Semigroup approximation and robust stabilization of distributed parameter systems

Theoretical results that enable rigorous statements of convergence and exponential stability of Galerkin approximations of LQR controls for infinite dimensional, or distributed parameter, systems have proliferated over the past ten years. In addition, extensive progress has been made over the same time period in the derivation of robust control design strategies for finite dimensional systems. However, the study of the convergence of robust finite dimensional controllers to robust controllers for infinite dimensional systems remains an active area of research. We consider a class of soft-constrained differential games evolving in a Hilbert space. Under certain conditions, a saddle point control can be given in feedback form in terms of a solution to a Riccati equation. By considering a related LQR problem, we can show a convergence result for finite dimensional approximations of this differential game. This yields a computational algorithm for the feedback gain that can be derived from similar strategies employed in infinite dimensional LQR control design problems. The approach described in this paper also inherits the additional properties of stability robustness common to game theoretic methods in finite dimensional analysis. These theoretical convergence and stability results are verified in several numerical experiments.

Kurdila, A. J.↗

Dissipative rendering and neural network control system design

Model-based control system designs are limited by the accuracy of the models of the plant, plant uncertainty, and exogenous signals. Although better models can be obtained with system identification, the models and control designs still have limitations. One approach to reduce the dependency on particular models is to design a set of compensators that will guarantee robust stability to a set of plants. Optimization over the compensator parameters can then be used to get the desired performance. Conservativeness of this approach can be reduced by integrating fundamental properties of the plant models. This is the approach of dissipative control design. Dissipative control designs are based on several variations of the Passivity Theorem, which have been proven for nonlinear/linear and continuous-time/discrete-time systems. These theorems depend not on a specific model of a plant, but on its general dissipative properties. Dissipative control design has found wide applicability in flexible space structures and robotic systems that can be configured to be dissipative. Currently, there is ongoing research to improve the performance of dissipative control designs. For aircraft systems that are not dissipative active control may be used to make them dissipative and then a dissipative control design technique can be used. It is also possible that rendering a system dissipative and dissipative control design may be combined into one step. Furthermore, the transformation of a non-dissipative system to dissipative can be done robustly. One sequential design procedure for finite dimensional linear time-invariant systems has been developed. For nonlinear plants that cannot be controlled adequately with a single linear controller, model-based techniques have additional problems. Nonlinear system identification is still a research topic. Lacking analytical models for model-based design, artificial neural network algorithms have recently received considerable attention. Using their universal approximation property, neural networks have been introduced into nonlinear control designs in several ways. Unfortunately, little work has appeared that analyzes neural network control systems and establishes margins for stability and performance. One approach for this analysis is to set up neural network control systems in the framework presented above. For example, one neural network could be used to render a system to be dissipative, a second strictly dissipative neural network controller could be used to guarantee robust stability.

Gonzalez, Oscar R.↗

On the Multilevel Solution Algorithm for Markov Chains

We discuss the recently introduced multilevel algorithm for the steady-state solution of Markov chains. The method is based on an aggregation principle which is well established in the literature and features a multiplicative coarse-level correction. Recursive application of the aggregation principle, which uses an operator-dependent coarsening, yields a multi-level method which has been shown experimentally to give results significantly faster than the typical methods currently in use. When cast as a multigrid-like method, the algorithm is seen to be a Galerkin-Full Approximation Scheme with a solution-dependent prolongation operator. Special properties of this prolongation lead to the cancellation of the computationally intensive terms of the coarse-level equations.

Horton, Graham↗

Comparison of Several Dissipation Algorithms for Central Difference Schemes

Several algorithms for introducing artificial dissipation into a central difference approximation to the Euler and Navier Stokes equations are considered. The focus of the paper is on the convective upwind and split pressure (CUSP) scheme, which is designed to support single interior point discrete shock waves. This scheme is analyzed and compared in detail with scalar and matrix dissipation (MATD) schemes. Resolution capability is determined by solving subsonic, transonic, and hypersonic flow problems. A finite-volume discretization and a multistage time-stepping scheme with multigrid are used to compute solutions to the flow equations. Numerical results are also compared with either theoretical solutions or experimental data. For transonic airfoil flows the best accuracy on coarse meshes for aerodynamic coefficients is obtained with a simple MATD scheme.

Swanson, R. C.↗