z-logo
Premium
Divergence preserving reconstruction of the nodal components of a vector field from its normal components to edges
Author(s) -
Liska Richard,
Shashkov Mikhail
Publication year - 2016
Publication title -
international journal for numerical methods in fluids
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.938
H-Index - 112
eISSN - 1097-0363
pISSN - 0271-2091
DOI - 10.1002/fld.4289
Subject(s) - vector field , divergence (linguistics) , vector projection , lagrange multiplier , mathematics , projection (relational algebra) , cartesian coordinate system , direction vector , vector valued function , vector potential , normal , mathematical analysis , algorithm , mathematical optimization , geometry , surface (topology) , physics , philosophy , linguistics , quantum mechanics , magnetic field
Summary We have developed a new divergence preserving method for the reconstruction of the Cartesian components of a vector field from the orthogonal projection of a vector field to the normals to edges in two dimensional. In this method, discrete divergences computed from the nodal components and from the normal ones are exactly the same. Our new method consists of two stages. At the first stage, we use an extended version of the local procedure described in [ J. Comput. Phys. , 139 :406–409, 1998] to obtain a ‘reference’ nodal vector. This local procedure is exact for linear vector fields; however, the discrete divergence is not preserved. Then, we formulate a constrained optimization problem, in which this reference vector plays the role of a target, and the divergence constraints are enforced by using Lagrange multipliers. It leads to the solution of ‘elliptic’ like discrete equations for the cell‐centered Lagrange multipliers. The new global divergence preserving method is exact for linear vector fields. We describe all details of our new method and present numerical results, which confirm our theory. Copyright © 2016 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here