Actually I want to solve an equation as: A^T x = b. I already know A, how
should I get its transpose?
I note that there is a member function of SparseDirectUMFPACK solver:
void Tvmult (Vector<double>& dst, const Vector<double>& src),
which can fulfil my purpose, since this function multiplies with A^{-T},
i.e. it returns an approximate solution of *A^Tx = b.*
*But what if I want to use a gmres solver? I didn't find in the manual such
a function to get the transpose of a sparse matrix. can someone help me
out? Many thanks!*
--
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.
