二元三方向剖分中B样条的B网结构与递推算法

§1.引言众所周知,de Boor-Con递推公式及微分-差分公式对于一元B样条的理论和应用极为重要。在多元样条中是否存在类似的结果,已成为近年来的研究课题。本文从B网结构出发,讨论三向剖分下不同次数样条空间的B样条之间的递推关系,指出不能简单地把函数形式的de Boor-Con公式搬到这里,然而可以在B网意义下实现递推。与一     

多元线性回归模型参数估计的递推算法及误差分析

讨论新增数据信息对多元线性回归模型的修正原理,给出不断加入新增数据信息的多元线性回归模型参数估计值的一种递推算法.利用影响因子的概念来刻画新增信息对预测误差的影响,并给出了算法和应用实例.     

Pseudoaffinity, de Boor algorithm, and blossoms

In order to ensure existence of a de Boor algorithm (hence of a B-spline basis) in a given spline space with (n+1)-dimensional sections, it is important to be able to generate each spline by restriction to the diagonal of a symmetric function of n variables supposed to be pseudoaffine w.r. to each variable. We proved that a way to obtain these three properties (symmetry, n-pseudoaffinity, diagonal property) is to suppose the existence of blossoms on the set of admissible n-tuples, given that blossoms are defined in a geometric way by means of intersections of osculating flats. In the present paper, we examine the converse: do symmetry, n-pseudoaffinity, and diagonal property imply existence of blossoms?     

Error Correcting Sequence and Projective De Bruijn Graph

Let X be a finite set of q elements, and n, K, d be integers. A subset C ⊂ X ⁿ is an (n, K, d) error-correcting code, if #(C) = K and its minimum distance is d. We define an (n, K, d) error-correcting sequence over X as a periodic sequence {a _i } _i=0,1,... (a _i ∈ X) with period K, such that the set of all consecutive n-tuples of this sequence form an (n, K, d) error-correcting code over X. Under a moderate conjecture on the existence of some type of primitive polynomials, we prove that there is a error correcting sequence, such that its code-set is the q-ary Hamming code with 0 removed, for q > 2 being a prime power. For the case q = 2, under a similar conjecture, we prove that there is a error-correcting sequence, such that its code-set supplemented with 0 is the subset of the binary Hamming code [2 ^m  − 1, 2 ^m  − 1 − m, 3] obtained by requiring one specified coordinate being 0. Received: October 27, 2005. Final Version received: December 31, 2007     

Products of B-patches

Products and tensor products of multivariate polynomials in B-patch form are viewed as linear combinations of higher degree B-patches. Univariate B-spline segments and certain regions of simplex splines are examples of B-patches. A recursive scheme for transforming tensor product B-patch representations into B-patch representations of more variables is presented. The scheme can also be applied for transforming ann-fold product of B-patch expansions into a B-patch expansion of higher degree. Degree raising formulas are obtained as special cases. The scheme calculates the blossom of the (tensor) product surface and generalizes the pyramidal recursive scheme for B-patches.     

Error Analysis of Clenshaw's Algorithm for Evaluating Derivatives of a Polynomial

A forward rounding error analysis is presented for the extended Clenshaw algorithm due to Skrzipek for evaluating the derivatives of a polynomial expanded in terms of orthogonal polynomials. Reformulating in matrix notation the three-term recurrence relation satisfied by orthogonal polynomials facilitates the estimate of the rounding error for the m-th derivative, which is recursively estimated in terms of the one for the (m – 1)-th derivative. The rounding errors in an important case of Chebyshev polynomial are discussed in some detail.This revised version was published online in October 2005 with corrections to the Cover Date.     

Error Analysis of the Lanczos Algorithm for Tridiagonalizing a Symmetric Matrix

The Lanczos algorithm for tridiagonalizing a symmetric matrixis the basis for several methods for solving sets of linearequations as well as for solving the eigenproblem. These methodsare very useful when the matrix is large and sparse. A completerounding error analysis of the algorithm is presented here,giving among other results an important expression for the lossof orthogonality of the computed vectors. The results here canbe used to analyze the many methods which are basedon the Lanczosalgorithm.     

关于DC函数最小化邻近点算法的注记

本文证明DC函数最小化问题邻近点算法的一个收敛性定理,并对此问题提出一类非精确邻近点算法．     

基于声矢量水听器阵列误差的自校正算法

对声矢量水听器阵列的各类误差进行了分类,推导了各类误差对阵列信号模型的影响因子,通过Monte Carlo实验分析对比了各类误差对阵列DOA估计性能的影响,然后将方向性误差和位置误差归结为幅度误差和相位误差,在传统声压阵列误差校正模型和算法的基础上,得到矢量阵列误差自校正的优化模型及自校正算法,最后,通过仿真实验和外场实验的数据处理表明,自校正算法具有良好的参数估计性能,具有一定的工程实用性.     

非线性测量误差模型的影响分析

本文对非线性测量误差模型给出了统一的诊断方法,并证明了数据删除模型与均值漂移模型的等价性,由此出发得到了Cook距离、残差、杠杆值等诊断统计量.本文还讨论了非线性测量误差模型的局部影响分析,并给出了一个具体应用实例.推广了Zhao & Lee(1995)的结果.     

On Koetter's Algorithm and the Computation of Error Values

In this article, we show that Koetter's algorithm for decoding one-point codes can compute error evaluator polynomials as well. We also show that the error evaluators do not need to be computed. The updating functions used in Koetter's algorithm can be used to compute error values instead.