ANALYSIS OF REAL-TIME DATA FROM INSTRUMENTED STRUCTURES

Similar documents
Introduction to Numerical Analysis. In this lesson you will be taken through a pair of techniques that will be used to solve the equations of.

TIME DELAY BASEDUNKNOWN INPUT OBSERVER DESIGN FOR NETWORK CONTROL SYSTEM

1. Calibration factor

On the approximation of particular solution of nonhomogeneous linear differential equation with Legendre series

Application of Homotopy Analysis Method for Solving various types of Problems of Partial Differential Equations

Thus the force is proportional but opposite to the displacement away from equilibrium.

Fourier Series & The Fourier Transform. Joseph Fourier, our hero. Lord Kelvin on Fourier s theorem. What do we want from the Fourier Transform?

Vehicle Arrival Models : Headway

Connectionist Classifier System Based on Accuracy in Autonomous Agent Control

Multivariate Auto-Regressive Model for Groundwater Flow Around Dam Site

Chapter 15. Time Series: Descriptive Analyses, Models, and Forecasting

Kriging Models Predicting Atrazine Concentrations in Surface Water Draining Agricultural Watersheds

Lecture 23 Damped Motion

Diebold, Chapter 7. Francis X. Diebold, Elements of Forecasting, 4th Edition (Mason, Ohio: Cengage Learning, 2006). Chapter 7. Characterizing Cycles

Sub Module 2.6. Measurement of transient temperature

1 Widrow-Hoff Algorithm

Chapter 9 Sinusoidal Steady State Analysis

OBJECTIVES OF TIME SERIES ANALYSIS

Phasor Estimation Algorithm Based on the Least Square Technique during CT Saturation

CHAPTER 2 Signals And Spectra

b denotes trend at time point t and it is sum of two

Nature Neuroscience: doi: /nn Supplementary Figure 1. Spike-count autocorrelations in time.

TP A.14 The effects of cut angle, speed, and spin on object ball throw

STATE-SPACE MODELLING. A mass balance across the tank gives:

Stable block Toeplitz matrix for the processing of multichannel seismic data

Modal identification of structures from roving input data by means of maximum likelihood estimation of the state space model

Decision Tree Learning. Decision Tree Learning. Decision Trees. Decision Trees: Operation. Blue slides: Mitchell. Orange slides: Alpaydin Humidity

CHAPTER 10 VALIDATION OF TEST WITH ARTIFICAL NEURAL NETWORK

( ) ( ) if t = t. It must satisfy the identity. So, bulkiness of the unit impulse (hyper)function is equal to 1. The defining characteristic is

Time series Decomposition method

Navneet Saini, Mayank Goyal, Vishal Bansal (2013); Term Project AML310; Indian Institute of Technology Delhi

Mapping in Dynamic Environments

On Measuring Pro-Poor Growth. 1. On Various Ways of Measuring Pro-Poor Growth: A Short Review of the Literature

SIGNALS AND SYSTEMS LABORATORY 8: State Variable Feedback Control Systems

Georey E. Hinton. University oftoronto. Technical Report CRG-TR February 22, Abstract

RC, RL and RLC circuits

Some Basic Information about M-S-D Systems

Practice Problems - Week #4 Higher-Order DEs, Applications Solutions

KINEMATICS IN ONE DIMENSION

3.1.3 INTRODUCTION TO DYNAMIC OPTIMIZATION: DISCRETE TIME PROBLEMS. A. The Hamiltonian and First-Order Conditions in a Finite Time Horizon

Mechanical Fatigue and Load-Induced Aging of Loudspeaker Suspension. Wolfgang Klippel,

M x t = K x F t x t = A x M 1 F t. M x t = K x cos t G 0. x t = A x cos t F 0

23.2. Representing Periodic Functions by Fourier Series. Introduction. Prerequisites. Learning Outcomes

Chapter 2. First Order Scalar Equations

LINEAR TIME SERIES ANALYSIS

2.1 Harmonic excitation of undamped systems

Homework 2 Solutions

5. Stochastic processes (1)

- The whole joint distribution is independent of the date at which it is measured and depends only on the lag.

Licenciatura de ADE y Licenciatura conjunta Derecho y ADE. Hoja de ejercicios 2 PARTE A

10. State Space Methods

Underwater Target Tracking Based on Gaussian Particle Filter in Looking Forward Sonar Images

2.160 System Identification, Estimation, and Learning. Lecture Notes No. 8. March 6, 2006

Lab 10: RC, RL, and RLC Circuits

