Efficient generation of random nonsingular matrices

DOI10.1002/RSA.3240040108MaRDI QIDQ4034712zbMATH OpenOpenAlexFDO

Authors Dana Randall

Publication date 16 May 1993

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/rsa.3240040108

zbMATH Keywords

algorithmfinite fieldgeneration of random nonsingular matricesnonsingularrandom matrix

Mathematics Subject Classification ID

Matrices over special rings (quaternions, finite fields, etc.) (15B33) Random matrices (algebraic aspects) (15B52)

Recommendations

• scientific article; zbMATH DE number 1545673
• The probability of a rational random matrix to be nonsingular
• Singularity probabilities for random matrices over finite fields
• On the singularity of random combinatorial matrices
• scientific article; zbMATH DE number 4057695

Cited in

(11)

• Self-testing/correcting with applications to numerical problems
• Code generator matrices as RNG conditioners
• Time and space efficient generators for quasiseparable matrices
• Testing of random matrices
• A finite presentation of CNOT-dihedral operators
• Generation of Random Orthogonal Matrices
• Using randomization to make recursive matrix algorithms practical
• Take your MEDS: digital signatures from matrix code equivalence
• Secure multi-party linear algebra with perfect correctness
• Computer algebra tales on Goppa codes and McEliece cryptography
• How to generate random matrices from the classical compact groups

This page was built for publication: Efficient generation of random nonsingular matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4034712)