The diagonal transfer method (TS algorithm) for five-point equations.

zbMATH Open1045.65088MaRDI QIDQ1852519FDOQ1852519

Authors: V. P. Il'in, V. L. Nefedov 

Publication date: 26 June 2003

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Recommendations

• Publication:3033255
• 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

zbMATH Keywords

sparse matricesstabilitynumerical experimentsfinite difference methoddirect methodsystem of linear algebraic equationstriangle-star algorithmTS algorithm

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Boundary value problems for second-order elliptic equations (35J25) Finite difference methods for boundary value problems involving PDEs (65N06) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12)

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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)