#include <Eigen/Sparse>
#include <vector>
#include <QImage>
const Eigen::VectorXd& boundary) {
int n =
int(boundary.size());
b(
id) -=
w * boundary(
j);
else if (
j == -1 ||
j ==
n)
b(
id) -=
w * boundary(
i);
else
coeffs.push_back(
T(
id, id1,
w));
}
void buildProblem(std::vector<T>& coefficients, Eigen::VectorXd&
b,
int n) {
Eigen::ArrayXd boundary = Eigen::ArrayXd::LinSpaced(
n, 0,
M_PI).sin().pow(2);
for (
int j = 0;
j <
n; ++
j) {
for (
int i = 0;
i <
n; ++
i) {
}
}
}
QImage img(
bits.data(),
n,
n, QImage::Format_Indexed8);
img.setColorCount(256);
for (
int i = 0;
i < 256;
i++) img.setColor(
i, qRgb(
i,
i,
i));
}
int i
Definition: BiCGSTAB_step_by_step.cpp:9
const unsigned n
Definition: CG3DPackingUnitTest.cpp:11
Eigen::Triplet< double > T
Definition: EigenUnitTest.cpp:11
RowVector3d w
Definition: Matrix_resize_int.cpp:3
Eigen::SparseMatrix< double > SpMat
Definition: Tutorial_sparse_example.cpp:5
void buildProblem(std::vector< T > &coefficients, Eigen::VectorXd &b, int n)
Definition: Tutorial_sparse_example_details.cpp:21
void saveAsBitmap(const Eigen::VectorXd &x, int n, const char *filename)
Definition: Tutorial_sparse_example_details.cpp:36
void insertCoefficient(int id, int i, int j, double w, std::vector< T > &coeffs, Eigen::VectorXd &b, const Eigen::VectorXd &boundary)
Definition: Tutorial_sparse_example_details.cpp:8
Scalar * b
Definition: benchVecAdd.cpp:17
General-purpose arrays with easy API for coefficient-wise operations.
Definition: Array.h:48
#define M_PI
Definition: main.h:121
Map< const Array< unsigned char, sizeof(T), 1 > > bits(const T &x)
Definition: packetmath_test_shared.h:36
string filename
Definition: MergeRestartFiles.py:39
list x
Definition: plotDoE.py:28
std::ptrdiff_t j
Definition: tut_arithmetic_redux_minmax.cpp:2