摘要
Scientific research and engineering computations are becoming dependent the modern high performance parallel computers increasingly. The algorithms for solving matrir eigen-problems is an important part in more computing projects. A brief review of the parallel algorithms for solving symmetric matrix eigenproblems is given here. A major emphasis is to collect bisection / multisection algorithm, divide and conquer algorithm,homotopy continuation method, Jacobi-like algorithm and iterative method.
Scientific research and engineering computations are becoming dependent the modern high performance parallel computers increasingly. The algorithms for solving matrir eigen-problems is an important part in more computing projects. A brief review of the parallel algorithms for solving symmetric matrix eigenproblems is given here. A major emphasis is to collect bisection / multisection algorithm, divide and conquer algorithm,homotopy continuation method, Jacobi-like algorithm and iterative method.
出处
《数值计算与计算机应用》
CSCD
北大核心
1997年第4期246-258,共13页
Journal on Numerical Methods and Computer Applications
