Skip to content
Snippets Groups Projects
Commit 07a668a0 authored by Oliver Sander's avatar Oliver Sander Committed by sander
Browse files

Use Gauss-Seidel instead of IPOpt as the base solver

Gauss-Seidel converges equally good/bad as IPOpt, but it is much faster.

[[Imported from SVN: r9839]]
parent 6079f3f6
Branches
No related tags found
No related merge requests found
...@@ -71,13 +71,12 @@ setup(const GridType& grid, ...@@ -71,13 +71,12 @@ setup(const GridType& grid,
// Create a multigrid solver // Create a multigrid solver
// //////////////////////////////// // ////////////////////////////////
#ifdef HAVE_IPOPT #if 0//def HAVE_IPOPT
// First create an IPOpt base solver // First create an IPOpt base solver
QuadraticIPOptSolver<MatrixType, CorrectionType>* baseSolver = new QuadraticIPOptSolver<MatrixType,CorrectionType>; QuadraticIPOptSolver<MatrixType, CorrectionType>* baseSolver = new QuadraticIPOptSolver<MatrixType,CorrectionType>;
baseSolver->verbosity_ = NumProc::QUIET; baseSolver->verbosity_ = NumProc::QUIET;
baseSolver->tolerance_ = baseTolerance; baseSolver->tolerance_ = baseTolerance;
#else #else
#warning IPOpt not installed -- falling back onto a Gauss-Seidel base solver
// First create a Gauss-seidel base solver // First create a Gauss-seidel base solver
TrustRegionGSStep<MatrixType, CorrectionType>* baseSolverStep = new TrustRegionGSStep<MatrixType, CorrectionType>; TrustRegionGSStep<MatrixType, CorrectionType>* baseSolverStep = new TrustRegionGSStep<MatrixType, CorrectionType>;
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Please register or to comment