Results 221 to 230 of about 16,443 (262)
Some of the next articles are maybe not open access.
Numerische Mathematik, 1967
In this paper we generalize the results of [4] and modify the algorithm presented there to obtain a better rate of convergence.
openaire +2 more sources
In this paper we generalize the results of [4] and modify the algorithm presented there to obtain a better rate of convergence.
openaire +2 more sources
A simple smoothing spline, III
Computational Statistics, 1999This paper is the third in a series devoted to the study of linear smoothing splines; for the review of Part II see [Zbl 1057.62515]. The present article focuses on computational aspects with the specific goal of developing an in-depth understanding of the methods for computing the linear smoothing spline.
openaire +2 more sources
Variance Reduction in Smoothing Splines
Scandinavian Journal of Statistics, 2009Abstract. We develop a variance reduction method for smoothing splines. For a given point of estimation, we define a variance‐reduced spline estimate as a linear combination of classical spline estimates at three nearby points. We first develop a variance reduction method for spline estimators in univariate regression models.
Paige, Robert L., Sun, Shan, Wang, Keyi
openaire +2 more sources
Smoothing Spline Score Estimation
SIAM Journal on Scientific Computing, 1994Summary: A new characterization and interpretation of the \textit{D. D. Cox} [Ann. Inst. Stat. Math. 37, 271-288 (1985; Zbl 0578.62041)] smoothing spline score estimator is provided, which makes it possible to construct an efficient algorithm for computing this score estimator.
openaire +2 more sources
1979
Publisher Summary The chapter describes the methods, with some changes, that were used by the author to solve the numerical problem assigned to him at the Ballistics Research Laboratories in Aberdeen, Maryland, during the Second World War. The problem was to smooth very extended equidistant tables of drag functions (or drag coefficients) by ...
openaire +2 more sources
Publisher Summary The chapter describes the methods, with some changes, that were used by the author to solve the numerical problem assigned to him at the Ballistics Research Laboratories in Aberdeen, Maryland, during the Second World War. The problem was to smooth very extended equidistant tables of drag functions (or drag coefficients) by ...
openaire +2 more sources
Smoothing With Periodic Cubic Splines
Bell System Technical Journal, 1983In this paper we present a mathematical algorithm for constructing a smoothing cubic spline with periodic end conditions and a predetermined ‘closeness of fit’ to a given set of points in the plane. In addition to providing a mathematical tool for smoothing raw data in which the underlying function is known to be periodic, this algorithm has special ...
openaire +2 more sources
Parametric smoothing of spline interpolation
2004 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2004Cubic spline interpolation is commonly applied in signal reconstruction problems. However, overshooting between samples is normally observed, and typically the reconstructed signal does not preserve the statistical properties of the original data or other desired properties such as monotonicity or convexity.
Jesús Ibáñez 0002 +3 more
openaire +1 more source
Smoothing splines for longitudinal data
Statistics in Medicine, 1995AbstractIn a longitudinal data model with fixed and random effects, polynomials are used to model the fixed effects and smoothing polynomial splines are used to model the within‐subject random effect curves. The splines are generated by modelling the data for each subject as observations of an integrated random walk with observational error.
S J, Anderson, R H, Jones
openaire +2 more sources
GACV for quantile smoothing splines
Computational Statistics & Data Analysis, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
2001
Piecewise approximation functions are compared to single functions which are defined over entire sets of data. The former are presented as providing close fits to the data and as being desirable for performance of subsequent calculations. The cubic spline is described as a piecewise function with controlled curvature and good continuity conditions over
openaire +1 more source
Piecewise approximation functions are compared to single functions which are defined over entire sets of data. The former are presented as providing close fits to the data and as being desirable for performance of subsequent calculations. The cubic spline is described as a piecewise function with controlled curvature and good continuity conditions over
openaire +1 more source

