Computations in modules over commutative domains

Authors:
Alkiviadis G. Akritas;Gennadi I. Malaschonok
Affiliations:
University of Thessaly, Department of Computer and Communication Engineering, Volos, Greece;Tambov State University, Tambov, Russia
Venue:
CASC'07 Proceedings of the 10th international conference on Computer Algebra in Scientific Computing
Year:
2007

Citing 7
Cited 1

Elements of computer algebra with applications

Elements of computer algebra with applications
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
Various proofs of Sylvester's (determinant) identity

Selected papers presented at the international IMACS symposium on Symbolic computation, new trends and developments
Efficient Gaussian Elimination Method for Symbolic Determinants and Linear Systems

ACM Transactions on Mathematical Software (TOMS)
Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic

FCT '85 Fundamentals of Computation Theory
Computation of the adjoint matrix

ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II

Modified gauss algorithm for matrices with symbolic entries

ACM Communications in Computer Algebra

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is a review of results on computational methods of linear algebra over commutative domains. Methods for the following problems are examined: solution of systems of linear equations, computation of determinants, computation of adjoint and inverse matrices, computation of the characteristic polynomial of a matrix.