Numerical solutions of a master equation for protein folding kinetics.
The numerical solution of a master equation involves the calculation of eigenpairs for the corresponding transition matrix. In this paper, we computationally study the folding rate for a kinetics problem of protein folding by solving a large-scale eigenvalue problem. Three numerical methods, the implicitly restarted Arnoldi, the Jacobi-Davidson, and the QR methods are applied to solve the corresponding large-scale eigenvalue problem of the transition matrix of the master equation. Comparison among three methods is performed in terms of the computational efficiency. It is found that the QR method demands tremendous computing resource when the length of sequence L > 10 due to the extremely large size of matrix and CPU time limitation. The Jacobi-Davidson method may encounter convergence issues, for some testing cases with L > 9. Among the three solution methods the implicitly restarted Arnoldi method is suitable for solving the problem. Numerical examples with various residues are investigated.
Department of Communication Engineering, National Chiao Tung University, Hsinchu 300, Taiwan. ymli@faculty.nctu.edu.tw
Yiming
Y
Li
D000465:Algorithms; D019295:Computational Biology / Q000379:methods*; D003198:Computer Simulation; D003201:Computers; D007700:Kinetics; D008956:Models, Chemical; D015233:Models, Statistical; D008962:Models, Theoretical; D017510:Protein Folding; D015203:Reproducibility of Results; D012984:Software; D013269:Stochastic Processes