Abstract.We discuss the construction of finite difference schemes for the two-point nonlinear boundary value problem: y~2,o +f (x, y) = 0, y12~ (a) = A 2j, yC2j~ (b) = Bzj, j = 0(1)n -1, n > 2. In the case of linear differential equations, these finite difference schemes lead to [2n+ 1)-diagonal linear systems. We consider in detailmethods of orders two, four and six for twopoint boundary value problems involving a fourth order differential equation; convergence of these methods is established and illustrated by numerical examples.

Summary. We discuss the construction of three-point finite difference approximations and their convergence for the class of singular two-point boundary value problems: (x~y')'=f(x,y), y(0)=A, y(1)=B, 0

Automata theory is an important subject in computer science and quite consequently, simulation of automata for pedagogical purposes is an important topic in computer science education research. This article reviews the major initiatives in the field of simulation of automata in the last five decades with emphasis on those automata simulators actually used at universities for teaching. A classification of the automata simulators on the basis of their design paradigms has been developed where they have been classified broadly into language based automata simulators and visualization centric automata simulators. Some salient trends in the research on simulation of automata are also identified. The article concludes with an advocacy for continuing research on simulation of automata and integration of automata simulators in teaching.

No abstract

No abstract