Positive set‐operators of low complexity

The powerset operator, ??, is compared with other operators of similar type and logical complexity. Namely we examine positive operators whose defining formula has a canonical form containing at most a string of universal quantifiers. We call them ?‐operators. The question we address in this paper is: How is the class of ?‐operators generated ? It is shown that every positive ?‐operator Γ such that Γ(??) ≠ ??, is finitely generated from ??, the identity operator Id, constant operators and certain trivial ones by composition, ∪ and ∩. This extends results of [3] concerning bounded positive operators.     

Local automorphisms of operator algebras on Banach spaces

In this paper we extend a result of Semrl stating that every 2-local automorphism of the full operator algebra on a separable infinite dimensional Hilbert space is an automorphism. In fact, besides separable Hilbert spaces, we obtain the same conclusion for the much larger class of Banach spaces with Schauder bases. The proof rests on an analogous statement concerning the 2-local automorphisms of matrix algebras for which we present a short proof. The need to get such a proof was formulated in Semrl's paper.

     

The solvability conditions for inverse eigenproblem of symmetric and anti‐persymmetric matrices and its approximation

The problem of generating a matrix A with specified eigen‐pair, where A is a symmetric and anti‐persymmetric matrix, is presented. An existence theorem is given and proved. A general expression of such a matrix is provided. We denote the set of such matrices by ??????_Eⁿ. The optimal approximation problem associated with ??????_Eⁿ is discussed, that is: to find the nearest matrix to a given matrix A* by A∈??????_Eⁿ. The existence and uniqueness of the optimal approximation problem is proved and the expression is provided for this nearest matrix. Copyright © 2002 John Wiley & Sons, Ltd.     

Prefiltration technique via aggregation for constructing low‐density high‐quality factorized sparse approximate inverse preconditionings

This paper considers a new approach to a priori sparsification of the sparsity pattern of the factorized approximate inverses (FSAI) preconditioner using the so‐called vector aggregation technique. The suggested approach consists in construction of the FSAI preconditioner to the aggregated matrix with a prescribed sparsity pattern. Then small entries of the computed ‘aggregated’ FSAI preconditioning matrix are dropped, and the resulting pointwise sparsity pattern is used to construct the low‐density block sparsity pattern of the FSAI preconditioning matrix to the original matrix. This approach allows to minimize (sometimes significantly) the construction costs of low‐density high‐quality FSAI preconditioners. Numerical results with sample matrices from structural mechanics and thin shell problems are presented. Copyright © 2002 John Wiley & Sons, Ltd.     

Image Formation in Low Vacuum SEM

The role of positive gaseous ions in the formation of secondary electron images in low vacuum scanning electron microscopes is discussed. This paper describes the charging processes and related effects that occur during high vacuum imaging of insulators and then discusses the influence of ions on those processes. The ions are responsible for a number of phenomena, including distortion of the electric field above and below the specimen surface due to space charge, removal of excess negative charge from the specimen, alteration of the specimen surface barrier, and scavenging/filtering of the secondary electron emission. The resulting electron-specimen-ion interactions can give rise to interesting contrast effects that are unique to this class of instruments.     

On perturbations of matrix pencils with real spectra, a revisit

This paper continues earlier studies by Bhatia and Li on eigenvalue perturbation theory for diagonalizable matrix pencils having real spectra. A unifying framework for creating crucial perturbation equations is developed. With the help of a recent result on generalized commutators involving unitary matrices, new and much sharper bounds are obtained.

     

三阶非线性时滞差分方程解的渐近性

研究了一类三阶非线性变滞量差分方程解的渐近性,给出了该类方程的非振动解当n→+∞时渐近趋于零或趋于某有限数值的几个充分条件.     

Direct and inverse estimates for a new family of linear positive operators

In the present paper we introduce a new family of linear positive operators and study some direct and inverse results in simultaneous approximation.     

Delay-dependent stochastic stability of delayed Hopfield neural networks with Markovian jump parameters

In this paper, the problem of stochastic stability for a class of time-delay Hopfield neural networks with Markovian jump parameters is investigated. The jumping parameters are modeled as a continuous-time, discrete-state Markov process. Without assuming the boundedness, monotonicity and differentiability of the activation functions, some results for delay-dependent stochastic stability criteria for the Markovian jumping Hopfield neural networks (MJDHNNs) with time-delay are developed. We establish that the sufficient conditions can be essentially solved in terms of linear matrix inequalities.     

Primary abelian <Emphasis Type="Italic">n</Emphasis>-Σ-groups

We prove the following theorem: Any abelian p-group is an n-Σ-group which is a strong ω-elongation of a totally projective group by a p ^ω+n -projective group precisely when it is totally projective. In particular, each p-torsion p ^ω+n -projective n-Σ-group is a direct sum of countable p-groups of length not exceeding ω + n and vice versa. These two claims generalize our recent results in [6] and [7]. Published in Lietuvos Matematikos Rinkinys, Vol. 47, No. 2, pp. 155–162, April–June, 2007.