具有无界分段常矩阵的三阶微分方程及其扰动方程的指数

关于对具有分段常矩阵的微分方程的研究,等人在文献[1]—[5]中给出了一些重要结果,文献[1]—[3]主要研究了有界情形,文献[4]、[5]研究了二阶无界分段常矩阵情形.本文将讨论三阶无界分段常矩阵情形,给出了其解的指数的上、下界和具有上、下界指数的解的存在性;最后还研究了其扰动方程的解的指数.     

不可约张量方法与分子结构(Ⅱ)——不可约张量算子矩阵元的计算

本文对文献[1]中的三条群链给出了必要的群间偶合系数(Isoscalar factor)的解析表达式;讨论了文献[1]中所定义的各种不可约张量算子对相应的群链基矢的矩阵元的计算,把描述单体力所需的偶合张量算子和描述二体力所需的四重偶合张量算子约化矩阵元的计算归结于基本张量算子矩阵元的计算,对各种张量算子矩阵元给出了统一表达式。     

TOR方法的收敛性

匡蛟勋在[1]中提出了解大线性系统的双参数松驰法——TOR 方法,并讨论了系数矩阵为 Hermitian 正定及 L 矩阵时,TOR 方法的收敛性。曾文平 [2]中又讨论了系数矩阵是正定对称矩阵、H—矩阵、L—矩阵及弱对角占优不可约矩阵时,TOR 方法的收敛性。本文讨论系数矩阵是正定矩阵、广义正定矩阵、N—稳定矩阵时,TOR 方法的收敛性。拓广了文[1]、[2]的结果。     

模糊一致矩阵排序方法的集成

基于文献[3]和文献[6]的模糊一致矩阵的排序方法,研究了这两种排序方法及排序向量的共性问题,给出了一种新的模糊一致矩阵排序方法的集成模型,得到了模糊一致矩阵排序方法及排序向量的相关结论和性质,丰富了模糊一致矩阵排序方法的理论和应用。     

并行矩阵多分裂多参数松弛算法

1 引言和算法 求解大型稀疏线性方程组Ax=6, A∈L(Rn), x,b∈Rn的并行矩阵多分裂算法最早由[1]提出, [2]提出了当系数矩阵是非奇H-矩阵时的多分裂多参数松弛算法.但是对于奇异H-矩阵的理论及算法的研究结果都很少,为此,[3]对于奇异H-矩阵的并行算法进行了有益的研究.本文给出了当系数矩阵是奇异H-     

目标函数系数、约束右端项及系数矩阵A同时变化的灵敏度分析

本文将文献[1]中提出的对目标函数系数与约束右端项同时变化的灵敏度分析中的单一分量变化,改进为向量整体变化的一般性处理;并将系数矩阵A的同时变化一起考虑在内,重点针对可行性和对偶可行性都不满足情况下,将文献[1]采取的引入人工变量及参数大M的传统方法,改用联合算法进行处理,简单方便多了.     

广义实正定矩阵的几个不等式

推广了文献[3]中的广义实正定矩阵的行列式不等式,同时给出了广义实正定矩阵的凸性不等式.     

矩阵之和的特征值与奇异值估计

本文获得了矩阵之和的特征值与奇异值的若干不等式，推广了文献[1]-[3]中的相关结果．     

二阶分块矩阵的伴随矩阵

本文主要讨论二阶分块矩阵的伴随矩阵,考虑到任何矩阵无论是否可逆,均存在伴随矩阵,将文献[1]中可逆的情况推广到了较一般情况,得到了二阶分块矩阵伴随矩阵的有关结论,并改进了文献[2]中相关结论的证明过程.     

Hermite正定矩阵迹的几个重要不等式

本文研究了Hermite正定矩阵迹的不等式问题.利用文献[1、2]的部分结果和矩阵恒等变形的方法,得到了关于Hermite正定矩阵迹的几个重要不等式,推广了文献[5、6]的结果     

Asynchronous multisplitting iteration with different weighting schemes

