基于二元连分式的散乱数据递推插值格式

本文首先基于新的非张量积型偏逆差商递推算法,分别构造奇数与偶数个插值节点上的二元连分式散乱数据插值格式,进而得到被插函数与二元连分式间的恒等式.接着,利用连分式三项递推关系式,提出特征定理来研究插值连分式的分子分母次数.然后,数值算例表明新的递推格式可行有效,同时,通过比较二元Thiele型插值连分式的分子分母次数,发现新的二元插值连分式的分子分母次数较低,这主要归功于节省了冗余的插值节点. 最后,计算此有理函数插值所需要的四则运算次数少于计算径向基函数插值.     

Thiele型向量连分式的收敛性定理

Thiele型向量连分式,不仅可用来解决一元和多元向量有理插值问题[1-3],一元和多元向量切触有理插值问题[3],还可用来研究向量Pade逼近及向量连分式逼近[1,3]。本文给出了这种连分式的收敛性定理,并把著名的Pringsheim定理推广到向量连分式上去。     

基于特征值理论求分式线性递推数列极限

利用分式线性递推数列与二阶方阵的对应关系,通过求二阶方阵的n次幂,给出了分式线性递推数列的通项表达式.再利用矩阵的特征值与不动点关系,得到了分式线性递推数列敛散性的所有表现形式.     

Stieltjes-Newton型有理插值

Stieltjes型分叉连分式在有理插值问题中有着重要的地位，它通过定义反差商和混合反差商构造给定结点上的二元有理函数，我们将Stieltjes型分叉连分式与二元多项式结合起来，构造Stieltje- Newton型有理插值函数，通过定义差商和混合反差商，建立递推算法，构造的Stieltjes-Newton型有理插值函数满足有理插值问题中所给的插值条件，并给出了插值的特征定理及其证明，最后给出的数值例子，验证了所给算法的有效性．     

关于Thiele型向量值连分式收敛定理的一个注记

本文利用推广的向量连分式向后递推算法重新给出了文[3]中定理1的证明,并改进了其结果。最后,在稍强的条件下,给出了这一类收敛向量连分式的一个更精致的截断误差估计。     

常见的非线性递推数列通项公式求法

我们经常遇到含有分式根式或二次式等非线性递推关系．如何根据这些非线性递推关系求数列的通项公式呢？     

“不动点法”与数列通项问题

由递推公式推导数列通项的问题千姿百态,其方法也不拘一格,在做题时经常会碰到一类递推数列,它满足的是分式递推关系．对于这种题型,大家一般想到的方法是“构造法”,那么除了这种方法还有没有别的方法呢？     

矩阵连分式序列的收敛性

本文研究了矩阵连分式的性质，获得了关于矩阵连分式序列收敛性的一些结果．     

连分式的不等式

本文研究二元连分式G(m,λ)的单调性质,得到一些新的连分式不等式．     

实Clifford分析中一类高阶奇异积分的计算公式

讨论了实Clifford分析中的一类高阶奇异积分,给出了这类高阶奇异积分的递推公式,计算公式.从而使实Clifford分析理论得以拓展.     

The Vector Epsilon Algorithm – a Residual Approach

We present an alternative to the vector -algorithm based on vector continued fractions and which is applicable when the sequence to be accelerated is generated by a one-point iteration function. These fractions are constructed in the language of Clifford algebras, which allow three-term recurrence relations. The new algorithm evidently has considerably greater numerical precision than the old one. Results from numerical experiments are reported.     

基于Samelson逆的向量值连分式的收敛准则

The aim of this work is to give some criteria on the convergence of vector valued continued fractions defined by Samelson inverse. We give a new approach to prove the convergence theory of continued fractions. First, by means of the modified classical backward recurrence relation, we obtain a formula between the m-th and n-th convergence of vector valued continued fractions. Second, using this formula, we give necessary and sufficient conditions for the convergence of vector valued continued fractions.     

