|
Orthogonal Functions
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 (mathematics), interval as the domain of a function, 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 Orthogonality_(mathematics), orthogonal when this integral is zero, i.e. \langle f, \, g \rangle = 0 whenever f \neq g. 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. Suppose \ is a sequence of orthogonal functions of nonzero L2-norm, ''L''2-norms \left\, f_n \right\, _2 = \sqrt = \left(\int f_n ^2 \ dx \right) ^\frac . It follows that the sequence ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fourier Series
A Fourier series () is an Series expansion, expansion of a periodic function into a sum of trigonometric functions. The Fourier series is an example of a trigonometric series. By expressing a function as a sum of sines and cosines, many problems involving the function become easier to analyze because trigonometric functions are well understood. For example, Fourier series were first used by Joseph Fourier to find solutions to the heat equation. This application is possible because the derivatives of trigonometric functions fall into simple patterns. Fourier series cannot be used to approximate arbitrary functions, because most functions have infinitely many terms in their Fourier series, and the series do not always Convergent series, converge. Well-behaved functions, for example Smoothness, smooth functions, have Fourier series that converge to the original function. The coefficients of the Fourier series are determined by integrals of the function multiplied by trigonometric func ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Monomial
In mathematics, a monomial is, roughly speaking, a polynomial which has only one term. Two definitions of a monomial may be encountered: # A monomial, also called a power product or primitive monomial, is a product of powers of variables with nonnegative integer exponents, or, in other words, a product of variables, possibly with repetitions. For example, x^2yz^3=xxyzzz is a monomial. The constant 1 is a primitive monomial, being equal to the empty product and to x^0 for any variable x. If only a single variable x is considered, this means that a monomial is either 1 or a power x^n of x, with n a positive integer. If several variables are considered, say, x, y, z, then each can be given an exponent, so that any monomial is of the form x^a y^b z^c with a,b,c non-negative integers (taking note that any exponent 0 makes the corresponding factor equal to 1). # A monomial in the first sense multiplied by a nonzero constant, called the coefficient of the monomial. A primitive monomial ... [...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 A simple example of a Cayley transform can be done on the real projective line. The Cayley transform here will permute 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 ... [...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 is 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 ... [...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. Histori ... [...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 ... [...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, laureate 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 spherical 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 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Chebyshev Polynomial
The Chebyshev polynomials are two sequences of orthogonal polynomials related to the trigonometric functions, 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 is not obvious at first sight but can be shown using de Moivre's formula (see #Trigonometric definition, below). The Chebyshev polynomials are polynomials with the largest possible leading coefficient whose absolute value on the interval (mathematics), interval is bounded by 1. They are also the "extremal" polynomials for many other properties. In 1952, Cornelius Lanczos showed that the Chebyshev polynomials are important in a ... [...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 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Laguerre Polynomial
In mathematics, the Laguerre polynomials, named after Edmond Laguerre (1834–1886), are nontrivial solutions of Laguerre's differential equation: xy'' + (1 - x)y' + ny = 0,\ y = y(x) which is a second-order linear differential equation. This equation has nonsingular solutions only if is a non-negative integer. Sometimes the name Laguerre polynomials is used for solutions of xy'' + (\alpha + 1 - x)y' + ny = 0~. where is still a non-negative integer. Then they are also named generalized Laguerre polynomials, as will be done here (alternatively associated Laguerre polynomials or, rarely, Sonine polynomials, after their inventor Nikolay Yakovlevich Sonin). More generally, a Laguerre function is a solution when is not necessarily a non-negative integer. The Laguerre polynomials are also used for Gauss–Laguerre quadrature to numerically compute integrals of the form \int_0^\infty f(x) e^ \, dx. These polynomials, usually denoted , , ..., are a polynomial sequ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Weight Function
A weight function is a mathematical device used when performing a sum, integral, or average to give some elements more "weight" or influence on the result than other elements in the same set. The result of this application of a weight function is a weighted sum or weighted average. Weight functions occur frequently in statistics and analysis, and are closely related to the concept of a measure. Weight functions can be employed in both discrete and continuous settings. They can be used to construct systems of calculus called "weighted calculus" and "meta-calculus".Jane Grossma''Meta-Calculus: Differential and Integral'' , 1981. Discrete weights General definition In the discrete setting, a weight function w \colon A \to \R^+ is a positive function defined on a discrete set A, which is typically finite or countable. The weight function w(a) := 1 corresponds to the ''unweighted'' situation in which all elements have equal weight. One can then apply this weight to various con ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
