基于仿酉矩阵的紧支撑二元正交小波滤波器组的构造

高维小波是处理多维信号的有力工具,张量积和栅格结构的小波有其自身的特点,但在实际应用中,我们仍需要构造小波滤波器来满足特定情形下的需要以提高滤波的效果,而构造正交滤波器,在多相域里就等价于构造仿酉阵,在本文中,我们通过对仿酉矩阵的研究,证明二元一次对称的仿酉阵一定能够块对角化,利用这种性质,给出了不可分离的二元正交小波滤波器组及线性相位小波滤波器的构造,并给出了相应的例子．     

中心对称仿酉矩阵的构造及二元具有线性相位正交小波滤波器组的参数化

中心对称仿酉矩阵(简记为CSPM)在线性相位的小波滤波器组的构造中起着重要的作用,本文给出偶数阶CSPM的表达式,矩阵中的元素为二元一次多项式.基于已给出的CSPM,给出具有线性相位的二元正交小波滤波器组的参数化,通过选取不同的参数可以得到的具有线性相位的正交小波滤波器组.最后给出算例.     

Weak amicable T‐matrices and Plotkin arrays

We introduce the class of weak amicable T‐matrices and use it to construct a class of orthogonal designs, for p = 1 and for p a prime power ≡ 3 (mod 4), and all odd q, q ≤ 21. This class includes new Plotkin arrays of order 24, 40, 56 and for the first time, of orders 8q, q ∈ {9,11,13,15,17,19,21}. © 2006 Wiley Periodicals, Inc. J Combin Designs 16: 44–52, 2008     

Continuous and discrete Bessel wavelet transforms

Using the theory of Hankel convolution, continuous and discrete Bessel wavelet transforms are defined. Certain boundedness results and inversion formula for the continuous Bessel wavelet transform are obtained. Important properties of the discrete Bessel wavelet transform are given.     

Approximation of high-dimensional kernel matrices by multilevel circulant matrices

Kernels are important in developing a variety of numerical methods, such as approximation, interpolation, neural networks, machine learning and meshless methods for solving engineering problems. A common problem of these kernel-based methods is to calculate inverses of kernel matrices generated by a kernel function and a set of points. Due to the denseness of these matrices, finding their inverses is computationally costly. To overcome this difficulty, we introduce in this paper an approximation of the kernel matrices by appropriate multilevel circulant matrices so that the fast Fourier transform can be applied to reduce the computational cost. Convergence analysis for the proposed approximation is established based on certain decay properties of the kernels.     

Intrinsic products and factorizations of matrices

We say that the product of a row vector and a column vector is intrinsic if there is at most one nonzero product of corresponding coordinates. Analogously we speak about intrinsic product of two or more matrices, as well as about intrinsic factorizations of matrices. Since all entries of the intrinsic product are products of entries of the multiplied matrices, there is no addition. We present several examples, together with important applications. These applications include companion matrices and sign-nonsingular matrices.     

轮廓波变换原理及其构造方法

本文主要介绍轮廓波变换的基本原理,对轮廓波多方向性实现的关键技术——多维多采样率系统进行了阐述并详细说明了方向滤波器的构造过程,最后总结出了构造方向滤波器组常用的两种方法——McClellan变换法和多相位表示法,并给出了9×9参数化扇形滤波器组的构造实例.     

Elementary matrices and products of idempotents

We study the relations between product decomposition of singular matrices into products of idempotent matrices and product decomposition of invertible matrices into elementary ones.     

Tensor rank bounds and explicit QTT representations for the inverses of circulant matrices

In this paper, we are concerned with the inversion of circulant matrices and their quantized tensor-train (QTT) structure. In particular, we show that the inverse of a complex circulant matrix $A$, generated by the first column of the form ${(a_0,\dots ,a_{m-1},0,\dots ,0,a_{-n},\dots ,a_{-1})}^{\top }$ admits a QTT representation with the QTT ranks bounded by $(m+n)$. Under certain assumptions on the entries of $A$, we also derive an explicit QTT representation of $A^{-1}$. The latter can be used, for instance, to overcome stability issues arising when numerically solving differential equations with periodic boundary conditions in the QTT format.     

分块r-循环Toeplitz矩阵的特征值方程

给出了分块 r-循环 Toeplitz矩阵特征方程的一个求法 ,推广了文 [1 ]的结果 .     

Sequences and arrays involving free variables

Abstact: Sequences in free variables are introduced and used to construct arrays in free variables which are suitable for circulant matrices. Most of the arrays found are maximal in the number of free variables. Applications include many new Goethals‐Seidel type arrays and complex orthogonal designs. © 2000 John Wiley & Sons, Inc. J Combin Designs 9: 17–27, 2001     

Numerical stability of biorthogonal wavelet transforms

Biorthogonal wavelets are essential tools for numerous practical applications. It is very important that wavelet transforms work numerically stable in floating point arithmetic. This paper presents new results on the worst-case analysis of roundoff errors occurring in floating point computation of periodic biorthogonal wavelet transforms, i.e. multilevel wavelet decompositions and reconstructions. Both of these wavelet algorithms can be realized by matrix–vector products with sparse structured matrices. It is shown that under certain conditions the wavelet algorithms can be remarkably stable. Numerous tests demonstrate the performance of the results.      

Pseudoprime factorizations of integer matrices

We give a method of factoring integer matrices in into components such that the factorization is not unique unless certain information is known. In Section 2, we introduce this method of factorization and provide theorems which establish its well-definedness. In Section 3, we construct a matrix in as a product of specific types of matrices and establish an algorithm for factoring the result uniquely given an amount of information.     

Two theorems on Euclidean distance matrices and Gale transform

We present a characterization of those Euclidean distance matrices (EDMs) D which can be expressed as D=λ(E−C) for some nonnegative scalar λ and some correlation matrix C, where E is the matrix of all ones. This shows that the cones

where is the elliptope (set of correlation matrices) and is the (closed convex) cone of EDMs.

The characterization is given using the Gale transform of the points generating D. We also show that given points , for any scalars λ₁,λ₂,…,λ_n such that

∑_j=1ⁿλ_jp^j=0, ∑_j=1ⁿλ_j=0,

we have

∑_j=1ⁿλ_jpⁱ−p^j2= forall i=1,…,n,

for some scalar independent of i.     

Inversion and canonization of block matrices

The paper is concerned with the problem of inverting block matrices to which the well-known Frobenius— Schur formulas are not applicable. These can be square matrices with four noninvertible square or rectangular blocks as well as square or rectangular matrices with two blocks. With regard to rectangular matrices, the results obtained are a further step in the development of the canonization method, which is used for solving arbitrary matrix equations.     

Mexican hat wavelet transform of distributions

Theory of Weierstrass transform is exploited to derive many interesting new properties of the Mexican hat wavelet transform. A real inversion formula in the differential operator form for the Mexican hat wavelet transform is established. Mexican hat wavelet transform of distributions is defined and its properties are studied. An approximation property of the distributional wavelet transform is investigated which is supported by a nice example.     

Explicit invariant measures for products of random matrices

We construct explicit invariant measures for a family of infinite products of random, independent, identically-distributed elements of SL. The matrices in the product are such that one entry is gamma-distributed along a ray in the complex plane. When the ray is the positive real axis, the products are those associated with a continued fraction studied by Letac & Seshadri [Z. Wahr. Verw. Geb. 62 (1983) 485-489], who showed that the distribution of the continued fraction is a generalised inverse Gaussian. We extend this result by finding the distribution for an arbitrary ray in the complex right-half plane, and thus compute the corresponding Lyapunov exponent explicitly. When the ray lies on the imaginary axis, the matrices in the infinite product coincide with the transfer matrices associated with a one-dimensional discrete Schrödinger operator with a random, gamma-distributed potential. Hence, the explicit knowledge of the Lyapunov exponent may be used to estimate the (exponential) rate of localisation of the eigenstates.

     

Cauchy wavelet transform of ultra-distributions in tube domains

In this paper, Cauchy wavelet transform of ultra-distributions in tube domains is defined and its various properties are studied using the theory of Cauchy integrals and Poisson integrals of ultra-distributions.