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
104 // matrix should already have been ordered so that all rows
200 += diag.array().square().matrix();
208 // Gaussian elimination to them. The matrix ete stores the normal
209 // matrix corresponding to the block being eliminated and array
233 typename EigenTypes<kEBlockSize, kEBlockSize>::Matrix
239 ete = diag.array().square().matrix().asDiagonal();
268 typename EigenTypes<kEBlockSize, kEBlockSize>::Matrix inverse_ete =
272 .solve(Matrix::Identity(e_block_size, e_block_size));
316 typename EigenTypes<kEBlockSize, kEBlockSize>::Matrix
321 ete = diag.array().square().matrix().asDiagonal();
416 // this function computes twp matrices. The diagonal block matrix
436 typename EigenTypes<kEBlockSize, kEBlockSize>::Matrix* ete,
447 // contribution of its E block to the matrix EE' (ete), and the
490 // Schur complement matrix, i.e
497 const Matrix& inverse_ete,
503 // computation of the right-hand matrix product, but memory
582 // static structure of the matrix A only pays attention to rows with
