In this paper, we described tow parallel algorithms for finding the solution of
symmetric pentadiagonal linear systems of equations of order n . The proposed algorithms
require 2 processors; each of both possesses
N
O n local memor
y.
The first algorithm includes writing the pentadiagonal matrix in the form of product
of tow tridiagonal matrices. We suggested a parallel algorithm for solving tridiagonal
linear systems of equations. The second algorithm consists of decomposition of the
pentadiagonal matrix in a form such that we can carry out the resulting linear systems of
equations by using parallel algorithm. We carried out many numerical experiments to
illustrate the efficiency, speeding up and accuracy for solving symmetric pentadiagonal
linear systems of equations. The numerical experiments showed that the proposed
algorithms were efficient and one of both was much faster in factor of 2 than the other one
for solving the same test problems.
This paper presents a new type of encryption, using a matrix
asymmetric and symmetric matrix inverse matrix clear text, which
is an internal encryption.
As well as asymmetric encryption, where the ciphertext is inversely
symmetric matrix.
Decryp
tion matrix related to any asymmetric encryption keys
depends on public and private, and is applied to the coded messages
used in the current system ASCII our computers.
