Jump to content

Domain reduction algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Jlwoodwa (talk | contribs) at 01:23, 27 March 2024 (tag as one source). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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

References

  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.