Old Web
Fast computation of RBF coefficients for regularly sampled inputs
2003
Using Fourier transform of the radial basis function (RBF) network, a fast computation of RBF coefficients for regularly sampled inputs is proposed. The use of the fast Fourier transform allows computation of the coefficients in O(NlogN) computational time, where N is the number of data.
Keywords:
- Discrete Fourier transform
- Short-time Fourier transform
- Pseudo-spectral method
- Discrete Fourier transform (general)
- Discrete-time Fourier transform
- Harmonic wavelet transform
- Non-uniform discrete Fourier transform
- Cyclotomic fast Fourier transform
- Mathematical optimization
- Mathematics
- Fractional Fourier transform
- Mathematical analysis
- Algorithm
- Electronic engineering
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
3
References
13
Citations
NaN
KQI