BiCGSTAB_step_by_step.cpp
Go to the documentation of this file.
1  int n = 10000;
2  VectorXd x(n), b(n);
3  SparseMatrix<double> A(n,n);
4  /* ... fill A and b ... */
5  BiCGSTAB<SparseMatrix<double> > solver(A);
6  // start from a random solution
7  x = VectorXd::Random(n);
8  solver.setMaxIterations(1);
9  int i = 0;
10  do {
11  x = solver.solveWithGuess(b,x);
12  std::cout << i << " : " << solver.error() << std::endl;
13  ++i;
14  } while (solver.info()!=Success && i<100);
b
VectorXd b(n)
Eigen::Success
@ Success
Definition: Constants.h:442
A
SparseMatrix< double > A(n, n)
solver
BiCGSTAB< SparseMatrix< double > > solver(A)
n
int n
Definition: BiCGSTAB_step_by_step.cpp:1
A
Definition: test_numpy_dtypes.cpp:298
x
x
Definition: BiCGSTAB_step_by_step.cpp:7
i
int i
Definition: BiCGSTAB_step_by_step.cpp:9


gtsam
Author(s):
autogenerated on Sat Nov 16 2024 04:01:55