Lines Matching full:matrix
37 // Eigen has an internal threshold switching between different matrix
40 // matrix matrix product algorithm that has a higher setup cost. For
41 // matrix sizes close to this threshold, especially when the matrices
107 // matrix should already have been ordered so that all rows
203 += diag.array().square().matrix();
211 // Gaussian elimination to them. The matrix ete stores the normal
212 // matrix corresponding to the block being eliminated and array
236 typename EigenTypes<kEBlockSize, kEBlockSize>::Matrix
242 ete = diag.array().square().matrix().asDiagonal();
271 typename EigenTypes<kEBlockSize, kEBlockSize>::Matrix inverse_ete =
275 .solve(Matrix::Identity(e_block_size, e_block_size));
319 typename EigenTypes<kEBlockSize, kEBlockSize>::Matrix
324 ete = diag.array().square().matrix().asDiagonal();
419 // this function computes twp matrices. The diagonal block matrix
439 typename EigenTypes<kEBlockSize, kEBlockSize>::Matrix* ete,
450 // contribution of its E block to the matrix EE' (ete), and the
493 // Schur complement matrix, i.e
500 const Matrix& inverse_ete,
506 // computation of the right-hand matrix product, but memory
585 // static structure of the matrix A only pays attention to rows with
