解高维广义对称正则长波方程的Fourier谱方法

１引言对称正则长波方程（ＳＲＬＷＥ）是正则化长波方程（ＲＬＷＥ）的一种对称叙述［１］用于描述弱非线性作用下空间变换的离子声波传播．［１］得到了方程组（１．１）的双曲正割平方孤立波解、四个不变量和数值结果、明显地,从（１．１）中消去ρ,得到一类正则长波方程（ＲＬＷＥ）代替（１．２）中第三项、第四项对ｔ的导数为对ｘ的导数,得到Ｂｏｕｓｓｉｎｅｓｑ方程．［２］对一类广义对称正则长波方程组提出了谱方法,证明了古典光滑解的存在性和唯一性,建立了近似解的收敛性和误差估计。［３］研究了高维对称正则长波方程整体…     

欧氏空间中的变换和线性变换

欧氏空间中的变换和线性变换郝秀梅，杨子胥（山东财政学院数学系２５００１４）文［１］、［２］讨论了欧氏空间中几类与内积相关联的变换必为线性变换，本文不仅推广了该二文的全部定理，而且刻划了文［１］定理１的变换Ｔ．定理１设Ｔ是欧氏空间Ｖ的一个变换．如果存在...     

H~p空间的扩张与_（L~p）~＇分布（1＜p＜＋∞）

熟知Ｌｐ（Ｒｎ）（１＜ｐ＜∞，ｎ≥１）在Ｐｏｉｓｓｏｎ积分变换下等同于Ｈｐ（Ｒｎ×Ｒ＋）［１］，Ｌｐ函数的Ｒｉｅｓｚ变换对应于Ｈｐ函数的共轭运算［２］．本文获得如下结果：在广义Ｐｏｉｓｓｏｎ积分变换下ＤＬｄ＇（Ｒｎ）等同于一个新空间ＥＨｐ（Ｒｎ×Ｒ＋），ＤＬｐ＇分布的广义Ｒｉｅｓｚ变换对应于ＥＨｐ函数的共轭运算．这里ＥＨｐ本文首次定义，它是Ｈｐ的对微分运算，封闭的最小线扩张．此外，还给出几个关于ＥＨｐ函数与ＤＬｐ＇分布的公式．     

谈欧氏空间中的变换和线性变换

谈欧氏空间中的变换和线性变换彭明海彭学梅（湖南省吉首大学４１６０００）文［３］推广了文［１］、文［２］的全部定理，本文不仅推广了文［３］的全部定理，而且得出新的结果．同时，论证也较简捷．今介绍给同行参考．定理１σ和τ是欧氏空间Ｖ的两个变换，φ是Ｖ的线...     

A New Class of Generalized Landau Linear Positive Operator Sequence and Its Properties of Approximation

§１．　ＩｎｔｒｏｄｕｃｔｉｏｎＩｎ１９０８，Ｅ．Ｌａｎｄａｕｉｎｔｒｏｄｕｃｅｄｔｈｅｆｏｌｌｏｗｉｎｇｗｅｌｌｋｎｏｗｎｓｅｑｕｅｎｃｅｏｆｏｐｅｒａｔｏｒｓ［１］Ｌｎ［ｆ（ｔ）；ｘ］＝Ｋｎ∫１－１ｆ（ｔ）［１－（ｔ－ｘ）２］ｎｄｔ，　　　　（１．１）ｗｈｅｒｅ　　　　　Ｋｎ＝［∫１｛－１（１－ｔ２）ｎｄｔ］－１～ｎπ　　（ｎ→∞）．（１．１）ｗａｓｕｓｅｄｉｎｔｈｅｐｒｏｏｆｏｆｔｈｅＷｅｉｅｒｓｔｒａｓｓＴｈｅｏｒｅｍ．Ｓｉｎｃｅｔｈｅｎ，ｔｈｅａｐｐｒｏｘｉｍａｔｉｏｎｐｒｏｐ－ｅｒｔ…     

双代数余循环的余同调变换

在［８］中,作者讨论余循环交叉积和扭积之间的关系（见定理 ５．３）．设 Ａ＃ＸＨ为余循环交叉积,ｒ∈Ｈｏｍ（Ｈ,Ａ）,是卷积可逆的,且ｒ（１）＝１．在］［６］中,Ｓ．Ｍａｊｉｄ对任意地余循环Ｘ定义了余同调变换 ｘｒ·在本文中,首先证明了［８］中的定理 ５．３以及它的对偶在一般情况下成立． Ｓ． Ｍａｊｉｄ在［５］中给出了余循环交叉积和余循环交叉余积形成双代数的充要条件,这种结构称为Ｂｉｃｒｏｓｓｐｒｏｄｕｃｔ积．这里讨论了余循环余同调变换如何具体地保持这种双代数结构．     

