We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? # for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “#”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? # to your account
#include <linbox/solutions/solve.h> using namespace LinBox; int main(void) { using Field = Givaro::Modular<double>; using Matrix = DenseMatrix<Field>; using Vector = DenseVector<Field>; Field F(101); Matrix A(F, 1, 2); Vector x(F, A.coldim()); Vector b(F, A.rowdim()); A.setEntry(0, 0, 13); A.setEntry(0, 1, 27); F.assign(b[0], 52); // Calling Lanczos Method::Lanczos method; solve(x, A, b, method); std::cout << "[ " << A.getEntry(0, 0) << " " << A.getEntry(0, 1) << " ] x = [ " << b[0] << " ]"; std::cout << " => x = [ " << x[0] << " " << x[1] << " ]" << std::endl; Field::Element Ax0, Ax1, Ax; F.mul(Ax0, A.getEntry(0, 0), x[0]); F.mul(Ax1, A.getEntry(0, 1), x[1]); F.add(Ax, Ax0, Ax1); if (!F.areEqual(Ax, b[0])) { std::cerr << "PROBLEM! Ax != b" << std::endl; } return 0; }
Sparse Lanczos seems ok.
The text was updated successfully, but these errors were encountered:
No branches or pull requests
Sparse Lanczos seems ok.
The text was updated successfully, but these errors were encountered: