首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
This paper studies relationships between coupled-expanding maps and one-sided symbolic dynamical systems. The concept of coupled-expanding map is extended to a more general one: coupled-expansion for a transitive matrix. It is found that the subshift for a transitive matrix is strictly coupled-expanding for the matrix in certain disjoint compact subsets; the topological conjugacy of a continuous map in its compact invariant set of a metric space to a subshift for a transitive matrix has a close relationship with that the map is strictly coupled-expanding for the matrix in some disjoint compact subsets. A certain relationship between strictly coupled-expanding maps for a transitive matrix in disjoint bounded and closed subsets of a complete metric space and their topological conjugacy to the subshift for the matrix is also obtained. Dynamical behaviors of subshifts for irreducible matrices are then studied and several equivalent statements to chaos are obtained; especially, chaos in the sense of Li–Yorke is equivalent to chaos in the sense of Devaney for the subshift, and is also equivalent to that the domain of the subshift is infinite. Based on these results, several new criteria of chaos for maps are finally established via strict coupled-expansions for irreducible transitive matrices in compact subsets of metric spaces and in bounded and closed subsets of complete metric spaces, respectively, where their conditions are weaker than those existing in the literature.  相似文献   

2.
The interplay between the algebraic and analytic properties of a matrix and the geometric properties of its pseudospectrum is investigated. It is shown that one can characterize Hermitian matrices, positive semi-definite matrices, orthogonal projections, unitary matrices, etc. in terms of the pseudospectrum. Also, characterizations are given to maps on matrices leaving invariant the pseudospectrum of the sum, difference, or product of matrix pairs. It is shown that such a map is always a unitary similarity transform followed by some simple operations such as adding a constant matrix, taking the matrix transpose, or multiplying by a scalar in {1,-1}.  相似文献   

3.
We consider the version of the pseudospectral method for solving boundary value problems which replaces the differential operator with a matrix constructed from the elementary differentiation matrices whose elements are the derivatives of the Lagrange fundamental polynomials at the collocation points. The iterative solution of the resulting system of equations then requires the recurrent application of that differentiation matrix. Since global polynomial interpolation on the interval only gives useful approximants for points which accumulate in the vicinity of the extremities, the matrix is ill-conditioned. To reduce this drawback, we use Kosloff and Tal-Ezer's suggestion to shift the collocation points closer to equidistant by a conformal map. However, instead of applying their change of variable setting, we extend to stationary equations the linear rational collocation method introduced in former work on partial differential equations. Numerically about as efficient, this does not require any new coding if one starts from an efficient program for the polynomial differentiation matrices.This revised version was published online in October 2005 with corrections to the Cover Date.  相似文献   

4.
In this paper we classify linear maps preserving commutativity in both directions on the space N(F) of strictly upper triangular (n+1)×(n+1) matrices over a field F. We show that for n3 a linear map on N(F) preserves commutativity in both directions if and only if =+f where is a product of standard maps on N(F) and f is a linear map of N(F) into its center.  相似文献   

5.
We say that A is an r-cyclic matrix if Ar=I. We investigate the structure of linear operators on matrices over antinegative semirings that map r-cyclic matrices to r-cyclic matrices and non r-cyclic matrices to non r-cyclic matrices.  相似文献   

