Pages that link to "Item:Q3805780"
From MaRDI portal
The following pages link to The Probability That a Numerical Analysis Problem is Difficult (Q3805780):
Displayed 20 items.
- Additive preconditioning for matrix computations (Q846341) (← links)
- Smoothed analysis of complex conic condition numbers (Q864180) (← links)
- On the probability distribution of data at points in real complete intersection varieties (Q945919) (← links)
- A randomized Kaczmarz algorithm with exponential convergence (Q1027734) (← links)
- A note on the behavior of the randomized Kaczmarz algorithm of Strohmer and Vershynin (Q1040681) (← links)
- The geometry of ill-conditioning (Q1100848) (← links)
- Condition numbers of random matrices (Q1179026) (← links)
- Mysteries of mathematics and computation (Q1323030) (← links)
- A statistical analysis of the numerical condition of multiple roots of polynomials. (Q1416369) (← links)
- Linear programming, complexity theory and elementary functional analysis (Q1924066) (← links)
- Upper bounds on the distribution of the condition number of singular matrices (Q2484545) (← links)
- Efficient parallel factorization and solution of structured and unstructured linear systems (Q2486566) (← links)
- The numerical condition of univariate and bivariate degree elevated Bernstein polynomials (Q2490716) (← links)
- General formulas for the smoothed analysis of condition numbers (Q2499745) (← links)
- On the probability distribution of condition numbers of complete intersection varieties and the average radius of convergence of Newton's method in the underdetermined case (Q3433761) (← links)
- On the Distribution of a Scaled Condition Number (Q3987928) (← links)
- How Many Eigenvalues of a Random Matrix are Real? (Q4276527) (← links)
- Statistical Condition Estimation for Linear Systems (Q4389259) (← links)
- On the singular values of Gaussian random matrices (Q5932199) (← links)
- A study of Auchmuty's error estimate (Q5948885) (← links)