Summary: Computation of the Adjoint Matrix
Alkiviadis Akritas1
and Gennadi Malaschonok2
1
University of Thessaly, Department of Computer and Communication Engineering,
GR-38221 Volos, Greece
akritas@uth.gr
2
Tambov State University, Laboratory for Algebraic Computations,
Internatsionalnaya 33, 392622 Tambov, Russia
malaschonok@math-iu.tstu.ru
Abstract. The best method for computing the adjoint matrix of an
order n matrix in an arbitrary commutative ring requires O(n+1/3
log n log log n) operations, provided that the complexity of the algorithm
for multiplying two matrices is n
+ o(n
). For a commutative domain
­ and under the same assumptions ­ the complexity of the best method
is 6n
/(2

Source: Akritas, Alkiviadis G. - Department of Computer and Communication Engineering, University of Thessaly

Collections: Computer Technologies and Information Sciences