AbstractIn this paper we develop a new multi-dimensional continued fraction algorithm and three known multi-dimensional continued fraction algorithms from the lattice basis reduction multisequence synthesis (LBRMS) algorithm with respect to the different choice of a parameter and so a continued fraction expansion is associated with a basis transformation. The new algorithm is similar to Dai's continued fraction algorithm [Z.D. Dai, K.P. Wang, D.F. Ye, m-Continued fraction algorithm on multi-Laurent series, Acta Arith. (2006) 1–21] but improves the latter effectively
AbstractA new algorithm is described in the paper for calculating continued fractions. The condition...
Is there a good continued fraction approximation between every two bad ones? What is the entropy of ...
AbstractWe present an algorithm to produce the continued fraction expansion of a linear fractional t...
AbstractIn this paper we develop a new multi-dimensional continued fraction algorithm and three know...
Abstract: We propose a new twodimensional generalization of the algorithm for expansion of...
In this paper, we present a method of implementing the multi-continued fraction algorithm on a class...
In this paper, we present a method of implementing the multi-continued fraction algorithm on a class...
AbstractIn this note we introduce a new algorithm to compute the continued fraction of a real number...
AbstractA new continued fraction algorithm is given and analyzed. It yields approximations for an ir...
The LLL algorithm is recognized as one of the most important achievements of twentieth century with ...
Abstract: Davenport and Swinnerton-Dyer found the first 20 extremal thernar cubic forms gi...
The LLL algorithm is recognized as one of the most important achievements of twentieth century with ...
Abstract: In Introduction we discuss the history of the continued fraction and of its gene...
AbstractIn this paper the generalization of a continued fraction in the sense of the Jacobi-Perron a...
A multidimensional continued fraction expansion is given which finds provably good Diophantine appro...
AbstractA new algorithm is described in the paper for calculating continued fractions. The condition...
Is there a good continued fraction approximation between every two bad ones? What is the entropy of ...
AbstractWe present an algorithm to produce the continued fraction expansion of a linear fractional t...
AbstractIn this paper we develop a new multi-dimensional continued fraction algorithm and three know...
Abstract: We propose a new twodimensional generalization of the algorithm for expansion of...
In this paper, we present a method of implementing the multi-continued fraction algorithm on a class...
In this paper, we present a method of implementing the multi-continued fraction algorithm on a class...
AbstractIn this note we introduce a new algorithm to compute the continued fraction of a real number...
AbstractA new continued fraction algorithm is given and analyzed. It yields approximations for an ir...
The LLL algorithm is recognized as one of the most important achievements of twentieth century with ...
Abstract: Davenport and Swinnerton-Dyer found the first 20 extremal thernar cubic forms gi...
The LLL algorithm is recognized as one of the most important achievements of twentieth century with ...
Abstract: In Introduction we discuss the history of the continued fraction and of its gene...
AbstractIn this paper the generalization of a continued fraction in the sense of the Jacobi-Perron a...
A multidimensional continued fraction expansion is given which finds provably good Diophantine appro...
AbstractA new algorithm is described in the paper for calculating continued fractions. The condition...
Is there a good continued fraction approximation between every two bad ones? What is the entropy of ...
AbstractWe present an algorithm to produce the continued fraction expansion of a linear fractional t...