Two algorithms for solving comrade linear systems

DOI10.1016/j.amc.2006.11.107zbMath1122.65316OpenAlexW2017034365MaRDI QIDQ2381319

A. A. Karawia

Publication date: 17 September 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.11.107

zbMATH Keywords

linear systemsnumerical examplesdeterminantstridiagonal matricessymbolic algorithmcomputer algebra systems (CAS)Comrade matrices

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Symbolic computation and algebraic computation (68W30) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

A novel elementary algorithm for solving comrade linear systems, Numerical algorithms for solving comrade linear systems based on tridiagonal solvers, On the inverse of a general pentadiagonal matrix, Factorization of Hessenberg matrices, On linear-time solvers for comrade linear systems, Symbolic algorithm for solving comrade linear systems based on a modified stair-diagonal approach

Uses Software

• Maple
• Mathematica
• Matlab
• MACSYMA
• cheney-kincaid

Cites Work

• A fast algorithm for evaluating \(n\)th order tri-diagonal determinants.
• On the inverse of a general tridiagonal matrix.
• Inversion of general tridiagonal matrices
• Applications of the comrade matrix to linear multivariable systems theory
• Unnamed Item
• Unnamed Item
• Unnamed Item