Frobenius method

Short description: Method for solving ordinary differential equations

Some solutions of a differential equation having a regular singular point with indicial roots r=12 and −1.

In mathematics, the method of Frobenius, named after Ferdinand Georg Frobenius, is a way to find an infinite series solution for a second-order ordinary differential equation of the form z2u″+p(z)zu′+q(z)u=0 with u′≡dudz and u″≡d2udz2.

in the vicinity of the regular singular point z=0.

One can divide by z2 to obtain a differential equation of the form u″+p(z)zu′+q(z)z2u=0 which will not be solvable with regular power series methods if either p(z)/z or q(z)/z2 are not analytic at z = 0. The Frobenius method enables one to create a power series solution to such a differential equation, provided that p(z) and q(z) are themselves analytic at 0 or, being analytic elsewhere, both their limits at 0 exist (and are finite).

## Contents

* 1 History: Frobenius' Actual Contributions
* 2 Explanation of Frobenius Method: first, linearly independent solution
* 3 Example
* 4 "The exceptional cases": roots separated by an integer
* 4.1 Tandem Recurrence Relations for Series Coefficients in the Exceptional Cases
* 5 See also
* 6 External links
* 7 References

## History: Frobenius' Actual Contributions

Frobenius' contribution[1] was not so much in all the possible forms of the series solutions involved (see below). These forms had all been established earlier,[2] by Fuchs.[3][4] The indicial polynomial (see below) and its role had also been established by Fuchs.[2]

A first contribution by Frobenius to the theory was to show that - as regards a first, linearly independent solution, which then has the form of an analytical power series multiplied by an arbitrary power r of the independent variable (see below) - the coefficients of the generalized power series obey a recurrence relation, so that they can always be straightforwardly calculated.

A second contribution by Frobenius was to show that, in cases in which the roots of the indicial equation differ by an integer, the general form of the second linearly independent solution (see below) can be obtained by a procedure which is based on differentiation[5] with respect to the parameter r, mentioned above.

A large part of Frobenius' 1873 publication[1] was devoted to proofs of convergence of all the series involved in the solutions, as well as establishing the radii of convergence of these series.

## Explanation of Frobenius Method: first, linearly independent solution

The method of Frobenius is to seek a power series solution of the form u(z)=zr∑k=0∞Akzk,(A0≠0)

Differentiating: u′(z)=∑k=0∞(k+r)Akzk+r−1 u″(z)=∑k=0∞(k+r−1)(k+r)Akzk+r−2

Substituting the above differentiation into our original ODE: z2∑k=0∞(k+r−1)(k+r)Akzk+r−2+zp(z)∑k=0∞(k+r)Akzk+r−1+q(z)∑k=0∞Akzk+r=∑k=0∞(k+r−1)(k+r)Akzk+r+p(z)∑k=0∞(k+r)Akzk+r+q(z)∑k=0∞Akzk+r=∑k=0∞[(k+r−1)(k+r)Akzk+r+p(z)(k+r)Akzk+r+q(z)Akzk+r]=∑k=0∞[(k+r−1)(k+r)+p(z)(k+r)+q(z)]Akzk+r=[r(r−1)+p(z)r+q(z)]A0zr+∑k=1∞[(k+r−1)(k+r)+p(z)(k+r)+q(z)]Akzk+r=0

The expression r(r−1)+p(0)r+q(0)=I(r) is known as the indicial polynomial, which is quadratic in r. The general definition of the indicial polynomial is the coefficient of the lowest power of z in the infinite series. In this case it happens to be that this is the rth coefficient but, it is possible for the lowest possible exponent to be r − 2, r − 1 or, something else depending on the given differential equation. This detail is important to keep in mind. In the process of synchronizing all the series of the differential equation to start at the same index value (which in the above expression is k = 1), one can end up with complicated expressions. However, in solving for the indicial roots attention is focused only on the coefficient of the lowest power of z.

Using this, the general expression of the coefficient of zk \+ r is I(k+r)Ak+∑j=0k−1(j+r)p(k−j)(0)+q(k−j)(0)(k−j)!Aj,

These coefficients must be zero, since they should be solutions of the differential equation, so

I(k+r)Ak+∑j=0k−1(j+r)p(k−j)(0)+q(k−j)(0)(k−j)!Aj=0∑j=0k−1(j+r)p(k−j)(0)+q(k−j)(0)(k−j)!Aj=−I(k+r)Ak1−I(k+r)∑j=0k−1(j+r)p(k−j)(0)+q(k−j)(0)(k−j)!Aj=Ak

The series solution with Ak above, Ur(z)=∑k=0∞Akzk+r satisfies z2Ur(z)″+p(z)zUr(z)′+q(z)Ur(z)=I(r)zr

If we choose one of the roots to the indicial polynomial for r in Ur(z), we gain a solution to the differential equation. If the difference between the roots is not an integer, we get another, linearly independent solution in the other root.

## Example

Let us solve z2f″−zf′+(1−z)f=0

Divide throughout by z2 to give f″−1zf′+1−zz2f=f″−1zf′+(1z2−1z)f=0 which has the requisite singularity at z = 0\.

Use the series solution f=∑k=0∞Akzk+rf′=∑k=0∞(k+r)Akzk+r−1f″=∑k=0∞(k+r)(k+r−1)Akzk+r−2

