Yes, I will do that. I could either enhance the introduction, or write a new
paragraph in the 'Possibilities for extensions' sections. I guess the latter
option would be the better one.
Either would be great!
I could provide a code snippet on how to check for positivity preservation,
but for that I need a way to access the non-diagonal entries of a
SparseMatrix. Do you have an idea on how to do it in a fast way?
You can create an iterator to the elements of a matrix row. Would that do what
you need?
Best
W.
--
------------------------------------------------------------------------
Wolfgang Bangerth email: [email protected]
www: http://www.math.colostate.edu/~bangerth/
--
The deal.II project is located at http://www.dealii.org/
For mailing list/forum options, see
https://groups.google.com/d/forum/dealii?hl=en
---
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
to [email protected].
For more options, visit https://groups.google.com/d/optout.
