Enriching Elementary School Mathematical Learning with the Steepest Descent Algorithm

نویسندگان

چکیده

The steepest descent (or ascent) algorithm is one of the most widely used algorithms in Science, Technology, Engineering, and Mathematics (STEM). However, this powerful mathematical tool neither taught nor even mentioned K12 education. We study whether it feasible for elementary school students to learn algorithm, while also aligning with standard curriculum. look at can be create enriching activities connected children’s real-life experiences, thus enhancing integration STEM fostering Computational Thinking. To address these questions, we conducted an empirical two phases. In first phase, tested feasibility teachers. a face-to-face professional development workshop 457 mathematics teachers actively participating using online platform, found that after 10-min introduction they could successfully apply use couple models. They were able complete complex novel tasks: selecting models adjusting parameters model uses algorithm. second 90 fourth graders from 3 low Socioeconomic Status (SES) schools. Using same posing understand tasks on platform. Additionally, close 75% completed modeling performed similarly

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

the effects of integrating cooperative learning into vocabulary learning of elementary school students

the purpose of the research is to examine if integrating cooperative learning into vocabulary learning helps to increase word recognition of students in an elementary school in iran. it tries to investigate whether cooperative learning approach enables students to improve their language learning. this research used stad (students team achievement division) as a cooperative model in this study. ...

15 صفحه اول

Efficient perceptron learning using constrained steepest descent

An algorithm is proposed for training the single-layered perceptron. The algorithm follows successive steepest descent directions with respect to the perceptron cost function, taking care not to increase the number of misclassified patterns. The problem of finding these directions is stated as a quadratic programming task, to which a fast and effective solution is proposed. The resulting algori...

متن کامل

Eecient Perceptron Learning Using Constrained Steepest Descent Running Title: Eecient Perceptron Learning 1 Eecient Perceptron Learning Using Constrained Steepest Descent

| An algorithm is proposed for training the single-layered per-ceptron. The algorithm follows successive steepest descent directions with respect to the perceptron cost function, taking care not to increase the number of misclassiied patterns. The problem of nding these directions is stated as a quadratic programming task, to which a fast and eeective solution is proposed. The resulting algorit...

متن کامل

Steepest Descent

The steepest descent method has a rich history and is one of the simplest and best known methods for minimizing a function. While the method is not commonly used in practice due to its slow convergence rate, understanding the convergence properties of this method can lead to a better understanding of many of the more sophisticated optimization methods. Here, we give a short introduction and dis...

متن کامل

On the steepest descent algorithm for quadratic functions

The steepest descent algorithm with exact line searches (Cauchy algorithm) is inefficient, generating oscillating step lengths and a sequence of points converging to the span of the eigenvectors associated with the extreme eigenvalues. The performance becomes very good if a short step is taken at every (say) 10 iterations. We show a new method for estimating short steps, and propose a method al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2021

ISSN: ['2227-7390']

DOI: https://doi.org/10.3390/math9111197