This paper is an attempt to bring some theory on the top of some previously unproved experimental statements about the double-base number system (DBNS). We use results from diophantine approximation to address the pro...
详细信息
ISBN:
(纸本)0819454974
This paper is an attempt to bring some theory on the top of some previously unproved experimental statements about the double-base number system (DBNS). We use results from diophantine approximation to address the problem of converting integers into DBNS. Although the material presented in this article is mainly theoretical, the proposed algorithm could lead to very efficient implementations.
A new and efficient number theoretic algorithm for evaluating signs of determinants is proposed The algorithm uses computations over small finite rings. It is devoted to a variety of computational geometry problems, w...
详细信息
ISBN:
(纸本)0819441880
A new and efficient number theoretic algorithm for evaluating signs of determinants is proposed The algorithm uses computations over small finite rings. It is devoted to a variety of computational geometry problems, where the necessity of evaluating signs, of determinants of small matrices often arises.
This paper gives displacement structure algorithms for the factorization positive definite and indefinite Hankel and Hankel-like matrices. The positive definite algorithm uses orthogonal symplectic transformations in ...
详细信息
ISBN:
(纸本)0819432938
This paper gives displacement structure algorithms for the factorization positive definite and indefinite Hankel and Hankel-like matrices. The positive definite algorithm uses orthogonal symplectic transformations in place of the Sigma-orthogonal transformations used in Toeplitz algorithms. The indefinite algorithm uses a look-ahead step and is based on the observation that displacement structure algorithms for Hankel factorization have a natural and simple block generalization. Both algorithms can be applied to Hankel-like matrices of arbitrary displacement rank.
暂无评论