Matrix computations using quasirandom sequences
algorithmsconvergenceextreme eigenvaluesMarkov chainsmatrix-vector productsMonte Carlo methodnumerical testspseudorandom numbersquasirandom numberssparse matricessystems of linear algebraic equations
Computational methods in Markov chains (60J22) Monte Carlo methods (65C05) Random number generation in numerical analysis (65C10) Numerical analysis or methods applied to Markov chains (65C40) Iterative numerical methods for linear systems (65F10) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Computational methods for sparse matrices (65F50)
- Quasirandom sequences in random process simulation algorithms
- Monte Carlo method for estimating eigenvalues using error balancing
- Time and space efficient generators for quasiseparable matrices
- On Monte Carlo and quasi-Monte Carlo for matrix computations
- scientific article; zbMATH DE number 4066203 (Why is no real title available?)
- Solving systems of linear algebraic equations using quasirandom numbers
- A parallel quasi-Monte Carlo method for computing extremal eigenvalues
- Methods for generating random orthogonal matrices
- Fast QMC matrix-vector multiplication
- Atomic and molecular calculations using quasirandom numbers
- A resolvent quasi-Monte Carlo method for estimating the minimum eigenvalues using the error balancing
This page was built for publication: Matrix computations using quasirandom sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2724541)