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.     

SPECTRUM-PRESERVING ELEMENTARY OPERATORS ON B（X）

1.IntroductionLetXbeaninfinitedimensionalcomplexBanachspaceandB(X)theBanachalgebraofallboundedlinearoperatorsonX.ForTEB(X),a(T),asusual,willdenotethespectrumofT.Let4bealinearmapfromB(X)intoitself.4isspectrum-preservingifa(di(T))=a(T)forallTEB(X);4isspectrum-compressingifa(4(T))ga(T)forallTEB(X).Itisclearthatif4isunital(i.e.,ac(I)=I),thenacisspectrum-preserving(spectrum-compressing)ifandonlyif4preservesinvertibilityinbothdirections(preservesinvertibility),i.e.,4(T)isinvertibleifando…     

Rank 2 Ample Vector Bundles on Some Smooth Rational Surfaces

Several classification results for ample vector bundles of rank 2 on Hirzebruch surfaces, and on Del Pezzo surfaces, are obtained. In particular, we classify rank 2 ample vector bundles with _c2 less than seven on Hirzebruch surfaces, and with _c2 less than four on Del Pezzo surfaces.     

Recursive partition and amalgamation with the exponential family: Theory and applications

The theory of tree-growing (RECPAM approach) is developed for outcome variables which are distributed as the canonical exponential family. The general RECPAM approach (consisting of three steps: recursive partition, pruning and amalgamation), is reviewed. This is seen as constructing a partition with maximal information content about a parameter to be predicted, followed by simplification by the elimination of ‘negligible’ information. The measure of information is defined for an exponential family outcome as a deviance difference, and appropriate modifications of pruning and amalgamation rules are discussed. It is further shown how the proposed approach makes it possible to develop tree-growing for situations usually treated by generalized linear models (GLIM). In particular, Poisson and logistic regression can be tree-structured. Moreover, censored survival data can be treated, as in GLIM, by observing a formal equivalence of the likelihood under random censoring and an appropriate Poisson model. Three examples are given of application to Poisson, binary and censored survival data.     

匀速运动的电偶极子的电场和磁场分布

本文通过对电偶极子电磁势的分析和相对论下电磁场在不同惯性系中的协变分布，计算了作匀速直线运动的电偶极子的电场和磁场的空间分布．     

An Improved Gradient Projection-based Decomposition Technique for Support Vector Machines

In this paper we propose some improvements to a recent decomposition technique for the large quadratic program arising in training support vector machines. As standard decomposition approaches, the technique we consider is based on the idea to optimize, at each iteration, a subset of the variables through the solution of a quadratic programming subproblem. The innovative features of this approach consist in using a very effective gradient projection method for the inner subproblems and a special rule for selecting the variables to be optimized at each step. These features allow to obtain promising performance by decomposing the problem into few large subproblems instead of many small subproblems as usually done by other decomposition schemes. We improve this technique by introducing a new inner solver and a simple strategy for reducing the computational cost of each iteration. We evaluate the effectiveness of these improvements by solving large-scale benchmark problems and by comparison with a widely used decomposition package.     

COMPACT COUPLED LINEAR TAPERED LINE BANDPASS FILTER WITH TWO TRANSMISSION ZEROS

A new compact bandpass filter composed of two coupled linear tapered line resonators (LTLRs) is designed. The two resonators are arranged in different layers. The filter has two transmission zeros on both sides of the passband. It has small size and steep response below its passband. It is also shown that this filter has 0.6 dB low insertion loss at the centre frequency and 10.5% 3dB bandwidth. This work was supported by the Development Foundation of Shanghai Educational Committee (217608) and Shanghai Leading Academic Discipline Project (T0102).     

FORMATION OF SINGULARITIES FOR A KIND OF QUASILINEAR NON－STRICTLY HYPERBOLIC SYSTEM

The author gets a blow-up result of C1 solution to the Cauchy problem for a first order quasilinear non-strictly hyperbolic system in one space dimension.     

Multicriteria decision making under uncertainty

Formalization for problems of multicriteria decision making under uncertainty is constructed in terms of guaranteed and weak estimates. A relevant definition of the vector maximinimax value is given. Parameterization and approximation of maximum, minimax, and maximinimax values based on the inverse logical convolution are suggested. An application for multicommodity networks is considered. Received: December 13, 2000 / Accepted: August 21, 2001?Published online May 8, 2002     

Nonsensitiveness Regions for Threshold Ellipsoids

The problem is to determine nonsensitiveness regions for threshold ellipsoids within a regular mixed linear model.