Home
last modified time | relevance | path

Searched refs:Fourier (Results 1 – 25 of 1682) sorted by relevance

12345678910>>...68

/dports/lang/slib/slib-3b6/
H A Ddft.txi2 @code{(require 'Fourier-transform)}
3 @ftindex dft, Fourier-transform
5 @code{fft} and @code{fft-1} compute the Fast-Fourier-Transforms
8 @code{sft} and @code{sft-1} compute the Discrete-Fourier-Transforms
18 the @dfn{Discrete Fourier Transform} of @var{array}.
19 @cindex Discrete Fourier Transform
29 the inverse Discrete Fourier Transform of @var{array}.
50 to @var{array}) of complex numbers comprising the inverse Discrete Fourier
54 @code{dft} and @code{dft-1} compute the discrete Fourier transforms
63 numbers comprising the Discrete Fourier Transform of @var{array}.
[all …]
/dports/math/nfft/nfft-3.5.2/matlab/nfsft/
H A DContents.m3 % f_hat_index - Return indices of Fourier coefficients
4 % ndsft_adjoint - Adjoint discrete spherical Fourier transform (direct alg.)
5 % ndsft_trafo - Discrete spherical Fourier transform (direct algorithm)
6 % nfsft_adjoint - Adjoint fast spherical Fourier transform
10 % nfsft_get_f_hat - Get Fourier coefficients in a matrix from plan
18 % nfsft_set_f_hat - Set Fourier coefficients in plan from a matrix
20 % nfsft_trafo - Fast spherical Fourier transform
29 % nfsft_get_f_hat_linear - Get Fourier coefficients in a linear vector from plan
30 % nfsft_set_f_hat_linear - Set Fourier coefficients in plan from a linear vector
/dports/deskutils/genius/genius-1.0.27/src/
H A Dtestfourier.gel2 if |f(0)| >= 0.01 then (error("Fourier test 1 fail");exit());
3 if |f(1)-1| >= 0.05 then (error("Fourier test 2 fail");exit());
4 if |f(-1)-1| >= 0.05 then (error("Fourier test 3 fail");exit());
5 if |f(2)| >= 0.01 then (error("Fourier test 4 fail");exit());
6 if |f(-2)| >= 0.01 then (error("Fourier test 5 fail");exit());
11 if |f(x)-ff(x)| >= 0.025 then (error("Fourier test 6 fail at x=" + x);exit());
17 if |f(x)-ff(x)| >= x/15 then (error("Fourier test 7 fail at x=" + x);exit());
20 if |-f(-x)-ff(x)| >= x/15 then (error("Fourier test 8 fail at x=" + x);exit());
26 if |f(x)-ff(x)| >= 0.01 then (error("Fourier test 9 fail at x=" + x);exit());
29 if |f(-x)-ff(x)| >= 0.01 then (error("Fourier test 10 fail at x=" + x);exit());
/dports/math/nfft/nfft-3.5.2/julia/nfct/
H A Dsimple_test_1d.jl24 #generate random Fourier coefficients
27 #set Fourier coefficients
37 #define Fourier matrix
40 #multiply Fourier matrix with vector of Fourier coefficients
62 #multiply Fourier matrix with vector of Fourier coefficients
H A Dsimple_test_2d.jl24 #generate random Fourier coefficients
27 #set Fourier coefficients
41 #define Fourier matrix
44 #multiply Fourier matrix with vector of Fourier coefficients
66 #multiply Fourier matrix with vector of Fourier coefficients
H A Dsimple_test_3d.jl24 #generate random Fourier coefficients
27 #set Fourier coefficients
41 #define Fourier matrix
44 #multiply Fourier matrix with vector of Fourier coefficients
66 #multiply Fourier matrix with vector of Fourier coefficients
/dports/math/nfft/nfft-3.5.2/julia/nfft/
H A Dsimple_test_1d.jl24 #generate random Fourier coefficients
27 #set Fourier coefficients
37 #define Fourier matrix
40 #multiply Fourier matrix with vector of Fourier coefficients
62 #multiply Fourier matrix with vector of Fourier coefficients
H A Dsimple_test_2d.jl24 #generate random Fourier coefficients
27 #set Fourier coefficients
41 #define Fourier matrix
44 #multiply Fourier matrix with vector of Fourier coefficients
66 #multiply Fourier matrix with vector of Fourier coefficients
H A Dsimple_test_3d.jl24 #generate random Fourier coefficients
27 #set Fourier coefficients
41 #define Fourier matrix
44 #multiply Fourier matrix with vector of Fourier coefficients
66 #multiply Fourier matrix with vector of Fourier coefficients
/dports/math/nfft/nfft-3.5.2/julia/nfst/
H A Dsimple_test_1d.jl24 #generate random Fourier coefficients
27 #set Fourier coefficients
37 #define Fourier matrix
40 #multiply Fourier matrix with vector of Fourier coefficients
62 #multiply Fourier matrix with vector of Fourier coefficients
H A Dsimple_test_2d.jl24 #generate random Fourier coefficients
27 #set Fourier coefficients
41 #define Fourier matrix
44 #multiply Fourier matrix with vector of Fourier coefficients
66 #multiply Fourier matrix with vector of Fourier coefficients
H A Dsimple_test_3d.jl24 #generate random Fourier coefficients
27 #set Fourier coefficients
41 #define Fourier matrix
44 #multiply Fourier matrix with vector of Fourier coefficients
66 #multiply Fourier matrix with vector of Fourier coefficients
/dports/math/nfft/nfft-3.5.2/matlab/nfft/
H A DContents.m8 % ndft_adjoint - Adjoint nonequispaced discrete Fourier transform (direct algorithm)
9 % ndft_trafo - Nonequispaced discrete Fourier transformation (direct algorithm)
10 % nfft_adjoint - Adjoint nonequispaced fast Fourier transform
13 % nfft_get_f_hat - Get Fourier coefficients from plan
21 % nfft_set_f_hat - Set Fourier coefficients in plan
23 % nfft_trafo - nonequispaced fast Fourier transformat
H A Dtest_nfft4d.m22 N1=24; % number of Fourier coefficients in first direction
23 N2=32; % number of Fourier coefficients in second direction
24 N3=30; % number of Fourier coefficients in third direction
25 N4=10; % number of Fourier coefficients in forth direction
39 fhat=rand(N1,N2,N3,N4); % Fourier coefficients
43 plan.fhat=fhatv; % set Fourier coefficients
45 nfft_trafo(plan); % compute nonequispaced Fourier transform
/dports/math/R-cran-forecast/forecast/man/
H A Dfourier.Rd6 \title{Fourier terms for modelling seasonality}
15 \item{K}{Maximum order(s) of Fourier terms}
23 \code{fourier} returns a matrix containing terms from a Fourier series, up
31 The period of the Fourier terms is determined from the time series
38 Typical use would omit \code{h} when generating Fourier terms for training a model
39 and include \code{h} when generating Fourier terms for forecasting.
54 # Using Fourier series for a "ts" object
60 # Using Fourier series for a "msts" object
/dports/science/elmerfem/elmerfem-release-9.0/fem/tests/FourierLoss/
H A Dcase.sif3 ! The idea of the solver is to make a Fourier decomposition on-the-fly
76 Equation = "Fourier"
82 ! Name of the variable that Fourier transform is operating on
88 ! Number of sin and cos terms in Fourier transform
89 Fourier Series Components = Integer 3
92 Fourier Series Output = Logical True
117 Fourier Start Cycles = Integer 1
120 ! Fourier Start Time = Real
121 ! Fourier Start Timestep = Integer
124 Fourier Integrate Cycles = Integer 1
/dports/math/reduce/Reduce-svn5758-src/doc/manual2/
H A Dcamal.tex15 The CAMAL package provides facilities for calculations in Fourier
18 particular.\index{Fourier Series}\index{CAMAL}\index{Celestial
21 \section{Operators for Fourier Series}
36 Fourier Series. The expression may contain {\em sine} and {\em
42 Fourier series expressions may be added, subtracted multiplies and
52 Differentiate or integrate a Fourier expression with respect to an angular
65 The operation of substituting an angle plus a Fourier expression for
77 The following program solves Kepler's Equation as a Fourier series to
/dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/source/fe/
H A Dfe_series_fourier.cc179 Fourier<dim, spacedim>::Fourier( in Fourier() function in FESeries::Fourier
204 Fourier<dim, spacedim>::Fourier( in Fourier() function in FESeries::Fourier
208 : Fourier<dim, spacedim>( in Fourier()
219 Fourier<dim, spacedim>::
220 operator==(const Fourier<dim, spacedim> &fourier) const in operator ==()
234 Fourier<dim, spacedim>::precalculate_all_transformation_matrices() in precalculate_all_transformation_matrices()
254 Fourier<dim, spacedim>::get_n_coefficients_per_direction( in get_n_coefficients_per_direction()
265 Fourier<dim, spacedim>::calculate( in calculate()
/dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/include/deal.II/numerics/
H A Dsmoothness_estimator.h44 class Fourier; variable
347 namespace Fourier
394 coefficient_decay(FESeries::Fourier<dim, spacedim> &fe_fourier,
444 FESeries::Fourier<dim, spacedim> &fe_fourier,
463 FESeries::Fourier<dim, spacedim>
/dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/source/numerics/
H A Dsmoothness_estimator.inst.in42 template void SmoothnessEstimator::Fourier::
44 FESeries::Fourier<deal_II_dimension, deal_II_space_dimension> &,
51 template void SmoothnessEstimator::Fourier::coefficient_decay_per_direction<
54 VEC>(FESeries::Fourier<deal_II_dimension, deal_II_space_dimension> &,
72 template FESeries::Fourier<deal_II_dimension, deal_II_space_dimension>
73 SmoothnessEstimator::Fourier::default_fe_series<deal_II_dimension,
/dports/math/openturns/openturns-1.18/python/src/
H A DFFTImplementation_doc.i.in2 "Base class for Fast Fourier Transform (FFT) and Inverse Fast Fourier Transform (IFFT).
16 "Perform Fast Fourier Transform (fft).
26 The data in Fourier domain.
30 The Fast Fourier Transform writes as following:
53 "Perform Inverse Fast Fourier Transform (fft).
67 The Inverse Fast Fourier Transform writes as following:
104 The 2D Fast Fourier Transform writes as following:
142 The 2D Fast Inverse Fourier Transform writes as following:
180 The 3D Fast Fourier Transform writes as following:
222 The 3D Inverse Fast Fourier Transform writes as following:
/dports/math/R/R-4.1.2/src/library/stats/man/
H A Dfft.Rd9 \title{Fast Discrete Fourier Transform (FFT)}
11 Computes the Discrete Fourier Transform (DFT) of an array with a fast
12 algorithm, the \dQuote{Fast Fourier Transform} (FFT).
27 \code{fft} is the unnormalized univariate discrete Fourier transform of the
37 the (unnormalized) inverse Fourier transform is returned, i.e.,
43 its discrete Fourier transform. This is useful for analyzing
60 Mixed Radix Fast Fourier Transforms,
66 An algorithm for the machine calculation of complex Fourier series,
78 ## Slow Discrete Fourier Transform (DFT) - e.g., for checking the formula
/dports/math/libRmath/R-4.1.1/src/library/stats/man/
H A Dfft.Rd9 \title{Fast Discrete Fourier Transform (FFT)}
11 Computes the Discrete Fourier Transform (DFT) of an array with a fast
12 algorithm, the \dQuote{Fast Fourier Transform} (FFT).
27 \code{fft} is the unnormalized univariate discrete Fourier transform of the
37 the (unnormalized) inverse Fourier transform is returned, i.e.,
43 its discrete Fourier transform. This is useful for analyzing
60 Mixed Radix Fast Fourier Transforms,
66 An algorithm for the machine calculation of complex Fourier series,
78 ## Slow Discrete Fourier Transform (DFT) - e.g., for checking the formula
/dports/math/sfft/sfft-0.1.0/doc/
H A Dintroduction.rst4 The *Sparse Fast Fourier Transform* is a DFT algorithm specifically designed
12 You should use the SFFT library when you want to compute the `Discrete Fourier
17 .. _Discrete Fourier Transform:
55 their website `Sparse Fast Fourier Transform Website`_.
65 If you are interested in the theory behind the Sparse Fast Fourier Transform,
67 and Eric Price, at their `Sparse Fast Fourier Transform Website`_.
72 .. _Sparse Fast Fourier Transform Website:
/dports/devel/boost-python-libs/boost_1_72_0/libs/math/doc/quadrature/
H A Dooura_fourier_integrals.qbk9 [section:fourier_integrals Fourier Integrals]
45 Ooura's method for Fourier integrals computes
54 These integrals arise when computing continuous Fourier transform of odd and even functions, respec…
129 * The advance of that paper is that one can compute ['both] the Fourier sine transform and Fourier …
130 But there are examples, like sinc integral, where the Fourier sine would converge, but the Fourier …
135 * Ooura, Takuya, and Masatake Mori, ['A robust double exponential formula for Fourier-type integral…
136 * Ooura, Takuya, ['A Double Exponential Formula for the Fourier Transforms.] Publ. RIMS, Kyoto Univ…
140 [endsect] [/section:fourier_integrals Fourier Integrals]

12345678910>>...68