Domain reduction algorithm

From Wikipedia, the free encyclopedia

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.