A randomized algorithm for estimating the condition number of matrices
From MaRDI portal
Publication:5412972
zbMATH Open1299.65088MaRDI QIDQ5412972FDOQ5412972
Authors: Farshid Mehrdoust
Publication date: 28 April 2014
Recommendations
Markov chaineigenvaluesnumerical resultsrandomized algorithmcondition numberquasi-Monte Carlo methodlarge matrices
Monte Carlo methods (65C05) Numerical analysis or methods applied to Markov chains (65C40) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of matrix norms, conditioning, scaling (65F35) Conditioning of matrices (15A12)
Cited In (12)
- Estimating Extremal Eigenvalues and Condition Numbers of Matrices
- FORTRAN codes for estimating the one-norm of a real or complex matrix, with applications to condition estimation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generating extreme-scale matrices with specified singular values or condition number
- An investigation of feasible descent algorithms for estimating the condition number of a matrix
- Title not available (Why is that?)
- Efficient Monte Carlo option pricing under CEV model
- Title not available (Why is that?)
- A new data mining approach to predicting matrix condition numbers
- Componentwise Condition Numbers of Random Sparse Matrices
- Calculation and upper limit estimation for angle condition number of matrix
This page was built for publication: A randomized algorithm for estimating the condition number of matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5412972)