Variant of the Thomas Algorithm for opposite-bordered tridiagonal systems of equations

Alexandre Martin, Iain D. Boyd

Research output: Contribution to journalArticlepeer-review

22 Scopus citations


To solve tridiagonal systems of linear equations, the Thomas Algorithm is a much more efficient method than, for instance, Gaussian elimination. The algorithm uses a series of elementary row operations and can solve a system of n equations in O(n) operations, instead of O(n3). Many variations of the Thomas Algorithm have been developed over the years to solve very specific near-tridiagonal matrix. However, none of these methods address the situation of a system of linear equations that could easily be solved if elementary operations on columns are applied, instead of elementary operations on rows. The present paper proposes an efficient method that allows the use of elementary column operations to solve linear systems of equations using vector multiplication techniques, such as the one proposed by Thomas.

Original languageEnglish
Pages (from-to)752-759
Number of pages8
JournalInternational Journal for Numerical Methods in Biomedical Engineering
Issue number6
StatePublished - Jun 2010


  • Elementary column operations
  • Linear solver
  • Thomas Algorithm

ASJC Scopus subject areas

  • Software
  • Biomedical Engineering
  • Modeling and Simulation
  • Molecular Biology
  • Computational Theory and Mathematics
  • Applied Mathematics


Dive into the research topics of 'Variant of the Thomas Algorithm for opposite-bordered tridiagonal systems of equations'. Together they form a unique fingerprint.

Cite this