Notes on Kalman Filtering

Introduction D P. r = constant discount rate, g = Gordon Model (1962): constant dividend growth rate.

Application of Speed Transform to the diagnosis of a roller bearing in variable speed

References are appeared in the last slide. Last update: (1393/08/19)

Lecture 3: Exponential Smoothing

LAPLACE TRANSFORM AND TRANSFER FUNCTION

An Extension to the Tactical Planning Model for a Job Shop: Continuous-Time Control

Joint Spectral Distribution Modeling Using Restricted Boltzmann Machines for Voice Conversion

Introduction to Mechanical Vibrations and Structural Dynamics

Module 4: Time Response of discrete time systems Lecture Note 2

Financial Econometrics Jeffrey R. Russell Midterm Winter 2009 SOLUTIONS

INTRODUCTION TO MACHINE LEARNING 3RD EDITION

Lecture 20: Riccati Equations and Least Squares Feedback Control

8. Basic RL and RC Circuits

Wall. x(t) f(t) x(t = 0) = x 0, t=0. which describes the motion of the mass in absence of any external forcing.

Linear Response Theory: The connection between QFT and experiments

Viscous Damping Summary Sheet No Damping Case: Damped behaviour depends on the relative size of ω o and b/2m 3 Cases: 1.

23.5. Half-Range Series. Introduction. Prerequisites. Learning Outcomes

Lecture 28: Single Stage Frequency response. Context

L07. KALMAN FILTERING FOR NON-LINEAR SYSTEMS. NA568 Mobile Robotics: Methods & Algorithms

14 Autoregressive Moving Average Models

Stationary Time Series

STRUCTURAL CHANGE IN TIME SERIES OF THE EXCHANGE RATES BETWEEN YEN-DOLLAR AND YEN-EURO IN

1. VELOCITY AND ACCELERATION

Institute for Mathematical Methods in Economics. University of Technology Vienna. Singapore, May Manfred Deistler

A generalization of the Burg s algorithm to periodically correlated time series

Physics 235 Chapter 2. Chapter 2 Newtonian Mechanics Single Particle

V AK (t) I T (t) I TRM. V AK( full area) (t) t t 1 Axial turn-on. Switching losses for Phase Control and Bi- Directionally Controlled Thyristors

A Generalization of Student s t-distribution from the Viewpoint of Special Functions

12: AUTOREGRESSIVE AND MOVING AVERAGE PROCESSES IN DISCRETE TIME. Σ j =

Position, Velocity, and Acceleration

ON THE BEAT PHENOMENON IN COUPLED SYSTEMS

Chapter 2. Models, Censoring, and Likelihood for Failure-Time Data

I-Optimal designs for third degree kronecker model mixture experiments

Types of Exponential Smoothing Methods. Simple Exponential Smoothing. Simple Exponential Smoothing

Problem set 2 for the course on. Markov chains and mixing times

Chapter 15: Phenomena. Chapter 15 Chemical Kinetics. Reaction Rates. Reaction Rates R P. Reaction Rates. Rate Laws

Math Final Exam Solutions

Application of a Stochastic-Fuzzy Approach to Modeling Optimal Discrete Time Dynamical Systems by Using Large Scale Data Processing

Solutions to Odd Number Exercises in Chapter 6

Introduction to AC Power, RMS RMS. ECE 2210 AC Power p1. Use RMS in power calculations. AC Power P =? DC Power P =. V I = R =. I 2 R. V p.

Methodology. -ratios are biased and that the appropriate critical values have to be increased by an amount. that depends on the sample size.

The equation to any straight line can be expressed in the form:

Lecture 18 GMM:IV, Nonlinear Models

(1) (2) Differentiation of (1) and then substitution of (3) leads to. Therefore, we will simply consider the second-order linear system given by (4)

Lecture 2-1 Kinematics in One Dimension Displacement, Velocity and Acceleration Everything in the world is moving. Nothing stays still.

Transcription:

3 h World Conference on Earhquake Engineering Vancouver, B.C., Canada Augus -6, 004 Paper No. 93 ANAYSIS OF REA-IME DAA FROM INSRUMENED SRUCURES Erdal SAFAK SUMMARY Analyses of real-ie daa fro insruened srucures require ools and echniques ha are differen han hose used for riggered daa. Real-ie onioring involves analysis of vibraion daa ha are low in apliudes and high in noise. Moreover, real-ie analysis requires ehods ha can be applied in real ie and recursively. his paper presens soe of he basics in processing and analyzing real-ie vibraion daa. he opics discussed include uilizaion of running ie windows, racking ean and ean-square values, derending, filering, and syse idenificaion. he ehods presened are based on he concep of opial adapive filering and recursive leas-squares esiaion. INRODUCION In ajoriy of srucures insruened for vibraion onioring, he recorders are se o rigger only during large-apliude oions, such as hose generaed by oderae o large earhquakes. Recenly, a few srucures have been insruened o provide coninuous daa in real ie, recording no only large-apliude oions bu also sall-apliude oions generaed by abien loads. he ain objecive in coninuous onioring is o rack any changes in srucural characerisics in order o deec daage. his ype of onioring is coonly known as Srucural Healh Monioring. Fourier-based specral analysis ehods have been he priary ool o analyze daa fro insruened srucures. Mehods ha are used o analyze large-apliude vibraion daa are no always appropriae o analyze abien vibraion daa. In ers of daa analysis, large-apliude records (e.g., earhquake records) have uch beer signal-o-noise raios han abien records. However, hey are ypically ransien, exhibi ie varying (i.e., nonsaionary) eporal and frequency characerisics, and can have nonlinear properies. In coparison, abien records have he advanages of being infiniely long duraion, saionary, and in os cases linear. However, hey conain high level of noise. he long duraion and saionariy of abien daa allow us o uilize saisical signal processing ools, which can copensae for he adverse effecs of low signal-o-noise raios. his paper presens soe of he basics in real-ie daa analysis, including he uilizaion of running ie windows, racking ean and ean-square values, derending, filering, and syse idenificaion. he ephasis is on ehods ha can be applied recursively, which are ore appropriae for real-ie analysis. Research Srucural Engineer, U.S. Geological Survey, Pasadena, California, USA. E-ail: safak@usgs.gov

RACKING IME VARIAIONS IN SIGNA PROPERIES Coninuous onioring requires coninuous and auoaed daa processing and analysis. he ehods ha are used for analysis should be able o adap and accoun for any changes in signal characerisics. he siples and os sraighforward approach o analyze coninuous daa is he block-daa approach. In his ehod, he records are handled in blocks of specified lengh. Each block is processed and analyzed as soon as i is full, and while he daa for he nex block are being acquired. More efficien ways o analyze coninuous daa can be developed by uilizing running ie windows. Running windows are in essence weighing funcions ha ephasize recen daa, while gradually deephasizing pas daa. he windows ensure ha any propery calculaed fro daa conains easureens ha are relevan o he curren sae of he srucure. he wo widely used weighing funcions are exponenially decaying windows and sliding recangular windows. he exponenially decaying window is defined as λ i wi (, ) wih i 0,,,, and wi (, ) λ = = = () λ where λ is known as he forgeing facor wih 0.0 < λ <.0. he window applies exponenially decaying weighs o pas daa poins. he eory ie consan, N 0, of he window is defined as he nuber of sapling poins over which he characerisics of he srucure can be assued o reain consan. I can be approxiaed as: N 0 λ () his equaion provides a siple crierion for he selecion of λ.. ypically, λ=0.900 ~ 0.999. Sliding recangular windows consider only a liied nuber of pas daa poins wih equal weighs. I is defined as: wi (, ) = for i wih 0,,,, and wi (, ) = (3) where is he window lengh and he eory ie consan. RACKING OF MEAN VAUE he ean value in a vibraion record represens he saic coponen of he srucure s response. Norally, he ean value of vibraion records should be zero. In real-ie onioring, he ean value ay flucuae around zero due o various facors, such as iperfecions in sensors, environenal facors (e.g., wind, rain, ec.), naural changes in srucure (e.g., srucural odificaions, change in loads, aging, ec.), or peranen daage afer an exree even (e.g., inelasic deforaions during an earhquake). herefore, i is iporan ha he changes in ean value are racked accuraely. We can consider he calculaion of ean value of a signal as a proble of a weighed leassquares fi of a consan o he record by iniizing he following error funcion:

[ ] (4) ε() = wi (,) xi () () where x(i) is he signal, w(,i) is he weighing funcion, and () is he ean value. For he weighing funcions described above, he iniizaion gives he following expressions for he ean value a ie : λ i For exponenially decaying window: ( ) = λ x() i λ For sliding regangular window: ( ) = xi ( ) + (5) Above expressions can be pu ino a recursive for such ha he ean value a ie is calculaed fro he ean value a ie -. he recursive fors are (Safak, 004) For exponenially decaying window: ( ) = λ ( ) + ( λ) x( i) For sliding regangular window: ( ) = ( ) + y() y( ) [ ] (6) Copuaionally, he recursive fors are ore appropriae for real-ie daa. RACKING OF MEAN-SQUARE VAUE Mean-square (MS) value is anoher iporan paraeer ha needs o be racked in real-ie onioring. MS value provides inforaion on average vibraion apliudes and is one of he key paraeers o deec changes in srucural response and exciaion. Siilar o he ean value, he MS value, s(), a ie can be calculaed by iniizing he following equaion: ε ( ) = wi (, ) x ( i) s ( ) (7) which resuls in he following recursive expressions for s() (Safak, 004): For exponenially decaying window: s( ) = λ s ( ) + ( λ) x( i) For sliding regangular window: s( ) = s( ) + y ( ) y ( ) (8) DERENDING Derending, also known as baseline correcion, reoves a linear rend fro records. Again, for real-ie daa i should be applied by uilizing running ie windows, so ha he rend ha is being reoved is he curren one. he equaions for derending are developed by deerining he bes sraigh-line fi, i.e., y()=a x() + b, o daa and incorporaing he ie windows of Eqs. and 3. he coefficiens a and b of he sraigh line are deerined by iniizing he following error funcion wih respec o a and b:

ε() = wi (,) xi () a xi () b [ ] (9) he explici expressions for a and b can be found in Safak (004). Noe ha because of he er b in he equaion, derending also reoves he ean value fro he daa. FIERING Band-pass filering Filering is required o reduce noise and eliinae unwaned frequency coponens in records. he sandard approach o noise reducion has been o use band-pass filers. Band-pass filers reove he frequency coponens ha are believed o be doinaed by noise (ypically he very low and very high ends of he frequency band). Alhough he noise is sill presen in he reaining frequency band, i is assued ha he signal-o-noise raio is high enough so ha he noise can be ignored. Band-pass filering, as well as low- or high-pass filering, can be done by using recursive iedoain filers of he following for (e.g., reer, 976): n k l (0) k= l= 0 y() = a y ( k) + b x ( l) where y() is he filered signal and x() is he original signal. he filer paraeers a k and b l and he filer orders and n are deerined by he corner frequencies, and he rae of decay of filer apliudes near he corner frequencies. A unique se of paraeers can be calculaed for any specified filer. For exaple, for a second order band-pass Buerworh filer wih corner frequencies of 0. Hz and 0 Hz and a sapling inerval of 0.0 second, he filer paraeers, calculaed by using MAAB (MahWorks, 003), are: a= -.9566, a= 0.9570, b0=0.05, b= 0, b = -0.05 () Opial filering Mos of real-ie vibraion daa consis of abien vibraions, which are characerized by low apliudes and low signal-o-noise raios. Analyses of such noisy signals require he applicaions of sophisicaed filers so ha he aoun of inforaion exraced fro he daa is axiized. A general class of such filers is known as opial filers. he key difference beween band-pass filers and opial filers is ha opial filers reduce he noise over he enire frequency band. We will presen he general concep of opial filering based on he principle of Recursive eas Squares (RS) approxiaion. Siilar filers can be developed by using he eas Mean Square (MS) approxiaion, as well as by uilizing sae-space forulaions, leading o Kalan Filers (KF) and Exended Kalan Filers (EKF). Due o space liiaions, hese alernaive fors will no be discussed; hey can be found in a large nuber of references ha are available in he lieraure (e.g., Widrow and Searns, 985; Braer and Siffling, 989). he basic philosophy in opial filering is ha he recorded response is coposed of a signal (i.e., he acual response) plus noise. Since he signal represens he response of a dynaic syse o soe exciaion, i is reasonable o expec ha response values a discree ies will follow a paern (e.g., a daped sinusoid), and herefore will be correlaed wih each oher. For linear syses, his paern can be represened by wriing he response a ie as a linear cobinaion

