HILBERTIAN INVARIANCE PRINCIPLE FOR EMPIRICAL PROCESS ASSOCIATED WITH A MARKOV PROCESS

The authors establish the Hilbertian invariance principle for the empirical process of a stationary Markov process, by extending the forward-backward martingale decomposition of Lyons-Meyer-Zheng to the Hilbert space valued additive functionals associated with general non-reversible Markov processes.     

对角因子循环矩阵的谱分解及其应用

在文「１」的基础上讨论对角因子循环矩阵。首先，我们给出对角因子循环矩阵的谱分解，然后，讨论对角因子循环矩阵的广义逆，最后，作为应用，求解一类偏微分方程。     

可补Hilbert C*-模及其有界模映射

给出了可补Hilbert C^*-模一系列等价刻画，获得了一类有界模映射的分解定理。     

用矩阵的谱分解研究线性矩阵方程

本利用矩阵的谱分解来研究线性矩阵方程，并给出当A，B为简单矩阵(即可对角化方阵)时，方程AX-XB=C和X=AXB=C有解的充要条件及通解形式。     

On the Decomposition of Hopf Module Coalgebra

In1969,Sweedler[1]giventhedecompositiontheoreyofcoalgebraswhicharecocommu-tative.In1975,Kaplansky[2]showedthatanycoalgebracanbeuniquelydecomposedintoadirectsumofitsindecomposablesubcoalgebras.From1978to1992,Shudo[3]andXu[4]consructuredtheindecomposabledirectsumcomponentsofacoalggebra,viadefineequivalenceralationforthesetofsimplesubcoalgebras.Asweknow,themodolecoalgebraisthennaturalgeneralizationofcoalgebra.AndittakesplayanimportentroleintheDrinfelddouble.Inthispaper,wediscussthedecompositio…     

满意正交表及其判别方法

本文提出了满意正交表的概念，并且利用正交表和投影矩阵的正交分解之间的关系给出了满意正交表的一种判别方法。     

对合的分解

Using the notion of biconnected sum we define the biconnected sum (T₁, M₁)§(T₂,M₂) of two involutions (T1M1) and (T2,M2) which is an involution on the biconnected sum M₁,§M₂. A connected involution is said to be reducible if it can be expressed as a biconnected sum of two connected involutions.Theorem Each connected involution (T, M) can be decomposed into a bi-connected sum of connected irreducible involutions (T, M)=(T₁, M₁)§…§(T_q,M_q),and (?) where the coefficients of H_{n_1}(M) are in Z/2 Z if M is unoriented, in Z if is oriented .     

一类广义的Kdv方程的显式差分解

本文考察一类具耗散的广义KdV方程组■ (gradφ(■))_x ■_(xxx)-α■_(xx) γ■ =■(x,t,■)的周期初值问题的显式差分格式．利用有界延拓法证明了该差分格式的收敛性与稳定性,并给出了算法和数值例子．     

符号几何规划的一种分解方法

针对符号几何规划提出了一种直接的分解方法,将难于求解的符号几何规划问题等价地转化为一个非线性程度很低的可分离规划,为寻求困难度高且规模较大的符号几何规划问题的求解提供了一种方法,特别是经此方法分解后的每个子问题均易于求解,最后给出了数值实例,验证了此方法的有效性．