Decomposition Method

14,000,000 Leading Edge Experts on the ideXlab platform

Scan Science and Technology

Contact Leading Edge Experts & Companies

Scan Science and Technology

Contact Leading Edge Experts & Companies

The Experts below are selected from a list of 360 Experts worldwide ranked by ideXlab platform

Abdulmajid Wazwaz - One of the best experts on this subject based on the ideXlab platform.

Taisuke Ozaki - One of the best experts on this subject based on the ideXlab platform.

  • a three dimensional domain Decomposition Method for large scale dft electronic structure calculations
    Computer Physics Communications, 2014
    Co-Authors: Taisuke Ozaki
    Abstract:

    Abstract With tens of petaflops supercomputers already in operation and exaflops machines expected to appear within the next 10 years, efficient parallel computational Methods are required to take advantage of such extreme-scale machines. In this paper, we present a three-dimensional domain Decomposition scheme for enabling large-scale electronic structure calculations based on density functional theory (DFT) on massively parallel computers. It is composed of two Methods: (i) the atom Decomposition Method and (ii) the grid Decomposition Method. In the former Method, we develop a modified recursive bisection Method based on the moment of inertia tensor to reorder the atoms along a principal axis so that atoms that are close in real space are also close on the axis to ensure data locality. The atoms are then divided into sub-domains depending on their projections onto the principal axis in a balanced way among the processes. In the latter Method, we define four data structures for the partitioning of grid points that are carefully constructed to make data locality consistent with that of the clustered atoms for minimizing data communications between the processes. We also propose a Decomposition Method for solving the Poisson equation using the three-dimensional FFT in Hartree potential calculation, which is shown to be better in terms of communication efficiency than a previously proposed parallelization Method based on a two-dimensional Decomposition. For evaluation, we perform benchmark calculations with our open-source DFT code, OpenMX, paying particular attention to the O ( N ) Krylov subspace Method. The results show that our scheme exhibits good strong and weak scaling properties, with the parallel efficiency at 131,072 cores being 67.7% compared to the baseline of 16,384 cores with 131,072 atoms of the diamond structure on the K computer.

  • A three-dimensional domain Decomposition Method for large-scale DFT electronic structure calculations
    arXiv: Materials Science, 2012
    Co-Authors: Taisuke Ozaki
    Abstract:

    With tens of petaflops supercomputers already in operation and exaflops machines expected to appear within the next 10 years, efficient parallel computational Methods are required to take advantage of such extreme-scale machines. In this paper, we present a three-dimensional domain Decomposition scheme for enabling large-scale electronic calculations based on density functional theory (DFT) on massively parallel computers. It is composed of two Methods: (i) atom Decomposition Method and (ii) grid Decomposition Method. In the former, we develop a modified recursive bisection Method based on inertia tensor moment to reorder the atoms along a principal axis so that atoms that are close in real space are also close on the axis to ensure data locality. The atoms are then divided into sub-domains depending on their projections onto the principal axis in a balanced way among the processes. In the latter, we define four data structures for the partitioning of grids that are carefully constructed to make data locality consistent with that of the clustered atoms for minimizing data communications between the processes. We also propose a Decomposition Method for solving the Poisson equation using three-dimensional FFT in Hartree potential calculation, which is shown to be better than a previously proposed parallelization Method based on a two-dimensional Decomposition in terms of communication efficiency. For evaluation, we perform benchmark calculations with our open-source DFT code, OpenMX, paying particular attention to the O(N) Krylov subspace Method. The results show that our scheme exhibits good strong and weak scaling properties, with the parallel efficiency at 131,072 cores being 67.7% compared to the baseline of 16,384 cores with 131,072 diamond atoms on the K computer.

Chen Gaojie - One of the best experts on this subject based on the ideXlab platform.

  • domain Decomposition Method for variational inequalities with robin boundary condition
    Computer Simulation, 2007
    Co-Authors: Chen Gaojie
    Abstract:

    Nonoverlapping additive domain Decomposition Method for a kind of elliptic variational inequalities with Robin boundary condition was developed and analyzed. In the Method, the unknown values at the common interface between adjacent subdomains were updated by Robin transmission conditions. Convergence was established for the proposed Methods. This kind of domain Decomposition Methods have been widely used to solve the boundary value problems of partial differential equation and many convergence theorems have been obtianed. Numerical experiments appeared that a greater acceleration of the Method could be obtained by choosing the Robin parameter suitably.

Dejie Yu - One of the best experts on this subject based on the ideXlab platform.

  • sparse signal Decomposition Method based on multi scale chirplet and its application to the fault diagnosis of gearboxes
    Mechanical Systems and Signal Processing, 2011
    Co-Authors: Fuqiang Peng, Dejie Yu
    Abstract:

    Abstract Based on the chirplet path pursuit and the sparse signal Decomposition Method, a new sparse signal Decomposition Method based on multi-scale chirplet is proposed and applied to the Decomposition of vibration signals from gearboxes in fault diagnosis. An over-complete dictionary with multi-scale chirplets as its atoms is constructed using the Method. Because of the multi-scale character, this Method is superior to the traditional sparse signal Decomposition Method wherein only a single scale is adopted, and is more applicable to the Decomposition of non-stationary signals with multi-components whose frequencies are time-varying. When there are faults in a gearbox, the vibration signals collected are usually AM–FM signals with multiple components whose frequencies vary with the rotational speed of the shaft. The meshing frequency and modulating frequency, which vary with time, can be derived by the proposed Method and can be used in gearbox fault diagnosis under time-varying shaft-rotation speed conditions, where the traditional signal processing Methods are always blocked. Both simulations and experiments validate the effectiveness of the proposed Method.

Saha S Ray - One of the best experts on this subject based on the ideXlab platform.

  • analytical solution for the space fractional diffusion equation by two step adomian Decomposition Method
    Communications in Nonlinear Science and Numerical Simulation, 2009
    Co-Authors: Saha S Ray
    Abstract:

    Abstract Spatially fractional order diffusion equations are generalizations of classical diffusion equations which are increasingly used in modeling practical superdiffusive problems in fluid flow, finance and other areas of application. This paper presents the analytical solutions of the space fractional diffusion equations by two-step Adomian Decomposition Method (TSADM). By using initial conditions, the explicit solutions of the equations have been presented in the closed form and then their solutions have been represented graphically. Two examples, the first one is one-dimensional and the second one is two-dimensional fractional diffusion equation, are presented to show the application of the present technique. The solutions obtained by the standard Decomposition Method have been numerically evaluated and presented in the form of tables and then compared with those obtained by TSADM. The present TSADM performs extremely well in terms of efficiency and simplicity.

  • an approximate solution of a nonlinear fractional differential equation by adomian Decomposition Method
    Applied Mathematics and Computation, 2005
    Co-Authors: Saha S Ray, Rati Kanta Bera
    Abstract:

    The aim of the present analysis is to apply Adomian Decomposition Method for the solution of a nonlinear fractional differential equation. Finally, the solution obtained by the Decomposition Method has been numerically evaluated and presented in the form of tables and then compared with those obtained by truncated series Method. A good agreement of the results is observed.