Search results for " Interpolation"
showing 10 items of 144 documents
On Inverse Distance Weighting in Pollution Models
2011
When evaluating the impact of pollution, measurements from remote stations are often weighted by the inverse of distance raised to some nonnegative power (IDW). This is derived from Shepard's method of spatial interpolation (1968). The paper discusses the arbitrary character of the exponent of distance and the problem of monitoring stations that are close to the reference point. From elementary laws of physics, it is determined which exponent of distance should be chosen (or its upper bound) depending on the form of pollution encountered, such as radiant pollution (including radioactivity and sound), air pollution (plumes, puffs, and motionless clouds by using the classical Gaussian model),…
Pollution models and inverse distance weighting: some critical remarks
2013
International audience; When evaluating the impact of pollution, measurements from remote stations are often weighted by the inverse of distance raised to some nonnegative power (IDW). This is derived from Shepard's method of spatial interpolation (1968). The paper discusses the arbitrary character of the exponent of distance and the problem of monitoring stations that are close to the reference point. From elementary laws of physics, it is determined which exponent of distance should be chosen (or its upper bound) depending on the form of pollution encountered, such as radiant pollution (including radioactivity and sound), air pollution (plumes, puffs, and motionless clouds by using the cl…
On specific stability bounds for linear multiresolution schemes based on piecewise polynomial Lagrange interpolation
2009
Abstract The Deslauriers–Dubuc symmetric interpolation process can be considered as an interpolatory prediction scheme within Harten's framework. In this paper we express the Deslauriers–Dubuc prediction operator as a combination of either second order or first order differences. Through a detailed analysis of certain contractivity properties, we arrive to specific l ∞ -stability bounds for the multiresolution transform. A variety of tests indicate that these l ∞ bounds are closer to numerical estimates than those obtained with other approaches.
Conversion of Dupin Cyclide Patches into Rational Biquadratic Bézier Form
2005
This paper uses the symmetry properties of circles and Bernstein polynomials to establish a series of interesting barycentric properties of rational biquadratic Bezier patches. A robust algorithm is presented, based on these properties, for the conversion of Dupin cyclide patches into Bezier form. A set of conversion examples illustrates the use of this algorithm.
Singularities of rational Bézier curves
2001
We prove that if an nth degree rational Bezier curve has a singular point, then it belongs to the two (n − 1)th degree rational Bezier curves defined in the (n − 1)th step of the de Casteljau algorithm. Moreover, both curves are tangent at the singular point. A procedure to construct Bezier curves with singularities of any order is given. 2001 Elsevier Science B.V. All rights reserved.
Completely positive invariant conjugate-bilinear maps on partial *-algebras
2007
The notion of completely positive invariant conjugate-bilinear map in a partial *-algebra is introduced and a generalized Stinespring theorem is proven. Applications to the existence of integrable extensions of *-representations of commutative, locally convex quasi*-algebras are also discussed.
Riesz and Wolff potentials and elliptic equations in variable exponent weak Lebesgue spaces
2015
Submitted by Alexandre Almeida (jaralmeida@ua.pt) on 2015-11-12T11:41:07Z No. of bitstreams: 1 RieszWolff_RIA.pdf: 159825 bytes, checksum: d99abdf3c874f47195619a31ff5c12c7 (MD5) Approved for entry into archive by Bella Nolasco(bellanolasco@ua.pt) on 2015-11-17T12:18:41Z (GMT) No. of bitstreams: 1 RieszWolff_RIA.pdf: 159825 bytes, checksum: d99abdf3c874f47195619a31ff5c12c7 (MD5) Made available in DSpace on 2015-11-17T12:18:41Z (GMT). No. of bitstreams: 1 RieszWolff_RIA.pdf: 159825 bytes, checksum: d99abdf3c874f47195619a31ff5c12c7 (MD5) Previous issue date: 2015-04
Gray coding cubic planar maps
2016
International audience; The idea of (combinatorial) Gray codes is to list objects in question in such a way that two successive objects differ in some pre-specified small way. In this paper, we utilize beta-description trees to cyclicly Gray code three classes of cubic planar maps, namely, bicubic planar maps, 3-connected cubic planar maps, and cubic non-separable planar maps. (C) 2015 Elsevier B.V. All rights reserved.
Bond-extended stochastic and nonstochastic bilinear indices. I. QSPR/QSAR applications to the description of properties/activities of small-medium si…
2010
Bond-extended stochastic and nonstochastic bilinear indices are introduced in this article as novel bond-level molecular descriptors (MDs). These novel totals (whole-molecule) MDs are based on bilinear maps (forms) similar to use defined in linear algebra. The proposed nonstochastic indices try to match molecular structure provided by the molecular topology by using the kth Edge(Bond)-Adjacency Matrix (Ek, designed here as a nonstochastic E matrix). The stochastic parameters are computed by using the kth stochastic edge-adjacency matrix, ESk, as matrix operators of bilinear transformations. This new edge (bond)-adjacency relationship can be obtained directly from Ek and can be considered li…
tomocomd-camps and protein bilinear indices - novel bio-macromolecular descriptors for protein research: I. Predicting protein stability effects of a…
2010
Descriptors calculated from a specific representation scheme encode only one part of the chemical information. For this reason, there is a need to construct novel graphical representations of proteins and novel protein descriptors that can provide new information about the structure of proteins. Here, a new set of protein descriptors based on computation of bilinear maps is presented. This novel approach to biomacromolecular design is relevant for QSPR studies on proteins. Protein bilinear indices are calculated from the kth power of nonstochastic and stochastic graph–theoretic electronic-contact matrices, and , respectively. That is to say, the kth nonstochastic and stochastic protein bili…