scientific article; zbMATH DE number 431484
The application of finite difference methods to solve boundary value problems leads to a system of difference equations which are actually a system of linear algebraic equations. In many applications the dimension of such a system is big and its solution can be burdened with inaccuracy. In order to overcome these difficulties one constructs algorithms which reduce the dimension of the system. Such algorithms can be constructed using the idea of the multiple difference ranging. The authors describe algorithms which enable to obtain a banded, symmetric and positive definite matrix of coefficients of the system of algebraic equations and discuss some properties of the presented algorithms.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138252)