Modular algorithm for reducing matrices to the Smith normal form
Copyright policy )Modular algorithm for reducing matrices to the Smith normal form
Abstract The paper gives a complete justification of the modular algorithm for reducing matrices to the Hermitian normal form, which enables one to construct a new modular algorithm for reducing to the Smith normal form that may simultaneously calculate the left matrix of the transformations. The main term in the estimate of the number of operations is 2( n 3 log D ), where n is the size and D is the determinant (or a multiple of it) of the matrix under consideration.
- Lomonosov Moscow State University Russian Federation
matrix transformation algorithm, normal forms of matrices, Canonical forms, reductions, classification, Other matrix algorithms, complexity of algorithms, Hermitian normal form, Smith normal form
matrix transformation algorithm, normal forms of matrices, Canonical forms, reductions, classification, Other matrix algorithms, complexity of algorithms, Hermitian normal form, Smith normal form
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!