Domain reduction algorithm: Difference between revisions
Content deleted Content added
Koustuvcse (talk | contribs) added references section |
|||
| (5 intermediate revisions by 3 users not shown) | |||
| Line 1: | Line 1: | ||
{{Multiple issues| |
|||
| ⚫ | '''Domain reduction algorithm'''s are |
||
{{Orphan|date=August 2024}} |
|||
{{one source |date=March 2024}} |
|||
}} |
|||
| ⚫ | '''Domain reduction algorithm'''s are algorithms 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=https://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== |
==References== |
||
{{reflist}} |
{{reflist}} |
||
[[Category:Algorithms]] |
|||
{{compu-prog-stub}} |
|||
Latest revision as of 07:06, 10 August 2024
 | This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages)
|
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]- ^ 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.
 | This computer-programming-related article is a stub. You can help Wikipedia by expanding it. |