Premium
Locally constrained projections on grids
Author(s) -
Carey G. F.,
Bicken G.,
Carey V.,
Berger C.,
Sanchez J.
Publication year - 2001
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/1097-0207(20010130)50:3<549::aid-nme35>3.0.co;2-s
Subject(s) - lagrange multiplier , grid , discretization , finite element method , computation , mathematical optimization , saddle point , saddle , constraint (computer aided design) , mathematics , constraint algorithm , property (philosophy) , computer science , algorithm , geometry , mathematical analysis , engineering , philosophy , structural engineering , epistemology
A technique is formulated for projecting vector fields from one unstructured computational grid to another grid so that a constraint condition such as a conservation property holds at the cell or element level on the ‘receiving’ grid. The approach is based on ideas from constrained optimization and certain mixed or multiplier‐type finite element methods in which Lagrange multipliers are introduced on the elements to enforce the constraint. A theoretical analysis and estimates for the associated saddle‐point problem are developed and a new algorithm is proposed for efficient solution of the resulting discretized problem. In the algorithm a reduced Schur's complement problem is constructed for the multipliers and the projected velocity computation reduces to a post‐processing calculation. In some instances the reduced system matrix can be factored so that repeated projections involve little more than forward and backward substitution sweeps. Numerical tests with an element of practical interest demonstrate optimal rate of convergence for the projected velocities and verify the local conservation property to expected machine precision. A practical demonstration for environmental simulation of Florida Bay concludes the study. Copyright © 2001 John Wiley & Sons, Ltd.