Non-stationary subdivision for exponential polynomials reproduction

In this paper we develop a novel approach to construct non-stationary subdivision schemes with a tension control parameter which can reproduce functions in a finite-dimensional subspace of exponential polynomials. The construction process is mainly implemented by solving linear systems for primal and dual subdivision schemes respectively, which are based on different parameterizations. We give the theoretical basis for the existence, uniqueness, and refinement rules of schemes proposed in this paper. The convergence and smoothness of the schemes are analyzed as well. Moreover, conics reproducing schemes are analyzed based on our theory, and a new idea that the tensor parameter ωk of the schemes can be adjusted for conics generation is proposed.     

Discrete chaos in Banach spaces

This paper is concerned with chaos in discrete dynamical systems governed by continuously Frech@t differentiable maps in Banach spaces. A criterion of chaos induced by a regular nondegenerate homoclinic orbit is established. Chaos of discrete dynamical systems in the n-dimensional real space is also discussed, with two criteria derived for chaos induced by nondegenerate snap-back repellers, one of which is a modified version of Marotto's theorem. In particular, a necessary and sufficient condition is obtained for an expanding fixed point of a differentiate map in a general Banach space and in an n-dimensional real space, respectively. It completely solves a long-standing puzzle about the relationship between the expansion of a continuously differentiable map near a fixed point in an n-dimensional real space and the eigenvalues of the Jacobi matrix of the map at the fixed point.     

Statistical and Geometrical Way of Model Selection for a Family of Subdivision Schemes

The objective of this article is to introduce a generalized algorithm to produce the m-point n-ary approximating subdivision schemes(for any integer m, n ≥ 2). The proposed algorithm has been derived from uniform B-spline blending functions. In particular, we study statistical and geometrical/traditional methods for the model selection and assessment for selecting a subdivision curve from the proposed family of schemes to model noisy and noisy free data. Moreover, we also discuss the deviation of subdivision curves generated by proposed family of schemes from convex polygonal curve. Furthermore, visual performances of the schemes have been presented to compare numerically the Gibbs oscillations with the existing family of schemes.     

The Haar Wavelet Analysis of Matrices and Its Applications

It is well known that Fourier analysis or wavelet analysis is a very powerful and useful tool for a function since they convert time-domain problems into frequency-domain problems. Are there similar tools for a matrix? By pairing a matrix to a piecewise function,a Haar-like wavelet is used to set up a similar tool for matrix analyzing, resulting in new methods for matrix approximation and orthogonal decomposition. By using our method, one can approximate a matrix by matrices with different orders. Our method also results in a new matrix orthogonal decomposition, reproducing Haar transformation for matrices with orders of powers of two. The computational complexity of the new orthogonal decomposition is linear. That is, for an m × n matrix, the computational complexity is O(mn). In addition,when the method is applied to k-means clustering, one can obtain that k-means clustering can be equivalently converted to the problem of finding a best approximation solution of a function. In fact, the results in this paper could be applied to any matrix related problems.In addition, one can also employ other wavelet transformations and Fourier transformation to obtain similar results.     

The independence of initial vectors in the subdivision schemes

Starting with an initial vector λ = (λ(κ))κ∈z ∈ ep(Z), the subdivision scheme generates asequence (Snaλ)∞n=1 of vectors by the subdivision operator Saλ(κ) = ∑λ(j)a(k - 2j), k ∈ Z. j∈zSubdivision schemes play an important role in computer graphics and wavelet analysis. It is very interesting tounderstand under what conditions the sequence (Snaλ)∞n=1 converges to an Lp-function in an appropriate sense.This problem has been studied extensively. In this paper we show that the subdivision scheme converges forany initial vector in ep(Z) provided that it does for one nonzero vector in that space. Moreover, if the integertranslates of the refinable function are stable, the smoothness of the limit function corresponding to the vectorλ is also independent of λ.     

Factorization of proper holomorphic maps on irreducible bounded symmetric domains of rank≥2

