Linear Maps Preserving Invertibility or Related Spectral Properties

We survey some recent results on linear maps on operator algebras that preserve invertibility. We also consider related problems such as the problem of the characterization of linear maps preserving spectrum, various parts of spectrum, spectral radius, quasinilpotents, etc. We present some results on elementary operators and additive operators preserving invertibility or related properties. In particular, we give a negative answer to a problem posed by Gao and Hou on characterizing spectrumpreserving elementary operators. Several open problems are also mentioned.     

The pressure in operator algebras

We introduce two notions of the pressure in operator algebras, one is the pressure Pα（π, T） for an automorphism α of a unital exact C^＊-algebra A at a self-adjoint element T in A with respect to a faithful unital ＊-representation π the other is the pressure Pτ,α（T） for an automorphism α of a hyperfinite von Neumann algebra M at a self-adjoint element T in M with respect to a faithful normal α-invariant state τ. We give some properties of the pressure, show that it is a conjugate invaxiant, and also prove that the pressure of the implementing inner automorphism of a crossed product A×α Z at a self-adjoint operator T in A equals that of α at T.     

TWO CLASSES OF INTEGRABLE COUPLING FOR AKNS HIERARCHY

A set of new matrix Lie algebra is constructed, which is devoted to obtaining a new loop algebra A 2M . Then we use the idea of enlarging spectral problems to make an enlarged spectral problems. It follows that the multi-component AKNS hierarchy is presented. Further, two classes of integrable coupling of the AKNS hierarchy are obtained by enlarging spectral problems.     

Zero divisors and prime elements of bounded semirings

A semiring is an algebraic structure similar to a ring, but without the requirement that each element must have an additive inverse. A bounded semiring is a semiring equipped with a compatible bounded partial order. In this paper, properties of zero divisors and prime elements of a bounded semiring are studied. In particular, it is proved that under some mild assumption, the set Z（A） of nonzero zero divisors of A is A ／ {0, 1}, and each prime element of A is a maximal element. For a bounded semiring A with Z（A） = A ／ {0, 1}, it is proved that A has finitely many maximal elements if ACC holds either for elements of A or for principal annihilating ideals of A. As an application of prime elements, we show that the structure of a bounded semiring A is completely determined by the structure of integral bounded semirings if either ｜Z（A）｜ = 1 or ｜Z（A）｜ -- 2 and Z（A）2 ≠ 0. Applications to the ideal structure of commutative rings are also considered. In particular, when R has a finite number of ideals, it is shown that the chain complex of the poset I（R） is pure and shellable, where I（R） consists of all ideals of R.     

Derivations on the algebra of operators in hilbert C*-modules

Let M be a full Hilbert C*-module over a C*-algebra A,and let End*A(M) be the algebra of adjointable operators on M.We show that if A is unital and commutative,then every derivation of End A(M) is an inner derivation,and that if A is σ-unital and commutative,then innerness of derivations on "compact" operators completely decides innerness of derivations on End*A(M).If A is unital(no commutativity is assumed) such that every derivation of A is inner,then it is proved that every derivation of End*A(Ln(A)) is also inner,where Ln(A) denotes the direct sum of n copies of A.In addition,in case A is unital,commutative and there exist x0,y0 ∈ M such that x0,y0 = 1,we characterize the linear A-module homomorphisms on End*A(M) which behave like derivations when acting on zero products.     

Banach空间上算子代数的超自反性

In this paper, we introduced the hyperreflexivity of operator algebra A on'Banach space, discussed the necessary, and sufficient condition that A is hyperreflexive, the estimate of hyperreflexive constant and the invariance of hyperreflexivety under the similarity transformation.     

TWO PROBLEMS ABOUT COMPOSITION OPERATORS ON HARDY SPACE

In this paper, two problems about composition operator on Hardy space are considered. Firstly, a new estimation of the norm of a class of composition operators is given. Secondly, the cyclic behavior of the adjoint operator of a composition operator is discussed.     

A class of nonlinear singularly perturbed initial boundary value problems for reaction diffusion equations with boundary perturbation

A class of nonlinear initial boundary value problems for reaction diffusion equations with boundary perturbation is considered. Under suitable conditions and using the theory of differential inequalities the asymptotic solution of the initial boundary value problems is studied.     

A DIRECT SEARCH FRAME-BASED CONJUGATE GRADIENTS METHOD

A derivative-free frame-based conjugate gradients algorithm is presented.Convergenceis shown for C~1 functions,and this is verified in numerical trials.The algorithm is tested ona variety of low dimensional problems,some of which are ill-conditioned,and is also testedon problems of high dimension.Numerical results show that the algorithm is effectiveon both classes of problems.The results are compared with those from a discrete quasi-Newton method,showing that the conjugate gradients algorithm is competitive.Thealgorithm exhibits the conjugate gradients speed-up on problems for which the Hessian atthe solution has repeated or clustered eigenvalues.The algorithm is easily parallelizable.     

ON THE SEPARABLE NONLINEAR LEAST SQUARES PROBLEMS

Separable nonlinear least squares problems are a special class of nonlinear least squares problems, where the objective functions are linear and nonlinear on different parts of variables. Such problems have broad applications in practice. Most existing algorithms for this kind of problems are derived from the variable projection method proposed by Golub and Pereyra, which utilizes the separability under a separate framework. However, the methods based on variable projection strategy would be invalid if there exist some constraints to the variables, as the real problems always do, even if the constraint is simply the ball constraint. We present a new algorithm which is based on a special approximation to the Hessian by noticing the fact that certain terms of the Hessian can be derived from the gradient. Our method maintains all the advantages of variable projection based methods, and moreover it can be combined with trust region methods easily and can be applied to general constrained separable nonlinear problems. Convergence analysis of our method is presented and numerical results are also reported.     

