Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “time discretization”

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 91 records · Page 5

Computational methods for optimal linear-quadratic compensators for infinite dimensional discrete-time systems

An abstract approximation theory and computational methods are developed for the determination of optimal linear-quadratic feedback control, observers and compensators for infinite dimensional discrete-time systems. Particular attention is paid to systems whose open-loop dynamics are described by semigroups of operators on Hilbert spaces. The approach taken is based on the finite dimensional approximation of the infinite dimensional operator Riccati equations which characterize the optimal feedback control and observer gains. Theoretical convergence results are presented and discussed. Numerical results for an example involving a heat equation with boundary control are presented and used to demonstrate the feasibility of the method.

Gibson, J. S.↗

Loop transfer recovery for general nonminimum phase discrete time systems. II - Design

The authors consider the design of controllers for the recovery of target loop transfer function or sensitivity and complementary sensitivity functions for general nonminimum phase discrete time systems. The necessary design constraints and the available design freedom are reviewed. In view of the available freedom, possible specifications on the eigenstructure of the observer dynamic matrix are formulated. Three different types of controllers which are respectively based on prediction, current, and reduced-order estimators are considered. For each one of those controllers, three different design techniques are developed. The first one is an eigenstructure assignment scheme, while the other two are optimization-based designs. The eigenstructure assignment method yields a controller design which achieves any chosen recovery error matrix among a set of admissible recovery error matrices. On the other hand, one of the optimization-based design methods leads to a controller that achieves a recovery error matrix having the infimum H-infinity norm, while the other does the same except it achieves a recovery error matrix having the infimum H2 norm.

Chen, Ben M.↗

Inherent robustness of discrete-time adaptive control systems

Global stability robustness with respect to unmodeled dynamics, arbitrary bounded internal noise, as well as external disturbance is shown to exist for a class of discrete-time adaptive control systems when the regressor vectors of these systems are persistently exciting. Although fast adaptation is definitely undesirable, so far as attaining the greatest amount of global stability robustness is concerned, slow adaptation is shown to be not necessarily beneficial. The entire analysis in this paper holds for systems with slowly varying return difference matrices; the plants in these systems need not be slowly varying.

Ma, C. C. H.↗

Explicit asymmetric bounds for robust stability of continuous and discrete-time systems

The problem of robust stability in linear systems with parametric uncertainties is considered. Explicit stability bounds on uncertain parameters are derived and expressed in terms of linear inequalities for continuous systems, and inequalities with quadratic terms for discrete-times systems. Cases where system parameters are nonlinear functions of an uncertainty are also examined.

Gao, Zhiqiang↗

Recursive multibody dynamics and discrete-time optimal control

A recursive algorithm is developed for the solution of the simulation dynamics problem for a chain of rigid bodies. Arbitrary joint constraints are permitted, that is, joints may allow translational and/or rotational degrees of freedom. The recursive procedure is shown to be identical to that encountered in a discrete-time optimal control problem. For each relevant quantity in the multibody dynamics problem, there exists an analog in the context of optimal control. The performance index that is minimized in the control problem is identified as Gibbs' function for the chain of bodies.

Deleuterio, G. M. T.↗

A VHDL Core for Intrinsic Evolution of Discrete Time Filters with Signal Feedback

Evolution of a novel low-pass filter design has been presented along with an assessment of its capabilities. (1) Performed well with the two added sines used as input during the evolution. (2) Also performs well when the input includes more sine at frequencies between the two used during evolution. (3) Fails to perform when input is a sine sweep with wider bandwidth. (4) This illustrates the importance of designing the evolutionary process to be representative of the environment that will be seen by the evolved design during deployment. The use of non-standard operators and fewer resources should allow the EMVCore to implement more compact representations of digital filters and to provide fault tolerance by implementing a new solution in the remaining tiles after some are damaged. The EMVCore can be used to implement standard discrete time filters in addition to evolved components.

Gwaltney, David A.↗

Synthesis of finite settling time discrete systems

A new finite settling time (FST) control law is presented. The performance and the flexibility of this dual-rate, sampled-data law as applied to the class of error driven, feedback control systems are demonstrated. A hybrid analog/digital simulation is performed in order to illustrate the practical aspects of this type of finite settling time design.

Gatlin, J. A.↗

A space-time discretization procedure for wave propagation problems

