devtools/eigen
1
0
Fork 0
mirror of https://gitlab.com/libeigen/eigen.git synced 2026-04-10 11:34:33 +08:00
Code Issues Packages Projects Releases Wiki Activity

Clang-format tests, examples, libraries, benchmarks, etc.

Browse Source
This commit is contained in:
Antonio Sánchez
2023-12-05 21:22:55 +00:00
committed by Rasmus Munk Larsen
parent 3252ecc7a4
commit 46e9cdb7fe
876 changed files with 33453 additions and 37795 deletions
Download Patch File Download Diff File Expand all files Collapse all files

50
doc/special_examples/Tutorial_sparse_example_details.cpp
View File

@@ -2,43 +2,41 @@
#include <vector>
#include <QImage>
typedef Eigen::SparseMatrix<double> SpMat; // declares a column-major sparse matrix type of double
typedef Eigen::SparseMatrix<double> SpMat; // declares a column-major sparse matrix type of double
typedef Eigen::Triplet<double> T;
void insertCoefficient(int id, int i, int j, double w, std::vector<T>& coeffs,
Eigen::VectorXd& b, const Eigen::VectorXd& boundary)
{
void insertCoefficient(int id, int i, int j, double w, std::vector<T>& coeffs, Eigen::VectorXd& b,
const Eigen::VectorXd& boundary) {
int n = int(boundary.size());
int id1 = i+j*n;
int id1 = i + j * n;
if(i==-1 || i==n) b(id) -= w * boundary(j); // constrained coefficient
else if(j==-1 || j==n) b(id) -= w * boundary(i); // constrained coefficient
else coeffs.push_back(T(id,id1,w)); // unknown coefficient
if (i == -1 || i == n)
b(id) -= w * boundary(j); // constrained coefficient
else if (j == -1 || j == n)
b(id) -= w * boundary(i); // constrained coefficient
else
coeffs.push_back(T(id, id1, w)); // unknown coefficient
}
void buildProblem(std::vector<T>& coefficients, Eigen::VectorXd& b, int n)
{
void buildProblem(std::vector<T>& coefficients, Eigen::VectorXd& b, int n) {
b.setZero();
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)
{
int id = i+j*n;
insertCoefficient(id, i-1,j, -1, coefficients, b, boundary);
insertCoefficient(id, i+1,j, -1, coefficients, b, boundary);
insertCoefficient(id, i,j-1, -1, coefficients, b, boundary);
insertCoefficient(id, i,j+1, -1, coefficients, b, boundary);
insertCoefficient(id, i,j, 4, coefficients, b, boundary);
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) {
int id = i + j * n;
insertCoefficient(id, i - 1, j, -1, coefficients, b, boundary);
insertCoefficient(id, i + 1, j, -1, coefficients, b, boundary);
insertCoefficient(id, i, j - 1, -1, coefficients, b, boundary);
insertCoefficient(id, i, j + 1, -1, coefficients, b, boundary);
insertCoefficient(id, i, j, 4, coefficients, b, boundary);
}
}
}
void saveAsBitmap(const Eigen::VectorXd& x, int n, const char* filename)
{
Eigen::Array<unsigned char,Eigen::Dynamic,Eigen::Dynamic> bits = (x*255).cast<unsigned char>();
QImage img(bits.data(), n,n,QImage::Format_Indexed8);
void saveAsBitmap(const Eigen::VectorXd& x, int n, const char* filename) {
Eigen::Array<unsigned char, Eigen::Dynamic, Eigen::Dynamic> bits = (x * 255).cast<unsigned char>();
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));
for (int i = 0; i < 256; i++) img.setColor(i, qRgb(i, i, i));
img.save(filename);
}