The arithmetic Fourier transform and real neural networks: Summability by primes

DOI10.1006/jmaa.1995.1072zbMath0858.65146MaRDI QIDQ1892528

W. J. Walker

Publication date: 11 March 1997

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jmaa.1995.1072

zbMATH Keywords

Möbius function; double layer; summability method; arithmetic Fourier transform; Möbius inversion; parallel processing; signal processing; artificial neural network; Fourier cosine coefficients; summability by primes

Mathematics Subject Classification ID

68T05: Learning and adaptive systems in artificial intelligence

65T50: Numerical methods for discrete and fast Fourier transforms

65Y05: Parallel numerical computation

42A16: Fourier coefficients, Fourier series of functions with special properties, special Fourier series

11N99: Multiplicative number theory

Related Items

The arithmetic fourier transform and the visual pathway