985 resultados para Orthogonal polynomial
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Wavelet functions have been used as the activation function in feedforward neural networks. An abundance of R&D has been produced on wavelet neural network area. Some successful algorithms and applications in wavelet neural network have been developed and reported in the literature. However, most of the aforementioned reports impose many restrictions in the classical backpropagation algorithm, such as low dimensionality, tensor product of wavelets, parameters initialization, and, in general, the output is one dimensional, etc. In order to remove some of these restrictions, a family of polynomial wavelets generated from powers of sigmoid functions is presented. We described how a multidimensional wavelet neural networks based on these functions can be constructed, trained and applied in pattern recognition tasks. As an example of application for the method proposed, it is studied the exclusive-or (XOR) problem.
Resumo:
In this paper, we described how a multidimensional wavelet neural networks based on Polynomial Powers of Sigmoid (PPS) can be constructed, trained and applied in image processing tasks. In this sense, a novel and uniform framework for face verification is presented. The framework is based on a family of PPS wavelets,generated from linear combination of the sigmoid functions, and can be considered appearance based in that features are extracted from the face image. The feature vectors are then subjected to subspace projection of PPS-wavelet. The design of PPS-wavelet neural networks is also discussed, which is seldom reported in the literature. The Stirling Universitys face database were used to generate the results. Our method has achieved 92 % of correct detection and 5 % of false detection rate on the database.
Resumo:
It is often necessary to run response surface designs in blocks. In this paper the analysis of data from such experiments, using polynomial regression models, is discussed. The definition and estimation of pure error in blocked designs are considered. It is recommended that pure error is estimated by assuming additive block and treatment effects, as this is more consistent with designs without blocking. The recovery of inter-block information using REML analysis is discussed, although it is shown that it has very little impact if thc design is nearly orthogonally blocked. Finally prediction from blocked designs is considered and it is shown that prediction of many quantities of interest is much simpler than prediction of the response itself.
Resumo:
Let C-n(lambda)(x), n = 0, 1,..., lambda > -1/2, be the ultraspherical (Gegenbauer) polynomials, orthogonal. in (-1, 1) with respect to the weight function (1 - x(2))(lambda-1/2). Denote by X-nk(lambda), k = 1,....,n, the zeros of C-n(lambda)(x) enumerated in decreasing order. In this short note, we prove that, for any n is an element of N, the product (lambda + 1)(3/2)x(n1)(lambda) is a convex function of lambda if lambda greater than or equal to 0. The result is applied to obtain some inequalities for the largest zeros of C-n(lambda)(x). If X-nk(alpha), k = 1,...,n, are the zeros of Laguerre polynomial L-n(alpha)(x), also enumerated in decreasing order, we prove that x(n1)(lambda)/(alpha + 1) is a convex function of alpha for alpha > - 1. (C) 2002 Published by Elsevier B.V. B.V.
Resumo:
We study the use of para-orthogonal polynomials in solving the frequency analysis problem. Through a transformation of Delsarte and Genin, we present an approach for the frequency analysis by using the zeros and Christoffel numbers of polynomials orthogonal on the real line. This leads to a simple and fast algorithm for the estimation of frequencies. We also provide a new method, faster than the Levinson algorithm, for the determination of the reflection coefficients of the corresponding real Szego polynomials from the given moments.
Resumo:
Let 0
Resumo:
Generalized Bessel polynomials (GBPs) are characterized as the extremal polynomials in certain inequalities in L-2 norm of Markov type. (C) 1998 Academic Press.
Resumo:
We prove that the only Jensen polynomials associated with an entire function in the Laguerre-Polya class that are orthogonal are the Laguerre polynomials. (C) 2009 Elsevier B.V. All rights reserved.
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
A positive measure psi defined on [a, b] such that its moments mu(n) = integral(b)(a)t(n) d psi(t) exist for n = 0, +/-1, +/-2. can be called a strong positive measure on [a, b] When 0 <= a < b <= infinity the sequence of polynomials {Q(n)} defined by integral(b)(a) t(-n+s) Q(n)(t) d psi(t) = 0, s = 0, ., n - 1, exist and they are referred here as L-orthogonal polynomials We look at the connection between two sequences of L-orthogonal polynomials {Q(n)((1))} and {Q(n)((0))} associated with two closely related strong positive measures and th defined on [a, b]. To be precise, the measures are related to each other by (t - kappa) d psi(1)(t) = gamma d psi(0)(t). where (t - kappa)/gamma is positive when t is an element of (n, 6). As applications of our study. numerical generation of new L-orthogonal polynomials and monotonicity properties of the zeros of a certain class of L-orthogonal polynomials are looked at. (C) 2010 IMACS Published by Elsevier B V All rights reserved
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
The study of robust design methodologies and techniques has become a new topical area in design optimizations in nearly all engineering and applied science disciplines in the last 10 years due to inevitable and unavoidable imprecision or uncertainty which is existed in real word design problems. To develop a fast optimizer for robust designs, a methodology based on polynomial chaos and tabu search algorithm is proposed. In the methodology, the polynomial chaos is employed as a stochastic response surface model of the objective function to efficiently evaluate the robust performance parameter while a mechanism to assign expected fitness only to promising solutions is introduced in tabu search algorithm to minimize the requirement for determining robust metrics of intermediate solutions. The proposed methodology is applied to the robust design of a practical inverse problem with satisfactory results.
Resumo:
Inner products of the type < f, g >(S) = < f, g >psi(0) + < f', g'>psi(1), where one of the measures psi(0) or psi(1) is the measure associated with the Gegenbauer polynomials, are usually referred to as Gegenbauer-Sobolev inner products. This paper deals with some asymptotic relations for the orthogonal polynomials with respect to a class of Gegenbauer-Sobolev inner products. The inner products are such that the associated pairs of symmetric measures (psi(0), psi(1)) are not within the concept of symmetrically coherent pairs of measures.