Skip to content

Commit 4d1abea

Browse files
Always use maxiter = 2
1 parent 91c749c commit 4d1abea

File tree

3 files changed

+4
-5
lines changed

3 files changed

+4
-5
lines changed

docs/src/plotting_utils.jl

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -87,7 +87,7 @@ function test_algs(
8787

8888
for tab in tableaus
8989
prob = problem(test_case, tab)
90-
alg = algorithm(test_case, tab)
90+
alg = algorithm(tab)
9191
predicted_order = if super_convergence == tab
9292
CTS.theoretical_convergence_order(tab) + 1
9393
else

test/convergence_utils.jl

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -60,7 +60,7 @@ end
6060

6161
function test_convergence_order!(test_case, tab, results = Dict(); refinement_range)
6262
prob = problem(test_case, tab)
63-
alg = algorithm(test_case, tab)
63+
alg = algorithm(tab)
6464
expected_order = default_expected_order(alg, tab)
6565
cr = OCT.refinement_study(
6666
prob,

test/utils.jl

Lines changed: 2 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -4,10 +4,9 @@ using Test
44
problem(test_case, tab::CTS.AbstractIMEXARKTableau) = test_case.split_prob
55
problem(test_case, tab) = test_case.prob
66

7-
function algorithm(test_case, tab)
7+
function algorithm(tab)
88
return if tab isa CTS.AbstractIMEXARKTableau
9-
max_iters = test_case.linear_implicit ? 1 : 2 # TODO: is 2 enough?
10-
CTS.IMEXARKAlgorithm(tab, NewtonsMethod(; max_iters))
9+
CTS.IMEXARKAlgorithm(tab, NewtonsMethod(; max_iters = 2))
1110
else
1211
tab
1312
end

0 commit comments

Comments
 (0)