Jump to content

Domain reduction algorithm

From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by Josve05a (talk | contribs) at 07:06, 10 August 2024 (top: added orphan tag). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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

References

[edit]
  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.