New answers tagged iterative-method
2
Most of this was already discussed in the comments, but I would like to elaborate and put a detailed answer.
There are no elementary characteristics (definiteness, symmetry, bandwidth) which can tell you whether the underlying (mixed or not) FEM/FVM is stable to solve the continuous problem. You can not tell anything about that just by looking at those ...
0
Assume that $y$ is not in the polyhedron (it is easy to check whether it is, and we know that the distance is zero in that case). If $y$ is outside then the closest point will be on the surface of the polyhedron.
So I came up with the following (horrible) algorithm, which will give you an upper bound. Let $y^0=y$.
Find distance of point $y^n$ to all planes $...
1
This answer is a bit late, but I was trying to implement the code you wrote and I found some issues.
You have not implemented the Lanczos algorithm correctly. The diagonalized matrix, $T$, itself is correct. So when you try and find the eigenvalues you obtain from the diagonalized matrix they are correct, but the matrix $V$ is not correct.The matrix $V$ is ...
Top 50 recent answers are included
