The recursive tri-reduction method for tridiagonal linear systems
D. J. Evans, Changjun Li
Abstract
D. J. Evans, Changjun Li
Abstract
Systems of tridiagonal equations frequently arise in practical applications related to solving ordinary or partial differential equations by discrete numerical methods. In this paper a new direct method called the recursive tri-reduction method is developed for the tridiagonal system. The method is simple and has the advantage over the Gaussian Elimination procedure when we use the parallel computer.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Systems of tridiagonal equations frequently arise in practical applications related to solving ordinary or partial differential equations by discrete numerical methods. In this paper a new direct method called the recursive tri-reduction method is developed for the tridiagonal system. The method is simple and has the advantage over the Gaussian Elimination procedure when we use the parallel computer.
Key concepts: Tridiagonal matrix, Tridiagonal matrix algorithm, Gaussian elimination, Mathematics, Reduction (mathematics), Crank–Nicolson method, Simple (philosophy), Applied mathematics