A generalization of the Buneman variant of cyclic odd–even reduction algorithm for solving finite difference approximations to Poisson’s equations is presented. This generalization places no restriction on the block size, n, of the system and computes the solution in O(n² log ₂ n) operations.
No takes yet. Share an insight, caveat, or question.
Roland A. Sweet (1977) studied this question.
Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context: