首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   18篇
  免费   3篇
数学   21篇
  2018年   1篇
  2016年   1篇
  2014年   2篇
  2013年   2篇
  2010年   2篇
  2008年   2篇
  2006年   1篇
  2005年   1篇
  2004年   1篇
  2003年   4篇
  2001年   1篇
  1998年   2篇
  1995年   1篇
排序方式: 共有21条查询结果,搜索用时 15 毫秒
1.
本文研究了由特征值唯一确定的3×3实Hankel矩阵.借助于M.Fielder[1]的结论并经过细致的讨论,得到3×3实Hankel矩阵由其特征值唯一确定的充分必要条件,刻画了3×3实Hankel矩阵的一种特征值性质.  相似文献   
2.
We show that many well-known counting coefficients in combinatorics are Hamburger moment sequences in certain unified approaches and that Hamburger moment sequences are infinitely convex. We introduce the concept of the q-Hamburger moment sequence of polynomials and present some examples of such sequences of polynomials. We also suggest some problems and conjectures.  相似文献   
3.
The coefficients of a linear system, even if it is a part of a block-oriented nonlinear system, normally satisfy some linear algebraic equations via Hankel matrices composed of impulse responses or correlation functions. In order to determine or to estimate the coefficients of a linear system it is important to require the associated Hankel matrix be of row-full-rank. The paper first discusses the equivalent conditions for identifiability of the system. Then, it is shown that the row-full-rank of the Hankel matrix composed of impulse responses is equivalent to identifiability of the system. Finally, for the row-full-rank of the Hankel matrix composed of correlation functions, the necessary and sufficient conditions are presented, which appear slightly stronger than the identifiability condition. In comparison with existing results, here the minimum phase condition is no longer required for the case where the dimension of the system input and output is the same, though the paper does not make such a dimensional restriction.  相似文献   
4.
In this paper, we consider an approximate block diagonalization algorithm of an n×n real Hankel matrix in which the successive transformation matrices are upper triangular Toeplitz matrices, and propose a new fast approach to compute the factorization in O(n 2) operations. This method consists on using the revised Bini method (Lin et al., Theor Comp Sci 315: 511–523, 2004). To motivate our approach, we also propose an approximate factorization variant of the customary fast method based on Schur complementation adapted to the n×n real Hankel matrix. All algorithms have been implemented in Matlab and numerical results are included to illustrate the effectiveness of our approach.  相似文献   
5.
We present a semidefinite programming approach for computing optimally conditioned positive definite Hankel matrices of order n. Unlike previous approaches, our method is guaranteed to find an optimally conditioned positive definite Hankel matrix within any desired tolerance. Since the condition number of such matrices grows exponentially with n, this is a very good test problem for checking the numerical accuracy of semidefinite programming solvers. Our tests show that semidefinite programming solvers using fixed double precision arithmetic are not able to solve problems with n>30. Moreover, the accuracy of the results for 24?n?30 is questionable. In order to accurately compute minimal condition number positive definite Hankel matrices of higher order, we use a Mathematica 6.0 implementation of the SDPHA solver that performs the numerical calculations in arbitrary precision arithmetic. By using this code, we have validated the results obtained by standard codes for n?24, and we have found optimally conditioned positive definite Hankel matrices up to n=100.  相似文献   
6.
In this study, we have found upper and lower bounds for the spectral norm of Cauchy–Toeplitz and Cauchy–Hankel matrices in the forms Tn=[1/(a+(ij)b)]ni,j=1, Hn=[1/(a+(i+j)b)]ni,j=1.  相似文献   
7.
A classical system of algebraic equations is treated as a finite power moment problem in C and investigated on this base. Being originated from the algebraic theory of binary forms, this system is closely related to an extraordinary number of different subjects in the classical and modern analysis. A survey of these relations is presented.  相似文献   
8.
We introduce a class of infinite matrices , which are asymptotically (as |s| + |s′| → ∞) close to Hankel–T?plitz matrices. We prove that this class forms an algebra, and that flow-maps of nonautonomous linear equations with coefficients from the class also belong to it.  相似文献   
9.
Bell数的Hankel矩阵的一般表示   总被引:3,自引:0,他引:3  
刘麦学  张海模 《数学季刊》2003,18(4):338-342
§ 1. Introduction  TheBellnumberBn countsthenumberofpartitionsofann set,withthefirstvaluesB0 =1 ,B1 =1 ,B2 =2 ,B3 =5 ,B4=1 5 ,B5=5 2 .ItsexponentialgeneratingfunctionisB(x) =∑n≥ 0Bnxnn ! =eex-1 ,(see [2 ]) .LetthegeneralhankelmatrixofBellnumberbe Bn(t) =Bt Bt+ 1 …Bn +tBt+ 1 Bt+ 2 …Bn+t+ 1…………Bn+t Bn+t+ 1 …B2n +t,(see [3]) .Recently ,AIGNER [1 ]obtaineddet Bn( 0 ) =det Bn( 1 ) =n ! ! ,wheren ! ! =∏nk =0 k ! .ThepurposeofthispaperistoprovideageneralrepersentationoftheH…  相似文献   
10.
The Structured Total Least Squares (STLS) problem is a natural extension of the Total Least Squares (TLS) approach when structured matrices are involved and a similarly structured rank deficient approximation of that matrix is desired. In many of those cases the STLS approach yields a Maximum Likelihood (ML) estimate as opposed to, e.g., TLS.In this paper we analyze the STLS problem for Hankel matrices (the theory can be extended in a straightforward way to Toeplitz matrices, block Hankel and block Toeplitz matrices). Using a particular parametrisation of rank-deficient Hankel matrices, we show that this STLS problem suffers from multiple local minima, the properties of which depend on the parameters of the new parametrisation. The latter observation makes initial estimates an important issue in STLS problems and a new initialization method is proposed. The new initialization method is applied to a speech compression example and the results confirm the improved performance compared to other previously proposed initialization methods.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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