Wikipedia

Neumann series

Also found in: Encyclopedia.

A Neumann series is a mathematical series of the form

where T is an operator and its k times repeated application. This generalizes the geometric series.

The series is named after the mathematician Carl Neumann, who used it in 1877 in the context of potential theory. The Neumann series is used in functional analysis. It forms the basis of the Liouville-Neumann series, which is used to solve Fredholm integral equations. It is also important when studying the spectrum of bounded operators.

Properties

Suppose that T is a bounded linear operator on the normed vector space X. If the Neumann series converges in the operator norm, then Id – T is invertible and its inverse is the series:

,

where is the identity operator in X. To see why, consider the partial sums

.

Then we have

This result on operators is analogous to geometric series in , in which we find that:

One case in which convergence is guaranteed is when X is a Banach space and |T| < 1 in the operator norm or is convergent. However, there are also results which give weaker conditions under which the series converges.

Example

Let be given by:

We need to show that C is smaller than unity in some norm. Therefore, we calculate:

Thus, we know from the statement above that exists.

The set of invertible operators is open

A corollary is that the set of invertible operators between two Banach spaces B and B' is open in the topology induced by the operator norm. Indeed, let S : BB' be an invertible operator and let T: BB' be another operator. If

|ST | < |S−1|−1,

then T is also invertible.

Since |Id – S−1T| < 1, the Neumann series Σ(Id – (S−1T))k is convergent. Therefore, we have

T−1S = (Id – (Id – S−1T))−1 = Σ(Id – (S−1T))k.

Taking the norms, we get

|T−1S| ≤ 1/(1 – |Id – (S−1T)|).

The norm of T−1 can be bounded by

Applications

The Neumann series has been used for linear data detection in massive multiuser multiple-input multiple-output (MIMO) wireless systems. Using a truncated Neumann series avoids computation of an explicit matrix inverse, which reduces the complexity of linear data detection from cubic to square.[1]

References

  1. ^ Wu, M.; Yin, B.; Vosoughi, A.; Studer, C.; Cavallaro, J. R.; Dick, C. (May 2013). "Approximate matrix inversion for high-throughput data detection in the large-scale MIMO uplink". IEEE International Symposium on Circuits and Systems (ISCAS): 2155–2158. doi:10.1109/ISCAS.2013.6572301. hdl:1911/75011.
  • Werner, Dirk (2005). Funktionalanalysis (in German). Springer Verlag. ISBN 3-540-43586-7.
This article is copied from an article on Wikipedia® - the free encyclopedia created and edited by its online user community. The text was not checked or edited by anyone on our staff. Although the vast majority of Wikipedia® encyclopedia articles provide accurate and timely information, please do not assume the accuracy of any particular article. This article is distributed under the terms of GNU Free Documentation License.

Copyright © 2003-2025 Farlex, Inc Disclaimer
All content on this website, including dictionary, thesaurus, literature, geography, and other reference data is for informational purposes only. This information should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional.