Santiago de Compostela, España
By far, the standard implementation of finite difference schemes for forward–backward partial differential equations consists in employing an iterative method. This paper collects a series of numerical results which demonstrate that a direct implementation can reduce the computing time. An effective way of choosing the seed for the iterative method naturally arises.
© 2008-2024 Fundación Dialnet · Todos los derechos reservados