Skip to content
Research Article Open access CC BY 4.0

On Solving Comrade Linear Systems Via Transformations

A. A. Karawia, S. S. Askar

Journal of Advances in Mathematics and Computer Science · pp. 1–8 · Published 3 Aug 2016

10.9734/BJMCS/2016/27679

Abstract

Recently, a new symbolic algorithm for solving comrade linear systems is given by Karawia [A. A. Karawia, Symbolic algorithm for solving comrade linear systems based on a modi fied Stair-Diagonal Approach, Appl. Math. Lett. 2013; 26:913-918.]. This paper introduces different numerical and symbolic algorithms for solving comrade linear systems via transformations. Our symbolic algorithm removes the cases where the numerical algorithms fail. The computational cost of these algorithms is given. It gives better absolute error than the other methods. The algorithm is implementable to the Computer Algebra System (CAS) such as MAPLE and MATLAB. Some illustrative examples are presented for the sake of illustration.

Comrade matrices tridiagonal matrices determinants Computer Algebra Systems (CAS)

Cited by 2

On linear-time solvers for comrade linear systems

J. A. Marrero · Journal of Computational and Applied Mathematics · 2020

Article metrics

Real usage data collected on this platform.

0

Page views

0

PDF downloads

0

Outbound clicks

2

Citations

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

No views recorded yet.

Traffic sources

Referring site, by host.

No traffic recorded yet.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.