Collocation method: Difference between revisions

Content deleted Content added
No edit summary
Line 1:
In mathematics, a '''collocation method''' is a method for the [[numerical analysis|numerical]] solution of [[ordinary differential equation]] and [[partial differential equation]]s and [[integral equation]]s. The idea is to choose a finite-dimensional space of candidate solutions (usually, [[polynomial]]s up to a certain degree) and a number of points in the ___domain (called ''collocation points''), and to select that solution which satisfies the given equation at the collocation points.
 
== Ordinary differential equations ==