The diagonal transfer method (TS algorithm) for five-point equations. (Q1852519)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The diagonal transfer method (TS algorithm) for five-point equations. |
scientific article; zbMATH DE number 1849233
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The diagonal transfer method (TS algorithm) for five-point equations. |
scientific article; zbMATH DE number 1849233 |
Statements
The diagonal transfer method (TS algorithm) for five-point equations. (English)
0 references
26 June 2003
0 references
The authors discuss the solution of systems of five-point equations that arise when differential equations are approximated on a rectangular grid \(\Omega_h\) with points \((x_i,y_j)\) \((i= 1,2,\dots, M)\) and characteristic step \(h= O(L^{-1})\). Modifications of the TS (triangle-star) algorithm for their solution are considered. The stability of the method is analyzed, and the results of numerical experiments are presented.
0 references
system of linear algebraic equations
0 references
finite difference method
0 references
stability
0 references
TS algorithm
0 references
triangle-star algorithm
0 references
sparse matrices
0 references
direct method
0 references
numerical experiments
0 references
0.7211121916770935
0 references
