Fast and efficient estimation of resonant modes. A case study of mechanical drivelines

dc.contributor.authorRezaeizadeh, Amin
dc.contributor.authorMastellone, Silvia
dc.date.accessioned2024-08-29T07:47:45Z
dc.date.available2024-08-29T07:47:45Z
dc.date.issued2024-08-28
dc.description.abstractThis work presents the development of an online parameter estimation algorithm for the identification of resonating modes in a linear system of arbitrary order. The method employs a short-time Fourier transform of the input and output signals and uses a recursive least square (RLS) algorithm to detect resonant frequencies and damping factors of the resonant modes.
dc.identifier.urihttps://irf.fhnw.ch/handle/11654/47134
dc.identifier.urihttps://doi.org/10.26041/fhnw-10111
dc.language.isoen
dc.publisherInstitut für Elektrische Energietechnik, Hochschule für Technik FHNW
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/
dc.spatialWindisch
dc.subjectsignal processing
dc.subjectrecursive least square (RLS)
dc.subjectoptimal estimation
dc.subjectresonance
dc.subject.ddc620 - Ingenieurwissenschaften und Maschinenbau
dc.subject.ddc510 - Mathematik
dc.titleFast and efficient estimation of resonant modes. A case study of mechanical drivelines
dc.type05 - Forschungs- oder Arbeitsbericht
dspace.entity.typePublication
fhnw.InventedHereYes
fhnw.ReviewTypeNo peer review
fhnw.affiliation.hochschuleHochschule für Technikde_CH
fhnw.affiliation.institutHochschule für Technik Allgemeinde_CH
fhnw.publicationStateUnpublished
relation.isAuthorOfPublication660ce7b1-27cc-47c2-8d39-1f34f2ca168a
relation.isAuthorOfPublicationdfa00cae-b3d6-4d4a-8926-d15d6a761bf9
relation.isAuthorOfPublication.latestForDiscovery660ce7b1-27cc-47c2-8d39-1f34f2ca168a
Dateien
Originalbündel
Gerade angezeigt 1 - 1 von 1
Lade...
Vorschaubild
Name:
_Arxiv_Resonance.pdf
Größe:
1.1 MB
Format:
Adobe Portable Document Format
Beschreibung:
Lizenzbündel
Gerade angezeigt 1 - 1 von 1
Lade...
Vorschaubild
Name:
license.txt
Größe:
2.66 KB
Format:
Item-specific license agreed upon to submission
Beschreibung: