Go to the documentation of this file.
15 template<
typename MatrixType>
void qr()
19 static const int Rows = MatrixType::RowsAtCompileTime,
Cols = MatrixType::ColsAtCompileTime;
22 Index rows = Rows ==
Dynamic ? internal::random<Index>(min_size,max_size) : Rows,
24 cols2 =
Cols ==
Dynamic ? internal::random<Index>(min_size,max_size) :
Cols,
40 MatrixQType
q =
qr.matrixQ();
54 check_solverbase<MatrixType, MatrixType>(
m1,
qr,
rows,
cols, cols2);
62 }
while(!
qr.isInvertible());
64 m3 =
m1 * MatrixType::Random(
size,cols2);
79 Index size = internal::random<Index>(min_size,max_size);
88 m1 +=
a *
a.adjoint();
100 for(
int i = 0; i < size; i++) m1(i,i) = internal::random<Scalar>();
130 for(
int i = 0;
i < 1;
i++) {
#define VERIFY_IS_EQUAL(a, b)
const EIGEN_DEVICE_FUNC LogReturnType log() const
#define VERIFY_RAISES_ASSERT(a)
#define CALL_SUBTEST_4(FUNC)
#define CALL_SUBTEST_3(FUNC)
Householder rank-revealing QR decomposition of a matrix with full pivoting.
#define CALL_SUBTEST_1(FUNC)
EIGEN_DEVICE_FUNC const Scalar & q
void createRandomPIMatrixOfRank(Index desired_rank, Index rows, Index cols, MatrixType &m)
EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE T mini(const T &x, const T &y)
#define CALL_SUBTEST_5(FUNC)
#define CALL_SUBTEST_6(FUNC)
#define CALL_SUBTEST_2(FUNC)
#define VERIFY_IS_UNITARY(a)
#define VERIFY_IS_APPROX(a, b)
NumTraits< Scalar >::Real RealScalar
static const DiscreteKey m3(M(3), 2)
#define EIGEN_TEST_MAX_SIZE
EIGEN_DECLARE_TEST(qr_fullpivoting)
The matrix class, also used for vectors and row-vectors.
EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE T maxi(const T &x, const T &y)
#define CALL_SUBTEST_7(FUNC)
#define CALL_SUBTEST_8(FUNC)
Holds information about the various numeric (i.e. scalar) types allowed by Eigen.
#define STATIC_CHECK(COND)
EIGEN_DEFAULT_DENSE_INDEX_TYPE Index
The Index type as used for the API.
gtsam
Author(s):
autogenerated on Fri Nov 1 2024 03:34:50