Improving a method for computing non-dominant solutions of certain second-order recurrence relations of Poincaré-type

Summary In this paper we present a method of convergence acceleration for the calculation of non-dominant solutions of second-order linear recurrence relations for which the coefficients satisfy certain asymptotic conditions. It represents an improvement of the method recently proposed by Jacobsen and Waadeland [3, 4] for limit periodic continued fractions. For continued fractions the method corresponds to a repeated application of the Bauer-Muir transformation. Some examples and a generalization to non-homogeneous recurrence relations are given.     

BIVARIATE VECTOR VALUED RATIONAL INTERPOLANTS BY BRANCHED CONTINUED FRACTIONS

By making use of Thiele-type bivariate branched continued fractions and Sumelson inverse,we construct a few kinds of bivariate vector valued rational interpolonts (BVRIs) over rectangular grids and find out certain relations among these BVRIs such as boundary identity and duality.     

On branched continued fractions rational interpolation over pyramid-typed grids

In this paper, three-term recurrence relations for branched continued fractions are determined. Based on the algorithm of partial inverse differences in tensor-product-like manner, the finite branched continued fractions can be applied to rational interpolation over pyramid-typed grids in R ³. By means of the three-term recurrence relations, a characterization theorem is valid. Then an error estimation is worked out. Based on the relationship between the partial inverse differences and partial reciprocal ones, and the partial reciprocal derivatives as well, the BCFs osculatory interpolation with its algorithm is stated which shows it feasibility of partial derivable functions in BCFs expansion at one point.     

‘Classical’ convergence theorems for generalized continued fractions

In this paper the classical convergence theorems by Śleszyński-Pringsheim, Worpitzky and Van Vleck for ordinary continued fractions will be generalized to continued fractions generalizations (along the lines of the Jacobi–Perron algorithm) with four-term recurrence relations.      

Clifford algebra valued boundary integral equations for three-dimensional elasticity

Applications of Clifford analysis to three-dimensional elasticity are addressed in the present paper. The governing equation for the displacement field is formulated in terms of the Dirac operator and Clifford algebra valued functions so that a general solution is obtained analytically in terms of one monogenic function and one multiple-component spatial harmonic function together with its derivative. In order to solve numerically the three-dimensional problems of elasticity for an arbitrary domain with complicated boundary conditions, Clifford algebra valued boundary integral equations (BIEs) for multiple-component spatial harmonic functions at an observation point, either inside the domain, on the boundary, or outside the domain, are constructed. Both smooth and non-smooth boundaries are considered in the construction. Moreover, the singularities of the integrals are evaluated exactly so that in the end singularity-free BIEs for the observation point on the boundary taking values on Clifford numbers can be obtained. A Clifford algebra valued boundary element method (BEM) based on the singularity-free BIEs is then developed for solving three-dimensional problems of elasticity. The accuracy of the Clifford algebra valued BEM is demonstrated numerically.     

Fueter polynomials in discrete Clifford analysis

Discrete Clifford analysis is a higher dimensional discrete function theory, based on skew Weyl relations. The basic notions are discrete monogenic functions, i.e. Clifford algebra valued functions in the kernel of a discrete Dirac operator. In this paper, we introduce the discrete Fueter polynomials, which form a basis of the space of discrete spherical monogenics, i.e. discrete monogenic, homogeneous polynomials. Their definition is based on a Cauchy–Kovalevskaya extension principle. We present the explicit construction for this discrete Fueter basis, in arbitrary dimension m and for arbitrary homogeneity degree k.     

Monogenic Differential Operators

In this paper we consider operators acting on Clifford algebra valued polynomials and, in particular, differential operators with polynomial coefficients. The decomposition of polynomials into homogeneous pieces leads to the classical homogeneous decomposition of operators and the further decomposition of homogeneous polynomials into monogenic polynomials leads to the concept of monogenic operator. Monogenic operators are characterized in terms of commutation relations and the monogenic decomposition of differential operators is studied in detail.