This paper is concerned with two aspects of the numerical calculation of integral transforms. The first is finding a necessary and sufficient condition that enables converting an integral transform into a correlation (convolution) form. The condition and the transformation that implements it are gen
โฆ LIBER โฆ
A fast computational method for minimum square error transform
โ Scribed by Seongwhan Lee; Jin H. Kim
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 200 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0167-8655
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Methods for Fast Computation of Integral
โ
Shay Gueron
๐
Article
๐
1994
๐
Elsevier Science
๐
English
โ 394 KB
A fast method to compute orthogonal load
โ
Constantinos Goutis
๐
Article
๐
1997
๐
John Wiley and Sons
๐
English
โ 176 KB
๐ 2 views
There are two commonly used partial least squares (PLS) regression algorithms. 1 -3 The first, the orthogonal scores algorithm, is the older one, 4 whereas the second, the orthogonal loadings algorithm, is more recent. 5 Their difference lies in the decomposition of the data matrix X = โ r i =1 t i
A new minimum zone method for evaluating
โ
S.T. Huang; K.C. Fan; John H. Wu
๐
Article
๐
1993
๐
Elsevier Science
๐
English
โ 651 KB
A new minimum zone method for evaluating
โ
S.T. Huang; K.C. Fan; John H. Wu
๐
Article
๐
1993
๐
Elsevier Science
๐
English
โ 623 KB
An iterational method for finding the mi
โ
M.K. Gavurin; Yu.B. Farforovskaya
๐
Article
๐
1966
๐
Elsevier Science
โ 236 KB
A fast fourier transform method for calc
โ
Bo Hellsing; Abraham Nitzan; Horia Metiu
๐
Article
๐
1986
๐
Elsevier Science
๐
English
โ 414 KB