Orthogonal functions: Difference between revisions

Revision as of 18:08, 3 March 2018

Latest revision as of 05:51, 24 December 2024

(24 intermediate revisions by 19 users not shown)

Line 1:

{{Short description|Type of function}}

In [[mathematics]], '''orthogonal functions''' belong to a [[function space]] whichthat is a [[vector space]] thatequipped haswith a [[bilinear form]]. When the function space has an [[interval (mathematics)|interval]] as the [[___domain of a function|___domain]], the bilinear form may be the [[integral]] of the product of functions over the interval:

:<math> \langle f,g\rangle = \int \overline{f(x)}g(x)\,dx .</math>

The functions <math>f</math> and <math>g</math> are [[bilinear form#Reflexivity and orthogonalityOrthogonality_(mathematics)|orthogonal]] when this integral is zero:, i.e. <math>\langle f, \, g \rangle = 0.</math> whenever <math>f \neq g</math>. As with a [[basis (linear algebra)|basis]] of vectors in a finite-dimensional space, orthogonal functions can form an infinite basis for a function space. Conceptually, the above integral is the equivalent of a vector [[dot product]]; two vectors are mutually independent (orthogonal) if their dot-product is zero.

As with a [[basis (linear algebra)|basis]] of vectors in a finite-dimensional space, orthogonal functions can form an infinite basis for a function space.

Suppose <math> \{ f_n \}f_0, n = 0, 1, 2f_1, \ldots\}</math> is a sequence of orthogonal functions. Ifof nonzero [[L2-norm|''L''<mathsup>f_n2</mathsup>-norm]]s has<math positivedisplay="inline"> [[support\left\| (mathematics)f_n \right\|support]] then_2 = <math>\sqrt{\langle f_n, f_n \rangle} = \left(\int f_n ^2 \ dx =\right) m_n^\frac{1}{2} </math>. is theIt [[L2-norm|''L''₂-norm]]follows of <math>f_n</math>, andthat the sequence <math>\left\{ f_n / \fracleft\| {f_n}{m_n} \right\| _2 \right\}</math> hasis of functions of ''L''<subsup>2</subsup>-norm one, forming an [[orthonormal sequence]]. The possibilityTo thathave ana integraldefined is''L''²-norm, unboundedthe integral must be avoidedbounded, hencewhich attentionrestricts isthe restrictedfunctions to being [[square-integrable function|square-integrable]]s.

==Trigonometric functions==

{{Main article|Fourier series|Harmonic analysis}}

Several sets of orthogonal functions have become standard bases for approximating functions. For example, the sine functions, {{nowrap|sin ''nx''}} and {{nowrap|sin ''mx'',}} are orthogonal on the interval <math>x \in (-π\pi, π\pi),</math> ifwhen <math>m \neq n</math> and ''mn'' ≠and ''nm'' are positive integers. For then

:<math>2 \sin \left(mx\right) \sin \left(nx\right) = \cos \left(\left(m - n\right)x\right) - \cos \left(\left(m+n\right) x\right), </math>

so thatand the integral of the product of the two sinessine functions vanishes.<ref>[[Antoni Zygmund]] (1935) ''[[Trigonometric Series|Trigonometrical Series]]'', page 6, Mathematical Seminar, University of Warsaw</ref> Together with cosine functions, these orthogonal functions may be assembled into a [[trigonometric polynomial]] to approximate a given function on the interval with its [[Fourier series]].

==Polynomials==

{{main article|Orthogonal polynomials}}

If one begins with the [[monomial]] sequence <math> \left\{1, ''x'', ''x''^{^2}, ...\dots\right\} ''x''<sup>n</supmath> ...}on the oninterval <math>[–1-1, 1]</math> and applies the [[Gram-SchmidtGram–Schmidt process]], then one obtains the [[Legendre polynomial]]s. Another collection of orthogonal polynomials are the [[associated Legendre polynomials]].

The study of orthogonal polynomials involves [[weight function]]s ''<math>w''(''x'')</math> whichthat are inserted in the bilinear form:

:<math> \langle f,g\rangle = \int w(x) f(x) g(x)\,dx .</math>

For [[Laguerre polynomial]]s on <math>(0, ∞\infty)</math> the weight function is <math>w(x) = e^{-x} .</math>.

Both physicists and probability theorists use [[Hermite polynomial]]s on <math>(−∞-\infty, ∞\infty)</math>, where the weight function is <math>w(x) = e^{-x^2}</math> or <math>w(x) = e^{- \frac {x^2}{/2}} .</math>.

[[Chebyshev polynomial]]s are defined on <math>[−1-1, 1]</math> and use weights <math display="inline">w(x) = \frac{1}{\sqrt{1 - x^2}}</math> or <math display="inline">w(x) = \sqrt{1 - x^2}</math>.

[[Zernike polynomial]]s are defined on the [[unit disk]] and have orthogonality of both radial and angular parts.

Line 31:

==Rational functions==

[[File:ChebychevRational1.png|thumb|Plot of the Chebyshev rational functions of order n=0,1,2,3 and 4 between x=0.01 and 100.]]

Legendre and Chebyshev polynomials provide orthogonal families for the interval {{nowrap|[−1, 1]}} while occasionally orthogonal families are required on {{nowrap|[0, ∞)}}. In this case it is convenient to apply the [[Cayley transform#Real homography|Cayley transform]] first, to bring the argument into {{nowrap|[−1, 1]}}. This procedure results in families of [[rational function|rational]] orthogonal functions called [[Legendre rational functions]] and [[Chebyshev rational functions]].

==In differential equations==

Line 37 ⟶ 38:

==See also==

* [[Hilbert space]]

* [[Eigenvalues and eigenvectors]]

* [[WannierHilbert functionspace]]

* [[Karhunen–Loève theorem]]

* [[Lauricella's theorem]]

* [[Karhunen–LoeveWannier theoremfunction]]

==References==

{{reflist}}

* George B. Arfken & Hans J. Weber (2005) ''Mathematical Methods for Physicists'', 6th edition, chapter 10: Sturm-Liouville Theory — Orthogonal Functions, [[Academic Press]].

* {{cite journal|author=Price, Justin J.|authorlink=Justin Jesse Price|title=Topics in orthogonal functions|journal=[[American Mathematical Monthly]]|volume=82|year=1975|pages=594–609|url=http://www.maa.org/programs/maa-awards/writing-awards/topics-in-orthogonal-functions|doi=10.2307/2319690}}

* [[Giovanni Sansone]] (translated by Ainsley H. Diamond) (1959) ''Orthogonal Functions'', [[Interscience Publishers]].

== External links ==

* [http://mathworld.wolfram.com/OrthogonalFunctions.html Orthogonal Functions], on MathWorld.