✦ LIBER ✦

Determinants and characteristic polynomials

✍ Scribed by B. V. Ivanov

Publisher: Springer
Year: 1986
Tongue: English
Weight: 311 KB
Volume: 11
Category: Article
ISSN: 0377-9017
DOI: 10.1007/bf00574152

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Invariant subspace, determinant and char

Invariant subspace, determinant and characteristic polynomials

✍ Yaokun Wu 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 124 KB

Making use of an elementary fact on invariant subspace and determinant of a linear map and the method of algebraic identities, we obtain a factorization formula for a general characteristic polynomial of a matrix. This answers a question posed in [A. Deng, I. Sato, Y. Wu, Characteristic polynomials

Determinants of integral ideal lattices

Determinants of integral ideal lattices and automorphisms of given characteristic polynomial

✍ Eva Bayer-Fluckiger 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 84 KB

The aim of this paper is to give a characterisation of the determinants and signatures of integral ideal lattices over a given algebraic number field. This is then used to obtain an existence criterion for automorphisms of given characteristic polynomial. In particular, we give a different proof of

Polynomial error and determination of th

Polynomial error and determination of the measuring equipment's normalizing metrological characteristics

✍ S. S. Obozovskii 📂 Article 📅 1975 🏛 Springer US 🌐 English ⚖ 147 KB

The Root and Bell’s disk iteration metho

The Root and Bell’s disk iteration methods are of the same error propagation characteristics in the simultaneous determination of the zeros of a polynomial, Part I: Correction methods

✍ M.N.O. Ikhile 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 490 KB

Generalised characteristic polynomials

✍ John Canny 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 710 KB

Multipolynomial resultants provide the most efficient methods known {in terms as asymptotic complexity) for solving certain systems of polynomial equations or eliminating variables {Bajaj et al., 1988). The resultant off1 ..... f~ in K[x 1 ..... xm] will be a polynomial in m-n+l variables which is z

Characteristic polynomials, Ehrhart quas

Characteristic polynomials, Ehrhart quasi-polynomials, and torus groups

✍ Jim Lawrence 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 171 KB

For k a positive integer, we consider the problem of counting solutions x to the equation kx = 0, where x is to lie in a given subset K of a torus group. This problem is considered for three classes of subsets K.