基于双共轭A-正交化过程的一类求解非对称线性系统的线性求解器
A class of linear solvers built on the Biconjugate A-Orthonormalization Procedure for solving unsymmetric linear systems
AI总结：
本文提出基于双共轭A-正交化过程的快速收敛且内存经济的迭代算法，用于实非对称和复非Hermitian系统，实验表明该方法优于Arnoldi和双共轭Lanczos方法。
摘要：
我们提出了基于双共轭$A$-正交化过程的实用迭代算法，用于实非对称和复非Hermitian系统。所开发的求解器的主要特点是快速收敛且内存经济。我们报告了大量数值实验组合，以证明所提出的方法族具有很强的竞争力，并且通常优于基于Arnoldi方法和双共轭Lanczos过程的其他流行算法用于非对称线性系统。
英文摘要：
We present economical iterative algorithms built on the Biconjugate $A$-Orthonormalization Procedure for real unsymmetric and complex non-Hermitian systems. The principal characteristics of the developed solvers is that they are fast convergent and cheap in memory. We report on a large combination of numerical experiments to demonstrate that the proposed family of methods is highly competitive and often superior to other popular algorithms built upon the Arnoldi method and the biconjugate Lanczos procedures for unsymmetric linear sytems.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
