Acceleration of Computation of Determinants and Characteristic Polynomials without Divisions

Authors:
T. R. Seifullin
Affiliations:
Cybernetics Institute, National Academy of Sciences of Ukraine, Kiev, Ukraine timur@d105.icyb.kiev.ua
Venue:
Cybernetics and Systems Analysis
Year:
2003

Citing 3
Cited 0

Matrix multiplication via arithmetic progressions

Journal of Symbolic Computation - Special issue on computational algebraic complexity
On computing determinants of matrices without divisions

ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Computation of Determinants, Adjoint Matrices, and Characteristic Polynomials without Division

Cybernetics and Systems Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

Algorithms are proposed that compute determinants and characteristic polynomials of n \times n matrices without divisions in \leq \frac {9}{7 } \cdot n^{3+1/2} ring operations and adjoint matrices in three times more ring operations.