I checked the asymptotic complexity of algorithm
found that it is O(N), where N is the number of cells in a mesh. Is it too
I heard about algorithms that produce mean asymptotic O(log(N)) or at least
O(square root (N))
The deal.II project is located at http://www.dealii.org/
For mailing list/forum options, see
You received this message because you are subscribed to the Google Groups
"deal.II User Group" group.
To unsubscribe from this group and stop receiving emails from it, send an email
For more options, visit https://groups.google.com/d/optout.