Yeah I think it make sense. Thank you again. 在2022年9月28日星期三 UTC+8 11:08:17<Wolfgang Bangerth> 写道：
> On 9/27/22 21:02, 'yy.wayne' via deal.II User Group wrote: > > > > Just one last question. So if I have the same problem coded in > real+imaginary > > or complex and solve with SparseDirect solver or Krylov subspace > methods. Will > > there be difference in time consumption (due to larger matirx / or > harder to > > solve complex arithmetic embedded in those solver)? > > For Krylov subspace methods, everything depends on the preconditioner and > it > is not possible to make general predictions without knowing what you want > to > use for the preconditioner. > > For SparseDirectUMFPACK, I suspect that using complex arithmetic is faster > than using separate real/imaginary components. By how much is something I > have > never measured -- you probably need to measure this yourself. It would not > greatly surprise me if it was faster by a factor of 4 or 6, but I don't > think > it should be a factor of 20 for example. > > Best > Wolfgang > > -- > ------------------------------------------------------------------------ > 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]. To view this discussion on the web visit https://groups.google.com/d/msgid/dealii/f6e6257b-33df-4e91-9bfb-bd3b05d1973dn%40googlegroups.com.
