new parameters for sparse-matrix libraries

git-svn-id: http://svn.einsteintoolkit.org/cactus/EinsteinAnalysis/AHFinderDirect/trunk@1095 f88db872-0e4f-0410-b76b-b9085cfa78c5

1 files changed, 17 insertions, 5 deletions

diff --git a/param.ccl b/param.ccl
index 6536cbc..df61516 100644
--- a/param.ccl
+++ b/param.ccl
@@ -847,12 +847,24 @@ real ILUCG__error_tolerance "error tolerance for conjugate gradient iteration"
 (0.0:*)	:: \
   "positive ==> error tolerance"
 } 1.0e-10
-int ILUCG__max_CG_iterations \
-  "max number of conjugate-gradient iterations for ILUCG sparse-matrix library"
+boolean ILUCG__limit_CG_iterations \
+  "should we limit the maximum number of conjugate gradient iterations allowed?"
 {
-0	:: "no limit"
-1:*	:: "any positive integer"
-} 100
+"false"	:: "no limit on CG iterations"
+"true"	:: "limit to Neqns CG iterations"
+} "true"
+
+# extra parameters for
+#   Jacobian_store_solve_method == "row-oriented sparse matrix/UMFPACK"
+int UMFPACK__N_II_iterations \
+  "number of iterative-improvement iterations to do inside UMFPACK \
+   after the sparse LU decompose/solve, each time we solve a linear system"
+{
+-1	:: "use the UMFPACK default"
+0	:: "don't do iterative improvement"
+1:*	:: "any positive integer \
+	    (in practice a few iterations give almost all the benefit)"
+} 0
 
 ########################################