We analyze an extension of backward differentiation formulas, used as boundary value methods, that generates a class of methods with nice stability and convergence properties. These methods are obtained starting from the boundary value GBDFs class, and are in the class of EBDF-type methods. We discuss different ways of using these linear multistep formulas in order to have efficient parallel implementations. Numerical experiments show their effectiveness.
Generalization of backward differentiation formulas for parallel computers
IAVERNARO, Felice;MAZZIA, Francesca
2002-01-01
Abstract
We analyze an extension of backward differentiation formulas, used as boundary value methods, that generates a class of methods with nice stability and convergence properties. These methods are obtained starting from the boundary value GBDFs class, and are in the class of EBDF-type methods. We discuss different ways of using these linear multistep formulas in order to have efficient parallel implementations. Numerical experiments show their effectiveness.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
