Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
Smith normal form
Description:
A diagonal canonical form of a matrix over a principal ideal domain, obtained through invertible row and column operations.
Related topics:
Polynomial and algebraic computation (17%),
Rings, Modules, and Algebras (13%),
Graph theory and applications (11%),
Advanced Combinatorial Mathematics (9%)
Wikidata ID:
wiki/Q7545384
OpenAlex ID:
keywords/smith-normal-form
Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
1979
·
Ravindran Kannan
, Achim Bachem
·
SIAM Journal on Computing
·
510
Computation with Finitely Presented Groups
1994
·
Charles C. Sims
·
Cambridge University Press eBooks
·
476
Linear-quadratic control: An introduction
1997
·
Ruth F. Curtain
·
Automatica
·
264
On the complexity of computing determinants
2005
·
Erich Kaltofen
, Gilles Villard
·
Computational Complexity
·
176
Near optimal algorithms for computing Smith normal forms of integer matrices
1996
·
Arne Storjohann
·
International Symposium on Symbolic and Algebraic Computation
·
162
Algorithms for the Solution of Systems of Linear Diophantine Equations
1982
·
Tsu-Wu J. Chou
, George E. Collins
·
SIAM Journal on Computing
·
143
Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer Matrix
1989
·
Costas S. Iliopoulos
·
SIAM Journal on Computing
·
136
Smith normal form in combinatorics
2016
·
Richard P. Stanley
·
Journal of Combinatorial Theory Series A
·
128
Smith normal form and Laplacians
2008
·
Dino Lorenzini
·
Journal of Combinatorial Theory Series B
·
124
PDF
Asymptotically Fast Triangularization of Matrices over Rings
1991
·
James L. Hafner
, Kevin S. McCurley
·
SIAM Journal on Computing
·
118
PDF
A finite group attached to the laplacian of a graph
1991
·
Dino J. Lorenzini
·
Discrete Mathematics
·
96
PDF
On Efficient Sparse Integer Matrix Smith Normal Form Computations
2001
·
Jean-Guillaume Dumas
, B. David Saunders
, et al.
·
Journal of Symbolic Computation
·
95
A q-analogue of the distance matrix of a tree
2006
·
R.B. Bapat
, A.K. Lal
, et al.
·
Linear Algebra and its Applications
·
81
PDF
Computing Simplicial Homology Based on Efficient Smith Normal Form Algorithms
2003
·
Jean-Guillaume Dumas
, Frank Heckenbach
, et al.
·
Springer eBooks
·
81
Algorithms for Hermite and Smith Normal Matrices and Linear Diophantine Equations
1971
·
Gordon H. Bradley
·
Mathematics of Computation
·
81
PDF
On the minors of an incidence matrix and its Smith normal form
1995
·
Jerrold W. Grossman
, Devadatta M. Kulkarni
, et al.
·
Linear Algebra and its Applications
·
78
Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices
1987
·
Erich Kaltofen
, M. S. Krishnamoorthy
, et al.
·
SIAM Journal on Algebraic and Discrete Methods
·
76
Parallel algorithms for matrix normal forms
1990
·
Erich Kaltofen
, M.S. Krishnamoorthy
, et al.
·
Linear Algebra and its Applications
·
72
The Smith normal form
1997
·
Morris Newman
·
Linear Algebra and its Applications
·
64
PDF
Integer-based constellation-shaping method for PAPR reduction in OFDM systems
2006
·
A. Mobasher
, A.K. Khandani
·
IEEE Transactions on Communications
·
56
On the worst-case complexity of integer Gaussian elimination
1997
·
Xin Gui Fang
, George Havas
·
International Symposium on Symbolic and Algebraic Computation
·
54
PDF
Abelian realization of phenomenological two-zero neutrino textures
2014
·
R. González Felipe
, H. Serôdio
·
Nuclear Physics B
·
53
Filling anomaly for general two- and three-dimensional C4 symmetric lattices
2021
·
Yuan Fang
, Jennifer Cano
·
Physical review. B./Physical review. B
·
46
PDF
Computing Hermite and Smith normal forms of triangular integer matrices
1998
·
Arne Storjohann
·
Linear Algebra and its Applications
·
45
Integer Matrix Diagonalization
1997
·
GEORGE HAVAS
, BOHDAN S. MAJEWSKI
·
Journal of Symbolic Computation
·
43
Show more works
View as search
Works count:
647
Citation count:
6,377
Year
Topic
Type