OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
full:diagonal
(Results
51 - 75
of
721
) sorted by null
1
2
3
4
5
6
7
8
9
10
11
>>
/device/google/atv/sdk/
devices.xml
12
<d:
diagonal
-length>55.0</d:
diagonal
-length>
81
<d:
diagonal
-length>55.0</d:
diagonal
-length>
/external/eigen/Eigen/
IterativeLinearSolvers
19
* - DiagonalPreconditioner - also called JAcobi preconditioner, work very well on
diagonal
dominant matrices.
/external/eigen/unsupported/test/
minres.cpp
28
//
Diagonal
preconditioner
/external/ceres-solver/internal/ceres/
implicit_schur_complement.cc
88
// contributions from the
diagonal
D if it is non-null. Add that to
139
// Given a block
diagonal
matrix and an optional array of
diagonal
140
// entries D, add them to the
diagonal
of the matrix and compute the
141
// inverse of each
diagonal
block.
block_jacobi_preconditioner.cc
73
// Compute the
diagonal
blocks by block inner products.
104
// Add the
diagonal
and invert each block.
111
block.
diagonal
() +=
dense_qr_solver.cc
75
// Temporarily append a
diagonal
block to the A matrix, but undo
80
// TODO(sameeragarwal): Since we are copying anyways, the
diagonal
133
// Temporarily append a
diagonal
block to the A matrix, but undo
/external/eigen/unsupported/Eigen/src/Polynomials/
Companion.h
225
//First row, first column excluding the
diagonal
237
//Middle rows and columns excluding the
diagonal
241
// column norm, excluding the
diagonal
244
// row norm, excluding the
diagonal
256
//Last row, last column excluding the
diagonal
/external/apache-commons-math/src/main/java/org/apache/commons/math/linear/
MatrixUtils.java
195
* Returns a
diagonal
matrix with specified elements.
197
* @param
diagonal
diagonal
elements of the matrix (the array elements
199
* @return
diagonal
matrix
202
public static RealMatrix createRealDiagonalMatrix(final double[]
diagonal
) {
203
final RealMatrix m = createRealMatrix(
diagonal
.length,
diagonal
.length);
204
for (int i = 0; i <
diagonal
.length; ++i) {
205
m.setEntry(i, i,
diagonal
[i]);
211
* Returns a
diagonal
matrix with specified elements
[
all
...]
CholeskyDecompositionImpl.java
38
/** Default threshold above which off-
diagonal
elements are considered too different
42
/** Default threshold below which
diagonal
elements are considered null
83
* @param relativeSymmetryThreshold threshold above which off-
diagonal
85
* @param absolutePositivityThreshold threshold below which
diagonal
116
// check off-
diagonal
elements (and reset them to 0)
135
// check
diagonal
element
QRDecompositionImpl.java
47
* <p>The elements BELOW the
diagonal
are the elements of the UPPER triangular
48
* matrix R, and the rows ABOVE the
diagonal
are the Householder reflector vectors
53
/** The
diagonal
elements of R. */
158
// copy the
diagonal
from rDiag and the upper triangle of qr
256
* <p>The elements BELOW the
diagonal
are the elements of the UPPER triangular
257
* matrix R, and the rows ABOVE the
diagonal
are the Householder reflector vectors
262
/** The
diagonal
elements of R. */
268
* @param rDiag
diagonal
elements of R
EigenDecomposition.java
58
* Returns the block
diagonal
matrix D of the decomposition.
59
* <p>D is a block
diagonal
matrix.</p>
60
* <p>Real eigenvalues are on the
diagonal
while complex values are on
/external/eigen/Eigen/src/Cholesky/
LDLT.h
37
* is lower triangular with a unit
diagonal
and D is a
diagonal
matrix.
141
/** \returns the coefficients of the
diagonal
matrix D */
142
inline
Diagonal
<const MatrixType> vectorD() const
145
return m_matrix.
diagonal
();
247
* part correspond to the coefficients of L (its
diagonal
is equal to 1 and
248
* is not stored), and the
diagonal
entries correspond to D.
284
// Find largest
diagonal
element
286
mat.
diagonal
().tail(size-k).cwiseAbs().maxCoeff(&index_of_biggest_in_corner);
319
temp.head(k) = mat.
diagonal
().real().head(k).asDiagonal() * A10.adjoint()
[
all
...]
/external/chromium-trace/catapult/telemetry/telemetry/internal/actions/
scroll.py
44
#
Diagonal
scrolling support was added in Chrome branch number 2332.
48
raise ValueError('
Diagonal
scrolling requires Chrome branch number'
/external/eigen/Eigen/src/Core/products/
SelfadjointMatrixMatrix.h
17
// pack a selfadjoint block
diagonal
for use with the gebp_kernel
35
blockA[count++] = numext::real(lhs(k,k)); // real (
diagonal
)
68
blockA[count++] = numext::real(lhs(i, i)); // real (
diagonal
)
103
// second part:
diagonal
block
285
// 1 - the transposed panel above the
diagonal
block => transposed packed copy
286
// 2 - the
diagonal
block => special packed copy
287
// 3 - the panel below the
diagonal
block => generic packed copy
296
// the block
diagonal
TriangularMatrixMatrix.h
137
triangularBuffer.
diagonal
().setZero();
139
triangularBuffer.
diagonal
().setOnes();
163
// 2 - the
diagonal
block => special kernel
164
// 3 - the dense panel below (lower case) or above (upper case) the
diagonal
block => GEPP
166
// the block
diagonal
, if any:
204
// the part below (lower case) or above (upper case) the
diagonal
=> GEPP
278
triangularBuffer.
diagonal
().setZero();
280
triangularBuffer.
diagonal
().setOnes();
/external/eigen/test/eigen2/
eigen2_svd.cpp
62
for(int i = 0; i < rows; i++) VERIFY(positive.
diagonal
()[i] >= 0); // cheap necessary (not sufficient) condition for positivity
68
for(int i = 0; i < rows; i++) VERIFY(positive.
diagonal
()[i] >= 0); // cheap necessary (not sufficient) condition for positivity
eigen2_miscmatrices.cpp
35
square.
diagonal
() = VectorType::Ones(rows);
/external/eigen/test/
product_trsolve.cpp
43
cmLhs.setRandom(); cmLhs *= static_cast<RealScalar>(0.1); cmLhs.
diagonal
().array() += static_cast<RealScalar>(1);
44
rmLhs.setRandom(); rmLhs *= static_cast<RealScalar>(0.1); rmLhs.
diagonal
().array() += static_cast<RealScalar>(1);
miscmatrices.cpp
34
square.
diagonal
() = VectorType::Ones(rows);
geo_alignedbox.cpp
118
VERIFY_IS_APPROX( 53.0f, box.
diagonal
().squaredNorm() );
119
VERIFY_IS_APPROX( std::sqrt( 53.0f ), box.
diagonal
().norm() );
145
VERIFY_IS_APPROX( 62, box.
diagonal
().squaredNorm() );
/external/bison/lib/
bitsetv.h
50
the same as transitive closure but with all bits on the
diagonal
/external/chromium-trace/catapult/telemetry/telemetry/internal/browser/
browser_info.py
51
#
Diagonal
scrolling was not supported in the ScrollAction until
/external/libopus/silk/fixed/
regularize_correlations_FIX.c
34
/* Add noise to matrix
diagonal
*/
/external/libopus/silk/float/
regularize_correlations_FLP.c
34
/* Add noise to matrix
diagonal
*/
/external/eigen/unsupported/Eigen/src/IterativeSolvers/
Scaling.h
66
* Compute the left and right
diagonal
matrices to scale the input matrix @p mat
68
* FIXME This algorithm will be modified such that the
diagonal
elements are permuted on the
diagonal
.
Completed in 395 milliseconds
1
2
3
4
5
6
7
8
9
10
11
>>