-
Notifications
You must be signed in to change notification settings - Fork 0
/
unal.cpp
58 lines (56 loc) · 2.22 KB
/
unal.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
// Tiny QR solver, header only library
//
// Licensed under the MIT License <http://opensource.org/licenses/MIT>.
//
// Copyright (C) 2023- Juraj Szitas
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
// SOFTWARE.
#include <iostream>
#include "./tinyqr.h"
#include "utils.h"
int main(int argc, char** argv) {
using scalar_t = double;
using tinyqr::QRImpl;
using tinyqr::qr_decomposition;
// you can validate easily using tinyqr::validate_qr - this is not done here
// since I already did that elsewhere
[&](){
auto benchmark = Benchmarker<scalar_t>(1000);
for (size_t i = 2; i < 64; i *= 2) {
for (size_t j = i; j < 1024; j *= 2) {
auto X = make_random_matrix<scalar_t>(j+1, i+1);
std::function<void()> v1 = [&]() {
qr_decomposition<scalar_t, QRImpl::baseline>(X, j+1, i+1);
};
std::function<void()> v2 = [&]() {
qr_decomposition<scalar_t, QRImpl::transpose>(X, j+1, i+1);
};
std::cout << "n: " << j+1 << " | p: " << i+1 << std::endl;
benchmark(v1, v2);
}
}
std::cout << "Performance on unaligned matrices:\n";
benchmark.report();
if(argc > 1) {
// dump to output file
benchmark.to_file(argv[1]);
}
}();
return 0;
}