控制过程方差的CUSUMQ图及其性质

崔恒建．控制过程方差的ＣＵＳＵＭＱ图及其性质．数理统计与管理，１９９８，１７（４），３３～３８．Ｑｕｓｅｎｂｅｒｒｙ（１９９５）基于样本方差的标准化变换Φ－１［Ｈｎ－１（（ｎ－１）Ｓ２／σ２０）］提出了控制过程方差的累积和（ＣＵＳＵＭ）Ｑ控制图。本文我们描述了在控制过程方差变化中这种ＣＵＳＵＭＱ控制图的性质，并将控制图的设计方法用到单边及双边的ＣＵＳＵＭＱ图，说明它几乎是最优的。而且我们发现在控制过程方差的微小变化时，设计的ＣＵＳＵＭＱ图的性能要优于基于ｌｏｇ（Ｓ２）的ＣＵＳＵＭ和ＥＷＭＡ图     

有理样条不可约解的行列式表示

１引言在文［１］中,对于剖分ａ＝ｘ０＜ｘ１＜…＜ｍｎ＝ｂ及给定的ｙ０,ｙ１,…,　…,Ｌ＋Ｍ－１,我们构造了有理样条Ｓ［Ｌ,Ｍ（ｘ）Ｑ［Ｌ,Ｍ］为次数不超过ｍ的多项式全体．在［１］中,已经讨论了Ｓ［Ｌ,Ｍ］（ｘ）的存在性,并指出：若问题（１）（２）（３）可解,则解唯一这里总假设问题（１）（２）（３）可解．２有理样条解不可约的充要条件由Ｓ［Ｌ,Ｍ］（ｘ）的依区间递推算法（见［１］）,我们只需讨论［ｘ０,ｘ１］上的情形．当［Ｘ０,ｘ１］时,将Ｓ［Ｌ,Ｍ］　（ｘ）,Ｐ［Ｌ,Ｍ］　（ｘ）和Ｑ［Ｌ,Ｍ］（…     

Travelling Wave Solutions for Generalized Fisher Equation

§１．　ＩｎｔｒｏｄｕｃｔｉｏｎＩｎ［１，２］，ＡｒｏｎｓｏｎａｎｄＷｅｉｎｂｅｒｇｅｒｈａｖｅｓｔｕｄｉｅｄｓｙｓｔｅｍａｔｉｃｌｙｔｈｅｓｃａｌａｒｎｏｎｌｉｎｅａｒｄｉｆｆｕ－ｓｉｏｎｅｑｕａｔｉｏｎｉｎｏｎｅｓｐａｃｅｖａｒｉａｂｌｅｕｔ＝ｕｘｘ＋φ（ｕ），（１．１）ｗｈｅｒｅｕ＝ｕ（ｘ，ｔ）ａｎｄφ（ｕ）ｉｓａｎｏｎｌｉｎｅａｒｆｕｎｃｔｉｏｎ．Ｅｑｕａｔｉｏｎ（１．１）ａｒｉｓｅｓｉｎｓｅｖｅｒａｌａｐｐｌｉｃａ－ｔｉｏｎｓ；Ｓｅｅ［１，２］ａｎｄ［３］ｆｏｒｉｎｆｏｒｍａｔｉｏｎａ…     

再谈欧氏空间的变换和线性变换

文［３］推广了文［１］～［２］中的全部定理,文［４］又推广了文［３］的全部定理,本文推广了文［４］的全部定理,指出了文［４］中的一个错误论断,并给出了线性变换的一个等价条件．为简便,文中的Ｖ表示欧氏空间,ＶＶ表示Ｖ的所有变换的集合,Ｌ（Ｖ）表示Ｖ的所...     

斜Haar类变换的演化生成与快速算法

1.引 言 Haar函数和Walsh函数是两类密切相关且十分重要的完备正交函数系,它们不仅在(离散)正交变换及其快速算法设计中起着重要的作用,而且在小波分析中占有重要地位:它们分别对应于Haar小波和Haar小波包.另外,它们还是遗传算法和密码学等涉及布尔函数或离散函数的学科之重要的理论分析工具.     

逆Walsh序p值Walsh变换的演化生成及快速算法

本文利用二分演化思想和矩阵分解技术 ,重点讨论逆Walsh序三值Walsh变换的演化生成和快速算法 ,并将之推广至p值情形 .     

