How to find the matlab interp1 computational complexity?
6 次查看(过去 30 天)
显示 更早的评论
Hi,
I am trying find the computational complexity of interp1 with 'linear', and "cubic". Can I get some help regarding this?
I am thinking it is O(n) and O(n^3). Are these correct?
1 个评论
Bruno Luong
2023-10-26
"Are these correct?"
No, O(n^3) is completely off (over estimated), see my answer. Also you don't tell what n is.
采纳的回答
Bruno Luong
2023-10-26
编辑:Bruno Luong
2023-10-26
If N is the number of data points (x, y), M is the query points (xq)
interp1(x, y, xq, ...)
has complexity of O(M*log(N)) for all methods, if x is sorted.
Essentially it is the time of query where xq are located in subintervals. Time of interpolation value are constant per point even for spline method.
If x is not sorted then you need to add log(N) of sorting but then the O notation remains the same
6 个评论
Bruno Luong
2023-10-31
编辑:Bruno Luong
2023-10-31
doesn't matter for O notation, since log 10, log 2 theirs inverse are constants
更多回答(0 个)
另请参阅
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!