Lines Matching full:sparse
394 * \brief A sparse direct LU factorization and solver based on the PARDISO library
396 * This class allows to solve for A.X = B sparse linear problems via a direct LU factorization
397 * using the Intel MKL PARDISO library. The sparse matrix A must be squared and invertible.
398 * The vectors or matrices X and B can be either dense or sparse.
400 * \tparam _MatrixType the type of the sparse matrix A, it must be a SparseMatrix<>
444 * \brief A sparse direct Cholesky (LLT) factorization and solver based on the PARDISO library
446 * This class allows to solve for A.X = B sparse linear problems via a LL^T Cholesky factorization
447 * using the Intel MKL PARDISO library. The sparse matrix A must be selfajoint and positive definite.
448 * The vectors or matrices X and B can be either dense or sparse.
450 * \tparam MatrixType the type of the sparse matrix A, it must be a SparseMatrix<>
503 * \brief A sparse direct Cholesky (LDLT) factorization and solver based on the PARDISO library
505 * This class allows to solve for A.X = B sparse linear problems via a LDL^T Cholesky factorization
506 * using the Intel MKL PARDISO library. The sparse matrix A is assumed to be selfajoint and positive definite.
508 * The vectors or matrices X and B can be either dense or sparse.
510 * \tparam MatrixType the type of the sparse matrix A, it must be a SparseMatrix<>
