do you have a good suggestion if an iterative solver would be faster.
This jacobian J with ( N = 32 ) took me around 1s of solving this equation x=J\y. The matrix is saved as sparse, and the density is around 3%.
( For N=64 the density ia about 1,6% and solving that matrix cost me about 50s. So the scaling is really bad)
The Dimensions of this matrix J are scaling with (3*(N+1)^2+(N-1)^2,3*(N+1)^2+(N-1)^2).
my desired N will be in the order of 128- 192.