s步正交法和GMRES在并行机上的实现
s-Step Orthomin and GMRES implemented on parallel computers
摘要：
正交法和广义最小残量法是求解非对称线性系解的常用迭代法。这些方法的s步推广通过形成s个同时搜索方向向量来增强其数据局部性、并行性和性能。良好的数据局部性是在分级存储超级计算机上实现接近峰值速率的关键。Arnoldi和Omin的s步的理论推导在过去已经发表。在这里，我们推导出s-步GMRES方法。然后，我们实现了s-步骤Omin和GMRES上的Cray-2分级存储超级计算机。
英文摘要：
The Orthomin ( Omin ) and the Generalized Minimal Residual method ( GMRES ) are commonly used iterative methods for approximating the solution of non-symmetric linear systems. The s-step generalizations of these methods enhance their data locality parallel and properties by forming s simultaneous search direction vectors. Good data locality is the key in achieving near peak rates on memory hierarchical supercomputers. The theoretical derivation of the s-step Arnoldi and Omin has been published in the past. Here we derive the s-step GMRES method. We then implement s-step Omin and GMRES on a Cray-2 hierarchical memory supercomputer.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
