共查询到20条相似文献,搜索用时 15 毫秒
1.
Gancho T. Tachev 《Numerical Functional Analysis & Optimization》2013,34(7-8):945-953
Pointwise and norm estimates for approximation of continuous function by piecewise linear interpolant with nonequidistant nodes are proved. Special attention is paid to the value of the absolute constants in front of the modulus. 相似文献
2.
Piecewise Rational Quadratic Interpolation to Monotonic Data 总被引:6,自引:0,他引:6
An explicit representation of a piecewise rational quadraticfunction is developed which produces a monotonic interpolantto given monotonic data. The explicit representation means thatthe piecewise monotonic interpolant is easily constructed andnumerical experiments indicate that the method produces visuallypleasing curves. Furthermore, the use of the method is justifiedby a convergence analysis. 相似文献
3.
4.
5.
本文讨论在数据是强相依的情况下函数系数部分线性模型的估计.首先,采用局部线性方法,给出该模型函数项函数的估计;然后,使用两阶段方法给出系数函数的估计.并且讨论了函数项函数估计的渐近正态性,以及系数函数估计的弱相合性和渐近正态性.模拟研究显示,这些估计是较为理想的. 相似文献
6.
The methods of using intertwining MRAs to find orthogonal scaling functions have previously been applied to one-dimensional
MRAs and are here extended to two-dimensional bases. Two examples are constructed from MRAs consisting of continuous, compactly
supported, piecewise affine functions of two variables. The resulting scaling functions can be conveniently restricted to
compact domains.
November 23, 1997. Date accepted: January 22, 1999. 相似文献
7.
In this paper, we consider spaces of cubic C^1-spline on a class of triangulations. By using the inductive algorithm, the posed Lagrange interpolation sets are constructed for cubic spline space. It is shown that the class of triangulations considered in this paper are nonsingular for S1/3 spaces. Moreover, the dimensions of those spaces exactly equal to L. L. Schuraaker's low bounds of the dimensions. At the end of this paper, we present an approach to construct triangulations from any scattered planar points, which ensures that the obtained triangulations for S1/3 space are nonsingular. 相似文献
8.
The present paper first establishes a decomposition result for f(x)∈ C
r
C
r+1. By using this decomposition we thus can obtain an estimate of ∣f(x) - L
n
(f,x)∣ which reflects the influence of the position of the x's and ω(f
(r+1),δ)j, j = 0,1,...,s, on the error of approximation.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
9.
In this paper, a QP-free feasible method with piecewise NCP functions is proposed for nonlinear inequality constrained optimization problems. The new NCP functions are piecewise linear-rational, regular pseudo-smooth and have nice properties. This method is based on the solutions of linear systems of equation reformulation of KKT optimality conditions, by using the piecewise NCP functions. This method is implementable and globally convergent without assuming the strict complementarity condition, the isolatedness of accumulation points. Furthermore, the gradients of active constraints are not requested to be linearly independent. The submatrix which may be obtained by quasi-Newton methods, is not requested to be uniformly positive definite. Preliminary numerical results indicate that this new QP-free method is quite promising. 相似文献
10.
Algorithm for Optimal Triangulations in Scattered Data Representation and Implementation 总被引:2,自引:0,他引:2
Scattered data collected at sample points may be used to determine simple functions to best fit the data. An ideal choice for these simple functions is bivariate splines. Triangulation of the sample points creates partitions over which the bivariate splines may be defined. But the optimality of the approximation is dependent on the choice of triangulation. An algorithm, referred to as an Edge Swapping Algorithm, has been developed to transform an arbitrary triangulation of the sample points into an optimal triangulation for representation of the scattered data. A Matlab package has been completed that implements this algorithm for any triangulation on a given set of sample points. 相似文献
11.
12.
Journal of Optimization Theory and Applications - We distinguish two kinds of piecewise linear functions and provide an interesting representation for a piecewise linear function between two normed... 相似文献
13.
14.
15.
We propose a new approach to calculating the first passage time densities for Brownian motion crossing piecewise linear boundaries which can be discontinuous. Using this approach we obtain explicit formulas for the first passage densities and show that they are continuously differentiable except at the break points of the boundaries. Furthermore, these formulas can be used to approximate the first passage time distributions for general nonlinear boundaries. The numerical computation can be easily done by using the Monte Carlo integration, which is straightforward to implement. Some numerical examples are presented for illustration. This approach can be further extended to compute two-sided boundary crossing distributions. 相似文献
16.
Abstract. We present algorithms for constructing a hierarchy of increasingly coarse Morse—Smale complexes that decompose a piecewise
linear 2-manifold. While these complexes are defined only in the smooth category, we extend the construction to the piecewise
linear category by ensuring structural integrity and simulating differentiability. We then simplify Morse—Smale complexes
by canceling pairs of critical points in order of increasing persistence. 相似文献
17.
18.
Marcelo C. Medeiros Mauricio G.C. Resende Alvaro Veiga 《Computational Optimization and Applications》2001,19(2):127-144
This paper describes a heuristic to build piecewise linear statistical models with multivariate thresholds, based on a Greedy Randomized Adaptive Search Procedure (GRASP). GRASP is an iterative randomized sampling technique that has been shown to quickly produce good quality solutions for a wide variety of optimization problems. In this paper we describe a GRASP to sequentially split an n-dimensional space in order to build a piecewise linear time series model. 相似文献
19.
K. C. Kiwiel 《Applied Mathematics and Optimization》1998,38(3):239-259
We give an algorithm for minimizing the sum of a strictly convex function and a convex piecewise linear function. It extends
several dual coordinate ascent methods for large-scale linearly constrained problems that occur in entropy maximization, quadratic
programming, and network flows. In particular, it may solve exact penalty versions of such (possibly inconsistent) problems,
and subproblems of bundle methods for nondifferentiable optimization. It is simple, can exploit sparsity, and in certain cases
is highly parallelizable. Its global convergence is established in the recent framework of B -functions (generalized Bregman functions).
Accepted 29 October 1996 相似文献
20.
二元样条函数插值在计算几何与计算机辅助几何设计中有着重要的作用.本文给出了一种矩形剖分上二元线性样条函数进行Lagrange插值时插值适定结点组所满足的拓扑与几何性质,这种性质依赖于二元线性样条函数所决定的分片线性代数曲线. 相似文献