No label defined (Q3727249)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3958571
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3958571 |
Statements
1986
0 references
Hensel code
0 references
eigenvalues
0 references
characteristic polynomial
0 references
overflow
0 references
truncation error
0 references
p-adic arithmetic
0 references
Danilevskii's method
0 references
Frobenius standard form
0 references
integer matrix
0 references
0.8057019114494324
0 references
0.7829020619392395
0 references
0.7724427580833435
0 references
0.7549773454666138
0 references
0.7495907545089722
0 references
[For the entire collection see Zbl 0591.00036.] One approach to computing the eigenvalues of a real matrix is to compute the roots of its characteristic polynomial. Since the eigenvalues are very sensitive to very small perturbation of its coefficients, an interesting alternative is to compute the characteristic polynomial exactly. It was suggested by \textit{E.Krishnamurthy}, \textit{T. Mahadeva Rao} and \textit{K. Subramanian} [Proc. Indian Acad. Sci., Sect. A 81, 58-79 (1975; Zbl 0324.10004)] that the problems of overflow and truncation error associated with floating-point arithmetic can be overcome using p-adic arithmetic. This is similar to modular arithmetic in which arithmetic operations are defined on coded representations of rational numbers and correspond to the rational arithmetic operations. We show how such an arithmetic system can be combined with Danilevskii's method of reducing a matrix to Frobenius standard form to obtain an exact algorithm for computing the characteristic polynomial of an integer matrix.
0 references