in this note, we characterize chebyshev subalgebras of unital jb-algebras. we exhibit that if b is chebyshev subalgebra of a unital jb-algebra a, then either b is a trivial subalgebra of a or a= h r .l, where h is a hilbert space

 In network code setting, a constant dimension code is a set of k-dimensional subspaces of F nq . If F_q n is a nondegenerated symlectic vector space with bilinear form f, an isotropic subspace U of F n q is a subspace that for all x, y ∈ U, f(x, y) = 0. We introduce isotropic subspace codes simply as a set of isotropic subspaces and show how the isotropic property use in decoding process, then...

A classification of weakly compact multiplication operators on L(Lp), 1 < p < ∞, is given. This answers a question raised by Saksman and Tylli in 1992. The classification involves the concept of `p-strictly singular operators, and we also investigate the structure of general `p-strictly singular operators on Lp. The main result is that if an operator T on Lp, 1 < p < 2, is `p-strictly singular ...

From the work of Simmons about nuclei in frames it follows that a topological space X is scattered if and only if each congruence Θ on the frame of open sets is induced by a unique subspace A so that Θ = {(U, V ) |U ∩A = V ∩A}, and that the same holds without the uniqueness requirement iff X is weakly scattered (corrupt). We prove a seemingly similar but substantially different result about qua...

a) X is strongly paracompact; b) X is paracompact; c) X is metacompact; d) X is weakly θ-refinable; e) Every open cover of X has a point-countable open refinement; f) X is subparacompact; g) If C is a closed subspace of X, then there are discrete closed sets S and T which are, respectively, well-ordered and reverse-well-ordered by the given ordering of X, have S ∪ T ⊂ C, and have the property t...

The Kohn-Sham equation in first-principles density functional theory (DFT) calculations is a nonlinear eigenvalue problem. Solving the nonlinear eigenproblem is usually the most expensive part in DFT calculations. Sparse iterative diagonalization methods that compute explicit eigenvectors can quickly become prohibitive for large scale problems. The Chebyshevfiltered subspace iteration (CheFSI) ...

This article provides an overview of some recent developments in quantum dynamic and spectroscopic calculations using the Chebyshev propagator. It is shown that the Chebyshev operator ( Tk (Ĥ)) can be considered as a discrete cosine type propagator ( cos(kΘ̂)), in which the angle operator ( Θ̂ = arccos Ĥ ) is a single-valued mapping of the scaled Hamiltonian ( Ĥ ) and the order (k) is an effectiv...

We give a general overview of the state-of-the-art in subspace system identification methods. We have restricted ourselves to the most important ideas and developments since the methods appeared in the late eighties. First, the basis of linear subspace identification are summarized. Different algorithms one finds in literature (Such as N4SID, MOESP, CVA) are discussed and put into a unifyin...

in this paper, we represent an inexact inverse subspace iteration method for com- puting a few eigenpairs of the generalized eigenvalue problem ax = bx[q. ye and p. zhang, inexact inverse subspace iteration for generalized eigenvalue problems, linear algebra and its application, 434 (2011) 1697-1715 ]. in particular, the linear convergence property of the inverse subspace iteration is preserved.

We introduce a new and eecient Chebyshev-Legendre Galerkin method for elliptic problems. The new method is based on a Legendre-Galerkin formulation, but only the Chebyshev-Gauss-Lobatto points are used in the computation. Hence, it enjoys advantages of both the Legendre-Galerkin and Chebyshev-Galerkin methods.