期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
INCOMPLETE SEMI-ITERATIVE METHODS FOR SOLVING SINGULAR LINEAR OPERATOR EQUATIONS IN BANACH SPACE WITH APPLICATIONS IN MARKOV CHAIN MODELING
1
作者 Wei Yimin(魏益民) +1 位作者 Wu Hebing(吴和兵) 《Numerical Mathematics A Journal of Chinese Universities(English Series)》 SCIE 2001年第2期129-144,共16页
We discuss the incomplete semi-iterative method (ISIM) for an approximate solution of a linear fixed point equations x=Tx+c with a bounded linear operator T acting on a complex Banach space X such that its resolvent h... We discuss the incomplete semi-iterative method (ISIM) for an approximate solution of a linear fixed point equations x=Tx+c with a bounded linear operator T acting on a complex Banach space X such that its resolvent has a pole of order k at the point 1. Sufficient conditions for the convergence of ISIM to a solution of x=Tx+c, where c belongs to the range space of R(I-T) k, are established. We show that the ISIM has an attractive feature that it is usually convergent even when the spectral radius of the operator T is greater than 1 and Ind 1T≥1. Applications in finite Markov chain is considered and illustrative examples are reported, showing the convergence rate of the ISIM is very high. 展开更多
关键词 SINGULAR linear operator equation index DRAZIN inverse semi-iterative method incomplete semi-iterative method Markov chain.
下载PDF
A Multi-pipe Path Planning by Modified Ant Colony Optimization 被引量:2
2
作者 QU Yan-feng JIANG Dan LIU Bin 《Computer Aided Drafting,Design and Manufacturing》 2011年第1期1-7,共7页
Path planning in 3D geometry space is used to find an optimal path in the restricted environment, according to a certain evaluation criteria. To solve the problem of long searching time and slow solving speed in 3D pa... Path planning in 3D geometry space is used to find an optimal path in the restricted environment, according to a certain evaluation criteria. To solve the problem of long searching time and slow solving speed in 3D path planning, a modified ant colony optimization is proposed in this paper. Firstly, the grid method for environment modeling is adopted. Heuristic information is connected with the planning space. A semi-iterative global pheromone update mechanism is proposed. Secondly, the optimal ants mutate the paths to improve the diversity of the algorithm after a defined iterative number. Thirdly, co-evolutionary algorithm is used. Finally, the simulation result shows the effectiveness of the proposed algorithm in solving the problem of 3D pipe path planning. 展开更多
关键词 3D multi-pipe path planning ant colony optimization semi-iterative co-evolutionary algorithm
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部