Results 21 to 30 of about 242 (52)
A Levinson-Galerkin algorithm for regularized trigonometric approximation
, 1999 Trigonometric polynomials are widely used for the approximation of a smooth function $f$ from a set of nonuniformly spaced samples $\{f(x_j)\}_{j=0}^{N-1}$.
Strohmer, Thomas
core +3 more sources
, 2004 The notion of breakdown point was introduced by Hampel (1968, 1971) and has since played an important role in the theory and practice of robust statistics.
Davies, P. L., Gather, U.
core +1 more source
Chebyshev approximation of a point set by a straight line [PDF]
, 1994 The problem of calculating the best approximating straight line—in the sense of Chebyshev—to a finite set of points inRn is considered. First-and second-order optimality conditions are derived and analysed.
Streng, M., Wetterling, W.
core +3 more sources
Optimal bandwidth selection for semi-recursive kernel regression estimators
, 2016 In this paper we propose an automatic selection of the bandwidth of the semi-recursive kernel estimators of a regression function defined by the stochastic approximation algorithm.
Slaoui, Yousri
core +3 more sources
Least-squares fitting of parametric curves with a linear function of several variables as argument [PDF]
, 1998 We discuss fitting of a parametric curve in the plane in the least-squares sense when the independent variable is a linear function of several variables with unknown coefficients. A general numerical method is recommended.
H. Späth
core +1 more source
Constrained reconstruction of 3D curves and surfaces using integral spline operators [PDF]
, 2013 In the context of direct/reverse engineering processes one of the main problem is the reconstruction of curves and surfaces starting from a cloud of points.
E. Miglio, F. Caliò
core +1 more source
Data fitting with a set of two concentric spheres [PDF]
, 2006 We consider fitting data points in space by a set of two concentric spheres. This problem ought to occur within computational metrology.
H. Späth
core +1 more source
Least squares fitting with rotated paraboloids [PDF]
, 2001 In [1] the problem of estimating the parameters of a rotated parabola fitted to measured points in the plane was examined. The corresponding method, also used in [2,3], is extended here to the case of a rotated paraboloid.
H. Späth
core
Least squares fitting of spheres and ellipsoids using not orthogonal distances [PDF]
, 2001 Berman [1] examined the problem of estimating the parameters of a circle when angular differences between successively measured data points were also measured. Applications were reported. Späth [4] generalized that problem by considering an ellipse.
H. Späth
core
Identifying spatial point sets [PDF]
, 2003 Two sets of spatial points are checked whether they can pproximately be transformed into each other by applying some unknown translation and some unknown rotation. This problem occurs at least in two dimensions within computational metrology.
H. Späth
core