In this paper,according to the Shamanskii technology,an alternately linearized implicit(ALI)iteration method is proposed to compute the minimal nonnegative solution to the nonsymmetric coupled algebraic Riccati equati...In this paper,according to the Shamanskii technology,an alternately linearized implicit(ALI)iteration method is proposed to compute the minimal nonnegative solution to the nonsymmetric coupled algebraic Riccati equation.Based on the ALI iteration method,we propose two modified alternately linearized implicit(MALI)iteration methods with double parameters.Further,we prove the monotone convergence of these iteration methods.Numerical examples demonstrate the effectiveness of the presented iteration methods.展开更多
We discuss estimates for the rate of convergence of the method of successive subspace corrections in terms of condition number estimate for the method of parallel subspace corrections.We provide upper bounds and in a ...We discuss estimates for the rate of convergence of the method of successive subspace corrections in terms of condition number estimate for the method of parallel subspace corrections.We provide upper bounds and in a special case,a lower bound for preconditioners defined via the method of successive subspace corrections.展开更多
基金National Natural Science Foundation for Youths of China(11801164)Youth Project of Hunan Provincial Education Department of China(22B0498).
文摘In this paper,according to the Shamanskii technology,an alternately linearized implicit(ALI)iteration method is proposed to compute the minimal nonnegative solution to the nonsymmetric coupled algebraic Riccati equation.Based on the ALI iteration method,we propose two modified alternately linearized implicit(MALI)iteration methods with double parameters.Further,we prove the monotone convergence of these iteration methods.Numerical examples demonstrate the effectiveness of the presented iteration methods.
文摘We discuss estimates for the rate of convergence of the method of successive subspace corrections in terms of condition number estimate for the method of parallel subspace corrections.We provide upper bounds and in a special case,a lower bound for preconditioners defined via the method of successive subspace corrections.
