Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
If I understand your question correctly: If you have a lot of points you want to check with the same polytope, you can put them into a matrix; computing AX>b*(1,1,1,1) batched together can potentially be faster because of matrix multiplication algorithms. But that's not online; maybe there's some online algorithm that can possibly take advantage of the same kind of speedup?
