Banach空间中关于增生算子的强收敛迭代序列

主要研究求解增生算子零点问题的一类算法:x_(n+1)=α_nu+(1-α_n)((1-λ)x_n+λJ_r_nx_n),其u是固定向量,λ∈(0,1),{r_n}和{α_n}是实数列,J_r_n表示增生算子A的预解式.其中(r_n)收敛是保证算法收敛的一个充分条件,该文主要证明了此条件可减弱为limn|1-(r_n+1)/r_n|=0.     

对称多项式基本定理的推广

关于x_1,x_2,…,x_n的对称多项式都可表为初等对称多项式σ_1,σ_2,…,σ_n的多项式。本文推广了此定理的结论。定义设f_i=f_i(x_1,x_2,…,x_n)(i=1,2,…,n)为关于x_1,x_2,…,x_n的i次对称多项式,且由它们组成的方程组 (这里a_i(i=1,2,…,n)为常数)是独立的n个方程组成的方程组。即f_i不能表为上述其它n-1个多项式的多项式。则称f_i,f_2,…,f_n为n元对称多项式的一组基。引理对于任意的1≤i≤n,f_i可表为σ_1,σ_2,…,σ_i的多项式。证明因为f_i是x_1,x_2,…,x_n的i次对称多项式。由对称多项式的基本定理可设 f_i=g(σ_1,σ_2,…,σ_n)在多项式g(σ_1,σ_2,…,σ_n)中若存在含σ_i(i相似文献   

经典代数特征值反问题的一般提法

§1.引言 [3]曾提出两类Hermiie阵的代数特征值反问题,后来被人们称之为加法问题和乘法问题并推广到更一般的情形.到目前止,经典代数特征值反问题在数学上的最一般提法如下: 问题G.给定n+1个n阶实对称矩阵A,A_1,…,A_n和n个实数λ_1,…,λ_n,求n个实数x_1,…,x_n,使矩阵     

初等对称多项式的一个重要性质

对于变元x_1,x_2,…,x_n,若记σ_1(n)=∑x_1,σ_2(n)=∑x_1x_j,σ_3(n)=∑x_1x_jx_k,…σ_2(n)=(n),…,σ_n(n)为关于变元x_1,x_2,…,x_n的初等对称多项式。为方便起见,本文规定σ_o(n)=1,则当变元x_1,x_2,…,x_n为实数时,我们得到初等对称多项式σ_o(n),σ_1(n),…,σ_n(n)的一个重要性质: 定理对于实数变元x_1,x_2,…,x_n及σ_o(n),σ_o(n),     

确定恒不等式中参数范围(最值)的一种方法

在中学数学里,对于恒不等式中的问题却很少谈及。但近年来国内外高考,数学竟赛和一些书刊中常出现这样一类恒不等式问题:若关于n个变元的不等式。f(x_1,x_2,…,x_n;λ_1,λ_2,…,λ_)>0(≥0)(I)在区域G上恒成立,试求参数λ_1,λ_2,…,λ_m的取值范围(或最大值、最小值)。本文介绍处理这类问题的一种方法——最值法如果在恒不等式(I)中能将变元x_1,x_2·…,x_n,全部或部分分离出来,使(I)式成为F(λ_1,λ_2,…,λ_m)>D(x_1,x_2,…,x_n),或F(λ_1,λ_2,…,λ_m)相似文献   

代数特征值反问题之解的稳定性分析

考虑如下代数特征值反问题: 问题 G(A;{A_k}_1~n;λ).设 A=(a_(ij)),A_k=(a_(ij)~((k))),k=1,…,n是n+1个n×n的实对称矩阵,λ=(λ_1,…,λ_n)是n维实向量且λ_i≠λ_j,i≠j.求n维实向量c=(c_1,…,c_n)~T,使矩阵A(c)=A+sum from k=1 to n (c_kA_k)的特征值是λ_1,…,λ_n. 这一问题是经典加法问题的推广.当A_k-e_ke_k~~T(e_k是n阶单位阵的第k列)时,     

一个构造增生映像零点的带误差的迭代算法

设E是一致光滑的Banach空间,A:D(A)E→2~E是一个满足值域条件的增生算子,进一步满足线性增长条件:‖Ax‖≤C(1+‖x‖)对某个常数C0, x∈D(A).设z∈D(A)是任意固定元,x_1∈D(A), A~(-1)0≠Φ.定义序列{x_n}D(A)如下:x_(n+1)∈x_n-λ_n(Ax_n+θ_n(x_n-z+e_n)),n≥1,其中{λ_n}与{θ_n}是满足一定条件的非负数列.则x_n→x~*∈A~(-1)(0),(n→∞).作为应用,我们推出构造连续伪压缩映像的不动点的收敛定理.     

标准Jacobi矩阵的混合型特征反问题

0 引言 本文讨论如下标准形式的Jacobi矩阵 其中a_i>0(i=1,2,…,n),b_i>0(i=1,2,…,n-1)。 对于Jacobi矩阵(对称三对角矩阵)的特征反问题,已有的成果[1],基本上集中在由两组频谱或两个特征对(指特征值及相应的特征向量)构造Jacobi矩阵的元素这样两类问题上,习惯上称之为频谱型或特征向量型反问题。本文提出且求解了第三类型——混合型特征反问题。即由一组频谱数据和一个特征向量构造矩阵元素的问题: 问题Ⅰ 给定正数λ~(1),λ~(2),…,λ~(n)和实向量x=(x_1,x_2,…,x_n)~T,其中x_1=1。构造一个标准形式的Jacobi矩阵J,使其第k阶顺序主子阵恰以λ~(k)(k=1,2,…,n)为其特征值。且(λ~(n),x)为其特征对。 问题Ⅱ 给定正数0<λ_1~(n)<λ_1~(n-1)<…<λ_1~(1)和正向量x=(x_1,x_2,…,x_n),其中x_=,x_k>0(k=2,…,n),构造一个标准形式的Jacobi矩阵J,使其第K阶顺序主子阵恰以λ_1~(k)为其最小特征值,而(λ~(n),x)为J的特征对。 问题Ⅲ 给定n个实数0<λ_1)<λ_2<…<λ_n和m个实数λ~(1),λ~(2),…,λ~(m)及m维向量x=(x_1,…,x_m)~T。构造n阶标准形式的Jaeobi矩阵J,使其第K阶顺序主子阵恰以λ~(k)(k=1,2,…,m)为其特征值,而(λ~(m),x)为第m阶顺序主子阵的特征对,且λ_k(k=1,2,…,n)为J的特征值。这里系大于或等     

