| /external/tensorflow/tensorflow/contrib/integrate/python/ops/ |
| odes.py | 110 estimated error at `t1`, and a list of Runge-Kutta coefficients `k` used for
138 """Fit coefficients for 4th order polynomial interpolation.
149 List of coefficients `[a, b, c, d, e]` for interpolating with the polynomial
185 def _interp_evaluate(coefficients, t0, t1, t):
189 coefficients: list of Tensor coefficients as created by `interp_fit`.
195 Polynomial interpolation of the coefficients at time `t`.
202 dtype = coefficients[0].dtype
211 for _ in range(2, len(coefficients)):
214 return _dot_product(coefficients, reversed(xs)
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/fitting/ |
| HarmonicCoefficientsGuesser.java | 24 /** This class guesses harmonic coefficients from a sample.
26 * <p>The algorithm used to guess the coefficients is as follows:</p>
57 * <p>We can find the coefficients A and B that best fit the sample
63 * coefficients A and B that minimize a least square criterion
150 /** Estimate a first guess of the coefficients.
189 /** Estimate a first guess of the a and ω coefficients.
236 // compute the amplitude and pulsation coefficients
|
| /external/libjpeg-turbo/simd/ |
| jidctflt-3dn.asm | 46 ; Perform dequantization and inverse DCT on one block of coefficients.
240 movq mm1,mm6 ; transpose coefficients
243 movq mm3,mm0 ; transpose coefficients
263 movq mm0,mm7 ; transpose coefficients
266 movq mm3,mm5 ; transpose coefficients
415 movq mm4,mm6 ; transpose coefficients(phase 2)
419 movq mm7,mm6 ; transpose coefficients(phase 3)
|
| jidctint-sse2.asm | 90 ; Perform dequantization and inverse DCT on one block of coefficients.
395 movdqa xmm6,xmm5 ; transpose coefficients(phase 1)
398 movdqa xmm1,xmm7 ; transpose coefficients(phase 1)
462 movdqa xmm4,xmm3 ; transpose coefficients(phase 1)
465 movdqa xmm6,xmm0 ; transpose coefficients(phase 1)
469 movdqa xmm1,xmm7 ; transpose coefficients(phase 2)
472 movdqa xmm5,xmm2 ; transpose coefficients(phase 2)
482 movdqa xmm2,xmm0 ; transpose coefficients(phase 2)
485 movdqa xmm5,xmm6 ; transpose coefficients(phase 2)
489 movdqa xmm3,xmm7 ; transpose coefficients(phase 3
[all...] |
| /frameworks/av/media/libstagefright/codecs/amrnb/dec/src/ |
| a_refl.h | 49 Purpose : Convert from direct form coefficients to
50 reflection coefficients
103 * PURPOSE: Convert from direct form coefficients to reflection coefficients
106 * reflection coefficients Q15
109 Word16 a[], /* i : Directform coefficients */
110 Word16 refl[], /* o : Reflection coefficients */
|
| /external/eigen/doc/ |
| InsideEigenExample.dox | 55 However, in the above program, we have chosen size=50, so our vectors consist of 50 float's, and 50 is not a multiple of 4. This means that we cannot hope to do all of that computation using SSE2 instructions. The second best thing, to which we should aim, is to handle the 48 first coefficients with SSE2 instructions, since 48 is the biggest multiple of 4 below 50, and then handle separately, without SSE2, the 49th and 50th coefficients. Something like this:
87 You may wonder, isn't it overengineering to have the storage in a separate class? The reason is that the Matrix class template covers all kinds of matrices and vector: both fixed-size and dynamic-size. The storage method is not the same in these two cases. For fixed-size, the matrix coefficients are stored as a plain member array. For dynamic-size, the coefficients will be stored as a pointer to a dynamically-allocated array. Because of this, we need to abstract storage away from the Matrix class. That's DenseStorage.
102 Here, the \a m_data member is the actual array of coefficients of the matrix. As you see, it is dynamically allocated. Rather than calling new[] or malloc(), as you can see, we have our own internal::aligned_new defined in src/Core/util/Memory.h. What it does is that if vectorization is enabled, then it uses a platform-specific call to allocate a 128-bit-aligned array, as that is very useful for vectorization with both SSE2 and AltiVec. If vectorization is disabled, it amounts to the standard new[].
106 When you call VectorXf::data() to get the pointer to the array of coefficients, it returns DenseStorage::data() which returns the \a m_data member.
158 This means that we can put almost all the methods and operators in the base class MatrixBase, and have only the bare minimum in the subclasses. If you look at the subclasses in Eigen, like for instance the CwiseBinaryOp class, they have very few methods. There are coeff() and sometimes coeffRef() methods for access to the coefficients, there are rows() and cols() methods returning the number of rows and columns, but there isn't much more than that. All the meat is in MatrixBase, so it only needs to be coded once for all kinds of expressions, matrices, and vectors.
184 As we said, CwiseBinaryOp is also used for other operations such as substration, so it takes another template parameter determining the operation that will be applied to coefficients. This template parameter is a functor, that is, a class in which we have an operator() so it behaves like a function. Here, the functor used is internal::scalar_sum_op. It is defined in src/Core/Functors.h.
358 Here's how it works. \a LinearVectorization means that the left-hand and right-hand side expression can be accessed linearly i.e. you can refer to their coefficients by one integer \a index, as opposed to having to refer to its coefficients by two integers \a row, \a column
[all...] |
| ClassHierarchy.dox | 52 array of coefficients. This is where, for instance, the \link PlainObjectBase::resize() resize() \endlink
62 \c x.transpose() and \c x.block(...) also have direct access, because their coefficients can be read right
64 coefficients requires a computation (an addition), it can't be just read off memory.
|
| /external/webrtc/webrtc/modules/audio_coding/codecs/isac/main/source/ |
| entropy_coding.c | 211 /* Dither on half of the coefficients. */
365 /* The second half of real and imaginary coefficients is zero. This is
503 /* Find AR coefficients */
518 /* Find RC coefficients. */
524 /* RC -> AR coefficients */
754 /* calculate the step-size for linear interpolation coefficients */
884 /* find quantization levels for coefficients */
981 /* Low-band LAR coefficients. */
987 /* High-band LAR coefficients. */
1014 /* Low-band LAR coefficients. *
[all...] |
| /external/eigen/Eigen/src/Core/ |
| Matrix.h | 117 * Dense matrices and vectors are plain usual arrays of coefficients. All the coefficients are stored, in an ordinary contiguous array.
118 * This is unlike Sparse matrices and vectors where the coefficients are stored as a list of nonzero coefficients.</dd>
122 * of coefficients as a fixed-size array, as a class member. This makes sense for very small matrices, typically up to 4x4, sometimes up
126 * variables, and the array of coefficients is allocated dynamically on the heap.
307 /** \brief Constructs a fixed-sized matrix initialized with coefficients starting at \a data */
341 /** \brief Constructs an initialized 2D vector with given coefficients */
345 /** \brief Constructs an initialized 3D vector with given coefficients */
355 /** \brief Constructs an initialized 4D vector with given coefficients */
[all...] |
| Redux.h | 421 /** \returns the minimum of all coefficients of \c *this.
431 /** \returns the maximum of all coefficients of \c *this.
441 /** \returns the sum of all coefficients of \c *this
456 /** \returns the mean of all coefficients of *this
474 /** \returns the product of all coefficients of *this
490 /** \returns the trace of \c *this, i.e. the sum of the coefficients on the main diagonal.
|
| /prebuilts/go/darwin-x86/src/image/jpeg/ |
| scan.go | 117 // all of a block's 64 DCT coefficients are transmitted in one pass.
119 // component), coefficients 1-5, and coefficients 6-63, in zig-zag
121 // band of coefficients are transmitted in one pass. For example,
138 return FormatError("progressive AC coefficients for more than one component")
164 // b is the decoded coefficients, in natural (not zig-zag) order.
217 // Load the previous partially decoded coefficients, if applicable.
251 // Decode the AC coefficients, as specified in section F.2.2.2.
290 // Save the coefficients.
395 return FormatError("too many coefficients")
[all...] |
| /prebuilts/go/linux-x86/src/image/jpeg/ |
| scan.go | 117 // all of a block's 64 DCT coefficients are transmitted in one pass.
119 // component), coefficients 1-5, and coefficients 6-63, in zig-zag
121 // band of coefficients are transmitted in one pass. For example,
138 return FormatError("progressive AC coefficients for more than one component")
164 // b is the decoded coefficients, in natural (not zig-zag) order.
217 // Load the previous partially decoded coefficients, if applicable.
251 // Decode the AC coefficients, as specified in section F.2.2.2.
290 // Save the coefficients.
395 return FormatError("too many coefficients")
[all...] |
| /external/eigen/Eigen/src/plugins/ |
| BlockMethods.h | 876 /// \param n the number of coefficients in the segment
903 /// \returns a dynamic-size expression of the first coefficients of *this.
907 /// \param n the number of coefficients in the segment
[all...] |
| /external/aac/libAACdec/src/ |
| channelinfo.h | 231 lpc4_lsf[M_LP_FILTER_ORDER]; /* Last LPC4 coefficients in LSF domain. */
233 coefficients in LSF domain
235 FIXP_LPC lp_coeff_old[2][M_LP_FILTER_ORDER]; /* Last LPC coefficients in LP
379 coefficients in LSP domain */
381 lp_coeff[5][M_LP_FILTER_ORDER]; /* linear prediction coefficients in
403 SPECTRAL_PTR pSpectralCoefficient; /* Spectral coefficients of each window */
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/ode/nonstiff/ |
| AdamsNordsieckTransformer.java | 135 /** Cache for already computed coefficients. */
145 /** Update coefficients of the higher order derivatives wrt y'. */
154 // compute exact coefficients
163 // update coefficients are computed by combining transform from
176 // initialization coefficients, computed from a R matrix = abs(P)
187 // convert coefficients to double
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| HessenbergDecomposition.h | 76 /** \brief Type for vector of Householder coefficients.
166 /** \brief Returns the Householder coefficients.
168 * \returns a const reference to the vector of Householder coefficients
174 * The Householder coefficients allow the reconstruction of the matrix
197 * Householder coefficients returned by householderCoefficients(),
285 * \param hCoeffs returned Householder coefficients
|
| /external/libopus/silk/fixed/ |
| burg_modified_FIX.c | 44 /* Compute reflection coefficients from input signal */
48 opus_int32 A_Q16[], /* O Prediction coefficients (length order) */
211 /* Ensure adjusted reflection coefficients has the original sign */
221 /* Update the AR coefficients */
231 /* Reached max prediction gain; set remaining coefficients to zero and exit loop */
249 /* Scale coefficients */
|
| main_FIX.h | 100 /* Compute noise shaping coefficients and initial gain values */
143 /* Find LPC and LTP coefficients */
174 const opus_int16 LTPCoef_Q14[ LTP_ORDER * MAX_NB_SUBFR ],/* I LTP_ORDER LTP coefficients for each MAX_NB_SUBFR subframe */
|
| /external/libopus/silk/fixed/x86/ |
| burg_modified_FIX_sse.c | 49 /* Compute reflection coefficients from input signal */
53 opus_int32 A_Q16[], /* O Prediction coefficients (length order) */
308 /* Ensure adjusted reflection coefficients has the original sign */
318 /* Update the AR coefficients */
328 /* Reached max prediction gain; set remaining coefficients to zero and exit loop */
346 /* Scale coefficients */
|
| /external/opencv/cvaux/src/ |
| cvhmmobs.cpp | 175 /* do transfroms for each column. Calc only first obsSize.height DCT coefficients */
205 /* other coefficients */
273 /* other coefficients */
372 /* do transfroms for each column. Calc only first obsSize.height DCT coefficients */
402 /* other coefficients */
470 /* other coefficients */
|
| /external/eigen/Eigen/src/Geometry/ |
| Translation.h | 21 * \tparam _Scalar the scalar type, i.e., the type of the coefficients.
36 /** the scalar type of the coefficients */
70 /** Constructs and initialize the translation transformation from a vector of translation coefficients */
|
| /external/libavc/common/x86/ |
| ih264_ihadamard_scaling_ssse3.c | 56 * @brief This function performs a 4x4 inverse hadamard transform on the 4x4 DC coefficients
61 * The DC coefficients pass through a 2-stage inverse hadamard transform.
65 * input 4x4 block of DC coefficients
|
| /external/libhevc/common/ |
| ihevc_chroma_iquant_recon.c | 73 * Input 4x4 coefficients
185 * Input 8x8 coefficients
297 * Input 16x16 coefficients
|
| /external/skia/include/core/ |
| SkColorSpace.h | 40 * Contains the coefficients for a common transfer function equation, specified as
113 * Transfer function can be specified as an enum or as the coefficients to an equation.
154 * If the transfer function can be represented as coefficients to the standard
|
| /external/skqp/include/core/ |
| SkColorSpace.h | 40 * Contains the coefficients for a common transfer function equation, specified as
113 * Transfer function can be specified as an enum or as the coefficients to an equation.
154 * If the transfer function can be represented as coefficients to the standard
|
