Difference between revisions of "Harminv"
(Created page with "{{Entry |Name=Harminv |Short description=Extracts frequencies and decay rates from a time series |Full description=Harminv is a program (and accompanying library) to solve the pr...") |
|||
| Line 3: | Line 3: | ||
|Short description=Extracts frequencies and decay rates from a time series | |Short description=Extracts frequencies and decay rates from a time series | ||
|Full description=Harminv is a program (and accompanying library) to solve the problem of harmonic inversion. Given a discrete-time, finite-length signal that consists of a sum of finitely-many sinusoids (possibly exponentially decaying) in a given bandwidth, it determines the frequencies, decay constants, amplitudes, and phases of those sinusoids. Harminv can, in principle, provide much better accuracy than straightforwardly extracting FFT peaks because it assumes a specific form for the signal. (Fourier transforms, in contrast, attempt to represent *any* data as a sum of sinusoidal components.) It is also often more robust than directly least-squares fitting the data (which can have problematic convergence). Harminv employs the "filter diagonalization method" (FDM) of Mandelshtam and Taylor. | |Full description=Harminv is a program (and accompanying library) to solve the problem of harmonic inversion. Given a discrete-time, finite-length signal that consists of a sum of finitely-many sinusoids (possibly exponentially decaying) in a given bandwidth, it determines the frequencies, decay constants, amplitudes, and phases of those sinusoids. Harminv can, in principle, provide much better accuracy than straightforwardly extracting FFT peaks because it assumes a specific form for the signal. (Fourier transforms, in contrast, attempt to represent *any* data as a sum of sinusoidal components.) It is also often more robust than directly least-squares fitting the data (which can have problematic convergence). Harminv employs the "filter diagonalization method" (FDM) of Mandelshtam and Taylor. | ||
| + | |Homepage URL=http://ab-initio.mit.edu/harminv/ | ||
|User level=none | |User level=none | ||
| − | |||
| − | |||
| − | |||
| − | |||
|Computer languages=C | |Computer languages=C | ||
|Documentation note=User manpage available in HTML format from http://ab-initio.mit.edu/harminv/harminv-man.html | |Documentation note=User manpage available in HTML format from http://ab-initio.mit.edu/harminv/harminv-man.html | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
|Keywords=fft,fdm,spectrum,filter diagonalization,filter diagonalization method,harmonic inversion,frequencies,decay constants,amplitudes,sinusoids,FFT peak | |Keywords=fft,fdm,spectrum,filter diagonalization,filter diagonalization method,harmonic inversion,frequencies,decay constants,amplitudes,sinusoids,FFT peak | ||
| − | | | + | |Version identifier=1.4 |
| − | |Last review by= | + | |Version date=2015/03/31 |
| − | |Last review date= | + | |Version status=stable |
| + | |Version download=http://ab-initio.mit.edu/harminv/harminv-1.4.tar.gz | ||
| + | |Last review by=IanK | ||
| + | |Last review date=2016/10/14 | ||
|Submitted by=Database conversion | |Submitted by=Database conversion | ||
|Submitted date=2011-04-01 | |Submitted date=2011-04-01 | ||
| − | | | + | |Status= |
| − | | | + | |Is GNU=No |
| − | | | + | |License verified date=2004-05-18 |
| − | | | + | }} |
| + | {{Project license | ||
| + | |License=GPLv2orlater | ||
| + | |License verified by=Janet Casey | ||
|License verified date=2004-05-18 | |License verified date=2004-05-18 | ||
| − | |||
}} | }} | ||
{{Person | {{Person | ||
| + | |Real name=Steven G. Johnson | ||
|Role=Maintainer | |Role=Maintainer | ||
| − | |||
|Email=stevenj@alum.mit.edu | |Email=stevenj@alum.mit.edu | ||
|Resource URL= | |Resource URL= | ||
| Line 40: | Line 37: | ||
}} | }} | ||
{{Software category | {{Software category | ||
| − | |Interface=command-line,library | + | |Interface=command-line, library |
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
}} | }} | ||
{{Software prerequisite | {{Software prerequisite | ||
| Line 55: | Line 47: | ||
|Prerequisite description=BLAS | |Prerequisite description=BLAS | ||
}} | }} | ||
| + | {{Featured}} | ||
Revision as of 13:50, 14 October 2016
Harminv
http://ab-initio.mit.edu/harminv/
Extracts frequencies and decay rates from a time series
Harminv is a program (and accompanying library) to solve the problem of harmonic inversion. Given a discrete-time, finite-length signal that consists of a sum of finitely-many sinusoids (possibly exponentially decaying) in a given bandwidth, it determines the frequencies, decay constants, amplitudes, and phases of those sinusoids. Harminv can, in principle, provide much better accuracy than straightforwardly extracting FFT peaks because it assumes a specific form for the signal. (Fourier transforms, in contrast, attempt to represent *any* data as a sum of sinusoidal components.) It is also often more robust than directly least-squares fitting the data (which can have problematic convergence). Harminv employs the "filter diagonalization method" (FDM) of Mandelshtam and Taylor.
Licensing
License
Verified by
Verified on
Notes
Leaders and contributors
| Contact(s) | Role |
|---|---|
| Steven G. Johnson | Maintainer |
Resources and communication
| Audience | Resource type | URI |
|---|---|---|
| Bug Tracking,Developer,Support | mailto:stevenj@alum.mit.edu | |
| Debian (Ref) | https://tracker.debian.org/pkg/harminv |
Software prerequisites
| Kind | Description |
|---|---|
| Required to use | BLAS |
| Required to use | LAPACK |
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the page “GNU Free Documentation License”.
The copyright and license notices on this page only apply to the text on this page. Any software or copyright-licenses or other similar notices described in this text has its own copyright notice and license, which can usually be found in the distribution or license text itself.