INVESTIGATION OF ALGORITHMS FOR ORDERING THE COEFFICIENTS OF SYSTEMS OF LINEAR ALGEBRAIC EQUATIONS IN COMPUTER VISION PROBLEMS
The article describes the procedure of solving the large systems of linear algebraic equations with sparse matrixes in computer vision. The efficiency of three algorithms for images ordering leading to the increase of the system sparseness is investigated by the author of the article. He also suggested modification of the nested dissection algorithm for image sets with irregular connections.
Keywords: system of linear algebraic equations, least squares, nested dissection, parallel sections, filling of the matrix, sparse matrix.
