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

Table 10

Weakly correlated test for root-finding algorithms.

Dimension	Iterations			Time (sec)			Error
	Avg	Max	Min	Avg	Max	Min	—
FPA2
500000	5.2	8	4	0.016	0.017	0.015	0
1000000	5.2	9	4	0.033	0.038	0.031	0
10000000	5.2	10	3	0.343	0.411	0.306	0
50000000	5.3	7	4	1.685	1.829	1.574	0
Regula falsi
500000	14.9	94	4	0.088	0.240	0.048	5
1000000	12.8	39	6	0.166	0.277	0.109	6
10000000	12.7	72	6	1.757	4.307	1.043	5
50000000	12.3	29	5	9.087	15.780	5.568	7
Secant
500000	8.7	15	5	0.066	0.096	0.047	13
1000000	9.1	16	6	0.134	0.212	0.100	13
10000000	9.1	12	7	1.413	1.814	1.071	14
50000000	9.0	11	6	7.054	10.166	5.133	18
Bisection
500000	50.1	53	43	0.128	0.196	0.066	4
1000000	49.5	53	46	0.254	0.408	0.138	4
10000000	49.7	53	45	2.760	4.080	1.549	3
50000000	50.3	53	46	14.097	20.289	8.536	7