Higher order compact algorithms are developed for the numerical simulation of wave propagation by using the concept of a discrete dispersion relation. The dispersion relation is the imprint of any linear operator in space-time. The discrete dispersion relation is derived from the continuous dispersion relation by examining the process by which locally plane waves propagate through a chosen grid. The exponential structure of the discrete dispersion relation suggests an efficient splitting of convective and diffusive terms for dissipative waves. Fourth- and eighth-order convection schemes are examined that involve only three or five spatial grid points. These algorithms are subject to the same restrictions that govern the use of dispersion relations in the constructions of asymptotic expansions to nonlinear evolution equations. A new eighth-order scheme is developed that is exact for Courant numbers of 1, 2, 3, and 4. Examples are given of a pulse and step wave with a small amount of physical diffusion.

Davis, Sanford↗

On time discretizations for spectral methods

New methods are introduced for the time integration of the Fourier and Chebyshev methods of solution for dynamic differential equations. These methods are unconditionally stable, even though no matrix inversions are required. Time steps are chosen by accuracy requirements alone. For the Fourier method both leapfrog and Runge-Kutta methods are considered. For the Chebyshev method only Runge-Kutta schemes are tested. Numerical calculations are presented to verify the analytic results. Applications to the shallow water equations are presented.

Gottlieb, D.↗

Finite-dimensional discrete-time control of linear distributed parameter systems

Systems described by partial differential equations have an infinite-dimensional state space. Feedback control of such distributed parameter systems must be accomplished by finite-dimensional controllers to be implemented by on-line digital computers. A further practical constraint is that the controller must operate in discrete (rather than continuous) time. This paper investigates the stability of such distributed parameter feedback controllers in closed-loop with the actual system.

Balas, M. J.↗

The theoretical accuracy of Runge-Kutta time discretizations for the initial boundary value problem: A careful study of the boundary error

The conventional method of imposing time dependent boundary conditions for Runge-Kutta (RK) time advancement reduces the formal accuracy of the space-time method to first order locally, and second order globally, independently of the spatial operator. This counter intuitive result is analyzed in this paper. Two methods of eliminating this problem are proposed for the linear constant coefficient case: (1) impose the exact boundary condition only at the end of the complete RK cycle, (2) impose consistent intermediate boundary conditions derived from the physical boundary condition and its derivatives. The first method, while retaining the RK accuracy in all cases, results in a scheme with much reduced CFL condition, rendering the RK scheme less attractive. The second method retains the same allowable time step as the periodic problem. However it is a general remedy only for the linear case. For non-linear hyperbolic equations the second method is effective only for for RK schemes of third order accuracy or less. Numerical studies are presented to verify the efficacy of each approach.

Carpenter, Mark H.↗

Dynamical approach study of spurious steady-state numerical solutions of nonlinear differential equations. I - The dynamics of time discretization and its implications for algorithm development in computational fluid dynamics

Spurious stable as well as unstable steady state numerical solutions, spurious asymptotic numerical solutions of higher period, and even stable chaotic behavior can occur when finite difference methods are used to solve nonlinear differential equations (DE) numerically. The occurrence of spurious asymptotes is independent of whether the DE possesses a unique steady state or has additional periodic solutions and/or exhibits chaotic phenomena. The form of the nonlinear DEs and the type of numerical schemes are the determining factor. In addition, the occurrence of spurious steady states is not restricted to the time steps that are beyond the linearized stability limit of the scheme. In many instances, it can occur below the linearized stability limit. Therefore, it is essential for practitioners in computational sciences to be knowledgeable about the dynamical behavior of finite difference methods for nonlinear scalar DEs before the actual application of these methods to practical computations. It is also important to change the traditional way of thinking and practices when dealing with genuinely nonlinear problems. In the past, spurious asymptotes were observed in numerical computations but tended to be ignored because they all were assumed to lie beyond the linearized stability limits of the time step parameter delta t. As can be seen from the study, bifurcations to and from spurious asymptotic solutions and transitions to computational instability not only are highly scheme dependent and problem dependent, but also initial data and boundary condition dependent, and not limited to time steps that are beyond the linearized stability limit.

Yee, H. C.↗

Boundedness regions of discrete-time dynamic systems

Techniques for obtaining quantitative information about boundedness properties are developed and applied to the sampled-data control of satellite attitude with quantization. Relevant stability concepts are introduced as a series of definitions, and interrelationships between various definitions are discussed. The boundedness regions are estimated by means of quadratic Liapunov functions, and a sufficient condition for the existence of a boundedness region is given for a certain class of systems. A quadratic Liapunov function is applied to the Lur'e-Postinkov class of systems, where the linear part of the system is not asymptotically stable and the quantizer represents the nonlinear characteristic. A numerical calculation of the region of boundedness estimates is performed for satellite attitude control and is compared with simulation results. It is tentatively concluded that the Liapunov results may be good and that simulation results may be difficult to interpret and time-consuming to generate. The Lur'e-based technique yields estimates of regions of absolute boundedness, but at the cost of greater analytical complexity.

Siljak, D.↗