In this paper we present fast discrete collocation methods forVolterra integral equations of Hammerstein type, where the Laplace transform of the kernel is known a priori. To compute the numerical solution over N time steps, the constructed methods require O(N log(N )) operations, O(log(N )) memory and preserve the order of accuracy of the corresponding exact collocation methods. The numerical experiments confirm the expected accuracy and the computational cost.
Fast Collocation methods for Volterra Integral equations of convolution type
CONTE, Dajana;
2006
Abstract
In this paper we present fast discrete collocation methods forVolterra integral equations of Hammerstein type, where the Laplace transform of the kernel is known a priori. To compute the numerical solution over N time steps, the constructed methods require O(N log(N )) operations, O(log(N )) memory and preserve the order of accuracy of the corresponding exact collocation methods. The numerical experiments confirm the expected accuracy and the computational cost.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.
