All Questions
1 question
6
votes
1
answer
762
views
What is the big-O complexity of solving the sparse Laplace equation in the plane?
In MATLAB, you can get a 2d Laplacian via A = delsq(numgrid('S',N)); yielding a matrix $A$ that is $n \times n$ with $n = O(N^2)$, for a square domain discretized ...
- 981