An Accelerated Fixed-Point Algorithm Applied to Quadratic Convex Separable Knapsack Problems

Table 9

Uncorrelated test for root-finding algorithms.

Dimension	Iterations			Time (sec)			Error
	Avg	Max	Min	Avg	Max	Min	—
FPA2
500000	5.3	8	4	0.016	0.018	0.015	0
1000000	5.5	10	4	0.034	0.039	0.031	0
10000000	5.4	10	4	0.347	0.408	0.323	0
50000000	5.3	8	3	1.693	1.860	1.529	0
Regula falsi
500000	14.3	78	6	0.094	0.220	0.054	8
1000000	18.2	90	5	0.200	0.515	0.106	6
10000000	11.9	32	5	1.791	2.721	1.199	4
50000000	12.9	51	6	9.064	17.161	4.563	1
Secant
500000	8.4	13	3	0.066	0.094	0.043	15
1000000	8.6	14	5	0.140	0.200	0.098	8
10000000	9.0	13	6	1.499	2.007	1.007	16
50000000	8.7	12	5	7.126	10.222	4.061	10
Bisection
500000	49.8	53	45	0.134	0.201	0.065	6
1000000	49.4	53	43	0.274	0.409	0.135	4
10000000	49.8	53	47	2.851	4.021	1.538	1
50000000	50.0	53	46	14.283	20.306	7.665	1