ON SOLVING ENERGY-DEPENDENT PARTITIONED REAL SYMMETRIC MATRIX EIGENVALUE PROBLEM BY A PARALLEL GENETIC ALGORITHM

被引：1
|
作者：
Sharma, Rahul [1 ]
Nandy, Subhajit [1 ,2 ]
Bhattacharyya, S. P. [1 ]
机构：
[1] Indian Assoc Cultivat Sci, Dept Phys Chem, Kolkata 700032, India
[2] Andrews High HS Sch, Kolkata 700031, India
来源：
JOURNAL OF THEORETICAL & COMPUTATIONAL CHEMISTRY | 2008年 / 7卷 / 06期
关键词：
Symmetric matrix eigenvalue problem; parallel genetic algorithm; partitioning techniques; energy-dependent partitioning; Lowdin's method;
D O I：
10.1142/S0219633608004428
中图分类号：
O6 [化学];
学科分类号：
0703 ;
摘要：
An energy-dependent partitioning scheme is explored for extracting a small number of eigenvalues of a real symmetric matrix with the help of a serial as well as parallel genetic algorithm (GA). The proposed method is tested on two matrices (up to 2000 x 2000) with an increasing number of processors in a master- slave architecture. A comparison is made with the Jacobi-Davidson method in serial mode as implemented in the JDQZ-package. Different partition sizes are used. Traditionally used Lowdin's method is also tested in both serial and parallel modes. The advantages and disadvantages of the parallel GA-based method in solving the partitioned eigenvalue problem are analyzed.
引用
收藏
页码：1103 / 1120
页数：18
相关论文
共 10 条
  • [1] On solving energy-dependent partitioned eigenvalue problem by genetic algorithm: The case of real symmetric Hamiltonian matrices
    Rahul Sharma
    Subbajit Nandy
    S. P. Bhattacharyya
    Pramana, 2006, 66 : 1125 - 1130
  • [2] On solving energy-dependent partitioned eigenvalue problem by-genetic algorithm: The case of real symmetric Hamiltonian matrices
    Sharma, Rahul
    Nandy, Subbajit
    Bhattacharyya, S. P.
    PRAMANA-JOURNAL OF PHYSICS, 2006, 66 (06): : 1125 - 1130
  • [3] Solving the dynamic energy aware job shop scheduling problem with the heterogeneous parallel genetic algorithm
    Luo, Jia
    El Baz, Didier
    Xue, Rui
    Hu, Jinglu
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2020, 108 : 119 - 134
  • [4] A Parallel Genetic Algorithm for Solving the Probabilistic Minimum Spanning Tree Problem
    Wang, Zhurong
    Yu, Changqing
    Hei, Xinhong
    Zhang, Bin
    2013 9TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY (CIS), 2013, : 61 - 65
  • [5] PARALLEL GENETIC ALGORITHM SOLVING 0/1 KNAPSACK PROBLEM RUNNING ON THE GPU
    Pospichal, Petr
    Schwarz, Josef
    Jaros, Jiri
    16TH INTERNATIONAL CONFERENCE ON SOFT COMPUTING MENDEL 2010, 2010, : 64 - 70
  • [6] Solving job shop scheduling problem using a hybrid parallel micro genetic algorithm
    Yusof, Rubiyah
    Khalid, Marzuki
    Hui, Gan Teck
    Yusof, Syafawati Md
    Othman, Mohd Fauzi
    APPLIED SOFT COMPUTING, 2011, 11 (08) : 5782 - 5792
  • [7] Efficiency of parallel genetic algorithm for solving N-queens problem on multicomputer platform
    Lazarova, Milena
    ADVANCED TOPICS ON EVOLUTIONARY COMPUTING, 2008, : 51 - 56
  • [8] A parallel genetic algorithm approach to solving the unit commitment problem: Implementation on the transputer networks
    Yang, HT
    Yang, PC
    Huang, CL
    IEEE TRANSACTIONS ON POWER SYSTEMS, 1997, 12 (02) : 661 - 668
  • [9] An Enhanced MapReduce Framework for Solving Protein Folding Problem Using a Parallel Genetic Algorithm
    Narayanan, A. G. Hari
    Krishnakumar, U.
    Judy, M. V.
    ICT AND CRITICAL INFRASTRUCTURE: PROCEEDINGS OF THE 48TH ANNUAL CONVENTION OF COMPUTER SOCIETY OF INDIA - VOL I, 2014, 248 : 241 - 250
  • [10] Parallel Genetic Algorithm with Elite and Diverse Cores for Solving the Minimum Connected Dominating Set Problem in Wireless Networks Topology Control
    Hedar, Abdel-Rahman
    El-Sayed, Gamal A.
    ICFNDS'18: PROCEEDINGS OF THE 2ND INTERNATIONAL CONFERENCE ON FUTURE NETWORKS AND DISTRIBUTED SYSTEMS, 2018,
1