矩阵方程AXB=C的通解

本文给出了矩阵方程 Ａ_（ｍ×ｎ）Ｘ_（ｎ×５）Ｂ_（ｓ×）＝Ｃ_（ｍ×ｔ）有解且有无穷解的通解表达式 Ｘ＝Ｃ~（＊＊）＋［ｋ_（１１）ξ_１~Ｔ＋…＋ｋ_（１（ｎ－ｒ））ξ_（ｎ－ｒ）~Ｔ＋……ｋ_（ｓ１）ξ_１~Ｔ＋…＋ｋ_（ｓ（ｎ－ｒ））ξ_（ｎ－ｒ）~Ｔ］ ＋［Ｐ_（１１）η_１＋…＋Ｐ_（１（ｓ－１））η_（ｓ－１）……Ｐ_（ｎ１）η_１＋…Ｐ_（ｎ（ｓ－１））η_（ｓ－１）］~Ｔ（其中ｋ_（ｉｊ）;Ｐ_（ｉｊ）为任意常数;ξ_１…,ξ_（ｎ－ｒ）;η_１…,η_（ｓ－１）分别为Ａ_（ｍ×ｎ）Ｘ_（ｎ×１）＝０;Ｘ_（１×ｓ）Ｂ_（ｓ×ｔ）＝０的一个基础解系,Ｃ~（＊＊）为ＡＸＢ＝Ｃ的一个特解）及利用矩阵初等变换求其通解的方法．     

关于∑sin~3A—∑cos~3A的下界

关于∑ｓｉｎ~３Ａ—∑ｃｏｓ~３Ａ的下界宁波大学数学系陈计陈宽宏在［１］中讨论了关于ＡＢＣ中界，他给出了如下结论：但未能给出（３）不平凡的下界．粗略探索之后，估计（３）在（Ａ，Ｂ，Ｃ）→（π，０，０）时取下确界－１；然而这并不成立：令看来，（３）的下确...     

关于一种循环类预条件方程组的快速求解

１引言考虑下列Ｎ阶线性方程组其中Ｃ１＝,Ｃ２＝０≤ｉ,ｊ≤Ｎ－１,是Ｎ阶循环矩阵,Ｊ１＝（Ｊ）是Ｎ阶置换矩阵,其元素分别满足１９９３年,Ｔ,Ｋ．Ｋｕ,Ｃ．Ｃ．Ｊ．Ｋｕｏ在［１］中取Ｃ１,Ｃ２为实对称循环矩阵,而Ｃ１＋Ｊ１Ｃ２作为预条件矩阵来求解在数字信号处理中有一定应用的Ｔｏｅｐｌｉｔｚ加Ｈａｎｋｅｌ线性方程组［２］,得到了一种高效的预处理其轭梯度算法．当Ｔｏｅｅｌｉｔｚ与Ｈａｎｋｅｌ矩阵之和为正定矩阵且条件数适中时,所需运算量可达到０（Ｎｌｏｇ２Ｎ）,比原有算法［２,３,４］的运算量０（Ｎ２）…     

奇阶中立型时滞微分方程解的振动性

