|
This article is cited in 3 scientific papers (total in 3 papers)
Solution of equations by the sequential grouping method and its optimization
S. V. Polin Academy of Cryptography of Russian Federation, Moscow
Abstract:
A general model of a class of algorithms for the solution of equations and systems of nonlinear equations is constructed. These algorithms are performed in several steps consisting in grouping of unknowns, testing and possible elimination of such groups. An approach for choosing the optimal algorithm is suggested.
Key words:
systems of nonlinear equations, grouping method, lattice representations.
Received 11.X.2010
Citation:
S. V. Polin, “Solution of equations by the sequential grouping method and its optimization”, Mat. Vopr. Kriptogr., 3:1 (2012), 97–123
Linking options:
https://www.mathnet.ru/eng/mvk50https://doi.org/10.4213/mvk50 https://www.mathnet.ru/eng/mvk/v3/i1/p97
|
Statistics & downloads: |
Abstract page: | 466 | Full-text PDF : | 244 | References: | 79 |
|