Lines Matching refs:Matrix
54 /** Wraps the Eigen sparse matrix \a mat into a Cholmod sparse matrix object.
118 /** Returns a view of the Eigen sparse matrix \a mat as Cholmod sparse matrix.
123 cholmod_sparse res = viewAsCholmod(Ref<SparseMatrix<_Scalar,_Options,_Index> >(mat.matrix().const_cast_derived()));
131 /** Returns a view of the Eigen \b dense matrix \a mat as Cholmod dense matrix.
152 /** Returns a view of the Cholmod sparse matrix \a cm as an Eigen sparse matrix.
201 explicit CholmodBase(const MatrixType& matrix)
207 compute(matrix);
223 * \c NumericalIssue if the matrix.appears to be negative.
231 /** Computes the sparse Cholesky decomposition of \a matrix */
232 Derived& compute(const MatrixType& matrix)
234 analyzePattern(matrix);
235 factorize(matrix);
239 /** Performs a symbolic decomposition on the sparsity pattern of \a matrix.
245 void analyzePattern(const MatrixType& matrix)
252 cholmod_sparse A = viewAsCholmod(matrix.template selfadjointView<UpLo>());
261 /** Performs a numeric decomposition of \a matrix
263 * The given matrix must have the same sparsity pattern as the matrix on which the symbolic decomposition has been performed.
267 void factorize(const MatrixType& matrix)
270 cholmod_sparse A = viewAsCholmod(matrix.template selfadjointView<UpLo>());
293 Ref<const Matrix<typename Rhs::Scalar,Dynamic,Dynamic,ColMajor> > b_ref(b.derived());
303 dest = Matrix<Scalar,Dest::RowsAtCompileTime,Dest::ColsAtCompileTime>::Map(reinterpret_cast<Scalar*>(x_cd->x),b.rows(),b.cols());
347 /** \returns the determinant of the underlying matrix from the current factorization */
354 /** \returns the log determinant of the underlying matrix from the current factorization */
387 // Simplicial factorization stored as standard CSC matrix.
418 * The sparse matrix A must be selfadjoint and positive definite. The vectors or matrices
421 * \tparam _MatrixType the type of the sparse matrix A, it must be a SparseMatrix<>
445 CholmodSimplicialLLT(const MatrixType& matrix) : Base()
448 this->compute(matrix);
469 * The sparse matrix A must be selfadjoint and positive definite. The vectors or matrices
472 * \tparam _MatrixType the type of the sparse matrix A, it must be a SparseMatrix<>
496 CholmodSimplicialLDLT(const MatrixType& matrix) : Base()
499 this->compute(matrix);
518 * The sparse matrix A must be selfadjoint and positive definite. The vectors or matrices
521 * \tparam _MatrixType the type of the sparse matrix A, it must be a SparseMatrix<>
545 CholmodSupernodalLLT(const MatrixType& matrix) : Base()
548 this->compute(matrix);
565 * using the Cholmod library. The sparse matrix A must be selfadjoint and positive definite. The vectors or matrices
572 * \tparam _MatrixType the type of the sparse matrix A, it must be a SparseMatrix<>
596 CholmodDecomposition(const MatrixType& matrix) : Base()
599 this->compute(matrix);
