This paper presents an algorithm for extending B-spline curves and surfaces. Based on the unclamping algorithm for B-spline curves, we propose a new algorithm for extending B-spline curves that extrapolates using the recurrence property of the de Boor algorithm. This algorithm provides a nice extension, with maximum continuity, to the original curve segment. Moreover, it can be applied to the extension of B-spline surfaces. Extension to both single and multiple target points/curves are considered in this paper.

Given a fixed$p$≠2, we prove a simple and effective characterization of all radial multipliers of $ \mathcal{F}{L^p}\left( {{\mathbb{R}^d}} \right) $ , provided that the dimension$d$is sufficiently large. The method also yields new$L$^{$q$}space-time regularity results for solutions of the wave equation in high dimensions.

The main object of this paper is to find a criterion for comparison of two tests for non-parametric hypotheses, taking advantage of the qualitative information that may exist. After a detailed analysis of the problem and some earlier suggestins for its solution (sections 2–4), a criterion is suggested in section 5. In order to apply it to a concrete case, a location problem is specified in section 6. The rank tests to be compared are analyzed in section 7, and the comparison by way of the criterion is carried out in section 8. It turns out that sign tests, sometimes slightly modified, are very often optimal according to the criterion used.

The$H$^{$p$}corona problem is the following: Let$g$_{1}, ...,$g$_{$m$}be bounded holomorphic functions with 0<δ≤Σ‖$g$_{$i$}‖. Can we, for any$H$^{$p$}function ϕ, find$H$^{$p$}functions$u$_{1}, ...,$u$_{$m$}such that Σ$g$_{$i$}$u$_{$i$}=ϕ? It is known that the answer is affirmative in the polydisc, and the aim of this paper is to prove that it is in non-degenerate analytic polyhedra. To prove this, we construct a solution using a certain integral representation formula. The$H$^{$p$}estimate for the solution is then obtained by localization and some harmonic analysis results in the polydisc.

Principal component analysis (PCA) is one of the most commonly used statistical procedures with a wide range of applications. This paper considers both minimax and adaptive estimation of the principal subspace in the high dimensional setting. Under mild technical conditions, we first establish optimal rates of convergence for estimating the principal subspace which sharp with respect to all the parameters, thus providing a complete character ization of the difficulty of the estimation problem in term of the convergence rate. The lower bound is obtained by calculating the local metric entropy an application of Fano's lemma. The rate optimal estimator is constructed using aggregation, which, however, might not be computationally feasible. We then introduce an adaptive procedure for estimating the principal sub space which is fully data driven and can be computed efficiently. It is shown that the estimator attains the optimal rates of convergence simultaneously over a large collection of the parameter spaces. A key idea in our construc tion is a reduction scheme which reduces the sparse PCA problem to a high dimensional multivariate regression problem. This method is potentially useful for other related