Lines Matching full:matrix
108 typedef Matrix<Scalar,Dynamic,1> VectorType;
109 typedef Matrix<Index, 1, MatrixType::ColsAtCompileTime> IntRowVectorType;
110 typedef Matrix<Index, MatrixType::RowsAtCompileTime, 1> IntColVectorType;
134 * \c NumericalIssue if the matrix appears to be negative.
150 /** Performs a symbolic decomposition on the sparcity of \a matrix.
156 Derived& analyzePattern(const MatrixType& matrix);
158 /** Performs a numeric decomposition of \a matrix
160 * The given matrix must has the same sparcity than the matrix on which the symbolic decomposition has been performed.
164 Derived& factorize(const MatrixType& matrix);
166 Derived& compute(const MatrixType& matrix);
178 && "PardisoImpl::solve(): invalid number of rows of the right hand side matrix b");
192 && "PardisoImpl::solve(): invalid number of rows of the right hand side matrix b");
214 // we process the sparse rhs per block of NbColsAtOnce columns temporarily stored into a dense matrix.
220 Eigen::Matrix<DestScalar,Dynamic,Dynamic,ColMajor> tmp_rhs(size,rhsCols);
221 Eigen::Matrix<DestScalar,Dynamic,Dynamic,ColMajor> tmp_res(size,rhsCols);
268 m_iparm[26] = 0; // No matrix checker
395 Matrix<Scalar,Dynamic,Dynamic,ColMajor> tmp;
419 * using the Intel MKL PARDISO library. The sparse matrix A must be squared and invertible.
422 * \tparam _MatrixType the type of the sparse matrix A, it must be a SparseMatrix<>
448 PardisoLU(const MatrixType& matrix)
452 compute(matrix);
455 matrix)
457 m_matrix = matrix;
469 * using the Intel MKL PARDISO library. The sparse matrix A must be selfajoint and positive definite.
472 * \tparam MatrixType the type of the sparse matrix A, it must be a SparseMatrix<>
502 PardisoLLT(const MatrixType& matrix)
506 compute(matrix);
511 void getMatrix(const MatrixType& matrix)
515 m_matrix.resize(matrix.rows(), matrix.cols());
516 m_matrix.template selfadjointView<Upper>() = matrix.template selfadjointView<UpLo>().twistedBy(p_null);
528 * using the Intel MKL PARDISO library. The sparse matrix A is assumed to be selfajoint and positive definite.
532 * \tparam MatrixType the type of the sparse matrix A, it must be a SparseMatrix<>
534 * Symmetric can be used for symmetric, non-selfadjoint complex matrices, the default being to assume a selfadjoint matrix.
563 PardisoLDLT(const MatrixType& matrix)
567 compute(matrix);
570 void getMatrix(const MatrixType& matrix)
574 m_matrix.resize(matrix.rows(), matrix.cols());
575 m_matrix.template selfadjointView<Upper>() = matrix.template selfadjointView<UpLo>().twistedBy(p_null);
