Pages that link to "Item:Q1103328"
From MaRDI portal
The following pages link to Complexity theory of numerical linear algebra (Q1103328):
Displaying 11 items.
- Computing the homology of real projective sets (Q667646) (← links)
- Wilkinson's bus: weak condition numbers, with an application to singular polynomial eigenproblems (Q827005) (← links)
- Average condition number for solving linear equations (Q1082774) (← links)
- Statistical complexity of dominant eigenvector calculation (Q1186505) (← links)
- Grid methods in computational real algebraic (and semialgebraic) geometry (Q1754715) (← links)
- Computational complexity of kernel-based density-ratio estimation: a condition number analysis (Q1945037) (← links)
- The asymptotic distribution of the condition number for random circulant matrices (Q2093404) (← links)
- Least singular value and condition number of a square random matrix with i.i.d. rows (Q2244514) (← links)
- Computing the homology of semialgebraic sets. I: Lax formulas (Q2291730) (← links)
- Average-case complexity without the black swans (Q2360669) (← links)
- Smooth analysis of the condition number and the least singular value (Q3160742) (← links)
