A fast algorithm to compute cubic fields

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A fast algorithm to compute cubic fields

We present a very fast algorithm to build up tables of cubic fields. Real cubic fields with discriminant up to 1011 and complex cubic fields down to −1011 have been computed. The classification of quadratic fields up to isomorphism is trivial: they are uniquely characterized by their discriminant, and we can compute tables as soon as we know how to test if an integer is squarefree and how to ch...

متن کامل

An algorithm to compute relative cubic fields

Let K be an imaginary quadratic number field with class number 1. We describe a new, essentially linear-time algorithm, to list all isomorphism classes of cubic extensions L/K up to a bound X on the norm of the relative discriminant ideal. The main tools are Taniguchi’s [18] generalization of Davenport-Heilbronn parametrisation of cubic extensions, and reduction theory for binary cubic forms ov...

متن کامل

A Fast Recursive Algorithm to Compute LocalAxial

Aim of the paper is to describe an application of a fast recursive algorithm to the computation of the local axial moment of a gray level image. The fast algorithm allows to reduce the computation complexity to O(n) where n is the input size. This result is of interest in real time image applications with more than 10 6 pixels. Experiments on real data validate the theoretical previsions.

متن کامل

A Fast Algorithm to Compute the Realstructured Stability Radius

We describe a fast algorithm to compute the real structured stability radius with respect to the open left-half plane or the open unit disk. It is based on a recent formula proved by Qiu et al. (Automatica, vol. 31, pp. 879-890, 1995) and the well-known correspondence between the singular values of a transfer function matrix and the imaginary eigenvalues of a related Hamiltonian matrix. Numeric...

متن کامل

The Euclidean Algorithm in Cubic Number Fields

In this note we present algorithms for computing Euclidean minima of cubic number fields; in particular, we were able to find all normEuclidean cubic number fields with discriminants −999 < d < 104.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Computation

سال: 1997

ISSN: 0025-5718

DOI: 10.1090/s0025-5718-97-00846-6