I believe that if Af = lufact(A) for sparse A then Af\b will give you what you want. The expression is parsed such that the transpose is not actually computed. Instead it calls the methods Ac_ldiv_B which calls the right solver in UMFPack.
Med venlig hilsen Andreas Noack 2014-09-12 9:55 GMT-04:00 Stéphane Mottelet <[email protected]>: > > Hello, > > How do you solve transpose(A)*x=b (without refactoring) when A is sparse > and has been factored ? UMFPack allows this in other implementations (e.g. > Scilab). > > Thanks for help > > S. >
