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
|
///////////////////////////////////////////////////////////////
// Copyright 2018 John Maddock. Distributed under the Boost
// Software License, Version 1.0. (See accompanying file
// LICENSE_1_0.txt or copy at https://www.boost.org/LICENSE_1_0.txt
//[eigen_eg
#include <iostream>
#include <boost/multiprecision/cpp_complex.hpp>
#include <boost/multiprecision/eigen.hpp>
#include <Eigen/Dense>
int main()
{
using namespace Eigen;
typedef boost::multiprecision::cpp_complex_quad complex_type;
//
// We want to solve Ax = b for x,
// define A and b first:
//
Matrix<complex_type, 2, 2> A, b;
A << complex_type(2, 3), complex_type(-1, -2), complex_type(-1, -4), complex_type(3, 6);
b << 1, 2, 3, 1;
std::cout << "Here is the matrix A:\n" << A << std::endl;
std::cout << "Here is the right hand side b:\n" << b << std::endl;
//
// Solve for x:
//
Matrix<complex_type, 2, 2> x = A.fullPivHouseholderQr().solve(b);
std::cout << "The solution is:\n" << x << std::endl;
//
// Compute the error in the solution by using the norms of Ax - b and b:
//
complex_type::value_type relative_error = (A*x - b).norm() / b.norm();
std::cout << "The relative error is: " << relative_error << std::endl;
return 0;
}
//]
/*
//[eigen_out
Here is the matrix A:
(2,3) (-1,-2)
(-1,-4) (3,6)
Here is the right hand side b:
1 2
3 1
The solution is:
(0.6,-0.6) (0.7,-0.7)
(0.64,-0.68) (0.58,-0.46)
The relative error is: 2.63132e-34
//]
*/
|
