Degeneration of structured integer matrices modulo an integer
From MaRDI portal
Publication:947675
DOI10.1016/j.laa.2008.06.020zbMath1155.65025OpenAlexW2149432192MaRDI QIDQ947675
Publication date: 6 October 2008
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2008.06.020
numerical examplessymbolic computationrandom matricesinteger matricesToeplitz matricesHankel matricesrational matricesstructured matricesmatrix inverse modulo an integer
Computational methods for sparse matrices (65F50) Symbolic computation and algebraic computation (68W30) Random matrices (algebraic aspects) (15B52) Direct numerical methods for linear systems and matrix inversion (65F05) Matrices of integers (15B36)
Related Items
Numerically safe Gaussian elimination with no pivoting, Randomized preprocessing versus pivoting, Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization, Randomized preprocessing of homogeneous linear systems of equations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Symbolic-numeric computation. Invited and contributed presentations given at the international workshop (SNC 2005), Xi'an, China, July 19--21 (2005)
- Determinants and ranks of random matrices over \({\mathbb{Z}}_ m\)
- Asymptotically fast solution of Toeplitz and related systems of linear equations
- Exact solution of linear equations using p-adic expansions
- A probabilistic remark on algebraic program testing
- Decoding interleaved Reed-Solomon codes over noisy channels
- Approximate formulas for some functions of prime numbers
- The distribution of prime numbers
- Distribution of Bordered Persymmetric Matrices in a Finite Field.
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- A bibliography on semiseparable matrices
