I would definitely use complex precision.
All direct sovler packages support complex, superlu, mumps and petsc.
Hong
On Sat, Dec 10, 2011 at 10:03 AM, Jack Poulson
wrote:
> Xiangdong,
>
> Nearly all of the time in a serial sparse-direct factorization goes into
> performing many different dense
Xiangdong,
Nearly all of the time in a serial sparse-direct factorization goes into
performing many different dense "frontal" factorizations. Efficient
implementations of dense LU factorization spend almost all of their time
within dense matrix-matrix multiplication, and complex matrix-matrix
mult
Hello everyone,
I am solving a complex linear system C x = d, where C= A+ iB (A, B are
real), in sparse-direct solver. So far, I use the real formulation by
solving the linear system [A, -B; B,A]. The reason we chose this
approach is to use the property of that the imaginary part B in our
problem
