“Collocation method”的意思、由来-开放百科全书

词条

Collocation method

释义

Ordinary differential equations
Example: The trapezoidal rule Other examples
Notes
References

In mathematics, a collocation method is a method for the numerical solution of ordinary differential equations, partial differential equations and integral equations. The idea is to choose a finite-dimensional space of candidate solutions (usually polynomials 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

is to be solved over the interval . Choose from 0 ≤ c₁< c₂< … < c_n ≤ 1.

The corresponding (polynomial) collocation method approximates the solution y by the polynomial p of degree n which satisfies the initial condition , and the differential equation

at all collocation points for . This gives n + 1 conditions, which matches the n + 1 parameters needed to specify a polynomial of degree n.

All these collocation methods are in fact implicit Runge–Kutta methods. The coefficients c_k in the Butcher tableau of a Runge–Kutta method are the collocation points. However, not all implicit Runge–Kutta methods are collocation methods.

^[1]

Example: The trapezoidal rule

Pick, as an example, the two collocation points c₁ = 0 and c₂ = 1 (so n = 2). The collocation conditions are

There are three conditions, so p should be a polynomial of degree 2. Write p in the form

to simplify the computations. Then the collocation conditions can be solved to give the coefficients

The collocation method is now given (implicitly) by

where y₁ = p(t₀ + h) is the approximate solution at t = t₀ + h.

This method is known as the "trapezoidal rule" for differential equations. Indeed, this method can also be derived by rewriting the differential equation as

and approximating the integral on the right-hand side by the trapezoidal rule for integrals.

Other examples

The Gauss–Legendre methods use the points of Gauss–Legendre quadrature as collocation points. The Gauss–Legendre method based on s points has order 2s.^[2] All Gauss–Legendre methods are A-stable.^[3]

In fact, one can show that the order of a collocation method corresponds to the order of the quadrature rule that one would get using the collocation points as weights.

Notes

1. ^{{harvnb|Ascher|Petzold|1998}}; {{harvnb|Iserles|1996|pp=43–44}}
2. ^{{harvnb|Iserles|1996|pp=47}}
3. ^{{harvnb|Iserles|1996|pp=63}}

References

{{Citation | last1=Ascher | first1=Uri M. | last2=Petzold | first2=Linda R. |author2-link=Linda Petzold| title=Computer Methods for Ordinary Differential Equations and Differential-Algebraic Equations | publisher=Society for Industrial and Applied Mathematics | location=Philadelphia | isbn=978-0-89871-412-8 | year=1998}}.
{{Citation | last1=Hairer | first1=Ernst | last2=Nørsett | first2=Syvert Paul | last3=Wanner | first3=Gerhard | title=Solving ordinary differential equations I: Nonstiff problems | publisher=Springer-Verlag | location=Berlin, New York | isbn=978-3-540-56670-0 | year=1993}}.
{{Citation | last1=Iserles | first1=Arieh | author1-link=Arieh Iserles | title=A First Course in the Numerical Analysis of Differential Equations | publisher=Cambridge University Press | isbn=978-0-521-55655-2 | year=1996}}.

1 : Numerical differential equations

随便看

开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。