Abstract: Automated data processing of complex systems projection method

\nThe nigh developed method of answer problems within the mechanisation of information process in mingled information systems is ve lyki fragile systems of linear algebraical equations (RR SLE). But in practice, the development of alter data impact systems, which shall be dependant to analysis, there is a lawn that affects the development and insertion of algorithms and softw be for solve boundary-dynamic and multi-tomirnyh field problems that expire when solving entangled scientific applied science problems, pattern recognition, knowledge extraction, etc.. For this purpose it is demand to consider some(prenominal) the theoretical apology for the sampling methods and their practical implementation in view: request approximation response and the convergence of deliberation algorithms. Among the set of animate methods for solving a class of problems of this spare place labor methods. With its ample versatility as well - a number of advantages, projective techniqu es are gaining increasing popularity. [1] The most famous of them - its the Ritz and Galerkin methods [2]. Their engage [3] allows to approximate problems oblige important properties of the real boundary cherish problem, in particular, symmetry, unequivocal certainty teplytsevyh properties of matrices and others. For projection methods for solving a well-developed theory analyze of errors of approximate solutions.