From 675f7f33e49dff7fd5edd3a7b5af4a5df79e5ff1 Mon Sep 17 00:00:00 2001 From: jthorn Date: Mon, 2 Jun 2003 15:13:04 +0000 Subject: add parameters for convergence criteria for ILUCG sparse linear solver git-svn-id: http://svn.einsteintoolkit.org/cactus/EinsteinAnalysis/AHFinderDirect/trunk@1079 f88db872-0e4f-0410-b76b-b9085cfa78c5 --- param.ccl | 26 ++++++++++++++++++++++++++ 1 file changed, 26 insertions(+) (limited to 'param.ccl') diff --git a/param.ccl b/param.ccl index eb1caf5..5a1c5ba 100644 --- a/param.ccl +++ b/param.ccl @@ -806,6 +806,8 @@ keyword Jacobian_compute_method "how do we compute the Jacobian matrix?" "fast, tricky programming, uses gij, dx gij, dxx gij, Kij, dx Kij" } "symbolic differentiation with finite diff d/dr" +######################################## + # # This parameter lists all known methods for storing the Jacobian and # solving linear systems with the Jacobian as the LHS matrix. See @@ -829,6 +831,30 @@ keyword Jacobian_store_solve_method \ solve with UMFPACK (sparse LU decomposition) method" } "row-oriented sparse matrix/ILUCG" +# +# Extra parameters for individual linear solvers +# + +# extra parameters for +# Jacobian_store_solve_method == "row-oriented sparse matrix/ILUCG" +real ILUCG__error_tolerance "error tolerance for conjugate gradient iteration" +{ +(*:0.0) :: \ + "negative ==> scale the absolute value by the floating point roundoff \ + threshold, e.g. -256.0 means to allow the last 8 bits of \ + the solution to be in error" +(0.0:*) :: \ + "positive ==> error tolerance" +} 1.0e-10 +int ILUCG__max_CG_iterations \ + "max number of conjugate-gradient iterations for ILUCG sparse-matrix library" +{ +0 :: "no limit" +1:* :: "any positive integer" +} 100 + +######################################## + # # This parameter controls two different sorts of one-sided finite # differencing: -- cgit v1.2.3