Domain reduction algorithm: Difference between revisions
Content deleted Content added
Koustuvcse (talk | contribs) created article with fact and reference |
Koustuvcse (talk | contribs) added references section |
||
| Line 1: | Line 1: | ||
'''Domain reduction algorithm'''s are algorithm used to reduce constraints and degrees of freedom in order to provide solutions for [[partial differential equations]].<ref name="Chan">{{cite book|last=Chan|first=Tony F.|title=Third International Symposium on Domain Decomposition Methods for Partial Differential Equations|url=http://books.google.com/books?id=_GJ1DXrAyJ8C&pg=PA199|accessdate=24 January 2015|publisher=SIAM|isbn=978-0-89871-253-7|page=xv|chapter=Introduction}}</ref> |
'''Domain reduction algorithm'''s are algorithm used to reduce constraints and degrees of freedom in order to provide solutions for [[partial differential equations]].<ref name="Chan">{{cite book|last=Chan|first=Tony F.|title=Third International Symposium on Domain Decomposition Methods for Partial Differential Equations|url=http://books.google.com/books?id=_GJ1DXrAyJ8C&pg=PA199|accessdate=24 January 2015|publisher=SIAM|isbn=978-0-89871-253-7|page=xv|chapter=Introduction}}</ref> |
||
==References== |
|||
{{reflist}} |
|||
Revision as of 09:55, 24 January 2015
Domain reduction algorithms are algorithm used to reduce constraints and degrees of freedom in order to provide solutions for partial differential equations.[1]
References
- ^ 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.