Fhe authors introduce refinements into the randomized pattern search method The randomized method of Lawrence and Stelghtz augments the ability of the method to adapt to direction An algorithm is derived that makes the method more adaptive in step size and incorporates penaltv terms to accommodate c
Discrete tchebycheff approximation for multivariate splines
β Scribed by Martin H. Schultz
- Publisher
- Elsevier Science
- Year
- 1972
- Tongue
- English
- Weight
- 254 KB
- Volume
- 6
- Category
- Article
- ISSN
- 0022-0000
No coin nor oath required. For personal study only.
β¦ Synopsis
In this paper we give the theoretical analysis for the combination of two ideas in numerical analysis. The first is to approximate the Tchebycheff approximation to a function over a continuum, X, in R M by Tchebycheff approximations over finite, discrete subsets of X, cf. [4, 5, 7, and 8], and the second is the use of multivariate spline functions as approximators. Experimental results for this combination have previously been reported in .
To be precise, let X be a compact subset of R M. If Y is any closed subset of X and g is a real-valued, continuous function on Y, let 11 g lit ~ max{[ g(Y)l [Y ~ Y}.
π SIMILAR VOLUMES
This work deals with an approximation method for multivariate functions from data constituted by a given data point set and a partial differential equation (PDE). The solution of our problem is called a PDE spline. We establish a variational characterization of the PDE spline and a convergence resul
We characterize module bases of spline spaces in terms of their determinants, degree sequences, and dimension series. These characterization also provide tests for freeness of the module. Applications are given to the basis and dimension problem for spline spaces.