A Novel Parallel Algorithm Based on the Gram-Schmidt Method for Tridiagonal Linear Systems of Equations

<table>The matrix<svg height="13.2125" id="M101" style="vertical-align:-3.00941pt" version="1.1" viewbox="0 0 41.349998 13.2125" width="41.349998" xmlns="http://www.w3.org/2000/svg">
<g transform="matrix(1.25,0,0,-1.25,0,13.2125)">
<g transform="translate(72,-61.43)">
<text transform="matrix(1,0,0,-1,-68.21,64.47)">
<tspan style="font-size: 11.21px; " x="0" y="0">𝐴</tspan>
</text>
<text transform="matrix(1,0,0,-1,-60.18,61.67)">
<tspan style="font-size: 7.85px; " x="0" y="0">1</tspan>
<tspan style="font-size: 7.85px; " x="3.9230001" y="0">5</tspan>
<tspan style="font-size: 7.85px; " x="7.8460002" y="0">×</tspan>
<tspan style="font-size: 7.85px; " x="12.86744" y="0">1</tspan>
<tspan style="font-size: 7.85px; " x="16.79044" y="0">5</tspan>
</text>
</g>
</g>
</svg>; (a) one processor, (b) two processors, and (c) three processors.</table>

Mathematical Problems in Engineering

fig4

Figure 4

Figure 4: A Novel Parallel Algorithm Based on the Gram-Schmidt Method for Tridiagonal Linear Systems of Equations 