Let’s consider elliptic problem (*) on the interval **[0, 1]**, with *Laplace operator*

On the ends of the interval we set the boundary condition **u(0) = u(1) = 0**.

Let’s subdivide our interval on **n** equal parts and apply finite differences schema with the step **h = 1/n**.

As a result, we receive the following 3-diagonal matrix

The vector of unknowns’ **u = (u _{j})_{j=0,…,n}** contains the values of unknown function

**u**from our equation (*) in the nodes

**x**of our 1-dimensional grid.

_{j}= j ∙ h, j = 0,…, n,
The right hand vector of the system of equations is the vector **(f _{j})_{j=0,…,n}** .
Its coordinates are the values of function

**f = f(x)**from the right-hand side of equation

**(*)**in the nodes of the grid

**x**.

_{j}, j = 0,…, n
Quantities **σ = (σ _{j})_{j=0,…,n}** , on the diagonal of this matrix, are the values of function

**σ = σ(x)**from equation

**(*)**in the nodes of the grid. If

**σ**is a constant (in particular if

**σ = 0**), then all numbers

**σ**, are equal to this constant.

_{j}, j = 0,…, n
Thus, in one-dimensional case the system of equations is quite simple.
And it is quite easy to solve this system of equations as soon as the matrix is so simple.
It especially simple, when **σ** is constant (for instance, zero).

As soon as the situation is so simple, there is no need to use our * Marlin Solver* here.