|
Orthogonal Function
In mathematics, orthogonal functions belong to a function space that is a vector space equipped with a bilinear form. When the function space has an interval as the domain, the bilinear form may be the integral of the product of functions over the interval: : \langle f,g\rangle = \int \overlineg(x)\,dx . The functions f and g are orthogonal when this integral is zero, i.e. \langle f, \, g \rangle = 0 whenever f \neq g. As with a 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. Suppose \ is a sequence of orthogonal functions of nonzero ''L''2-norms \left\, f_n \right\, _2 = \sqrt = \left(\int f_n ^2 \ dx \right) ^\frac . It follows that the sequence \left\ is of functions of ''L''2-norm one, forming an orthonormal sequence. To have a defined ''L'' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics with the major subdisciplines of number theory, algebra, geometry, and analysis, respectively. There is no general consensus among mathematicians about a common definition for their academic discipline. Most mathematical activity involves the discovery of properties of abstract objects and the use of pure reason to prove them. These objects consist of either abstractions from nature orin modern mathematicsentities that are stipulated to have certain properties, called axioms. A ''proof'' consists of a succession of applications of deductive rules to already established results. These results include previously proved theorems, axioms, andin case of abstraction from naturesome basic properties that are considered true starting points of t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Legendre Polynomial
In physical science and mathematics, Legendre polynomials (named after Adrien-Marie Legendre, who discovered them in 1782) are a system of complete and orthogonal polynomials, with a vast number of mathematical properties, and numerous applications. They can be defined in many ways, and the various definitions highlight different aspects as well as suggest generalizations and connections to different mathematical structures and physical and numerical applications. Closely related to the Legendre polynomials are associated Legendre polynomials, Legendre functions, Legendre functions of the second kind, and associated Legendre functions. Definition by construction as an orthogonal system In this approach, the polynomials are defined as an orthogonal system with respect to the weight function w(x) = 1 over the interval 1,1/math>. That is, P_n(x) is a polynomial of degree n, such that \int_^1 P_m(x) P_n(x) \,dx = 0 \quad \text n \ne m. With the additional standardization condi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Legendre Rational Functions
In mathematics the Legendre rational functions are a sequence of orthogonal functions on , ∞). They are obtained by composing the Cayley transform with Legendre polynomials">Cayley_transform.html" ;"title=", ∞). They are obtained by composing the Cayley transform">, ∞). They are obtained by composing the Cayley transform with Legendre polynomials. A rational Legendre function of degree ''n'' is defined as: :R_n(x) = \frac\,P_n\left(\frac\right) where P_n(x) is a Legendre polynomial. These functions are eigenfunctions of the singular Sturm–Liouville problem: :(x+1)\partial_x(x\partial_x((x+1)v(x)))+\lambda v(x)=0 with eigenvalues :\lambda_n=n(n+1)\, Properties Many properties can be derived from the properties of the Legendre polynomials of the first kind. Other properties are unique to the functions themselves. Recursion :R_(x)=\frac\,\frac\,R_n(x)-\frac\,R_(x)\quad\mathrm and :2(2n+1)R_n(x)=(x+1)^2(\partial_x R_(x)-\partial_x R_(x))+(x+ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rational Function
In mathematics, a rational function is any function that can be defined by a rational fraction, which is an algebraic fraction such that both the numerator and the denominator are polynomials. The coefficients of the polynomials need not be rational numbers; they may be taken in any field ''K''. In this case, one speaks of a rational function and a rational fraction ''over K''. The values of the variables may be taken in any field ''L'' containing ''K''. Then the domain of the function is the set of the values of the variables for which the denominator is not zero, and the codomain is ''L''. The set of rational functions over a field ''K'' is a field, the field of fractions of the ring of the polynomial functions over ''K''. Definitions A function f(x) is called a rational function if and only if it can be written in the form : f(x) = \frac where P\, and Q\, are polynomial functions of x\, and Q\, is not the zero function. The domain of f\, is the set of all valu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cayley Transform
In mathematics, the Cayley transform, named after Arthur Cayley, is any of a cluster of related things. As originally described by , the Cayley transform is a mapping between skew-symmetric matrices and special orthogonal matrices. The transform is a homography used in real analysis, complex analysis, and quaternionic analysis. In the theory of Hilbert spaces, the Cayley transform is a mapping between linear operators . Real homography The Cayley transform is an automorphism of the real projective line that permutes the elements of in sequence. For example, it maps the positive real numbers to the interval ��1, 1 Thus the Cayley transform is used to adapt Legendre polynomials for use with functions on the positive real numbers with Legendre rational functions. As a real homography, points are described with projective coordinates, and the mapping is : ,\ 1= \left frac ,\ 1\right\thicksim - 1, \ x + 1= ,\ 1begin1 & 1 \\ -1 & 1 \end . Complex homography On the Riemann ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Haar Wavelet
In mathematics, the Haar wavelet is a sequence of rescaled "square-shaped" functions which together form a wavelet family or basis. Wavelet analysis is similar to Fourier analysis in that it allows a target function over an interval to be represented in terms of an orthonormal basis. The Haar sequence is now recognised as the first known wavelet basis and extensively used as a teaching example. The Haar sequence was proposed in 1909 by Alfréd Haar. Haar used these functions to give an example of an orthonormal system for the space of square-integrable functions on the unit interval , 1 The study of wavelets, and even the term "wavelet", did not come until much later. As a special case of the Daubechies wavelet, the Haar wavelet is also known as Db1. The Haar wavelet is also the simplest possible wavelet. The technical disadvantage of the Haar wavelet is that it is not continuous, and therefore not differentiable. This property can, however, be an advantage for t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Walsh Function
In mathematics, more specifically in harmonic analysis, Walsh functions form a complete orthogonal set of functions that can be used to represent any discrete function—just like trigonometric functions can be used to represent any continuous function in Fourier analysis. They can thus be viewed as a discrete, digital counterpart of the continuous, analog system of trigonometric functions on the unit interval. But unlike the sine and cosine functions, which are continuous, Walsh functions are piecewise constant. They take the values −1 and +1 only, on sub-intervals defined by dyadic fractions. The system of Walsh functions is known as the Walsh system. It is an extension of the Rademacher system of orthogonal functions. Walsh functions, the Walsh system, the Walsh series, and the fast Walsh–Hadamard transform are all named after the American mathematician Joseph L. Walsh. They find various applications in physics and engineering when analyzing digital signals. Hist ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Unit Disk
In mathematics, the open unit disk (or disc) around ''P'' (where ''P'' is a given point in the plane), is the set of points whose distance from ''P'' is less than 1: :D_1(P) = \.\, The closed unit disk around ''P'' is the set of points whose distance from ''P'' is less than or equal to one: :\bar D_1(P)=\.\, Unit disks are special cases of disks and unit balls; as such, they contain the interior of the unit circle and, in the case of the closed unit disk, the unit circle itself. Without further specifications, the term ''unit disk'' is used for the open unit disk about the origin, D_1(0), with respect to the standard Euclidean metric. It is the interior of a circle of radius 1, centered at the origin. This set can be identified with the set of all complex numbers of absolute value less than one. When viewed as a subset of the complex plane (C), the unit disk is often denoted \mathbb. The open unit disk, the plane, and the upper half-plane The function :f(z)=\frac is an ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Zernike Polynomial
In mathematics, the Zernike polynomials are a sequence of polynomials that are orthogonal on the unit disk. Named after optical physicist Frits Zernike, winner of the 1953 Nobel Prize in Physics and the inventor of phase-contrast microscopy, they play important roles in various optics branches such as beam optics and imaging. Definitions There are even and odd Zernike polynomials. The even Zernike polynomials are defined as :Z^_n(\rho,\varphi) = R^m_n(\rho)\,\cos(m\,\varphi) \! (even function over the azimuthal angle \varphi), and the odd Zernike polynomials are defined as :Z^_n(\rho,\varphi) = R^m_n(\rho)\,\sin(m\,\varphi), \! (odd function over the azimuthal angle \varphi) where ''m'' and ''n'' are nonnegative integers with ''n ≥ m ≥ 0'' (''m'' = 0 for even Zernike polynomials), ''\varphi'' is the azimuthal angle, ''ρ'' is the radial distance 0\le\rho\le 1, and R^m_n are the radial polynomials defined below. Zernike polynomials have the property of being l ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Chebyshev Polynomial
The Chebyshev polynomials are two sequences of polynomials related to the cosine and sine functions, notated as T_n(x) and U_n(x). They can be defined in several equivalent ways, one of which starts with trigonometric functions: The Chebyshev polynomials of the first kind T_n are defined by : T_n(\cos \theta) = \cos(n\theta). Similarly, the Chebyshev polynomials of the second kind U_n are defined by : U_n(\cos \theta) \sin \theta = \sin\big((n + 1)\theta\big). That these expressions define polynomials in \cos\theta may not be obvious at first sight, but follows by rewriting \cos(n\theta) and \sin\big((n+1)\theta\big) using de Moivre's formula or by using the angle sum formulas for \cos and \sin repeatedly. For example, the double angle formulas, which follow directly from the angle sum formulas, may be used to obtain T_2(\cos\theta)=\cos(2\theta)=2\cos^2\theta-1 and U_1(\cos\theta)\sin\theta=\sin(2\theta)=2\cos\theta\sin\theta, which are respectively a polynomial in \cos\t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hermite Polynomial
In mathematics, the Hermite polynomials are a classical orthogonal polynomial sequence. The polynomials arise in: * signal processing as Hermitian wavelets for wavelet transform analysis * probability, such as the Edgeworth series, as well as in connection with Brownian motion; * combinatorics, as an example of an Appell sequence, obeying the umbral calculus; * numerical analysis as Gaussian quadrature; * physics, where they give rise to the eigenstates of the quantum harmonic oscillator; and they also occur in some cases of the heat equation (when the term \beginxu_\end is present); * systems theory in connection with nonlinear operations on Gaussian noise. * random matrix theory in Gaussian ensembles. Hermite polynomials were defined by Pierre-Simon Laplace in 1810, though in scarcely recognizable form, and studied in detail by Pafnuty Chebyshev in 1859. Chebyshev's work was overlooked, and they were named later after Charles Hermite, who wrote on the polynomials in 1864, d ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
