We construct a modified Bernoulli iteration method for solving the quadratic matrix equation AX^2 + BX + C = 0, where A, B and C are square matrices. This method is motivated from the Gauss-Seidel iteration for solv...We construct a modified Bernoulli iteration method for solving the quadratic matrix equation AX^2 + BX + C = 0, where A, B and C are square matrices. This method is motivated from the Gauss-Seidel iteration for solving linear systems and the ShermanMorrison-Woodbury formula for updating matrices. Under suitable conditions, we prove the local linear convergence of the new method. An algorithm is presented to find the solution of the quadratic matrix equation and some numerical results are given to show the feasibility and the effectiveness of the algorithm. In addition, we also describe and analyze the block version of the modified Bernoulli iteration method.展开更多
A numerical solution of the quadratic matrix equations associated with a nonsingular M-matrix by using the alternately linearized implicit iteration method is considered. An iteration method for computing a nonsingula...A numerical solution of the quadratic matrix equations associated with a nonsingular M-matrix by using the alternately linearized implicit iteration method is considered. An iteration method for computing a nonsingular M-matrix solution of the quadratic matrix equations is developed, and its corresponding theory is given. Some numerical examples are provided to show the efficiency of the new method.展开更多
基金Supported by The Special Funds For Major State Basic Research Projects (No. G1999032803) The China NNSF 0utstanding Young Scientist Foundation (No. 10525102)+1 种基金 The National Natural Science Foundation (No. 10471146) The National Basic Research Program (No. 2005CB321702), P.R. China.
文摘We construct a modified Bernoulli iteration method for solving the quadratic matrix equation AX^2 + BX + C = 0, where A, B and C are square matrices. This method is motivated from the Gauss-Seidel iteration for solving linear systems and the ShermanMorrison-Woodbury formula for updating matrices. Under suitable conditions, we prove the local linear convergence of the new method. An algorithm is presented to find the solution of the quadratic matrix equation and some numerical results are given to show the feasibility and the effectiveness of the algorithm. In addition, we also describe and analyze the block version of the modified Bernoulli iteration method.
基金This work was supported by the National Natural Science Foundation (No.11171337), P. R. China.
文摘A numerical solution of the quadratic matrix equations associated with a nonsingular M-matrix by using the alternately linearized implicit iteration method is considered. An iteration method for computing a nonsingular M-matrix solution of the quadratic matrix equations is developed, and its corresponding theory is given. Some numerical examples are provided to show the efficiency of the new method.