Pages that link to "Item:Q5944040"
From MaRDI portal
The following pages link to On the complexity of computing error bounds (Q5944040):
Displaying 4 items.
- Finding the orthogonal projection of a point onto an affine subspace (Q874996) (← links)
- Probabilistic condition number estimates for real polynomial systems. I: A broader family of distributions (Q1727980) (← links)
- Highly accurate verified error bounds for Krylov type linear system solvers (Q1873165) (← links)
- The average condition number of most tensor rank decomposition problems is infinite (Q2697393) (← links)
