Two composition methods for solving certain systems of linear equations
The problem of solving the system of equations \(Ax=b\) is discussed, knowing that certain of its subsystems \(A^ 1x^ 1=b^ 1,...,A^ mx^ m=b^ m\) can be solved uniquely. Since these methods do not allow pivoting they usually may be less stable than classical methods. However, they are of particular interest for establishing computational methods for computing certain linear or quasilinear sequence transformations recursively. Two methods are presented and examples are given.
scientific article; zbMATH DE number 3907658