AbstractA low communication parallel algorithm is developed for the solution of time-dependent nonlinear PDEs. The parallelization is achieved by domain decomposition. The discretization in time is performed via a third-order semi-implicit stiffly stable scheme. The elemental solutions in the subdomains are constructed using a high-order method with the local Fourier basis (LFB).The continuity of the global solution is accomplished by a point-wise matching of the local subsolutions on the interfaces. The matching relations are derived in terms of the jumps on the interfaces. The LFB method enables splitting a two-dimensional problem with global coupling of the interface unknowns into a set of uncoupled one-dimensional differential equations...
Discontinuous Galerkin (DG) methods are a class of finite element methods using discontinuous basis ...
In this thesis we propose a new algorithm for solving PDEs on massively parallel computers. The Nest...
This research focuses on parallel algorithms, which help to solve limited memory and computational t...
AbstractA low communication parallel algorithm is developed for the solution of time-dependent nonli...
A novel domain decomposition method for spectrally accurate solutions of PDEs is presented. A Local ...
In this paper we summarize recent progresses on the parallel method for solving time-dependent probl...
Abstract. A local relaxation method for solving linear elliptic PDEs with O(N) processors and O(x/) ...
We consider a sequence of elliptic partial differential equations (PDEs) with different but similar ...
Many applications require the numerical solution of a partial differential equation (PDE), leading t...
none5siIn this paper we consider a multigrid approach for solving elliptic equations over non-matchi...
In the paper, the parallelization of multi-grid methods for solving second-order elliptic boundary v...
Abstract. We focus on the study of multigrid methods with aggressive coarsening and polynomial smoot...
Abstract. With the continued evolution of computing architectures towards many-core com-puting, algo...
This paper presents a numerical method for variable coefficient elliptic PDEs with mostly smooth sol...
AbstractTime dependent problems in Partial Differential Equations (PDEs) are often solved by the Met...
Discontinuous Galerkin (DG) methods are a class of finite element methods using discontinuous basis ...
In this thesis we propose a new algorithm for solving PDEs on massively parallel computers. The Nest...
This research focuses on parallel algorithms, which help to solve limited memory and computational t...
AbstractA low communication parallel algorithm is developed for the solution of time-dependent nonli...
A novel domain decomposition method for spectrally accurate solutions of PDEs is presented. A Local ...
In this paper we summarize recent progresses on the parallel method for solving time-dependent probl...
Abstract. A local relaxation method for solving linear elliptic PDEs with O(N) processors and O(x/) ...
We consider a sequence of elliptic partial differential equations (PDEs) with different but similar ...
Many applications require the numerical solution of a partial differential equation (PDE), leading t...
none5siIn this paper we consider a multigrid approach for solving elliptic equations over non-matchi...
In the paper, the parallelization of multi-grid methods for solving second-order elliptic boundary v...
Abstract. We focus on the study of multigrid methods with aggressive coarsening and polynomial smoot...
Abstract. With the continued evolution of computing architectures towards many-core com-puting, algo...
This paper presents a numerical method for variable coefficient elliptic PDEs with mostly smooth sol...
AbstractTime dependent problems in Partial Differential Equations (PDEs) are often solved by the Met...
Discontinuous Galerkin (DG) methods are a class of finite element methods using discontinuous basis ...
In this thesis we propose a new algorithm for solving PDEs on massively parallel computers. The Nest...
This research focuses on parallel algorithms, which help to solve limited memory and computational t...