/external/eigen/unsupported/Eigen/ |
MatrixFunctions | 255 in the interval \f$ (-1, 1) \f$. The main diagonal and the first 256 super-diagonal is directly computed.
|
/external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
DGMRES.h | 356 //FIXME Check first if the matrix is singular ... zero diagonal 391 return schurofH.matrixT().diagonal();
|
/external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
MatrixPower.h | 500 m_conditionNumber = m_T.diagonal().array().abs().maxCoeff() / m_T.diagonal().array().abs().minCoeff();
|
/external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
LevenbergMarquardt.h | 473 wa1 = fjac.diagonal(); 474 fjac.diagonal() = qrfac.hCoeffs();
|
/external/freetype/src/truetype/ |
ttsubpix.c | 346 /* Maintain thickness of diagonal in 'N' */ 398 /* Fixes vanishing diagonal in 4 */ [all...] |
/external/pdfium/third_party/freetype/src/truetype/ |
ttsubpix.c | 346 /* Maintain thickness of diagonal in 'N' */ 398 /* Fixes vanishing diagonal in 4 */ [all...] |
/external/skia/src/core/ |
SkPathRef.cpp | 69 // Is the antidiagonal non-zero (otherwise the diagonal is zero) 73 // Are the two non-zero diagonal or antidiagonal values the same sign.
|
SkMatrix.cpp | 144 // the primary diagonal is all zeros and that the secondary diagonal 162 // Not affine, therefore we already know secondary diagonal is 163 // all zeros, so we just need to check that primary diagonal is 170 // record if the (p)rimary diagonal is all non-zero [all...] |
/frameworks/base/tools/aapt2/compile/ |
NinePatch.cpp | 592 DiagonalImageLine diagonal(rows, 1 + nine_patch->outline.left, 596 FindOutlineInsets(&diagonal, &top_left, &bottom_right);
|
/external/opencv/cxcore/include/ |
cxcore.h | 222 /* Select a diagonal of the input array. 223 (diag = 0 means the main diagonal, >0 means a diagonal above the main one, 225 The diagonal will be represented as a column (nx1 matrix). */ 779 /* Calculates trace of the matrix (sum of elements on the main diagonal) */ [all...] |
/external/ImageMagick/MagickCore/ |
pixel.c | [all...] |
/external/ImageMagick/ImageMagick/script/ |
formats.html | [all...] |
/external/ImageMagick/www/ |
formats.html | [all...] |
/external/dng_sdk/source/ |
dng_negative.h | 700 // aren't, they are diagonal matrices. [all...] |
/external/apache-commons-math/src/main/java/org/apache/commons/math/linear/ |
FieldLUDecompositionImpl.java | 145 // Divide the lower elements by the "winning" diagonal elt.
|
/external/autotest/client/site_tests/firmware_TouchMTB/tests/logs/link/20130806_221321-fw_1.0.AA-robot/ |
touch_firmware_report-link-fw_1.0.AA-complete-20140116_103340.log | [all...] |
/external/autotest/client/site_tests/firmware_TouchMTB/ |
validators.py | 218 """Is the direction diagonal?""" 230 return GV.DIAGONAL 637 # For diagonal lines, consider both x and y axes [all...] |
/external/deqp/modules/gles2/scripts/ |
gen-conversions.py | 44 # * matrix from scalar: broadcast scalar to diagonal, other components zero
|
/external/deqp/modules/gles3/scripts/ |
gen-conversions.py | 44 # * matrix from scalar: broadcast scalar to diagonal, other components zero
|
/external/eigen/Eigen/ |
Core | 455 #include "src/Core/Diagonal.h"
|
/external/eigen/Eigen/src/Eigenvalues/ |
HessenbergDecomposition.h | 195 * - the upper part and lower sub-diagonal represent the Hessenberg matrix H
|
/external/eigen/doc/ |
AsciiQuickReference.txt | 94 R.diagonal() // diag(R) // Read-write
|
FunctionsTakingEigenTypes.dox | 20 \li EigenBase: The base class unifying all types of objects that can be evaluated into dense matrices or arrays, for example special matrix classes such as diagonal matrices, permutation matrices, etc. It can be used in functions that are meant to work on any such general type.
|
/external/eigen/test/ |
cholesky.cpp | 361 // LDLT is not guaranteed to work for indefinite matrices, but happens to work fine if matrix is diagonal.
|
nullary.cpp | 31 bool diagOK = (A.diagonal().array() == 1).all();
|