Pages that link to "Item:Q5944040"
From MaRDI portal
The following pages link to On the complexity of computing error bounds (Q5944040):
Displaying 15 items.
- Efficient and accurate computation of upper bounds of approximation errors (Q633637) (← links)
- On certain computable tests and componentwise error bounds (Q685872) (← links)
- Finding the orthogonal projection of a point onto an affine subspace (Q874996) (← links)
- On Koetter's algorithm and the computation of error values (Q1431617) (← links)
- Probabilistic condition number estimates for real polynomial systems. I: A broader family of distributions (Q1727980) (← links)
- On a generalized notion of mistake bounds (Q1854426) (← links)
- Highly accurate verified error bounds for Krylov type linear system solvers (Q1873165) (← links)
- Computing unrestricted synopses under maximum error bound (Q1939676) (← links)
- The average condition number of most tensor rank decomposition problems is infinite (Q2697393) (← links)
- Complexity estimates depending on condition and round-off error (Q3158534) (← links)
- Resource Bounded Frequency Computations with Three Errors (Q3511315) (← links)
- (Q4209111) (← links)
- Tight and Rigorous Error Bounds for Basic Building Blocks of Double-Word Arithmetic (Q4581373) (← links)
- New upper bounds on error exponents (Q4701290) (← links)
- Subspace Iteration Randomization and Singular Value Problems (Q5254699) (← links)