RUS  ENG
Full version
JOURNALS // Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] // Archive

Mat. Vopr. Kriptogr., 2012 Volume 3, Issue 1, Pages 97–123 (Mi mvk50)

This article is cited 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.

UDC: 519.16+519.615.5+519.712

Received 11.X.2010

DOI: 10.4213/mvk50



© Steklov Math. Inst. of RAS, 2024