Computation of the Adjoint Matrix

DOI10.1007/11758525_65zbMATH Open1155.68588arXiv1711.09450OpenAlexW3099953724MaRDI QIDQ3545114FDOQ3545114

Gennadi I. Malaschonok, Alkiviadis G. Akritas

Publication date: 9 December 2008

Published in: Computational Science – ICCS 2006 (Search for Journal in Brave)

Abstract: The best method for computing the adjoint matrix of an order $n$ matrix in an arbitrary commutative ring requires $$ operations, provided the complexity of the algorithm for multiplying two matrices is $$. For a commutative domain -- and under the same assumptions -- the complexity of the best method is $$. In the present work a new method is presented for the computation of the adjoint matrix in a commutative domain. Despite the fact that the number of operations required is now 1.5 times more, than that of the best method, this new method permits a better parallelization of the computational process and may be successfully employed for computations in parallel computational systems.

Full work available at URL: https://arxiv.org/abs/1711.09450

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cited In (6)

• Direct calculation of off-diagonal matrix elements
• Various proofs of Sylvester's (determinant) identity.
• Fast Generalized Bruhat Decomposition
• Title not available (Why is that?)
• On the adjugate matrix
• Title not available (Why is that?)

Uses Software

• ParCA

   Recommendations

• Title not available (Why is that?) 👍 👎
• Computation of determinants, adjoint matrices, and characteristic polynomials without division 👍 👎
• Some fast algorithms multiplying a matrix by its adjoint 👍 👎
• Title not available (Why is that?) 👍 👎
• Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation 👍 👎

This page was built for publication: Computation of the Adjoint Matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3545114)