We obtain rigidity results on arbitrary proper holomorphic maps F from an irreducible bounded symmetric domain Ω of rank ≥2 into any complex space Z. After lifting to the normalization of the subvariety F (Ω) Z, we prove that F must be the canonical projection map to the quotient space of Ω by a finite group of automorphisms. The approach is along the line of the works of Mok and Tsai by considering radial limits of bounded holomorphic functions derived from F and proving that proper holomorphic maps between bounded symmetric domains preserve certain totally geodesic subdomains. In contrast to the previous works, in general we have to deal with multivalent holomorphic maps for which Fatou’s theorem cannot be applied directly. We bypass the difficulty by devising a limiting process for taking radial limits of correspondences arising from proper holomorphic maps and by elementary estimates allowing us to define distinct univalent branches of the underlying multivalent map on certain subsets. As a consequence of our rigidity result, with the exception of Type-IV domains, any proper holomorphic map f : Ω→ D of Ω onto a bounded convex domain D is necessarily a biholomorphism. In the exceptional case where Ω is a Type-IV domain, either f is a biholomorphism or it is a double cover branched over a totally geodesic submanifold which can be explicitly described.     

A unified three point approximating subdivision scheme

In this paper,we propose a three point approximating subdivision scheme,with three shape parameters,that unifies three different existing three point approximating schemes.Some sufficient conditions for subdivision curve C0 to C3 continuity and convergence of the scheme for generating tensor product surfaces for certain ranges of parameters by using Laurent polynomial method are discussed.The systems of curve and surface design based on our scheme have been developed successfully in garment CAD especially for clothes modelling.     

求解方程的一类迭代公式

Using the forms of Newton iterative function, the iterative function of Newton's method to handle the problem of multiple roots and the Halley iterative function, we give a class of iterative formulae for solving equations in one variable in this paper and show that their convergence order is at least quadratic. At last we employ our methods to solve some non-linear equations and compare them with Newton's method and Halley's method. Numerical results show that our iteration schemes are convergent if we choose two suitable parametric functions λ(x) and μ(x). Therefore, our iteration schemes are feasible and effective.     

A Gorni-Zampieri Pair of a Homogeneous Polynomial Map

In this paper, we improve the algorithm and rewrite the function make- Pairing for computing a Gorni-Zampieri pair of a homogeneous polynomial map. As an application, some counterexamples to PLDP （dependence problem for power lin- car maps） are obtained, including one in the lowest dimension （n = 48） in all suchcounterexamples one has found up to now.     

THE REDUCED BASIS TECHNIQUE AS A COARSE SOLVER FOR PARAREAL IN TIME SIMULATIONS