of pas responses; ha is x () = ak x ( k) + n () () k= he firs er on he righ-hand side represens he correlaed porion of he record, i.e., he signal, and he second er he uncorrelaed porion of he signal, i.e., he noise. Hence, he proble becoes deerining he opial values of a k such ha he prediced value of x() is as close o is recorded value as possible. Assuing ha n() is a zero-ean rando process and all he pas values of x() are known, he bes esiae, E[x()], of x() can be wrien as Ex [ ( )] = ak x ( k) (3) k= he error in he esiae, ε(), is defined as he difference beween he recorded value and he esiaed value of x(); and he oal error, V, is he su of squared errors over he record lengh, N: N k ε (4) k= = ε() = x() + a x( k) and V = () where N is he nuber of sapling poins. By aking V / ak = 0 for k =,, we obain he following arix equaion for a k : xx K xx xx a r (0) r ( ) r () M = M O M M a rxx( ) rxx(0) r xx( ) (5) where rxx ( j) = xkxk ( ) ( j) (6) k= is he auocorrelaion funcion of x(). By defining he following vecors and he arix, we can wrie i in a ore copac for as: a rxx () rxx (0) K rxx ( ) θ = R f where θ =, f, R M = M = M O M a rxx( ) r xx( ) rxx(0) (7)

A key paraeer ha needs o be seleced o apply hese equaions is, he filer order. A filer wih oo sall does no accuraely represen he signal, whereas a filer wih oo large ay ry o represen noise as well as he signal. here several crieria available in he lieraure o selec (see, Sodersro, 987). A sipler and ore sraighforward selecion can be ade by ploing he variaion of V = ε () wih (Safak, 004). his su ypically shows a fas drop wih increasing, and hen level off. he value where he su sars o level off can be aken as he opial filer order. Eq. 4 is based on he iniizaion of forward squared predicion errors because we used he pas values of x() o predic is curren value. Siilar equaions can be developed by iniizing he backward predicion errors. We can also iniize he su of forward and backward predicion errors, which resuls in he so-called Burg s ehod (Burg, 968). he relaionships beween he forward and backward iniizaion forulaions lead o very fas recursive algorihs for he soluion of filer coefficiens, such as evinson-durbin algorih (evinson, 947; Durbin, 959) and laice filers (Griffihs, 977; Makhoul, 977). An iporan assupion ade in he derivaion of Eq. 4 is ha x() is a saionary signal. In oher words, he eporal and frequency characerisics of x() does no change significanly wih ie, and herefore he auocorrelaion funcion r xx (Eq. 5) is he funcion of he ie lag only beween he wo coponens. he assupion of saionariy is appropriae for vibraions under abien forces and wind loads, bu no for vibraions under ransien loads such as earhquakes or blas loads. Adapive filering Adapive filering is required when he eporal and frequency characerisics of he signal change wih ie, i.e., he assupion of saionariy is no longer valid. Equaions for adapive filering can be developed by siple incorporaing a weighing funcion (e.g., Eq. or 3) in he error funcion for he leas-squares esiaion. (Eq. 4). ha leads o he following error funcion: k (8) k= V() = w(,) i x() i + a x( i k) Noe ha V is now a funcion of ie. By denoing φ () = [ x( ), x( ),, x( )] (9) and using he exponenially decaying for for w(,i), he paraeer vecor θ = [ a, a,, a ] can be calculaed recursively by he following se of equaions (jung, 999):