The differential Fourier transform method

We suggest the two new discrete differential sine and cosine Fourier transforms of a complex vector which are based on solving by a finite difference scheme the inhomogeneous harmonic differential equations of the first order with complex coefficients and of the second order with real coefficients, respectively. In the basic version, the differential Fourier transforms require by several times less arithmetic operations as compared to the basic classicalmethod of discrete Fourier transform. In the differential sine Fourier transform, the matrix of the transformation is complex,with the real and imaginary entries being alternated, whereas in the cosine transform, the matrix is purely real. As in the classical case, both matrices can be converted into the matrices of cyclic convolution; thus all fast convolution algorithms including the Winograd and Rader algorithms can be applied to them. The differential Fourier transform method is compatible with the Good–Thomas algorithm of the fast Fourier transform and can potentially outperform all available methods of acceleration of the fast Fourier transform when combined with the fast convolution algorithms.     

Walsh函数的一种新定义及快速算法设计

传统的Walsh函数是以Rademacher函数为基函数生成 .本文运用对称复制的观点 ,定义了一种新函数 G函数 ,并以G函数为基础 ,定义了四种序的Walsh函数 ,同时 ,运用序码分析方法 ,实现了两种序Walsh变换的快速算法设计 .     

迭代方程与离散叙率Walsh函数

在J.L.Shanks的基础上,给出了产生离散叙率Walsh函数的迭代方程,由迭代 方程推出了离散Walsh 函数的表达式和Walsh变换的速算 法(FWWT).     

Spectral Decomposition of Cyclic Operators in Discrete Harmonic Analysis

For the operators of the discrete Fourier transform, the discrete Vilenkin–Christenson transform, and all linear transpositions of the discrete Walsh transform, we obtain their spectral decompositions and calculate the dimensions of eigenspaces. For complex operators, namely, the discrete Fourier transform and the Vilenkin–Christenson transform, we obtain real projectors on eigenspaces. For the discrete Walsh transform, we consider in detail the Paley and Walsh orderings and a new ordering in which the matrices of operators are symmetric. For operators of linear transpositions of the discrete Walsh transforms with nonsymmetric matrices, we obtain a spectral decomposition with complex projectors on eigenspaces. We also present the Parseval frame for eigenspaces of the discrete Walsh transform.     

C编号Walsh函数及Manz算法

沃尔什编号Walsh函数是Walsh在1923年给出的;1931年,Paley定义了佩利编号Walsh函数;哈德玛编号Walsh函数是根据Hadamard 1893年的工作,由专用     

On the properties of a new tensor product of matrices

Previously, the author introduced a new tensor product of matrices according to which the matrix of the discrete Walsh-Paley transform can be represented as a power of the second-order discrete Walsh transform matrix H with respect to this product. This power is an analogue of the representation of the Sylvester-Hadamard matrix in the form of a Kronecker power of H. The properties of the new tensor product of matrices are examined and compared with those of the Kronecker product. An algebraic structure with the matrix H used as a generator element and with these two tensor products of matrices is constructed and analyzed. It is shown that the new tensor product operation proposed can be treated as a convenient mathematical language for describing the foundations of discrete Fourier analysis.     

Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones

We describe an implementation of nonsymmetric interior-point methods for linear cone programs defined by two types of matrix cones: the cone of positive semidefinite matrices with a given chordal sparsity pattern and its dual cone, the cone of chordal sparse matrices that have a positive semidefinite completion. The implementation takes advantage of fast recursive algorithms for evaluating the function values and derivatives of the logarithmic barrier functions for these cones. We present experimental results of two implementations, one of which is based on an augmented system approach, and a comparison with publicly available interior-point solvers for semidefinite programming.     

Multidimensional Cooley–Tukey Algorithms Revisited

The representation theory of Abelian groups is used to obtain an algebraic divide-and-conquer algorithm for computing the finite Fourier transform. The algorithm computes the Fourier transform of a finite Abelian group in terms of the Fourier transforms of an arbitrary subgroup and its quotient. From this algebraic algorithm a procedure is derived for obtaining concrete factorizations of the Fourier transform matrix in terms of smaller Fourier transform matrices, diagonal multiplications, and permutations. For cyclic groups this gives as special cases the Cooley–Tukey and Good–Thomas algorithms. For groups with several generators, the procedure gives a variety of multidimensional Cooley–Tukey type algorithms. This method of designing multidimensional fast Fourier transform algorithms gives different data flow patterns from the standard “row–column” approaches. We present some experimental evidence that suggests that in hierarchical memory environments these data flows are more efficient.