加法与乘法逆特征值问题的可解性

1.引言 本文讨论如下代数特征值反问题可解的充分条件: 问题A(加法逆特征值问题)。给定一Hermite矩阵A=(a_(ij))_(n×n)及n个实数λ_1,…,λ_n,求一实对角阵D=diag(c_1…,c_n),使得A+D的特征值为λ_1,…,λ_n。 问题M(乘法逆特征值问题)。给定一正定Hermite矩阵A=(a_(ij))_(n×n)和n个正实数     

求解特征值问题的 AOR 算法的收敛性

用 AOR 方法求解线性方程组是众所周知的,我们将此方法应用到求解特征值问题方面.考虑下面特征值问题:(A—λI)x=0,(1.1)这里 A 是大型稀疏非奇异对称矩阵.显然,问题(1.1)有下面三条性质:i)其 n 个特征值都是实的,不妨设为λ_1≤λ_2≤…≤λ_n;(1.2)     

Depth notions for orthogonal regression

Global depth, tangent depth and simplicial depths for classical and orthogonal regression are compared in examples, and properties that are useful for calculations are derived. The robustness of the maximum simplicial depth estimates is shown in examples. Algorithms for the calculation of depths for orthogonal regression are proposed, and tests for multiple regression are transferred to orthogonal regression. These tests are distribution free in the case of bivariate observations. For a particular test problem, the powers of tests that are based on simplicial depth and tangent depth are compared by simulations.     

State models and asymptotic behaviour of 2D positive systems

Homogeneous 2D positive systems are 2D state-space models whosevariables are alwalys nonnegative and, consequently, are describedby a pair of nonnegative square matrices (A, B). In the paper,the properties of these pairs are discussed both in the generalcase and under particular assumptions like finite memory, separability,and property L. Various aspects of the positive asymptotic dynamic are considered;in particular, sufficient conditions are provided guaranteeingthat the local states are eventually strictly positive. Finally,some results on the convergence of the states towards a constantasymptotic distribution are presented.     

Periodic and solitary-wave solutions of the Degasperis–Procesi equation

