Sure! Here's a clearer and more polished version of your message: Hello everyone, I'm struggling with my code because every approach I try seems to result in some kind of error. Let me explain my problem: I have an iterative system, and in each iteration, I need to find the solution to the inequality A * x ≤ b, where: A is a 6×2 matrix b is a 6×1 vector x should have two solutions, but I'm primarily interested in the range of these solutions, i.e., [x₁_low, x₁_up] and [x₂_low, x₂_up]. The part that's really tripping me up is that I need to intersect the solution from iteration i-1 with the current solution at iteration i. Essentially, I'm solving a set membership estimation (SME) problem. Could anyone help me with this? I would really appreciate it! I used an approach suggested by a user on this platform a long time ago. It works well, but the problem arises when it comes to finding the intersection of the solutions across iterations. The issue is that, with this approach, each iteration is treated as an independent problem, separate from the next one. However, what I need is a way to propagate and intersect the solution from iteration (i-1) with the current iteration (i) to maintain consistency over time. I'm not sure how to implement this intersection step correctly. Any guidance or suggestions would be greatly appreciated! Continue reading...
