A robust two-level incomplete factorization for (Navier-)Stokes saddle point matrices

Mathematics – Numerical Analysis

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

27 pages

Scientific paper

We present a new hybrid direct/iterative approach to the solution of a special class of saddle point matrices arising from the discretization of the steady incompressible Navier-Stokes equations on an Arakawa C-grid. The two-level method introduced here has the following properties: (i) it is very robust, even close to the point where the solution becomes unstable; (ii) a single parameter controls fill and convergence, making the method straightforward to use; (iii) the convergence rate is independent of the number of unknowns; (iv) it can be implemented on distributed memory machines in a natural way; (v) the matrix on the second level has the same structure and numerical properties as the original problem, so the method can be applied recursively; (vi) the iteration takes place in the divergence- free space, so the method qualifies as a 'constraint preconditioner'; (vii) the approach can also be applied to Poisson problems. This work is also relevant for problems in which similar saddle point matrices occur, for instance when simulating electrical networks, where one has to satisfy Kirchhoff's conservation law for currents.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A robust two-level incomplete factorization for (Navier-)Stokes saddle point matrices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A robust two-level incomplete factorization for (Navier-)Stokes saddle point matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A robust two-level incomplete factorization for (Navier-)Stokes saddle point matrices will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-40341

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.