2000 character limit reached
New Symbolic Algorithms For Solving A General Bordered Tridiagonal Linear System
Published 4 Mar 2013 in cs.SC, cs.NA, and math.NA | (1303.0738v1)
Abstract: In this paper, the author present reliable symbolic algorithms for solving a general bordered tridiagonal linear system. The first algorithm is based on the LU decomposition of the coefficient matrix and the computational cost of it is O(n). The second is based on The Sherman-Morrison-Woodbury formula. The algorithms are implementable to the Computer Algebra System (CAS) such as MAPLE, MATLAB and MATHEMATICA. Three examples are presented for the sake of illustration.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.