MS FT-2-2 7 Orthogonal polynomials and quadrature: Theory, computation, and applications

Quadrature rules find many applications in science and engineering. Their analysis is a classical area of applied mathematics and continues to attract considerable attention. This seminar brings together speakers with expertise in a large variety of quadrature rules. It is the aim of the seminar to provide an overview of recent developments in the analysis of quadrature rules. The computation of error estimates and novel applications also are described

Generalized averaged Gaussian quadrature and applications

A simple numerical method for constructing the optimal generalized averaged Gaussian quadrature formulas will be presented. These formulas exist in many cases in which real positive GaussKronrod formulas do not exist, and can be used as an adequate alternative in order to estimate the error of a Gaussian rule. We also investigate the conditions under which the optimal averaged Gaussian quadrature formulas and their truncated variants are internal

Image Registration Workshop Proceedings

Automatic image registration has often been considered as a preliminary step for higher-level processing, such as object recognition or data fusion. But with the unprecedented amounts of data which are being and will continue to be generated by newly developed sensors, the very topic of automatic image registration has become and important research topic. This workshop presents a collection of very high quality work which has been grouped in four main areas: (1) theoretical aspects of image registration; (2) applications to satellite imagery; (3) applications to medical imagery; and (4) image registration for computer vision research

Journal of Telecommunications and Information Technology, 2011, nr 4

kwartalni

Convergence Of Cascade Algorithms In Sobolev Spaces For Perturbed Refinement Masks

. In this paper the convergence of the cascade algorithm in a Sobolev space is considered if the refinement mask is perturbed. It is proved that the cascade algorithm corresponding to a slightly perturbed mask converges. Moreover, the perturbation of the resulting limit function is estimated in terms of that of the masks. x1. Introduction In this paper we are concerned with the following problem: Given a compactly supported multivariate refinable function OE, how does perturbation of its finite refinement mask affect the convergence of the cascade algorithm? Further, if the cascade algorithm for the perturbed mask also converges, how the resulting limit function is related with OE? We say that a compactly supported function OE is M-refinable if it satisfies a refinement equation OE = X ff2ZZ s a(ff)OE(M \Delta \Gamma ff); (1:1) where the finitely supported sequence a = (a(ff)) ff2ZZ s is called the refinement mask. The s \Theta s matrix M is called a dilation matrix. We suppo..