Discrete least squares approximation of piecewise-linear functions by trigonometric polynomials
Issues of Analysis, 2017 Let N be a natural number greater than 1. Select N uniformly distributed points t_k = 2πk/N (0 ≤ k ≤ N − 1) on [0, 2π]. Denote by L_{n,N} (f) = L_{n,N} (f, x) (1 ≤ n ≤ N/2) the trigonometric polynomial of order n possessing the least quadratic deviation from f with respect to the system {t_k}^(N−1)_k=0 .
openaire +2 more sources
Analysis of solution of the least squares problem [PDF]
, 1999 For the given data $(p_i,t_i,f_i),$ $i=1,ldots,m$, we consider the existence problem of the best parameter approximation of the exponential model function in the sense of ordinary least squares and total least squares.
D. Jukić, R. Scitovski
core +1 more source
A Kiefer--Wolfowitz theorem for convex densities
, 2007 Kiefer and Wolfowitz [Z. Wahrsch. Verw. Gebiete 34 (1976) 73--85] showed that if $F$ is a strictly curved concave distribution function (corresponding to a strictly monotone density $f$), then the Maximum Likelihood Estimator $\hat{F}_n$, which is, in ...
Balabdaoui, Fadoua, Wellner, Jon A.
core +3 more sources
A Modification of the Moving Least-Squares Approximation in the Element-Free Galerkin Method
Journal of Applied Mathematics, 2014 The element-free Galerkin (EFG) method is one of the widely used meshfree methods for solving partial differential equations. In the EFG method, shape functions are derived from a moving least-squares (MLS) approximation, which involves the inversion of ...
Yang Cao, Jun-Liang Dong, Lin-Quan Yao
doaj +1 more source
Analysis of Two Dimensional Steady-State Heat Conduction Problems by MLPG Method [PDF]
International Journal of Advanced Design and Manufacturing Technology, 2011 Numerical solutions obtained by the Meshless local Petrov–Galerkin (MLPG) method are presented for two-dimensional steady-state heat conduction problems.
GholamHosein Baradaran +1 more
doaj
Kernel Estimation of Rate Function for Recurrent Event Data [PDF]
, 2003 Recurrent event data are largely characterized by the rate function but smoothing techniques for estimating the rate function have never been rigorously developed or studied in statistical literature.
Chiang, Chin-Tsang +2 more
core +1 more source
Total Least Squares Spline Approximation
Mathematics, 2019 Spline approximation, using both values y i and x i as observations, is of vital importance for engineering geodesy, e.g., for approximation of profiles measured with terrestrial laser scanners, because it enables the consideration of
Frank Neitzel +2 more
doaj +1 more source
Convergence analysis of generalized iteratively reweighted least squares algorithms on convex function spaces [PDF]
The computation of robust regression estimates often relies on minimization of a convex functional on a convex set. In this paper we discuss a general technique for a large class of convex functionals to compute the minimizers iteratively which is ...
Bissantz, Nicolai +3 more
core
Rational-spline approximation with automatic tension adjustment [PDF]
An algorithm for weighted least-squares approximation with rational splines is presented. A rational spline is a cubic function containing a distinct tension parameter for each interval defined by two consecutive knots.
Kerr, P. A., Schiess, J. R.
core +1 more source
Meshless Local Petrov-Galerkin Method for 3D Steady-State Heat Conduction Problems
Advances in Mechanical Engineering, 2011 The Meshless Local Petrov-Galerkin (MLPG) method is applied for solving the three-dimensional steady state heat conduction problems. This method is a truly meshless approach; also neither the nodal connectivity nor the background mesh is required for ...
M. J. Mahmoodabadi +3 more
doaj +1 more source