The multisplitting iteration method was presented by O’Leary and White [5] for solving large sparse linear systems on parallel multiprocessor system. In this paper, we further set up an asynchronous variant for the multisplitting iteration method with different weighting schemes studied by White [8]. Moreover, we establish a general convergence criterion for asynchronous iteration framework, and then prove the convergence of the new asynchronous multisplitting iteration method with different weighting schemes by making use of this general criterion.     

A one parameter method for the matrix inverse square root

This paper is motivated by the paper [3], where an iterative method for the computation of a matrix inverse square root was considered. We suggest a generalization of the method in [3]. We give some sufficient conditions for the convergence of this method, and its numerical stabillity property is investigated. Numerical examples showing that sometimes our generalization converges faster than the methods in [3] are presented.     

A unifying theorem for Newton’s method on spaces with a convergence structure

We present a semilocal convergence theorem for Newton’s method (NM) on spaces with a convergence structure. Using our new idea of recurrent functions, we provide a tighter analysis, with weaker hypotheses than before and with the same computational cost as for Argyros (1996, 1997, 1997, 2007) [1], [2], [3] and [5], Meyer (1984, 1987, 1992) [13], [14] and [15]. Numerical examples are provided for solving equations in cases not covered before.     

非定常的热传导-对流问题的非线性Galerkin混合元法(Ⅲ):时间二阶精度的全离散格式

In this paper, a fully discrete format of nonlinear Galerkin mixed element method with two-step discretization of time for the non stationary conduction-convection problems is presented. The existence and the convergence of the fully discrete mixed element solution are shown. On the basis of [9] and [10], we have proved that the schemes have second-order convergence accuracy for the time discretization.     

Local and global optimization by parallel algorithms for MIMD systems

This paper describes an implementation on the Neptune system at Loughborough University of Sutti's parallel (MIMD) algorithm [1–3] and an analysis of its performance. Parallel asynchronous versions of Powell's method [6] and Price's algorithm [7] are proposed, designed for efficient implementation on MIMD systems.This work has been developed during the author's stay at the Numerical Optimization Centre, Hatfield Polytechnic, England.     

非线性方程组的符号矩阵，正则分裂与单调包含（Ⅰ）

As a continuation of part I of the paper under the same title, we developgeneral monotonic enclosure methods for the couple systems of the splitting equations {x=G([x]a,[x]b,[y]c) y=G([y]a,[y]b,[x]c),which models the system of equations associated with hybrid and aaynchronotts monotonicity as well as convexity. The resulting algorithms and convergence theorems generalize and unify various known methods and monotonic enclosure theorents established by other authors.     

基于锥模型的一般信赖域算法收敛性分析

本文给出了锥模型信赖域算法的一般模型，它不仅包含通常的信赖域算法一相当于锥模型算法中bk＝0的情形，而且文献[1]的算法也可看作其子类．我们研究这个模型的较强的全局收敛性，并讨论保证算法具有超线性收敛速率的条件，从而推广了文[1]和文[4]中的若干结果．     

Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem

Convergence is established for asynchronous parallel successive overrelaxation (SOR) algorithms for the symmetric linear complementarity problem. For the case of a strictly diagonally dominant matrix convergence is achieved for a relaxation factor interval of (0, 2] with line search, and (0, 1] without line search. Computational tests on the Sequent Symmetry S81 multiprocessor give speedup efficiency in the 43%–91% range for the cases for which convergence is established. The tests also show superiority of the asynchronous SOR algorithms over their synchronous counterparts.This material is based on research supported by National Science Foundation Grants DCR-8420963 and DCR-8521228 and Air Force Office of Scientific Research Grant AFOSR-86-0172.     

On Newton's Method for Solving Nonlinear Equations and Function Splitting

We provided in [14] and [15] a semilocal convergence analysis for Newton's method on a Banach space setting, by splitting the given operator. In this study, we improve the error bounds, order of convergence, and simplify the sufficient convergence conditions. Our results compare favorably with the Newton-Kantorovich theorem for solving equations.     

集值映射的拟一致收敛

本文中，在拟一致空间中引入强局部对称性的概念，并讨论集值映射的拟一致收敛性．本文推广了［５］中的一些结果，同时用反例否定了［３］和［４］中的主要定理