2) Iterative (Turbo) processing
迭代(Turbo)处理
3) preconditioned iteration
预处理迭代
1.
By use of multigrid method, this paper proposes a preconditioned iteration method solving the boundary value problem of elliptic equations, the proof of convergence is given.
利用多重网格法的思想,构造出一种求解椭圆型方程边值问题的预处理迭代格式,并给出了收敛性证明。
4) Turbo iterative processing
Turbo迭代处理
5) preconditioned iterative methods
预处理迭代法
1.
Efficient multistep procedure for time-stepping Galerkin methods is derived and analyzed, in which used an alternating direction preconditioned iterative methods for approximately solving the linear equations arising at each timestep in a discrete Galerkin method for a class of linear parabolic systems.
针对一类完全非线性抛物型方程组提出并分析了一类向后差分多步全离散Galerkin格式,并且用交替方向预处理迭代法求解多步全离散Galerkin法在每一时刻所产生的代数方程组,得到了最优阶的L2模误差估计。
6) iterative processing unit
迭代处理单元
1.
Focusing on the problem that the extrinsic information transfer(EXIT) functions of the iterative processing unit in existing methods are of low accuracy,an accurate method named optimal histogram(OptHIST) is proposed.
针对现有计算方法得到的迭代处理单元的外部信息转移(EXIT)函数精确度较差的问题,提出了一种EXIT函数的精确计算方法——最优直方图法(OptHIST)。
补充资料:层层迭迭
1.见"层层迭迭"。
说明:补充资料仅用于学习参考,请勿用于其它任何用途。
参考词条