Asymptotic Recovery for Discrete-Time Systems

An asymptotic recovery design procedure is proposed for square, discrete-time, linear, time-invariant multivariable systems, which allows a state-feedback design to be approximately recovered by a dynamic output feedback scheme. Both the case of negligible processing time (compared to the sampling interval) and of significant processing time are discussed. In the former case, it is possible to obtain perfect. © 1985 IEEE.

Discrete-time modelling of woodwind instrument bores using wave variables

A method for simulation of acoustical bores, useful in the context of sound synthesis by physical modeling of woodwind instruments, is presented. As with previously developed methods, such as digital waveguide modeling (DWM) [Smith, Comput. Music J. 16, pp 74-91 (1992)] and the multi convolution algorithm (MCA) [Martinez et al., J. Acoust. Soc. Am. 84, pp 1620-1627 (1988)], the approach is based on a one-dimensional model of wave propagation in the bore. Both the DWM method and the MCA explicitly compute the transmission and reflection of wave variables that represent actual traveling pressure waves. The method presented in this report, the wave digital modeling (WDM) method, avoids the typical limitations associated with these methods by using a more general definition of the wave variables. An efficient and spatially modular discrete-time model is constructed from the digital representations of elemental bore units such as cylindrical sections, conical sections, and toneholes. Frequency-dependent phenomena, such as boundary losses, are approximated with digital filters. The stability of a simulation of a complete acoustic bore is investigated empirically. Results of the simulation of a full clarinet show that a very good concordance with classic transmission-line theory is obtained.

A discrete time-dependent method for metastable atoms and molecules in intense fields

The full-dimensional time-dependent Schrodinger equation for the electronic dynamics of single-electron systems in intense external fields is solved directly using a discrete method. Our approach combines the finite-difference and Lagrange mesh methods. The method is applied to calculate the quasienergies and ionization probabilities of atomic and molecular systems in intense static and dynamic electric fields. The gauge invariance and accuracy of the method is established. Applications to multiphoton ionization of positronium, the hydrogen atom and the hydrogen molecular ion are presented. At very high laser intensity, above the saturation threshold, we extend the method using a scaling technique to estimate the quasienergies of metastable states of the hydrogen molecular ion. The results are in good agreement with recent experiments. (C) 2004 American Institute of Physics.

Discrete-Time Conserved Quantities for Damped Oscillators

Numerical sound synthesis is often carried out using the finite difference time domain method. In order to analyse the stability of the derived models, energy methods can be used for both linear and nonlinear settings. For Hamiltonian systems the existence of a conserved numerical energy-like quantity can be used to guarantee the stability of the simulations. In this paper it is shown how to derive similar discrete conservation laws in cases where energy is dissipated due to friction or in the presence of an energy source due to an external force. A damped harmonic oscillator (for which an analytic solution is available) is used to present the proposed methodology. After showing how to arrive at a conserved quantity, the simulation of a nonlinear single reed shows an example of an application in the context of musical acoustics.

Optimal approximation of fractional derivatives through discrete-time fractions using genetic algorithms

This study addresses the optimization of rational fraction approximations for the discrete-time calculation of fractional derivatives. The article starts by analyzing the standard techniques based on Taylor series and Padé expansions. In a second phase the paper re-evaluates the problem in an optimization perspective by tacking advantage of the flexibility of the genetic algorithms.