Korenberg's "fast Orthogonal Search" Method
Michael Korenberg of Queens University in Kingston, Ontario, developed a method for choosing a sparse set of components from an over-complete set, such as sinusoidal components for spectral analysis, called fast orthogonal search (FOS). Mathematically, FOS uses a slightly modified Cholesky decomposition in a mean-square error reduction (MSER) process, implemented as a sparse matrix inversion. As with the other LSSA methods, FOS avoids the major shortcoming of discrete Fourier analysis, and can achieve highly accurate identifications of embedded periodicities and excels with unequally-spaced data; the fast orthogonal search method has also been applied to other problems such as nonlinear system identification.
Read more about this topic: Least-squares Spectral Analysis
Famous quotes containing the words fast, search and/or method:
“Unhappie Verse, the witnesse of my unhappie state,
Make thy selfe fluttring wings of thy fast flying
Thought,”
—Edmund Spenser (1552?–1599)
“The search for the truth is the most important work in the whole world, and the most dangerous.”
—James Clavell (b. 1924)
“I do not know a method of drawing up an indictment against a whole people.”
—Edmund Burke (1729–1797)