Now, substituting ∑k=0∞(k+r)(k+r−1)Akzk+r−2−1z∑k=0∞(k+r)Akzk+r−1+(1z2−1z)∑k=0∞Akzk+r=∑k=0∞(k+r)(k+r−1)Akzk+r−2−1z∑k=0∞(k+r)Akzk+r−1+1z2∑k=0∞Akzk+r−1z∑k=0∞Akzk+r=∑k=0∞(k+r)(k+r−1)Akzk+r−2−∑k=0∞(k+r)Akzk+r−2+∑k=0∞Akzk+r−2−∑k=0∞Akzk+r−1=∑k=0∞(k+r)(k+r−1)Akzk+r−2−∑k=0∞(k+r)Akzk+r−2+∑k=0∞Akzk+r−2−∑k−1=0∞Ak−1zk−1+r−1=∑k=0∞(k+r)(k+r−1)Akzk+r−2−∑k=0∞(k+r)Akzk+r−2+∑k=0∞Akzk+r−2−∑k=1∞Ak−1zk+r−2={∑k=0∞((k+r)(k+r−1)−(k+r)+1)Akzk+r−2}−∑k=1∞Ak−1zk+r−2={(r(r−1)−r+1)A0zr−2+∑k=1∞((k+r)(k+r−1)−(k+r)+1)Akzk+r−2}−∑k=1∞Ak−1zk+r−2=(r−1)2A0zr−2+{∑k=1∞(k+r−1)2Akzk+r−2−∑k=1∞Ak−1zk+r−2}=(r−1)2A0zr−2+∑k=1∞((k+r−1)2Ak−Ak−1)zk+r−2

From (r − 1)2 = 0 we get a double root of 1. Using this root, we set the coefficient of zk \+ r − 2 to be zero (for it to be a solution), which gives us: (k+1−1)2Ak−Ak−1=k2Ak−Ak−1=0 hence we have the recurrence relation: Ak=Ak−1k2

Given some initial conditions, we can either solve the recurrence entirely or obtain a solution in power series form.

Since the ratio of coefficients Ak/Ak−1 is a rational function, the power series can be written as a generalized hypergeometric series.

## "The exceptional cases": roots separated by an integer

The previous example involved an indicial polynomial with a repeated root, which gives only one solution to the given differential equation. In general, the Frobenius method gives two independent solutions provided that the indicial equation's roots are not separated by an integer (including zero).

If the root is repeated or the roots differ by an integer, then the second solution can be found using: y2=Cy1ln⁡x+∑k=0∞Bkxk+r2 where y1(x) is the first solution (based on the larger root in the case of unequal roots), r2 is the smaller root, and the constant C and the coefficients Bk are to be determined. Once B0 is chosen (for example by setting it to 1) then C and the Bk are determined up to but not including Br1−r2, which can be set arbitrarily. This then determines the rest of the Bk. In some cases the constant C must be zero.

Example: consider the following differential equation (Kummer's equation with a = 1 and b = 2): zu″+(2−z)u′−u=0 The roots of the indicial equation are −1 and 0. Two independent solutions are 1/z and ez/z, so we see that the logarithm does not appear in any solution. The solution (ez−1)/z has a power series starting with the power zero. In a power series starting with z−1 the recurrence relation places no restriction on the coefficient for the term z0, which can be set arbitrarily. If it is set to zero then with this differential equation all the other coefficients will be zero and we obtain the solution 1/z.

### Tandem Recurrence Relations for Series Coefficients in the Exceptional Cases

In cases in which roots of the indicial polynomial differ by an integer (including zero), the coefficients of all series involved in second linearly independent solutions can be calculated straightforwardly from tandem recurrence relations.[5] These tandem relations can be constructed by further developing Frobenius' original invention of differentiating with respect to the parameter r, and using this approach to actually calculate the series coefficients in all cases.[5]

## See also

* Fuchs' theorem
* Regular singular point
* Laurent series

## External links

* Weisstein, Eric W.. "Frobenius Method". http://mathworld.wolfram.com/FrobeniusMethod.html.
* Teschl, Gerald (2012). Ordinary Differential Equations and Dynamical Systems. Providence: American Mathematical Society. ISBN 978-0-8218-8328-0. https://www.mat.univie.ac.at/~gerald/ftp/book-ode/. (Draft version available online at https://www.mat.univie.ac.at/~gerald/ftp/book-ode/). Chapter 4 contains the full method including proofs.

## References

1. ↑ 1.0 1.1 Frobenius, Ferdinand Georg (1968). "Uber die Integration der linearen Differentialgleichungen durch Reihen" (in German). Gesammelte Abhandlungen. Berlin: Springer-Verlag. pp. 84–105.
2. ↑ 2.0 2.1 Gray, Jeremy (1986). Linear Differential Equations and Group Theory from Riemann to Poincare. Boston: Birkhauser. ISBN 0-8176-3318-9.
3. ↑ Fuchs, Lazarus Immanuel (1865). "Zur Theorie der linearen Differentialgleichungen mit veranderlichen Coefficienten" (in German). Gesammelte Mathematische Werke von L. Fuchs. University Of Michigan Library.
4. ↑ Fuchs, Lazarus Immanuel (1866). "Zur Theorie der linearen Differentialgleichungen mit veranderlichen Coefficienten". Journal für die reine und angewandte Mathematik 66: 159–204.
5. ↑ 5.0 5.1 5.2 van der Toorn, Ramses (27 December 2022). "Tandem Recurrence Relations for Coefficients of Logarithmic Frobenius Series Solutions about Regular Singular Points" (in en). Axioms 12 (1): 32. doi:10.3390/axioms12010032. ISSN 2075-1680.

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Frobenius method. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Frobenius_method&oldid=210140"