期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
非线性混合效应模型参数估计方法分析 被引量:17
1
作者 符利勇 张会儒 +1 位作者 李春明 唐守正 《林业科学》 EI CAS CSCD 北大核心 2013年第1期114-119,共6页
非线性混合效应模型是针对回归函数依赖于固定效应和随机效应的非线性关系而建立的。一阶线性化算法(FO)和条件一阶线性化算法(FOCE)为2种计算非线性混合效应模型参数的常用线性化算法。本文基于FOCE算法,提出一种改进的随机效应参数计... 非线性混合效应模型是针对回归函数依赖于固定效应和随机效应的非线性关系而建立的。一阶线性化算法(FO)和条件一阶线性化算法(FOCE)为2种计算非线性混合效应模型参数的常用线性化算法。本文基于FOCE算法,提出一种改进的随机效应参数计算方法,并利用树高生长数据和模拟数据对3种算法进行分析和比较。结果表明:改进的FOCE算法得到的随机效应参数更能反映个体间的随机差异,并且拟合效果更好。 展开更多
关键词 非线性混合效应模型 一阶线性化算法(fo) 条件一阶线性化算法(foCE) 改进的foCE算法
下载PDF
K-Dimensional Optimal Parallel Algorithm for the Solution of a General Class of Recurrence Equations 被引量:1
2
作者 高庆狮 刘志勇 《Journal of Computer Science & Technology》 SCIE EI CSCD 1995年第5期417-424,共8页
This paper proposes a parallel algorithm, called KDOP (K-DimensionalOptimal Parallel algorithm), to solve a general class of recurrence equations efficiently. The KDOP algorithm partitions the computation into a serie... This paper proposes a parallel algorithm, called KDOP (K-DimensionalOptimal Parallel algorithm), to solve a general class of recurrence equations efficiently. The KDOP algorithm partitions the computation into a series of sub-computations, each of which is executed in the fashion that all the processors work simultaneously with each one executing an optimal sequential algorithm to solve a subcomputation task. The algorithm solves the equations in O(N/p)steps in EREW PRAM model (Exclusive Read Exclusive Write Parallel Ran-dom Access Machine model) using p<N1-e processors, where N is the size of the problem, and e is a given constant. This is an optimal algorithm (itsspeedup is O(p)) in the case of p<N1-e. Such an optimal speedup for this problem was previously achieved only in the case of p<N0.5. The algorithm can be implemented on machines with multiple processing elements or pipelined vector machines with parallel memory systems. 展开更多
关键词 Parallel algorithm optimal algorithm first-order linear recurrence equations recursive doubling algorithm tridiagonal systems of linear equations
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部