Domain reduction algorithm
From Wikipedia, the free encyclopedia
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)
(Learn how and when to remove this message)
This article is an orphan, as no other articles introduce links to this page from related articles . (August 2024)
This article relies largely or entirely on a single source . Relevant discussion may be found on the talk page. Please help improve this article by introducing citations to additional sources.
Find sources: "Domain reduction algorithm" – news · newspapers · books · scholar · JSTOR (March 2024)
Find sources: "Domain reduction algorithm" – news · newspapers · books · scholar · JSTOR (March 2024)
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.
Stub icon
This computer-programming-related article is a stub. You can help Wikipedia by expanding it.