Recursive and explicit rules: How can we build student algebraic understanding?

Differing perspectives have been offered about student use of recursive and explicit rules. These include: (a) promoting the use of explicit rules over the use of recursive rules, and (b) encouraging student use of both recursive and explicit rules. This study sought to explore students’ use of recursive and explicit rules by examining the reasoning of 25 sixth-grade students, including a focus on four target students, as they approached tasks in which they were required to develop generalizations while using computer spreadsheets as an instructional tool. The results demonstrate the difficulty that students had moving from the successful use of recursive rules toward explicit rules. In particular, two students abandoned general reasoning, instead focusing on particular values in an attempt to construct explicit rules. It is recommended that students be encouraged to connect recursive and explicit rules as a potential means for constructing successful generalizations.     

带时滞观测线性离散系统的递推滤波

本文讨论带时滞观测线性离散系统的滤波问题,提出利用联合分布函数,得到滤波递推格式.这种方法还适用于一般的带有状态时滞的线性离散系统.     

Structure of Pareto optima in an infinite-horizon economy where agents have recursive preferences

This article generalizes the one-agent growth theory with discounting to the case of several agents with recursive preferences. In a multi-consumption goods world, we show that, under some regularity conditions, any Pareto optimum can be viewed as a function of a trajectory of a dynamical system. The state space can be chosen to be the product of the space of capitals and the unit simplex. We define and study the properties of generalized value functions.     

Recursive quadratic programming algorithm that uses an exact augmented Lagrangian function

An algorithm for nonlinear programming problems with equality constraints is presented which is globally and superlinearly convergent. The algorithm employs a recursive quadratic programming scheme to obtain a search direction and uses a differentiable exact augmented Lagrangian as line search function to determine the steplength along this direction. It incorporates an automatic adjustment rule for the selection of the penalty parameter and avoids the need to evaluate second-order derivatives of the problem functions. Some numerical results are reported.     

On some compound distributions with Borel summands

The generalized Poisson distribution is well known to be a compound Poisson distribution with Borel summands. As a generalization we present closed formulas for compound Bartlett and Delaporte distributions with Borel summands and a recursive structure for certain compound shifted Delaporte mixtures with Borel summands. Our models are introduced in an actuarial context as claim number distributions and are derived only with probabilistic arguments and elementary combinatorial identities. In the actuarial context related compound distributions are of importance as models for the total size of insurance claims for which we present simple recursion formulas of Panjer type.     

Function-valued Padé-type approximant via E-algorithm and its applications in solving integral equations

The function-valued Padé-type approximant (FPTA) was defined in the inner product space [8]. In this work, we choose the coefficients in the Neumann power series to make the inner product with both sides a function-valued system of equations to yield a scalar system. Then we express an FPTA in the determinant form. To avoid the direct computation of the determinants, we present the E-algorithm for FPTA based on the vector-valued E-algorithm given by Brezinski [4]. The method of FPTA via E-algorithm (FPTAVEA) not only includes all previous methods but overcomes their essential difficulties. The numerical experiment for a typical integral equation [1] illustrates that the method of FPTAVEA is simpler and more effective for obtaining the characteristic values and the characteristic functions than all previous methods. In addition, this method is also applicable to other Fredholm integral equations of the second kind without explicit characteristic values and characteristic functions. A corresponding example [12] is given and the numerical result is the same as that in [12].     

Modeling of a magnetorheological damper by recursive lazy learning

Nowadays dampers based on magnetorheological (MR) fluids are receiving significant attention specially for control of structural vibration and automotive suspensions systems. In most cases, it is necessary to develop an appropriate control strategy which is practically implementable when a suitable model for MR dampers is available. It is not a trivial task to model the dynamic of MR dampers because of their inherent non-linear and hysteretic dynamics. In this paper, a recursive lazy learning method based on neural networks is considered to model the MR damper behavior. The proposed method is validated by comparison with experimental obtained responses. Results show the estimated model correlates very well with the data obtained experimentally. The method proposed learns quickly that it is only necessarily a learning cycle, it can learn on-line and it is easy to select the network structure and calculate the model parameters.     

On the Applications of the Linear Recurrence Relationships to Pseudoprimes

We present here some results on the applications of linear recursive sequences of order $2$ to the Fermat pseudoprimes, Fibonacci pseudoprimes, and Dickson pseudoprimes.     

Order-free Recursion on the Real Numbers

We investigate operations, computable in the sense of Recursive Analysis, which can be generated recursively from the arithmetic operations and the limit operation without using any tests on the real numbers. These functions, called order-free recursive, can be shown to include a large class of computable functions. As main tools we provide an effective version of the Stone-Weierstraß Approximation Theorem, as well as recursive partitions of unity.     

Analyse de complexité pour un théorème de Hall sur les fractions continues

We give a polynomial time controlled version of a theorem of M. Hall: every real number can be written as the sum of two irrational numbers whose developments into a continued fraction contain only 1, 2, 3 or 4. Mathematics Subject Classification: 03D15, 03F60, 11A55, 68Q25.