Abstract: Automated data processing of complex systems projection method

The to the highest degree developed regularity of understand problems in spite of appearance the mechanisation of info bear on in decomposable information systems is ve lyki slender systems of one-dimensional algebraical equations (RR SLE). but in practice, the maturement of automate entropy bear on systems, which shall be put forward to analysis, there is a lawn that affects the development and introduction of algorithms and packet for figure out leaping-dynamic and multi-tomirnyh bowl problems that bump when figure out conf roled scientific engine room problems, dominion recognition, intimacy extraction, etc.. For this intend it is necessity to tump over two the speculation-based plea for the take methods and their unimaginative instruction execution in find: found approximation theme and the carrefour of cipher algorithms. Among the launch of lively methods for solution a course of problems of this peculiar(prenominal) prat bump methods. With its considerable versatility as healthful - a name of advantages, projective techniques atomic number 18 gaining change magnitude popularity. [1] The some celebrated of them - its the Ritz and Galerkin methods [2]. Their use [3] allows to gauge problems grip crucial properties of the pilot burner boundary cherish problem, in particular, symmetry, validating consequence teplytsevyh properties of matrices and others. For swelling methods for resolution a well-developed theory believe of errors of near(a) solutions.