Travelling-wave solutions of the Degasperis–Procesi equation are investigated. The solutions are characterized by two parameters. For propagation in the positive x-direction, hump-like, inverted loop-like and coshoidal periodic-wave solutions are found; hump-like, inverted loop-like and peakon solitary-wave solutions are obtained as well. For propagation in the negative x-direction, there are solutions which are just the mirror image in the x-axis of the aforementioned solutions. A transformed version of the Degasperis–Procesi equation, which is a generalization of the Vakhnenko equation, is also considered. For propagation in the positive x-direction, hump-like, loop-like, inverted loop-like, bell-like and coshoidal periodic-wave solutions are found; loop-like, inverted loop-like and kink-like solitary-wave solutions are obtained as well. For propagation in the negative x-direction, well-like and inverted coshoidal periodic-wave solutions are found; well-like and inverted peakon solitary-wave solutions are obtained as well. In an appropriate limit, the previously known solutions of the Vakhnenko equation are recovered.     

近程空中目标航路研究

本文在等加速俯冲飞行假定下，分析了近程空中目标航路的特点，并据此提出了目标航路模型．经过投影变换，把目标航路模型转化为二次函数，从而使目标航路的滤波及预报问题得到简化．采用递推最小二乘（ＲＬＳ）原理，给出了目标航路的在线滤波器及预报器．最后，对本文方法进行了仿真，并对仿真结果进行了分析．     

秩为1矩阵的性质及应用

给出了秩1矩阵的结构,讨论了这类矩阵在矩阵运算、对角化、标准型等方面的性质,推广和改进了文[1]的一些相关结果,并指出了它的若干应用,重点讨论了一类矩阵,得到了有关结论和方法.     

Stability of random impulsive coupled systems on networks with Markovian switching

Abstract

This article is intended to study global asymptotical stability in probability for random impulsive coupled systems on networks with Markovian switching. Two cases are considered. (1) Continuous dynamics are stable while impulses are unstable; (2) impulses are stable while continuous dynamics are unstable. To begin with, based on Lyapunov method as well as graph-theoretic technique, several new stability criteria in two cases are derived, that are, the Lyapunov-type criteria and the coefficients-type criteria. Then main results are used for a class of random impulsive coupled oscillators. Finally, the effectiveness of the obtained results is verified by numerical simulations.     

MTL代数的特征定理

对于逻辑系统代数结构的研究,是一个十分重要的研究课题.近期提出的BL代数,R_0代数,MTL代数就是这个方向具有代表性的研究成果.本文讨论MTL代数的性质与结构,给出这种代数的几个特征定理,澄清这种代数与其它代数结构的关系.鉴于单位区间中由左连续t-范数诱导的剩余蕴涵与MTL代数的紧密联系,本文还考察了这种模糊蕴涵的特征性质.     

由格蕴涵代数诱导的伴随半群

给出由格蕴涵代数诱导出的伴随半群及有关概念 ,详细讨论伴随半群中的元素即格蕴涵代数的左映射的性质 ,得到它们的几个等价条件。最后讨论由格蕴涵代数诱导的两个双格半群与伴随半群之间的关系 ,并证明这些半群是幂等的当且仅当它们是由格 H蕴涵代数所诱导     

Some properties of singular integral operators over an open curve Dedicated to the 85th birthday of Prof.Lu Jinake

In this paper, the stability properties, the endpoint behavior and the invertible relations of Cauchy-type singular integral operators over an open curve are discussed. If the endpoints of the curve are not special, this type of operators are proved to be stable. At the endpoints, either the singularity or smoothness of the operators are exactly described. And the function sets or spaces on which the operators are invertible as well as the corresponding inverted operators are given. Meanwhile, some applications for the solution of Cauchy-type singular integral equations are illustrated.     

Algorithms for finding optimum trees: Description,use and evaluation

This work is devoted to the problem of finding an optimum spanning tree in an undirected graph. Both min-sum and min-max trees are sought. The five algorithms considered are among the most well-known proposed in the literature. They are described in sect. 1 as thoroughly as possible, using a simplified Pascal language; all min-sum algorithms are derived from a unique prototype formulation. In sect. 2, the algorithms are implemented in PFORT to enhance their portability and ad hoc data structures are utilized in order to obtain subroutines as efficient as possible. Finally, in sect. 3, the programs are evaluated, comparing their performances in handling several classes of randomly generated graphs. Various observations are reported, and some indications for choosing the most suitable algorithm in each case are provided.Sponsored by the CNR finalized project on Informatics (subproject P1, task SOFMAT), Italy.