Journal of Inequalities and Applications

Table 1 Comparisons of iteration numbers and cpu times

From: A two-level domain decomposition algorithm for linear complementarity problem

$n^{2}$	AS		SSN		TLDD
$n^{2}$	iter.	cpu	iter.	cpu	iter.	cpu
100	51	0.015	5	0.015	3	0.047
400	155	0.64	10	1.997	6	1.154
900	318	6.567	12	27.378	9	17.755
1,600	546	34.564	14	178.101	11	112.117

Back to article page