搜索结果: 1-2 共查到“数学 non-recursive”相关记录2条 . 查询时间(0.062 秒)
Factorizations and Reductions of Order in Quadratic and other Non-recursive Higher Order Difference Equations
non-recursive form symmetry factorization semi-invertible map criterion
2010/12/28
A higher order difference equation may be generally defined in an arbitrary nonempty set S as:
fn(xn, xn−1, . . . , xn−k) = gn(xn, xn−1, . . . , xn−k)where fn, gn: Sk+1→ S are...
Factorizations and Reductions of Order in Quadratic and other Non-recursive Higher Order Difference Equations
non-recursive form symmetry factorization semi-invertible map criterion
2011/3/4
A higher order difference equation may be generally defined in an arbitrary nonempty set S as:
fn(xn, xn−1, . . . , xn−k) = gn(xn, xn−1, . . . , xn−k)where fn, gn: Sk+1→ S are...