Checking if there exist a monotonic function that is consistent with the measurements: an efficient algorithm

DOI10.1007/s11155-005-6892-xzbMath1078.65531OpenAlexW2156798584MaRDI QIDQ2572920

Kavitha Tupelly, Karen Villaverde, Vladik Ya. Kreinovich

Publication date: 7 November 2005

Published in: Reliable Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11155-005-6892-x

zbMATH Keywords

parallel computationinterval uncertaintymonotonicity checking

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30) Parallel numerical computation (65Y05) Algorithms for approximation of functions (65D15)

Cites Work

• Computational complexity and feasibility of data processing and interval computations
• If we measure a number, we get an interval. What if we measure a function or an operator?
• ICTM: an interval tessellation-based model for reliable topographic segmentation
• A feasible algorithm for locating concave and convex zones of interval data and its use in statistics-based clustering
• Density Estimation and Bump-Hunting by the Penalized Likelihood Method Exemplified by Scattering and Meteorite Data
• From interval computations to modal mathematics
• Modal intervals
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Checking if there exist a monotonic function that is consistent with the measurements: an efficient algorithm