Fast algorithm for computing the upper endpoint of sample variance for interval data: Case of sufficiently accurate measurements
From MaRDI portal
Publication:2490454
DOI10.1007/S11155-006-2965-8zbMath1088.65008OpenAlexW2150536490MaRDI QIDQ2490454
Publication date: 2 May 2006
Published in: Reliable Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11155-006-2965-8
Related Items (3)
Toward a definition and understanding of correlation for variables constrained by random relations ⋮ Towards combining probabilistic and interval uncertainty in engineering calculations: algorithms for computing statistics under interval uncertainty, and their computational complexity ⋮ Population variance under interval uncertainty: a new algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Grouping bounds for inequality measures under alternative informational assumptions
- Towards combining probabilistic and interval uncertainty in engineering calculations: algorithms for computing statistics under interval uncertainty, and their computational complexity
- Rigorous global search: continuous problems
- Exact bounds on finite populations of interval data
- Numerical Software with Result Verification
This page was built for publication: Fast algorithm for computing the upper endpoint of sample variance for interval data: Case of sufficiently accurate measurements