Lines Matching full:matrix
20 * \brief Standard SVD decomposition of a matrix and associated features
22 * \param MatrixType the type of the matrix of which we are computing the SVD decomposition
24 * This class performs a standard SVD decomposition of a real matrix A of size \c M x \c N
42 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> ColVector;
43 typedef Matrix<Scalar, MatrixType::ColsAtCompileTime, 1> RowVector;
45 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, MinSize> MatrixUType;
46 typedef Matrix<Scalar, MatrixType::ColsAtCompileTime, MatrixType::ColsAtCompileTime> MatrixVType;
47 typedef Matrix<Scalar, MinSize, 1> SingularValuesType;
53 SVD(const MatrixType& matrix)
54 : m_matU(matrix.rows(), (std::min)(matrix.rows(), matrix.cols())),
55 m_matV(matrix.cols(),matrix.cols()),
56 m_sigma((std::min)(matrix.rows(),matrix.cols()))
58 compute(matrix);
68 void compute(const MatrixType& matrix);
89 /** Computes / recomputes the SVD decomposition A = U S V^* of \a matrix
94 void SVD<MatrixType>::compute(const MatrixType& matrix)
96 const int m = matrix.rows();
97 const int n = matrix.cols();
109 MatrixType matA(matrix);
182 // Set up the final bidiagonal matrix or order p.
520 Matrix<Scalar,MatrixUType::RowsAtCompileTime,1> aux = m_matU.transpose() * b.col(j);
536 /** Computes the polar decomposition of the matrix, as a product unitary x positive.
554 /** Computes the polar decomposition of the matrix, as a product positive x unitary.
572 /** decomposes the matrix as a product rotation x scaling, the scaling being
587 Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> sv(m_sigma);
598 /** decomposes the matrix as a product scaling x rotation, the scaling being
613 Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> sv(m_sigma);