θ() = θ( ) + () x() φ () θ( ) P ( ) φ ( ) () = λ + φ () P ( ) φ( P ( ) φ( ) φ ( P ) ( ) P () = P ( ) λ λ + φ () P ( ) φ( (0) As indicaed, he filer paraeers now are ie varying. SYSEM IDENIFICAION Syse idenificaion refers o he exracion of srucural characerisics fro recorded signals. he basic approach o syse idenificaion is very siilar o ha used for opial filering. We search for an opial filer ha convers he recorded exciaion signal ino he recorded response signals. he filer idenified represens he dynaic characerisics of he srucure. As will be shown laer, here is a one-o-one correspondence beween he filer paraeers and he odal frequencies and daping raios of he srucure. If we do no have access o he exciaion signal (e.g., ground acceleraions in he case of an earhquake-induced vibraions), we assue ha he exciaion is a zero-ean wind-band rando process. his case is known as oupu-only idenificaion. We presen he basics of syse idenificaion for boh oupu-only and inpuoupu cases below. Oupu-only syse idenificaion: he forulaion for oupu-only syse idenificaion is idenical o ha for opial filering. We search for a filer ha, when applied o daa, will give a residual ha is as close o a zero-ean whie-noise sequence as possible. Maheaically, his leads o he sae error funcion and he iniizaion proble defined by Eq. 4 (for saionary signals) or by Eq. 8 (for nonsaionary signals). he filer paraeers are calculaed fro he resuling equaions, Eq. 5 or Eq. 0. In order o calculae he dynaic properies of he srucure fro he filer coefficiens, we firs calculae he roos of he following equaion: + az + + a z = 0 () he roos of he equaion are called he poles, p k, of he ransfer funcion for he srucure. For srucures wih posiive daping, all he roos are in coplex conjugae pairs, resuling in / disinc odal frequencies, f k, and daping raios, ξ k. he f k, and ξ k are calculaed fro he following equaions (Safak, 99): ( p ) + ( p ) / ( p ) ln / od( ) ln / od( ) ξk =, fk = in Hz, k =,, / () arg( p ) ln / od( ) πξk k where od( ) and arg( ) denoe he odulus and arguen of he coplex poles, and is he sapling inerval in seconds. Inpu-oupu syse idenificaion: If he inpu (i.e., he exciaion) signal is also recorded, we deerine filer paraeers by aking

he exciaion signal as he inpu o he filer and aching he oupu-signal in he leas-squares sense. he filer equaion for he inpu-oupu case is: n k l (3) k= l= 0 x () = a x ( k) + b u ( l) + n () where u() denoes he inpu signal. he filer paraeers, a k and b l can be deerined recursively fro Eq. 0, by siply changing he definiions of he vecors θ() and φ() as follows: θ ( ) = [ a, a,, a, b0, b,, bn] φ( ) = [ x ( ), x ( ),, x ( ), u ( ), u ( ),, u ( n)] he naural frequencies and daping raios are calculaed fro a k coefficiens as discussed above; b l coefficiens are relaed o he odal paricipaion facors (for deails, see Safak, 988; 99). Since θ() is ie-varying, his algorih can rack any changes in he odal frequencies and daping raios. SUMMARY AND CONCUSIONS Analyses of real-ie daa fro insruened srucures require fas and efficien algorihs. Coninuous records differ fro riggered records in ha hey are ypically very low in apliudes and high in noise. Mehods used o analyze real-ie daa should be able o exrac he signal buried in noise, and iniize he effecs of noise over he enire frequency band. he ehods should also be in a fora ha can be applied recursively in real ie, and be able o adap o rack any ie variaions in signal properies. Opial adapive filers offer one of he bes ools o analyze real-ie daa. hese filers exrac he signal fro record by searching hidden correlaion paerns in he daa. Such filers are used no only for noise reducion over he enire frequency band, bu also for syse idenificaion, because he forulaion for boh leads o he iniizaion of sae error funcions. Opial adapive filers can be expressed in a large nuber of differen fors, and known under differen naes depending on he forulaion and error iniizaion algorihs used in he developen, such as RS filers, MS filers, and Kalan Filers. REFERENCES. Braer, K. and Siffling, G. Kalan-Bucy Filers, Arech House, Norwood, MA, 989.. Burg, J.P. A new analysis echnique for ie-series daa, NAO Advanced Sudy Insiue on Signal Processing, Enschede, he Neherlands, 968. 3. Durbin, J. Efficien esiaors of paraeers in oving average odels, Bioerica, 46:306-36, 959. 4. Griffihs,.J. A coninuously adapive filer ipleened as a laice srucure, Proc. 977 IEEE In. Conf. on Acousics, Speech and Signal Processing, 683-686, 977. 5. evinson, N. he Wiener rs error crierion filer design and predicion, J. Mah. (4)

Phys., 5:6-78, 947. 6. jung,. Syse Idenificaion: heory for he User, Prenice Hall PR, Upper Saddle River, NJ, 999. 7. Makhoul, J. Sable and efficien laice ehods for linear predicion, IEEE rans. Acousics, Speech and Signal Processing, ASSP-5:43-48, 977. 8. he MahWorks, Inc. MAAB he anguage of echnical Copuing, Version 6, Naick, MA, 003. 9. Safak, E. (988). Analysis of recordings in srucural engineering: Adapive filering, predicion, and conrol, Open-File Repor 88-647, U. S. Geological Survey, Menlo Park, California. 0. Safak, E. (99). Idenificaion of linear srucures using discree-ie filers, Journal of Srucural Engineering, ASCE, Vol.7, No.0, Ocober 99, pp.3046-3085.. Safak, E. (004). Analysis of real-ie vibraion daa (in preparaion).. Sodersro,. Model srucure deerinaion, in Encyclopedia of Syses and Conrol (M. Singh, ed.), Pergaon Press, Elsford, NY, 987. 3. reer, S.A. Inroducion o Discree-ie Signal Processing, John Wiley and Sons, New York, NY, 976. 4. Widrow, B. and Searns, S.D. Adapive Signal Processing, Prenice-Hall, Inc., Englewood Cliffs, NJ, 985.