Subdivision Collocation Method for One-Dimensional Bratu’s Problem

Table 6

Comparison between absolute errors of (2) for case .

	By subdivision collection algorithm	By [25]	By [5]
0.0	0.00000000000200e − 4	0.000000000000000000	0.000000000000000000
0.1	1.78028999853849e − 4	1.521724399999999e − 2	2.129029899999996e − 3
0.2	2.98182579522244e − 4	1.467511560000001e − 2	4.209699400000017e − 3
0.3	4.00894362875881e − 4	5.887811600000015e − 3	6.186805800000028e − 3
0.4	4.69878760757103e − 4	3.246635400000031e − 3	8.001913999999999e − 3
0.5	4.93879501417605e − 4	6.985078600000028e − 3	9.599191999999979e − 3
0.6	4.69878760757159e − 4	3.246635400000031e − 3	1.092952429999999e − 2
0.7	4.00894362875992e − 4	5.887811600000015e − 3	1.193342070000003e − 2
0.8	2.98182579522410e − 4	1.467511560000001e − 2	1.237780840000000e − 2
0.9	1.78028999854057e − 4	1.521724399999999e − 2	1.087336650000000e − 2
1.0	0.00000000000017e − 4	0.000000000000000000	0.000000000000000000