Creat membership Creat membership
Sign in

Forgot password?

Confirm
  • Forgot password?
    Sign Up
  • Confirm
    Sign In
Creat membership Creat membership
Sign in

Forgot password?

Confirm
  • Forgot password?
    Sign Up
  • Confirm
    Sign In
Collection
For ¥0.57 per day, unlimited downloads CREATE MEMBERSHIP Download

toTop

If you have any feedback, Please follow the official account to submit feedback.

Turn on your phone and scan

home > search >

A parallel algorithm for achieving the Smith Normal Form of an integer matrix

Author:
Ingmar Neumann   Wolfgang Wilhelmi  


Journal:
Parallel Computing


Issue Date:
1996


Abstract(summary):

The Smith normal form of a matrix is a diagonal representation which contains the invariant factors of the matrix in its diagonal. In this paper, a new algorithm, which exploits parallelism by considering data dependencies, is proposed. In the case of sparse matrices, a high degree of parallelism can be reached


Page:
1399-1412


VIEW PDF

The preview is over

If you wish to continue, please create your membership or download this.

Create Membership

Similar Literature

Submit Feedback

This function is a member function, members do not limit the number of downloads