１．引言考虑奇阶非线性泛函微分方程［ｘ（ｔ）－ｃｘ（ｔ—(）］（ｎ）＋ｐ（ｔ）ｆ（ｘ（ｔ－σ））＝０（１）对方程（１）我们作如下假设（Ｈ）：（Ｈ１）ｎ＞１是奇整数,ｐ∈Ｃ（（ｔ０,∞）,（ｔ０,∞））;（Ｈ２）τ＞０,σ＞０且０≤ｃ≤１;（Ｈ３）ｆ∈Ｃ（Ｒ,Ｒ）是单调增加,ｘｆ（ｘ）＞０,Ｘ≠０且当｜ｘ｜→∞时有｜ｆ（ｔ）｜→∞．设δ＝ｍａｘ｛τ,σ｝,∈Ｃ（［Ｔ－δ,Ｔ］,Ｒ）．方程（１）在［Ｔ,∞）上的解是指函数ｘ∈Ｃ（［Ｔ,∞）,Ｒ）,使得ｘ（ｔ）＝(（ｔ）,Ｔ－δ≤ｔ≤Ｔ,［ｘ（ｔ）－ｃｘ…     

非对称不定问题的非协调多重网格法

１．引言设　是Ｒｄ（ｄ＝２;３）中的有界多角形区域,α是它的边界．考虑下列模型问题此处ｆ∈ＥＬ２（Ω）,系数ＡＥ（Ｃ１（Ω））ｄ×ｄ满足下列一致椭园条件此处α０是正常数．此外假设Ｂ∈（Ｃ１（Ω）ｄ和ｃ∈Ｃ０（Ω）（［１４］）．（１．１）式的变分形式是：找ｕ∈Ｈ０（Ω）使得最近,非对称不定问题的非协调多重网格法吸引了众多的研究,详见问,［７］;［１０］．考虑非协调元多重网格的一个重要原因是混合元和非协调元之间存在着紧密的联系（详见【几问,问）．设ＦＩ是ｆｉ拟一致的Ｈ角形或矩形剖分,是由连接Ｆ'－'（…     

Burgers－KdV 方程的初边值问题

该文借助适当的逼近，用散逸算子理论，差分和估计方法，证明了［０，１］×［０，Ｔ］上Ｂｕｒｇｅｒｓ－ＫｄＶ方程ｕｔ＋ｕ（ｘｘｘ）－Ｕ（ｘｘ）＋ｕｕｘ＝ｆ（ｘ，ｔ）的一类初边值问题存在唯一的解ｕ∈Ｌ∞（０，Ｔ；Ｈ３（０，１））∩Ｃ（０，Ｔ；Ｈ２（０，１））∩Ｗ（１，∞），（Ｏ，Ｔ；Ｌ２（０，１））．     

数值求解延时微分方程的步长准则

１．引言 用一个数值方法求解下列延时微分方程：其中, ｆ： Ｒ × Ｃｄ × Ｃｄ → Ｃｄ为给定函数, Ｕ（ｔ）当上＞ ０时为未知函数,τ＞ ０为常数延时量,ф（ｔ）∈Ｃｄ为已知向量值函数．为了检验一个数值方法的数值稳定性,常用如下试验方程：来观察方法的数值稳定性,这里ａ,ｂ∈Ｃ（Ｃ为复数集）为已知常数,ф（ｔ）为给定的连续函数（ｔ≤０）． 定义 １［2］．延时微分方程（简记为ＤＤＥＳ）（３）被称为是渐近稳定的,如果（３）的每一个解Ｕ（ｔ）满足 方程(３)的特征方程为： 定义 ２［２］．一数值方法求解ＤＤＥＳ称为…     

关于三基本量的一个不等式及其应用

设Ｒ、ｒ与ｓ是△ＡＢＣ的三基本量（外接圆半径、内切圆半径与半周长）,则有［１］、［２］ｓ４－２ｓ２（２Ｒ２＋１０Ｒｒ－ｒ２）＋ｒ（４Ｒ＋ｒ）３≤０（１）（当且仅当△ＡＢＣ为等腰三角形时取等号）．（１）称为三角形基本不等式．本文中,我们将应用它导出关于Ｒ、ｒ与ｓ的一个含双参数（λ,ｔ）的不等式．适当选择参数λ、ｔ的值,便可得到包括Ｇｅｒｒｅｔｓｅｎ不等式、Ｏ．Ｋｏｏｉ不等式等著名不等式在内的一大批有用的不等式．定理　对△ＡＢＣ中的三基本量Ｒ、ｒ、ｓ及任意实数λ、ｔ,都有　－（ｔ－１）２Ｒ３＋２［ｔ…     

一类具有双重奇性的抛物型方程的整体解和有限熄灭

本文讨论具有双重奇性的抛物型方程ｕｔ＝ ｄｉｖ（｜△ｕ~ａ｜ｐ~－２△ｕ~ａ）,（ｘ,ｔ） ∈ Ｒ~ｎ ×（０,∞）,其中Ｐ＞ １,ａ＞ ０,ｎ≤ ２．证明当１＜ Ｐ＜ｎ（ａ＋１）／（ａｎ＋１）时,存在整体自相似解ｕｇｓ（·,ｔ） ∈ Ｌ~ｑ（Ｒ~ｎ）（ｑ＞ｓ＝~△ｎ［１－ａ（ｐ－１）］／ｐ）,但是ｕｇｓ∈~／Ｌ~ｓ（Ｒ~ｎ）（定理２．１）;同时存在有限熄灭的自相似解ｕｌｓ满足相同的积分条件（定理 ３．１）．     

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

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

等差-等比循环矩阵的逆矩阵求法

本文给出了等差-等此循环矩阵的逆矩阵求法,推广文[5]的结果.     

On simple families of cyclic polynomials

We study polynomials giving cyclic extensions over rational function fields with one variable satisfying some conditions. By using them, we construct families of cyclic polynomials over some algebraic number fields. And these families give non-Kummer (or non-Artin-Schreier) cyclic extensions. In this paper, we see that our polynomials have two nice arithmetic properties. One is simplicity: our polynomials and their discriminants have more simple expressions than previous results, e.g. Dentzer (1995), Malle and Mazat (1999) and Smith (1991), etc. The other is a ``systematic' property: if one of our polynomials gives an extension , then for every intermediate field we can easily find polynomials giving from systematically.

     

图的循环带宽和

Abstract. Let G be a simple graph. The cyclic bandwidth sum problem is to determine a labeling of graph G in a cycle such that the total length of edges is as small as possible. In this paper, some upper and lower bounds on cyclic bandwidth sum of graphs are studied.     

Cyclic k‐cycle systems of order 2kn + k: A solution of the last open cases

We exhibit cyclic (K_v, C_k)‐designs with v > k, v ≡ k (mod 2k), for k an odd prime power but not a prime, and for k = 15. Such values were the only ones not to be analyzed yet, under the hypothesis v ≡ k (mod 2k). Our construction avails of Rosa sequences and approximates the Hamiltonian case (v = k), which is known to admit no cyclic design with the same values of k. As a particular consequence, we settle the existence question for cyclic (K_v, C_k)‐designs with k a prime power. © 2004 Wiley Periodicals, Inc. J Combin Designs 12: 299–310, 2004.     

矩阵广义对角化的标准形

定义了标准循环分块对角矩阵的概念,给出了矩阵广义对角化的标准形及其算法.     

New classes of 2-weight cyclic codes

We introduce new classes of 2-weight cyclic codes which are direct sums of 1-weight irreducible cyclic codes      

Some cyclic BIBDs with block size four

In this paper we give some results on cyclic BIBDs with block size 4. It is proved that a cyclic B(4,1;4ⁿ u) exists where u is a product of primes congruent to 1 modulo 6 and n is a positive integer and n ≥ 3. In the case of n = 2, we also give some partial results on the existence of a cyclic B(4,1;4²u) where u is a product of primes congruent to 1 modulo 6. © 2004 Wiley Periodicals, Inc.     

Characterization of graphs with infinite cyclic edge connectivity

In this paper, we characterize the graphs with infinite cyclic edge connectivity. Then we design an efficient algorithm to determine whether a graph has finite cyclic edge connectivity or infinite cyclic edge connectivity.     

Construction of Certain Cyclic Distance-Preserving Codes Having Linear-Algebraic Characteristics

An ordered list of binary words of length n is called a distance-preserving m, n-code, if the list distance between two words is equal to their Hamming distance, for distances up to m. A technique for constructing cyclic m, n-codes is presented, based on the standard Gray code and on some simple tools from linear algebra.