Which version of Julia are you using? Please do provide a test case to generate Af and b, so that I can try reproduce it.
-viral On Monday, September 15, 2014 2:00:11 PM UTC+5:30, Stéphane Mottelet wrote: > > Hello, > > It seems that it does not work as you said : > > *julia> (A**f)'\b* > > *ERROR: stack overflow* > > * in Ac_ldiv_B! at linalg/umfpack.jl:354 (repeats 80000 times)* > > In order to motivate my needs, I have to solve both systems, one with A > and the other one with transpose(A). > > > S. > > > > Le vendredi 12 septembre 2014 17:43:50 UTC+2, Andreas Noack a écrit : >> >> 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 <stephane...@free.fr>: >> >>> >>> 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. >>> >> >>
