English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper, the author present reliable symbolic algorithms for solving ageneral bordered tridiagonal linear system. The first algorithm is based on theLU decomposition of the coefficient matrix and the computational cost of it isO(n). The second is based on The Sherman-Morrison-Woodbury formula. Thealgorithms are implementable to the Computer Algebra System (CAS) such asMAPLE, MATLAB and MATHEMATICA. Three examples are presented for the sake ofillustration.

New Symbolic Algorithms For Solving A General Bordered Tridiagonal Linear System