Search NASA⌕ Search

NASA NTRS · 20210001559

Linear Algorithms for Worst Case Identification in H infinity with Applications to Flexible Structures

Abstract

This paper is concerned with linear algorithms for identification in which have been studied in [9]. It is shown that the two different linear algorithms in [9] can be unified into a single one which can be further extended to nonuniformly spaced frequency response samples with exponential convergence for the noise free case. Improved upper bounds for the corresponding identification errors are derived. Applications to the identification of lightly damped systems such as flexible structures are also considered.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kim, G., Chu, C., Gu, G.. 1994-01-01. Linear Algorithms for Worst Case Identification in H infinity with Applications to Flexible Structures. https://ntrs.nasa.gov/citations/20210001559

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related reports

Linear optics and projective measurements for fun and profit

The technique of projective measurements in linear optics can provide an apparent, efficient nonlinear interaction between photons, which is technically problematic otherwise. We present an application of such a technique to prepare large photon-number path entanglement.

linear↗

Linear Wave Motion from Concentrated Harmonic Sources in Blasius Flow

The motion of individual linear instability waves in shear flows is well described by existing theoretical and numerical methods. However, naturally occuring sources produce coherent wave motions with broadband spanwise wavenumber and frequency spectra, and the different spectral components interact both linearly and nonlinearily. This paper describes a series of calculations for the parameters of three different experiments using locally parallel linear stability theory (LST), the Parabolized Stability Equations (PSE), and Direct Numerical Simulation (DNS). The calculations illustrate the strengths and weaknesses of the different methods, the extent to which the methods agree or disagree, and, finally the extent to which agreement with the measurements can be attained, given that the experiments also have their own difficulties.

linear↗