Collocation method: Difference between revisions

Content deleted Content added
No edit summary
Tag: extraneous markup
Undid revision 877392126 by 2001:250:4000:4118:7096:1CD9:6C33:2B0E rmv empty ref tags
Line 1:
In mathematics, a '''collocation method''' is a method for the [[numerical analysis|numerical]] solution of [[ordinary differential equation]]s, [[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 ==
 
Suppose that the [[ordinary differential equation]]
:<math> y'(t) = f(t,y(t)), \quad y(t_0)=y_0, </math>
Line 62 ⟶ 64:
 
{{DEFAULTSORT:Collocation Method}}
[[Category:Numerical differential equations]]≠<ref></ref>