test_transpose.cpp

/// @file test_transpose.cpp
/// @author Thijs Steel, KU Leuven, Belgium
/// @brief Test transpose
//
// Copyright (c) 2021-2023, University of Colorado Denver. All rights reserved.
//
// This file is part of <T>LAPACK.
// <T>LAPACK is free software: you can redistribute it and/or modify it under
// the terms of the BSD 3-Clause license. See the accompanying LICENSE file.

// Test utilities and definitions (must come before <T>LAPACK headers)
#include "testutils.hpp"

// <T>LAPACK
#include <tlapack/lapack/transpose.hpp>

using namespace tlapack;

TEMPLATE_TEST_CASE("Conjugate Transpose gives correct result",
                   "[util]",
                   TLAPACK_TYPES_TO_TEST)
{
    using matrix_t = TestType;
    using T = type_t<matrix_t>;
    using idx_t = size_type<matrix_t>;

    // Functor
    Create<matrix_t> new_matrix;

    // MatrixMarket reader
    MatrixMarket mm;

    // Generate n
    idx_t n = GENERATE(1, 2, 3, 5, 10);
    // Generate m
    idx_t m = GENERATE(1, 2, 3, 5, 10);

    // Define the matrices
    std::vector<T> A_;
    auto A = new_matrix(A_, m, n);
    std::vector<T> B_;
    auto B = new_matrix(B_, n, m);

    // Generate a random matrix in A
    mm.random(A);

    DYNAMIC_SECTION("m = " << m << " n = " << n)
    {
        TransposeOpts opts;
        // Set nx to a small value so that the blocked algorithm gets tested
        // even for small n and m;
        opts.nx = 3;
        conjtranspose(A, B, opts);

        for (idx_t i = 0; i < m; ++i)
            for (idx_t j = 0; j < n; ++j)
                CHECK(B(j, i) == conj(A(i, j)));
    }
}

TEMPLATE_TEST_CASE("Transpose gives correct result",
                   "[util]",
                   TLAPACK_TYPES_TO_TEST)
{
    using matrix_t = TestType;
    using T = type_t<matrix_t>;
    using idx_t = size_type<matrix_t>;

    // Functor
    Create<matrix_t> new_matrix;

    // MatrixMarket reader
    MatrixMarket mm;

    // Generate n
    idx_t n = GENERATE(1, 2, 3, 5, 10);
    // Generate m
    idx_t m = GENERATE(1, 2, 3, 5, 10);

    // Define the matrices
    std::vector<T> A_;
    auto A = new_matrix(A_, m, n);
    std::vector<T> B_;
    auto B = new_matrix(B_, n, m);

    // Generate a random matrix in A
    mm.random(A);

    DYNAMIC_SECTION("m = " << m << " n = " << n)
    {
        TransposeOpts opts;
        // Set nx to a small value so that the blocked algorithm gets tested
        // even for small n and m;
        opts.nx = 3;
        transpose(A, B, opts);

        for (idx_t i = 0; i < m; ++i)
            for (idx_t j = 0; j < n; ++j)
                CHECK(B(j, i) == A(i, j));
    }
}