On factored discretizations of the Laplacian for the fast solution of Poisson's equation on general regions (Q2266361): Difference between revisions

A discrete version of the factorization \((\partial /\partial x-i\partial /\partial y)(\partial /\partial x+i\partial /\partial y)=\Delta\) is the basis for a two-parameter factored discretization of the Laplacian. In fact, a sparse Cholesky decomposition of the relevant discretization operator is found. It leads to fast second order Poisson solvers on 2-D regions. An implementation similar to the marching algorithm is proposed. The relationship of stability versus accuracy is discussed.