A new bordering strategy for solving block-tridiagonal linear systems

D. J. Evans Parallel Algorithm Research Centre, Department of Computer Studies, University of Technology, Loughborough, Leicestershire, UK

M. D. Levin Parallel Algorithm Research Centre, Department of Computer Studies, University of Technology, Loughborough, Leicestershire, UK

Abstract

A new algorithm, the double-bordering algorithm, for the solution of linear systems of equations is derived, and its complexity is shown to be compatible with the complexity of Gaussian elimination, The application of the algorithm to the solution of block-tridiagonal systems is also described.

Keywords:

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

A new bordering strategy for solving block-tridiagonal linear systems

Information for

Open access

Opportunities

Help and information

A new bordering strategy for solving block-tridiagonal linear systems

Abstract

Reprints and Corporate Permissions

Academic Permissions

Related research

To cite this article:

Download citation

Information for

Open access

Opportunities

Help and information

Keep up to date

Your download is now in progress and you may close this window

Login or register to access this feature