AbstractCompact numerical schemes provide high-order solution of PDEs with low dissipation and dispersion. Computer implementation of these schemes requires numerous passes of data through cache memory that considerably reduces performance of these schemes. To reduce this difficulty, a novel algorithm is proposed here. This algorithm is based on a wavefront approach and sweeps through cache memory only twice
AbstractIn this work, we present a new low memory requirement and low computational time method for ...
Wavelet expansions have drawn a lot of attention in recent decades. Wavelets originate from signal a...
Direct numerical simulation (DNS) of complex flows require solving the problem on parallel machines ...
AbstractCompact numerical schemes provide high-order solution of PDEs with low dissipation and dispe...
Several numerical computation algorithms exhibit dependences that lead to a wavefront of the computa...
Abstract. Competitive numerical algorithms for solving partial differential equations have to work w...
(eng) Several numerical computation algorithms exhibit dependences that lead to a wavefront in the c...
We consider the implementation of a frontal code for the solution of large sparse unsymmetric linear...
Many state of the art CFD codes that exhibit low computational intensity (flops per RAM access) "sat...
The use of time-domain boundary integral equations has proved very effective and efficient for three...
Abstract. Finite difference approximation, in addition to Taylor truncation errors, introduces nu-me...
In this paper we develop a general efficient sparse storage technique suitable to coding front evolu...
Abstract. Competitive numerical simulation codes solving partial dif-ferential equations have to tap...
AbstractIn this paper, an implementation of some Runge-Kutta schemes that requires 2N-storage, where...
This paper studies the effects of hardware thread scheduling on cache management in GPUs. We propose...
AbstractIn this work, we present a new low memory requirement and low computational time method for ...
Wavelet expansions have drawn a lot of attention in recent decades. Wavelets originate from signal a...
Direct numerical simulation (DNS) of complex flows require solving the problem on parallel machines ...
AbstractCompact numerical schemes provide high-order solution of PDEs with low dissipation and dispe...
Several numerical computation algorithms exhibit dependences that lead to a wavefront of the computa...
Abstract. Competitive numerical algorithms for solving partial differential equations have to work w...
(eng) Several numerical computation algorithms exhibit dependences that lead to a wavefront in the c...
We consider the implementation of a frontal code for the solution of large sparse unsymmetric linear...
Many state of the art CFD codes that exhibit low computational intensity (flops per RAM access) "sat...
The use of time-domain boundary integral equations has proved very effective and efficient for three...
Abstract. Finite difference approximation, in addition to Taylor truncation errors, introduces nu-me...
In this paper we develop a general efficient sparse storage technique suitable to coding front evolu...
Abstract. Competitive numerical simulation codes solving partial dif-ferential equations have to tap...
AbstractIn this paper, an implementation of some Runge-Kutta schemes that requires 2N-storage, where...
This paper studies the effects of hardware thread scheduling on cache management in GPUs. We propose...
AbstractIn this work, we present a new low memory requirement and low computational time method for ...
Wavelet expansions have drawn a lot of attention in recent decades. Wavelets originate from signal a...
Direct numerical simulation (DNS) of complex flows require solving the problem on parallel machines ...
DOI
Add to ORKG