In this paper, we extend the reduced basis methods for parameter dependent problems to the parareal in time algorithm introduced by Lions et al. [12] and solve a nonlinear evolutionary parabolic partial differential equation. The fine solver is based on the finite element method or spectral element method in space and a semi-implicit Runge-Kutta scheme in time. The coarse solver is based on a semi-implicit scheme in time and the reduced basis approximation in space. Of[line-online procedures are developed, and it is proved that the computational complexity of the on-line stage depends only on the dimension of the reduced basis space （typically small）. Parareal in time algorithms based on a multi-grids finite element method and a multi-degrees finite element method are also presented. Some numerical results are reported.     

Maximal Subgroups in the Classical Groups Normalizing Solvable Subgroups

Let G be a classical group over an arbitrary field F,acting on an n-dimensional vector space V=V(n,F) over a field F.In this paper,we classify the maximal subgroups of G,which normalizes a solvable subgroup N of GL(L,F) not lying in F~*1_V.     

複合形在歐氏空間中的實現問题Ⅰ

<正> 在拓撲發展之初很早就知道一個抽象的n維單純複合形(有限或無限)必可在2n+1維歐氏空間及R~(2n+1)中得到實現,它的證明也很簡單(例如見[1]§2或[2]第Ⅲ章§2).從這一定理知道2n+1維的歐氏空間實際上已包括了所有想像得到的n維複合形,可是是否有不能在R~m中實現但能在R~(m+1)中實現的     

Reachability analysis of linear systems using support functions

This work is concerned with the algorithmic reachability analysis of continuous-time linear systems with constrained initial states and inputs. We propose an approach for computing an over-approximation of the set of states reachable on a bounded time interval. The main contribution over previous works is that it allows us to consider systems whose sets of initial states and inputs are given by arbitrary compact convex sets represented by their support functions. We actually compute two over-approximations of the reachable set. The first one is given by the union of convex sets with computable support functions. As the representation of convex sets by their support function is not suitable for some tasks, we derive from this first over-approximation a second one given by the union of polyhedrons. The overall computational complexity of our approach is comparable to the complexity of the most competitive available specialized algorithms for reachability analysis of linear systems using zonotopes or ellipsoids. The effectiveness of our approach is demonstrated on several examples.     

Area preserving maps and volume preserving maps between a class of polyhedrons and a sphere

We construct a bijective continuous area preserving map from a class of elongated dipyramids to the sphere, together with its inverse. Then we investigate for which such solid polyhedrons the area preserving map can be used for constructing a bijective continuous volume preserving map to the 3D-ball. These maps can be further used in constructing uniform and refinable grids on the sphere and on the ball, starting from uniform and refinable grids on the elongated dipyramids. In particular, we show that HEALPix grids can be obtained from these maps. We also study the optimality of the logarithmic energy of the configurations of points obtained from these grids.     

多元FFT与FST的直接方法

一、多元变换矩阵与矩阵的张量积 矩阵的张量积(Kronecker乘积)是导出多元直接变换的主要工具,因此,这里首先列出张量积的定义及其简单性质. 定义.设A_n,B_m分别是n×n,m×m方阵,则A_n与B_m的张量积是一个(n·m)×(n·m)方阵:A_nB_m=[A_nb_(ij)],其中B_m=[b_(ij)].并记A~(k)=?.     

From approximating to interpolatory non-stationary subdivision schemes with the same generation properties

In this paper we describe a general, computationally feasible strategy to deduce a family of interpolatory non-stationary subdivision schemes from a symmetric non-stationary, non-interpolatory one satisfying quite mild assumptions. To achieve this result we extend our previous work (Conti et al., Linear Algebra Appl 431(10):1971?C1987, 2009) to full generality by removing additional assumptions on the input symbols. For the so obtained interpolatory schemes we prove that they are capable of reproducing the same space of exponential polynomials as the one generated by the original approximating scheme. Moreover, we specialize the computational methods for the case of symbols obtained by shifted non-stationary affine combinations of exponential B-splines, that are at the basis of most non-stationary subdivision schemes. In this case we find that the associated family of interpolatory symbols can be determined to satisfy a suitable set of generalized interpolating conditions at the set of the zeros (with reversed signs) of the input symbol. Finally, we discuss some computational examples by showing that the proposed approach can yield novel smooth non-stationary interpolatory subdivision schemes possessing very interesting reproduction properties.     

On Semitransitive Collections of Operators

A collection F of operators on a vector space V is said to be semitransitive if for every pair of nonzero vectors x and y in V there exists a member T of F such that either Tx = y or Ty = x (or both). We study semitransitive algebras and semigroups of operators. One of the main results is that if the underlying field is algebraically closed, then every semitransitive algebra of operators on a space of dimension n contains a nilpotent element of index n. Among other results on semitransitive semigroups, we show that if the rank of nonzero members of such a semigroup acting on an n-dimensional space is a constant k, then k divides n.     

A quantitative program for Hadwiger’s covering conjecture

In 1957,Hadwiger made a conjecture that every n-dimensional convex body can be covered by 2n translates of its interior.Up to now,this conjecture is still open for all n 3.In 1933,Borsuk made a conjecture that every n-dimensional bounded set can be divided into n + 1 subsets of smaller diameters.Up to now,this conjecture is open for 4 n 297.In this article we encode the two conjectures into continuous functions defined on the spaces of convex bodies,propose a four-step program to attack them,and obtain some partial results.     

偶特征有限正交空间中的几个计数公式及应用

设Fq(n)是Fq上的n维正交空间,设P是任一个给定的m维全奇异子空间.计算了F(qn)中满足dim(P∩Q)=i的r维全奇异子空间Q的个数,给出了用子空间构作认证码的例子.