A SUCCESSIVE LEAST SQUARES METHOD FOR STRUCTURED TOTAL LEAST SQUARES

A new method for Total Least Squares (TLS) problems is presented. It differs from previous approaches and is based on the solution of successive Least Squares problems.The method is quite suitable for Structured TLS (STLS) problems. We study mostly the case of Toeplitz matrices in this paper. The numerical tests illustrate that the method converges to the solution fast for Toeplitz STLS problems. Since the method is designed for general TLS problems, other structured problems can be treated similarly.     

A Nonlinear Singularly Perturbed Problem for Reaction Diffusion Equations with Boundary Perturbation

A nonlinear singularly perturbed problems for reaction diffusion equation with boundary perturbation is considered. Under suitable conditions, the asymptotic behavior of solution for the initial boundary value problems of reaction diffusion equations is studied using the theory of differential inequalities.     

MULTIPLE POSITIVE SOLUTIONS FOR SINGULAR BOUNDARY VALUE PROBLEMS WITH p-LAPLACIAN

This paper is concerned with the existence of positive solutions to singular boundary value problems of functional differential equations with p-Laplacian. Under the suitable conditions,the existence of three positive solutions is esta- blished by using an abstract fixed point theorem.     

Characterization of Operators on the Dual of Hypergroups which Commute with Translations and Convolutions

For a locally compact group G, L^1 (G) is its group algebra and L^∞(G) is the dual of L^1 (G).Lau has studied the bounded linear operators T:L^∞(G)→L^∞(G) which commute with convolutions and translations. For a subspace H of L^∞(G), we know that M(L^∞(G),H), the Banach algebra of all bounded linear operators on L^∞(G) into H which commute with convolutions, has been studied by Pyre and Lau. In this paper, we generalize these problems to L(K)^*, the dual of a hypergroup algebra L(K) in a very general setting, i.e. we do not assume that K admits a Haar measure. It should be noted that these algebras include not only the group algebra L^1(G) but also most of the semigroup algebras.Compact hypergroups have a Haar measure, however, in general it is not known that every hypergroup has a Haar measure. The lack of the Haar measure and involution presents many difficulties; however,we succeed in getting some interesting results.     

MODIFIED LEAST SQUARE METHOD ON COMPUTING DIRICHLET PROBLEMS

The singularity theory of dynamical systems is linked to the numerical computation of boundary value problems of differential equations. It turns out to be a modified least square method for a calculation of variational problem defined on Ck(Ω), in which the base functions are polynomials and the computation of problems is transferred to compute the coefficients of the base functions. The theoretical treatment and some simple examples are provided for understanding the modification procedure of the methods. A modified least square method on difference scheme is introduced with a general matrix form of dynamical systems. We emphasize the simplicity of the algorithm and only use Euler algorithm to compute initial value problems of ODEs. A better algorithm is needed to reduce the stiffness of ODEs.     

ON THE BOTTLENECK CAPACITY EXPANSION PROBLEMS ON NETWORKS

This article considers a class of bottleneck capacity expansion problems. Such problems aim to enhance bottleneck capacity to a certain level with minimum cost. Given a network G(V, A, C) consisting of a set of nodes V= {v1,v2,…,vn},a set of arcs A ■ {(vi, vj) | i=1,2,…, n;j=1,2,…,n} and a capacity vector C. The component cij of C is the capacity of arc (vi ,vj). Define the capacity of a subset A' of A as the minimum capacity of the arcs in A, the capacity of a family F of subsets of A is the maximum capacity of its members. There are two types of expanding models. In the arc-expanding model, the unit cost to increase the capacity of arc (vi, vj) is wij. In the node-expanding model, it is assumed that the capacities of all arcs (vi,vj) which start at the same node vi should be increased by the same amount and that the unit cost to make such expansion is wi. This article considers three kinds of bottleneck capacity expansion problems (path, spanning arborescence and maximum flow) in both expanding models. For each kind of expansion problems, this article discusses the characteristics of the problems and presents several results on the complexity of the problems.     

Symmetry of the point spectrum of infinite dimensional hamiltonian operators and its applications

This paper studies the symmetry, with respect to the real axis, of the point spectrum of the upper triangular infinite dimensional Hamiltonian operator H. Note that the point spectrum of H can be described as σp(H) = σp(A) ∪σp1(-A*). Using the characteristic of the set σp1(-A*), we divide the point spectrum σp(A) of A into three disjoint parts. Then, a necessary and sufficient condition is obtained under which σp1(-A*) and one part of σp(A) are symmetric with respect to the real axis each other. Based on this result, the symmetry of σp(H) is completely given. Moreover, the above result is applied to thin plates on elastic foundation, plane elasticity problems and harmonic equations.     

随机规划中若干凸性命题(Ⅰ)

There is a Kind of so-called chance constrained programming problems in stochastic programming. One of the main subjects of this kind of problems is whether the constrained set or is convex. In this letter, we discuss the convexity statement if all the elements of the fist column of A(ω) are independent random variables with known Weibull distributions and others are fixed. Suppose density function for Weibull distribution     

Fast Solvers of Fredholm Optimal Control Problems

<正>The formulation of optimal control problems governed by Fredholm integral equations of second kind and an efficient computational framework for solving these control problems is presented.Existence and uniqueness of optimal solutions is proved. A collective Gauss-Seidel scheme and a multigrid scheme are discussed.Optimal computational performance of these iterative schemes is proved by local Fourier analysis and demonstrated by results of numerical experiments.