Lines Matching full:matrix
114 // Solve the system Sx = r, assuming that the matrix S is stored in a
137 Eigen::LLT<Matrix, Eigen::Upper> llt =
180 // Determine the non-zero blocks in the Schur Complement matrix, and
268 // Solve the system Sx = r, assuming that the matrix S is stored in a
292 down_cast<const BlockRandomAccessSparseMatrix*>(lhs())->matrix());
305 // complement matrix from scratch and not rely on the
309 // Create a upper triangular symmetric matrix.
325 // Create a upper triangular symmetric matrix.
375 // Solve the system Sx = r, assuming that the matrix S is stored in a
400 down_cast<const BlockRandomAccessSparseMatrix*>(lhs())->matrix());
431 // Solve the system Sx = r, assuming that the matrix S is stored in a
459 down_cast<const BlockRandomAccessSparseMatrix*>(lhs())->matrix());
468 // This is an upper triangular matrix.
470 // Map this to a column major, lower triangular matrix.
