Random permutations using GEPP
From MaRDI portal
Cites work
- Average-case analysis of the Gaussian Elimination with Partial Pivoting
- Baxter permuton and Liouville quantum gravity
- CALU: A communication optimal LU factorization algorithm
- Complete pivoting growth of butterfly matrices and butterfly Hadamard matrices
- Complete pivoting growth of butterfly matrices and butterfly Hadamard matrices
- Descartes' rule of signs and the identifiability of population demographic models from genomic variation data
- Dimension and randomness in groups acting on rooted trees
- Distribution of the number of pivots needed using Gaussian elimination with partial pivoting on random matrices
- Distribution of the number of pivots needed using Gaussian elimination with partial pivoting on random matrices
- Factorizing complex symmetric matrices with positive definite real and imaginary parts
- Growth Factors of Random Butterfly Matrices and the Stability of Avoiding Pivoting
- Heights of butterfly trees
- High performance computing for computational science -- VECPAR 2014. 11th international conference, Eugene, OR, USA, June 30 -- July 3, 2014. Revised selected papers
- How to generate random matrices from the classical compact groups
- LAPACK Users' Guide
- Matrix models for beta ensembles
- Numerical stability in Gaussian elimination
- On spectral and numerical properties of random butterfly matrices
- On the linear independence of fractional powers of integers.
- On the longest increasing subsequence and number of cycles of butterfly permutations
- Permutons, meanders, and SLE-decorated Liouville quantum gravity
- Permutons, meanders, and SLE-decorated Liouville quantum gravity
- Random matrices
- Random Permutations -- A geometric point of view
- Statistical tables for biological, agricultural and medical research.
- The Brownian limit of separable permutations
- The Efficient Generation of Random Orthogonal Matrices with an Application to Condition Estimators
- The skew Brownian permuton: A new universality class for random constrained permutations
- The Subgroup Algorithm for Generating Uniform Random Variables
- Using Random Butterfly Transformations to Avoid Pivoting in Sparse Direct Methods
This page was built for publication: Random permutations using GEPP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7367925)