Matrix decomposition algorithms for separable elliptic boundary value problems in two space dimensions (Q1801852): Difference between revisions

The numerical solution of separable linear elliptic problems on a rectangle has been the subject of different approaches, such as finite differences, finite elements, orthogonal spline collocation and spectral methods. The resulting linear systems whose solutions are looked for, are apparently unrelated. The authors show that these systems can be described in terms of a general system involving convenient matrix tensor products. Extensions, the possibility of taking advantage of implicit parallelism and an application are also discussed.