cher2kU

Source: tests/dense/her2k2.cpp

// ========================================================================= //
// This file is part of MyraMath, copyright (c) 2014-2019 by Ryan A Chilton  //
// and distributed by MyraCore, LLC. See LICENSE.txt for license terms.      //
// ========================================================================= //

// Containers.
#include <myramath/utility/Number.h>
#include <myramath/dense/Matrix.h>

// Algorithms.
#include <myramath/utility/random.h>
#include <myramath/dense/gemm.h>
#include <myramath/dense/her2k.h>
#include <myramath/dense/frobenius.h>
#include <myramath/dense/transpose.h>
#include <myramath/dense/hermitian.h>
#include <myramath/dense/conjugate.h>
#include <myramath/dense/triu.h>

// Reporting.
#include <tests/myratest.h>

using namespace myra;

namespace {

template<class Number> void test(int I, int J, typename ReflectPrecision<Number>::type tolerance)
  {
  // Useful typedef.
  typedef typename ReflectPrecision<Number>::type Precision;
  myra::out() << typestring<Number>() << std::endl;
  // Make random nonsquare matrices A and B
  auto A = Matrix<Number>::random(I,J);
  auto B = Matrix<Number>::random(I,J);
  Number alpha = random<Number>();
  Precision beta  = random<Precision>();
  Number one(1);
  // Compare her2k_inplace('N') to gemm_inplace(A,'N',B,'H'); gemm_inplace(B,'N',A,'H');
    {
    auto C1 = Matrix<Number>::random(I,I);
    C1 = C1 + hermitian(C1);
    Matrix<Number> C2 = C1;
    gemm_inplace(C1,A,'N',B,'H',alpha,beta);
    gemm_inplace(C1,B,'N',A,'H',conjugate(alpha),one);
    her2k_inplace(C2,'U',A,B,'N',alpha,beta);
    Precision error = frobenius(triu(C1-C2));
    myra::out() << "  |her2k('N')-gemm('N','H')| = " << error << std::endl;
    REQUIRE(error < tolerance);
    }
  // Compare her2k_inplace('T') to gemm_inplace(A,'T',B,'C'); gemm_inplace(B,'T',A,'C');
    {
    auto C1 = Matrix<Number>::random(J,J);
    C1 = C1 + hermitian(C1);
    Matrix<Number> C2 = C1;
    gemm_inplace(C1,A,'T',B,'C',alpha,beta);
    gemm_inplace(C1,B,'T',A,'C',conjugate(alpha),one);
    her2k_inplace(C2,'U',A,B,'T',alpha,beta);
    Precision error = frobenius(triu(C1-C2));
    myra::out() << "  |her2k('T')-gemm('T','C')| = " << error << std::endl;
    REQUIRE(error < tolerance);
    }
  // Compare her2k_inplace('C') to gemm_inplace(A,'C',B,'T'); gemm_inplace(B,'C',A,'T');
    {
    auto C1 = Matrix<Number>::random(I,I);
    C1 = C1 + hermitian(C1);
    Matrix<Number> C2 = C1;
    gemm_inplace(C1,A,'C',B,'T',alpha,beta);
    gemm_inplace(C1,B,'C',A,'T',conjugate(alpha),one);
    her2k_inplace(C2,'U',A,B,'C',alpha,beta);
    Precision error = frobenius(triu(C1-C2));
    myra::out() << "  |her2k('C')-gemm('C','T')| = " << error << std::endl;
    REQUIRE(error < tolerance);
    }
  // Compare her2k_inplace('H') to gemm_inplace(A,'H',B,'N'); gemm_inplace(B,'H',A,'N');
    {
    auto C1 = Matrix<Number>::random(J,J);
    C1 = C1 + hermitian(C1);
    Matrix<Number> C2 = C1;
    gemm_inplace(C1,A,'H',B,'N',alpha,beta);
    gemm_inplace(C1,B,'H',A,'N',conjugate(alpha),one);    
    her2k_inplace(C2,'U',A,B,'H',alpha,beta);
    Precision error = frobenius(triu(C1-C2));
    myra::out() << "  |herk('H')-gemm('H','N')| = " << error << std::endl;
    REQUIRE(error < tolerance);
    }
  }

} // namespace

ADD_TEST("sher2kU","[dense][blas]")
  { test<NumberS>(57,24,1.0e-4f); }

ADD_TEST("dher2kU","[dense][blas]")
  { test<NumberD>(57,24,1.0e-8); }

ADD_TEST("cher2kU","[dense][blas]")
  { test<NumberC>(57,24,1.0e-4f); }
  
ADD_TEST("zher2kU","[dense][blas]")
  { test<NumberZ>(57,24,1.0e-8); }

Results: [PASS]

std::complex<float>
  |her2k('N')-gemm('N','H')| = 0
  |her2k('T')-gemm('T','C')| = 0
  |her2k('C')-gemm('C','T')| = 0
  |herk('H')-gemm('H','N')| = 0

Go back to Summary of /test programs.