commit f6e603114e163444b09be9907a4519348ff3be26
parent 1373a9ed07a127e4a3f9bbe312bcf600ee8b8f9e
Author: Ivan Gankevich <igankevich@ya.ru>
Date: Tue, 30 May 2017 17:32:25 +0300
Spell-check.
Diffstat:
1 file changed, 4 insertions(+), 4 deletions(-)
diff --git a/arma.org b/arma.org
@@ -1323,10 +1323,10 @@ formula using nested FFTs. Since two-dimensional FFT of the same size is
repeatedly applied to every time slice, its coefficients (complex exponents) are
pre-computed for all slices, and computations are performed with only a few
transcendental functions. In case of MA model, performance is also increased by
-doing convolution with FFT transforms. So, high performance of ARMA model is due
-to scarce use of transcendental functions and heavy use of FFT, not to mention
-that high convergence rate and non-existence of periodicity allows to use far
-fewer coefficients compared to LH model.
+doing convolution with FFT. So, high performance of ARMA model is due to scarce
+use of transcendental functions and heavy use of FFT, not to mention that high
+convergence rate and non-existence of periodicity allows to use far fewer
+coefficients compared to LH model.
ARMA implementation uses several libraries of reusable mathematical functions
and numerical algorithms (listed in table\nbsp{}[[tab-arma-libs]]), and was
