Computation of the Adjoint Matrix
From MaRDI portal
Publication:3545114
DOI10.1007/11758525_65zbMATH Open1155.68588arXiv1711.09450OpenAlexW3099953724MaRDI QIDQ3545114FDOQ3545114
Authors: 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 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
Recommendations
- scientific article; zbMATH DE number 1263378
- Computation of determinants, adjoint matrices, and characteristic polynomials without division
- Some fast algorithms multiplying a matrix by its adjoint
- scientific article; zbMATH DE number 1504614
- Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
Cited In (8)
- Fast generalized Bruhat decomposition
- Direct calculation of off-diagonal matrix elements
- Various proofs of Sylvester's (determinant) identity.
- Several properties of adjoint matrix over a ring
- Title not available (Why is that?)
- Some fast algorithms multiplying a matrix by its adjoint
- On the adjugate matrix
- Title not available (Why is that?)
Uses Software
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)
