Skip to content
Snippets Groups Projects
Commit a2e2d3ea authored by podlesny's avatar podlesny
Browse files

remove debug print

parent 525084a3
No related branches found
No related tags found
No related merge requests found
...@@ -24,10 +24,10 @@ class LineSearchSolver ...@@ -24,10 +24,10 @@ class LineSearchSolver
Dune::Solvers::Interval<double> D; Dune::Solvers::Interval<double> D;
D = f.subDifferential(0); D = f.subDifferential(0);
std::cout << "f.A " << f.quadraticPart() << " f.b " << f.linearPart() << std::endl; //std::cout << "f.A " << f.quadraticPart() << " f.b " << f.linearPart() << std::endl;
std::cout << D[0] << " " << D[1] << std::endl; //std::cout << D[0] << " " << D[1] << std::endl;
std::cout << "domain: " << f.domain()[0] << " " << f.domain()[1] << std::endl; //std::cout << "domain: " << f.domain()[0] << " " << f.domain()[1] << std::endl;
if (D[1] > 0) // NOTE: Numerical instability can actually get us here if (D[1] > 0) // NOTE: Numerical instability can actually get us here
...@@ -44,9 +44,9 @@ class LineSearchSolver ...@@ -44,9 +44,9 @@ class LineSearchSolver
const Bisection globalBisection; //(0.0, 1.0, 0.0, 0.0); const Bisection globalBisection; //(0.0, 1.0, 0.0, 0.0);
x = globalBisection.minimize(f, f.scaling(), 0.0, bisectionsteps); x = globalBisection.minimize(f, f.scaling(), 0.0, bisectionsteps);
std::cout << "x: " << x << "scaling: " << f.scaling(); //std::cout << "x: " << x << "scaling: " << f.scaling();
x /= f.scaling(); x /= f.scaling();
std::cout << "final x: " << x << std::endl; //std::cout << "final x: " << x << std::endl;
//x = f.domain().projectIn(x); //x = f.domain().projectIn(x);
} }
}; };
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Please register or to comment