✦ LIBER ✦

Smooth interpolation of large sets of scattered data

✍ Scribed by Richard Franke; Greg Nielson

Publisher: John Wiley and Sons
Year: 1980
Tongue: English
Weight: 783 KB
Volume: 15
Category: Article
ISSN: 0029-5981
DOI: 10.1002/nme.1620151110

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Spline interpolation and smoothing of da

Spline interpolation and smoothing of data

✍ R.E. Cutkosky; C. Pomponiu 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 876 KB

Title of program: SPLINESMOOTH smoothing a set of experimental data, measured at a sequence of values of some independent variable. This is done as a first Catalogue number: AAQO step towards interpolating, integrating, differentiating, or otherwise transforming the function represented by the data.

Statistical treatment of large digital C

Statistical treatment of large digital Chromatographic data sets

✍ D.C. Freeman; D.W. Byrd 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 883 KB

Frequency interpolation of electromagnet

Frequency interpolation of electromagnetic scattering data using a hybrid model

✍ Bin Jiang; Tao Su; Hao Ling 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB 👁 1 views

Selective sampling for approximate clust

Selective sampling for approximate clustering of very large data sets

✍ Liang Wang; James C. Bezdek; Christopher Leckie; Ramamohanarao Kotagiri 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 506 KB

A key challenge in pattern recognition is how to scale the computational efficiency of clustering algorithms on large data sets. The extension of non-Euclidean relational fuzzy c-means (NERF) clustering to very large (VL = unloadable) relational data is called the extended NERF (eNERF) clustering al

Large sets of coverings

✍ Tuvi Etzion 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 699 KB

Large sets of packings were investigated extensively. Much less is known about the dual problem, Le., large sets of coverings. We examine two types of important questions in this context; what is the maximum number of disjoint optimal coverings? and what is the minimum number of optimal coverings fo

Interpolation of Convex Scattered Data i

Interpolation of Convex Scattered Data in R3 Based upon an Edge Convex Minimum Norm Network

✍ L.E. Andersson; T. Elfving; G. Iliev; K. Vlachkova 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 741 KB

In this paper a characterization of the optimal (using the minimum norm criterion) interpolant, convex along the edges of a triangulation, using data at the vertices is obtained. We thereby generalize results obtained by Nielson for the unconstrained case. 1995 Academic Press. Inc