The diagonal transfer method (TS algorithm) for five-point equations.
direct methodfinite difference methodnumerical experimentssparse matricesstabilitysystem of linear algebraic equationstriangle-star algorithmTS algorithm
Boundary value problems for second-order elliptic equations (35J25) Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Finite difference methods for boundary value problems involving PDEs (65N06) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12)
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.
- scientific article; zbMATH DE number 4131583
- scientific article; zbMATH DE number 1564036
- scientific article; zbMATH DE number 3870532
- Using the line-by-line recurrence method with a variable compensation parameter for solving finite-difference elliptical equations
- Network direct methods for discretized PDEs on structured grids
This page was built for publication: The diagonal transfer method (TS algorithm) for five-point equations.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1852519)