6.
对称Toeplitz系统的快速W变换基预条件子   总被引:5,自引:0,他引:5  
成礼智 《计算数学》2000,22(1):73-82
1.引言考虑下列N阶线性方程组其中T_N=(t_i,j) 是N×N阶实对称正定(SPD)Toeplitz矩阵,即0,1,…,N-1)且T_N的所有特征值为正数.Toeplitz系统已广泛应用于数字信号处理,时间序列分析(参见[1])以及微分方程的数值解(参见[21]等领域.八十年代以前,考虑到Toeplitz矩阵的特殊性,人们主要用Levinson递推技术及其变形或者分而治之思想直接求解方程组(1.1),计算复杂性为O(N~(2))或O(NlogN~(2))(参见[3]);比Gauss法运算量级O(N~(3)…  相似文献   

7.
The article deals with Galerkin matrices arising with finite element discretizations of the Navier–Stokes system. Usually these matrices are indefinite and nonsymmetric. They have to be preconditioned if a related linear system is to be solved efficiently by an iterative method. We consider preconditioning by a pressure mass matrix. It is shown how upper and lower bounds of the eigenvalues of a preconditioned Galerkin matrix may be found by variational arguments.  相似文献   

8.
9.
In this paper, we analyze problems involving matrix variables for which we use a noncommutative algebra setting. To be more specific, we use a class of functions (called NC analytic functions) defined by power series in noncommuting variables and evaluate these functions on sets of matrices of all dimensions; we call such situations dimension-free. These types of functions have recently been used in the study of dimension-free linear system engineering problems. In this paper we characterize NC analytic maps that send dimension-free matrix balls to dimension-free matrix balls and carry the boundary to the boundary; such maps we call “NC ball maps”. We find that up to normalization, an NC ball map is the direct sum of the identity map with an NC analytic map of the ball into the ball. That is, “NC ball maps” are very simple, in contrast to the classical result of D'Angelo on such analytic maps in C. Another mathematically natural class of maps carries a variant of the noncommutative distinguished boundary to the boundary, but on these our results are limited. We shall be interested in several types of noncommutative balls, conventional ones, but also balls defined by constraints called Linear Matrix Inequalities (LMI). What we do here is a small piece of the bigger puzzle of understanding how LMIs behave with respect to noncommutative change of variables.  相似文献   

10.
We investigate continuous injective maps defined on the space of upper triangular matrices over a field F that preserve commutativity of matrices in both directions. We show that every such map is a composition of either an inner automorphism and a locally polynomial map or the two latter and one more automorphism of upper triangular matrices.  相似文献   

11.
假设T_m(D)是体D上所有上三角m×m矩阵的集合.首先分别给出诱导映射和保幂等性的定义.然后为了刻画T_m(D)的保幂等的诱导映射,提出类序列的概念,同时描述类序列的性质.最后,使用矩阵技术和初等方法,借助于分类讨论得到了T_m(D)的保幂等的诱导映射的一般形式并且给出了某些例子,用以解释某些结果之间的关系.  相似文献   

12.
Many research efforts for image encryption schemes have elaborated for designing nonlinear functions since security of these schemes closely depends on inherent characteristics of nonlinear functions. It is commonly believed that a chaotic map can be used as a good candidate of a nonlinear component for image encryption schemes. We propose a new image encryption algorithm using a large pseudorandom permutation which is combinatorially generated from small permutation matrices based on chaotic maps. The random-like nature of chaos is effectively spread into encrypted images by using the permutation matrix. The experimental results show that the proposed encryption scheme provides comparable security with that of the conventional image encryption schemes based on Baker map or Logistic map.  相似文献   

13.
This paper presents an iterative algorithm to solve a class of generalized coupled Sylvester-transpose matrix equations over bisymmetric or skew-anti-symmetric matrices. When the matrix equations are consistent, the bisymmetric or skew-anti-symmetric solutions can be obtained within finite iteration steps in the absence of round-off errors for any initial bisymmetric or skew-anti-symmetric matrices by the proposed iterative algorithm. In addition, we can obtain the least norm solution by choosing the special initial matrices. Finally, numerical examples are given to demonstrate the iterative algorithm is quite efficient. The merit of our method is that it is easy to implement.  相似文献   

14.
15.
令F表示任意域,Mn(F)表示由F上所有n×n矩阵形成的结合代数.本文的目的是研究Mn(F)上具有如下性质的两类线性映射,其中一类线性映射在Mn(F)上每一点的取值与Mn(F)的某个合同变换在该点的取值相同,另一类线性映射在Mn(F)上每一点的取值与Mn(F)的某个相似变换在该点的取值相同,随着Mn(F)上的点不同,这些合同变换和相似变换可能也不同.利用矩阵的秩、幂等阵以及幂零阵的性质,通过矩阵计算的方法证明了第一类线性映射或者是合同变换或者是合同变换与转置变换的复合,第二类线性映射或者是相似变换或者是相似变换与转置变换的复合.由这个结果可知存在真正意义上的局部合同变换和局部相似变换,从而丰富了局部映射理论的研究。  相似文献   

16.
本文讨论具有一般协方差结构的增长曲线模型中未知参数矩阵的Bayes影响分析问题.在无信息先验分布假设下,K-L距离被用来评估指定响应阵对参数矩阵的后验分布的影响程度.  相似文献   

17.
We propose an iterative algorithm for the minimization of a ? 1-norm penalized least squares functional, under additional linear constraints. The algorithm is fully explicit: it uses only matrix multiplications with the three matrices present in the problem (in the linear constraint, in the data misfit part and in the penalty term of the functional). None of the three matrices must be invertible. Convergence is proven in a finite-dimensional setting. We apply the algorithm to a synthetic problem in magneto-encephalography where it is used for the reconstruction of divergence-free current densities subject to a sparsity promoting penalty on the wavelet coefficients of the current densities. We discuss the effects of imposing zero divergence and of imposing joint sparsity (of the vector components of the current density) on the current density reconstruction.  相似文献   

18.
We call an iterated map zero-diagonal, if it has a zero-diagonal Jacobi matrix for all x,y. Similarly, zero-trace iterated maps are the maps with zero-trace Jacobi matrix. In this paper, we present some of the geometric and algebraic properties of zero-diagonal planar maps. However, the main focus of this paper is the analysis of the zero-trace planar maps by linear transforming them to a zero-diagonal ones. Some sufficient conditions for the transformation are obtained. Stability for non-hyperbolic fixed points, two types of codim-2 bifurcations, and the local/global invariant manifolds for zero-diagonal and zero-trace maps are investigated.  相似文献   

19.
The basic properties of interval matrix multiplication and several well-known solution algorithms for linear interval equations are abstracted by the concept of a sublinear map. The new concept, coupled with a systematic use of Ostrowski's comparison operator (in a form generalized to interval matrices), is used to derive quantitative information about the result of interval Gauss elimination andthe limit of various iterative schemes for the solution of linear interval equations. Moreover, optimality results are prove for (1) the use of the midpoint inverse as a preconditioning matrix, and (2) Gauss-Seidel iteration with componentwise intersection. This extends and improves results by Scheu, Krawczyk, and Alefeld and Herzberger.  相似文献   

20.
We study mapping cones and their dual cones of positive maps of the \(n\times n\) matrices into itself. For a natural class of cones there is a close relationship between maps in the cone, super-positive maps, and separable states. In particular the composition of a map from the cone with a map in the dual cone is super-positive, and so the natural state it defines is separable.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号