Hillel Tal-Ezer
Tel Aviv University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Hillel Tal-Ezer.
SIAM Journal on Numerical Analysis | 1986
Hillel Tal-Ezer
A pseudospectral numerical scheme for solving linear, periodic, hyperbolic problems is described. It has infinite accuracy both in time and in space. The high accuracy in time is achieved without increasing the computational work and memory space which is needed for a regular, one step explicit scheme. The algorithm is shown to be optimal in the sense that among all the explicit algorithms of a certain class it requires the least amount of work to achieve a certain given resolution. The class of algorithms referred to consists of all explicit schemes which may be represented as a polynomial in the spatial operator.
SIAM Journal on Numerical Analysis | 1989
Hillel Tal-Ezer
A pseudospectral explicit scheme for solving linear, periodic, parabolic problems is described. It has infinite accuracy both in time and in space. The high accuracy is achieved while the time resolution parameter
Geophysics | 1990
Hillel Tal-Ezer; Jose M. Carcione; Dan Kosloff
M(M = O({1 / {\Delta t}})
Journal of Computational Physics | 1992
Hillel Tal-Ezer; Ronnie Kosloff; Charles Cerjan
for time marching algorithm) and the space resolution parameter
Geophysics | 2010
Dan Kosloff; Reynam C. Pestana; Hillel Tal-Ezer
N(N = O({1 / {\Delta x))}}
Journal of Scientific Computing | 1989
Hillel Tal-Ezer
must satisfy
Journal of Computational Physics | 1986
Hillel Tal-Ezer
M = O(N^{1 + \varepsilon } )\varepsilon > 0
Seg Technical Program Expanded Abstracts | 2008
Dan Kosloff; Reynam C. Pestana; Hillel Tal-Ezer
, compared to the common stability condition
Journal of Computational Physics | 1981
Amiram Harten; Hillel Tal-Ezer
M = O(N^2 )
Seg Technical Program Expanded Abstracts | 2006
Dan Kosloff; Hillel Tal-Ezer; Allon Bartana
, which must be satisfied in any explicit finite-order time algorithm.