Jump to content

Domain reduction algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Koustuvcse (talk | contribs) at 09:53, 24 January 2015 (created article with fact and reference). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Domain reduction algorithms are algorithm used to reduce constraints and degrees of freedom in order to provide solutions for partial differential equations.[1]

  1. ^ Chan, Tony F. "Introduction". Third International Symposium on Domain Decomposition Methods for Partial Differential Equations. SIAM. p. xv. ISBN 978-0-89871-253-7. Retrieved 24 January 2015.