A class of asynchronous nested matrix multisplitting methods for solving large-scale systems of linear equations are proposed, and their convergence characterizations are studied in detail when the coefficient matrice...A class of asynchronous nested matrix multisplitting methods for solving large-scale systems of linear equations are proposed, and their convergence characterizations are studied in detail when the coefficient matrices of the linear systems are monotone matrices and H-matrices, respectively.展开更多
In this paper, we establish the semi-local convergence theorem of the rent method with regional estimation. By an in-depth investigation in to the algorithm structure of the method, we convert the Brent method into an...In this paper, we establish the semi-local convergence theorem of the rent method with regional estimation. By an in-depth investigation in to the algorithm structure of the method, we convert the Brent method into an approximate Newton method with a special error term. Bsaed on such equivalent variation, under a similar condition of the Newton-Kantorovich theorem of the Newton method, we establish a semi-local convergence theorem of the Brent method. This theorem provides a sufficient theoretical basis for initial choices of the Brent method.展开更多
A class of asynchronous matrix multi-splitting multi-parameter relaxation methods, including the asynchronous matrix multisplitting SAOR, SSOR and SGS methods as well. as the known asynchronous matrix multisplitting A...A class of asynchronous matrix multi-splitting multi-parameter relaxation methods, including the asynchronous matrix multisplitting SAOR, SSOR and SGS methods as well. as the known asynchronous matrix multisplitting AOR, SOR and GS methods, etc., is proposed for solving the large sparse systems of linear equations by making use of the principle of sufficiently using the delayed information. These new methods can greatly execute the parallel computational efficiency of the MIMD-systems, and are shown to be convergent when the coefficient matrices are H-matrices. Moreover, necessary and sufficient conditions ensuring the convergence of these methods are concluded for the case that the coefficient matrices are L-matrices.展开更多
文摘A class of asynchronous nested matrix multisplitting methods for solving large-scale systems of linear equations are proposed, and their convergence characterizations are studied in detail when the coefficient matrices of the linear systems are monotone matrices and H-matrices, respectively.
文摘In this paper, we establish the semi-local convergence theorem of the rent method with regional estimation. By an in-depth investigation in to the algorithm structure of the method, we convert the Brent method into an approximate Newton method with a special error term. Bsaed on such equivalent variation, under a similar condition of the Newton-Kantorovich theorem of the Newton method, we establish a semi-local convergence theorem of the Brent method. This theorem provides a sufficient theoretical basis for initial choices of the Brent method.
基金Project 19601036 supported by the National Natural Science Foundation of China.
文摘A class of asynchronous matrix multi-splitting multi-parameter relaxation methods, including the asynchronous matrix multisplitting SAOR, SSOR and SGS methods as well. as the known asynchronous matrix multisplitting AOR, SOR and GS methods, etc., is proposed for solving the large sparse systems of linear equations by making use of the principle of sufficiently using the delayed information. These new methods can greatly execute the parallel computational efficiency of the MIMD-systems, and are shown to be convergent when the coefficient matrices are H-matrices. Moreover, necessary and sufficient conditions ensuring the convergence of these methods are concluded for the case that the coefficient matrices are L-matrices.
