|
[Sponsors] |
May 14, 2001, 12:26 |
complex sparse matrix
|
#1 |
Guest
Posts: n/a
|
Hello, I expect to solve a large complex linear system, which is sparse and symetric but nonhermitian, what kind of numerical method work well for such a problem? I know that iterative method exist that deal with nonsymetric matrices (BiCG or GMRES), but are they really efficient? Which other method may I use? Thanks, Stephane
|
|
May 14, 2001, 14:15 |
Re: complex sparse matrix
|
#2 |
Guest
Posts: n/a
|
QMR perhaps. Usually BICGSTAB works well but the convergence depends a lot of the preconditioners. Algebraic multigrid (AMG) is an option although MG based on coarse discretizations (if you matric results from discretizing some type of conservation equations) would is a much better choice. Netlib has some routines that you can try out.
|
|
|
|
Similar Threads | ||||
Thread | Thread Starter | Forum | Replies | Last Post |
Force can not converge | colopolo | CFX | 13 | October 4, 2011 23:03 |
Sparse solver for block-diagonal matrix | alberto_cuoci | Main CFD Forum | 1 | July 5, 2011 07:37 |
C++ solver for Large sparse matrix! | sina_mech | Main CFD Forum | 7 | November 20, 2009 14:52 |
OpenFOAM version 1.6 details | lakeat | OpenFOAM Running, Solving & CFD | 42 | August 26, 2009 22:47 |
Sparse matrix | Takuya TSUJI | Main CFD Forum | 4 | May 9, 2001 19:07 |