This is the authors' abstract. We don't add key points for this paper.
We consider solving separable, second order, linear elliptic partial differential equations. If an elliptic problem is separable, then, for certain discretizations, the matrices involved in the corresponding discrete problem can be expressed in terms of tensor products of lower order matrices. In the most general case, the discrete problem can be written in the form (A₁ ⊗ B₂ + B₁ ⊗ A₂ )C = F. We present a new Tensor Product Generalized Alternating Direction Implicit (TPGADI) iterative method for solving such discrete problems. We prove convergence and establish computational efficiency. The TPGADI method is applied to the Hermite bicubic collocation equations. We conclude that the TPGADI method is an effective tool for solving the discrete elliptic problems arising from a large class of elliptic problems.
No takes yet. Share an insight, caveat, or question.
Wayne R. Dyksen (1987) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:
More from SIAM Journal on Numerical Analysis