A New Algorithm for Inverting General Cyclic Heptadiagonal Matrices Recursively
نویسنده
چکیده
In this paper, we describe a reliable symbolic computational algorithm for inverting general cyclic heptadiagonal matrices by using parallel computing along with recursion. The algorithm is implementable to the Computer Algebra System(CAS) such as MAPLE, MATLAB and MATHEMATICA. An example is presented for the sake of illustration.
منابع مشابه
On the Inverse Of General Cyclic Heptadiagonal and Anti-Heptadiagonal Matrices
In the current work, the author present a symbolic algorithm for finding the determinant of any general nonsingular cyclic heptadiagonal matrices and inverse of anti-cyclic heptadiagonal matrices. The algorithms are mainly based on the work presented in [A. A. KARAWIA, A New Algorithm for Inverting General Cyclic Heptadiagonal Matrices Recursively, arXiv:1011.2306v1 [cs.SC]]. The symbolic algor...
متن کاملA New Algorithm for General Cyclic Heptadiagonal Linear Systems Using Sherman-Morrison-Woodbury formula
In this paper, a new efficient computational algorithm is presented for solving cyclic heptadiagonal linear systems based on using of heptadiagonal linear solver and Sherman–Morrison–Woodbury formula. The implementation of the algorithm using computer algebra systems (CAS) such as MAPLE and MATLAB is straightforward. Numerical example is presented for the sake of illustration.
متن کاملSymbolic algorithm for inverting cyclic pentadiagonal matrices recursively - Derivation and implementation
In this paper, by using parallel computing along with recursion, we describe a reliable symbolic computational algorithm for inverting cyclic pentadiagonal matrices. The algorithm is implemented in MAPLE. Two other symbolic algorithms are developed and the computational costs for all algorithms are given. An example is presented for the sake of illustration. © 2009 Elsevier Ltd. All rights rese...
متن کاملOn the Inverting of A General Heptadiagonal Matrix
In this paper, we developed new numeric and symbolic algorithms to find the inverse of any nonsingular heptadiagonal matrix. Symbolic algorithm will not break and it is without setting any restrictive conditions. The computational cost of our algorithms is O(n). The algorithms are suitable for implementation using computer algebra system such as MAPLE, MATLAB and MATHEMATICA. Examples are given...
متن کاملامید ریاضی نرخ پوشش برای ماتریس‌های هلمن
Hellman’s time-memory trade-off is a probabilistic method for inverting one-way functions, using pre-computed data. Hellman introduced this method in 1980 and obtained a lower bound for the success probability of his algorithm. After that, all further analyses of researchers are based on this lower bound. In this paper, we first studied the expected coverage rate (ECR) of the Hellman matrice...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1011.2306 شماره
صفحات -
تاریخ انتشار 2010