From 7819ddbb5e78720f05fcba110c612ae0e4c6657f Mon Sep 17 00:00:00 2001 From: Martin Kronbichler Date: Tue, 20 May 2025 14:39:03 +0200 Subject: [PATCH] New test case --- tests/lac/householder.cc | 31 +++++++++++++++++++++++++------ tests/lac/householder.output | 1 + 2 files changed, 26 insertions(+), 6 deletions(-) diff --git a/tests/lac/householder.cc b/tests/lac/householder.cc index 7da1d670fa..d7a007253b 100644 --- a/tests/lac/householder.cc +++ b/tests/lac/householder.cc @@ -16,6 +16,7 @@ // Tests Householder class for QR-decomposition #include +#include #include #include @@ -36,11 +37,29 @@ main() FullMatrix A(4, 3, &rect[0][0]); Householder H(A); - Vector u(4); - Vector v1(3); - Vector v2(3); + { + Vector u(4); + Vector v1(3); - for (unsigned int i = 0; i < u.size(); ++i) - u(i) = i * i; - deallog << "Distance " << H.least_squares(v1, u) << std::endl; + for (unsigned int i = 0; i < u.size(); ++i) + u(i) = i * i; + deallog << "Distance " << H.least_squares(v1, u) << std::endl; + } + + // make a rudimentary complex test + FullMatrix> B(A.m(), A.n()); + for (unsigned int i = 0; i < A.m(); ++i) + for (unsigned int j = 0; j < A.n(); ++j) + B(i, j) = A(i, j); + + Householder> HB(B); + + { + Vector> u(4); + Vector> v1(3); + + for (unsigned int i = 0; i < u.size(); ++i) + u(i) = i * i; + deallog << "Distance " << H.least_squares(v1, u) << std::endl; + } } diff --git a/tests/lac/householder.output b/tests/lac/householder.output index 71fb7aaaf4..59ec92d92f 100644 --- a/tests/lac/householder.output +++ b/tests/lac/householder.output @@ -1,2 +1,3 @@ DEAL::Distance 1.75 +DEAL::Distance (1.75,0.00) -- 2.39.5