Approximate inverse computation using Frobenius inner product

Parallel preconditioners are presented for the solution of general linear systems of equations. The computation of these preconditioners is achieved by orthogonal projections related to the Frobenius inner product. So, min_M∈??∥AM?I∥ _F and matrix M₀∈?? corresponding to this minimum (?? being any vectorial subspace of ??_n(?)) are explicitly computed using accumulative formulae in order to reduce computational cost when subspace ?? is extended to another one containing it. Every step, the computation is carried out taking advantage of the previous one, what considerably reduces the amount of work. These general results are illustrated with the subspace of matrices M such that AM is symmetric. The main application is developed for the subspace of matrices with a given sparsity pattern which may be constructed iteratively by augmenting the set of non‐zero entries in each column. Finally, the effectiveness of the sparse preconditioners is illustrated with some numerical experiments. Copyright © 2002 John Wiley & Sons, Ltd.     

An M/G/1 Retrial Queueing System with Two-Phase Service and Preemptive Resume

An M/G/1 retrial queueing system with additional phase of service and possible preemptive resume service discipline is considered. For an arbitrarily distributed retrial time distribution, the necessary and sufficient condition for the system stability is obtained, assuming that only the customer at the head of the orbit has priority access to the server. The steady-state distributions of the server state and the number of customers in the orbit are obtained along with other performance measures. The effects of various parameters on the system performance are analysed numerically. A general decomposition law for this retrial queueing system is established.     

一类稀疏效应下捕食┐被捕食者系统极限环的存在性和唯一性

本文研究捕食者种群具有线性密度制约的一类稀疏效应下捕食－被捕食者系统ｘ＝ｘ（ａｘ－ｃｘ３－ｂｙ），ｙ＝ｙ（－α＋βｘ－γｙ）．（＊）得到：（１）当Ａ１＜Ａ１，Ａ２＜Ａ２，Ａ３＞Ａ３时，系统（＊）在第一象限内存在极限环；（２）当Ａ２＜Ａ２，Ａ３＞Ａ３时，系统（＊）在第一象限内存在唯一极限环     

岸基光电探测系统

论述两类岸基光电探测系统；岸基光电跟踪仪和岸基红外监视系统。阐述其典型实例、特点及发展方向。     

一类非线性抛物型变分不等方程的全局吸引子及弱近似惯性流形

对由一类非线性抛物型变分不等方程所描述的无穷维动力系统，给出了存在全局吸引子及弱近似惯性流形的充分条件．     

Double Michael Additions of Lithium Enolate of 1,4-Dioxaspiro[4.5]dec-6-en-8-One to Acrylates

Double Michael additions of lithium enolaie of 1,4-dioxaspiro[4.5]dec-6-en-8-one to four acrylates afforded bicyclo[2.2.2]octan-2-ones with high regio- and stereoselectivities in moderate yields.     

Phasenbeziehungen und Natriumionenleitung im quasi-binären System Na2SiF6/Na3AlF6

Phase Relations and Sodium Ion Conductivity within the Quasi-binary System Na₂SiF₆/Na₂AIF₆ . The phase diagram of the Na₂SiF₆/Na₃AlF₆ system has been determined by means of x-ray powder diffraction, thermal analysis and conductivity measurements in the sub-solidus region. Na₃AlF₆ accomodates up to 73 mol.-% Na₂SiF₆ maintaining the crystal structure type. The sodium ion conductivity increases by about five orders of magnitude upon doping Na₃AlF₆ with Na₂SiF₆.     

On the Moments of Overflow and Freed Carried Traffic for the GI/M/C/0 System

In circuit-switched networks call streams are characterized by their mean and peakedness (two-moment method). The GI/M/C/0 system is used to model a single link, where the GI-stream is determined by fitting moments appropriately. For the moments of the overflow traffic of a GI/M/C/0 system there are efficient numerical algorithms available. However, for the moments of the freed carried traffic, defined as the moments of a virtual link of infinite capacity to which the process of calls accepted by the link (carried arrival process) is virtually directed and where the virtual calls get fresh exponential i.i.d. holding times, only complex numerical algorithms are available. This is the reason why the concept of the freed carried traffic is not used. The main result of this paper is a numerically stable and efficient algorithm for computing the moments of freed carried traffic, in particular an explicit formula for its peakedness. This result offers a unified handling of both overflow and carried traffics in networks. Furthermore, some refined characteristics for the overflow and freed carried streams are derived.