Lines Matching refs:Matrix
33 typedef Matrix<Scalar, 1, ColsAtCompileTime> RowVectorType;
34 typedef Matrix<Scalar, RowsAtCompileTime, 1> ColVectorType;
36 typedef Matrix<Scalar, ColsAtCompileTime, 1> DiagVectorType;
37 typedef Matrix<Scalar, ColsAtCompileTimeMinusOne, 1> SuperDiagVectorType;
56 explicit UpperBidiagonalization(const MatrixType& matrix)
57 : m_householder(matrix.rows(), matrix.cols()),
58 m_bidiagonal(matrix.cols(), matrix.cols()),
61 compute(matrix);
64 UpperBidiagonalization& compute(const MatrixType& matrix);
65 UpperBidiagonalization& computeUnblocked(const MatrixType& matrix);
91 // This version should be faster for small matrix size
103 typedef Matrix<Scalar,Dynamic,1,ColMajor,MatrixType::MaxRowsAtCompileTime,1> TempType;
137 * Let's partition the matrix A:
144 * and the \a blockSize x \c cols horizontal panel [A00 A01] of the matrix \a A. The bottom-right block A11
145 * is updated using matrix-matrix products:
156 Ref<Matrix<typename MatrixType::Scalar, Dynamic, Dynamic,
158 Ref<Matrix<typename MatrixType::Scalar, Dynamic, Dynamic,
167 typedef Ref<Matrix<Scalar, Dynamic, 1>, 0, ColInnerStride> SubColumnType;
168 typedef Ref<Matrix<Scalar, 1, Dynamic>, 0, RowInnerStride> SubRowType;
169 typedef Ref<Matrix<Scalar, Dynamic, Dynamic, StorageOrder > > SubMatType;
297 Matrix<Scalar,
302 Matrix<Scalar,
316 // partition the matrix A:
359 UpperBidiagonalization<_MatrixType>& UpperBidiagonalization<_MatrixType>::computeUnblocked(const _MatrixType& matrix)
361 Index rows = matrix.rows();
362 Index cols = matrix.cols();
367 m_householder = matrix;
381 UpperBidiagonalization<_MatrixType>& UpperBidiagonalization<_MatrixType>::compute(const _MatrixType& matrix)
383 Index rows = matrix.rows();
384 Index cols = matrix.cols();
390 m_householder = matrix;
