期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
Intelligent Tutoring System of Linear Programming
1
作者 Amor Hasic Samed Jukic 《Advances in Linear Algebra & Matrix Theory》 2022年第2期39-66,共28页
There is a growing technological development in intelligent teaching systems. This field has become interesting to many researchers. In this paper, we present an intelligent tutoring system for teaching mathematics th... There is a growing technological development in intelligent teaching systems. This field has become interesting to many researchers. In this paper, we present an intelligent tutoring system for teaching mathematics that helps students understand the basics of linear programming using Linear Program Solver and Service for Solving Linear Programming Problems, through which students will be able to solve economic problems. It comes down to determining the minimum or maximum value of a linear function, which is called the objective function, according to pre-set limiting conditions expressed by linear equations and inequalities. The goal function and the limiting conditions represent a mathematical model of the observed problem. Working as a professor of mathematics in high school, I felt the need for one such work and dealing with the study of linear programming as an integral part of mathematics. There are a number of papers in this regard, but exclusively related to traditional ways of working, as stated in the introductory part of the paper. The center of work as well as the final part deals with the study of linear programming using programs that deal with this topic. 展开更多
关键词 Intelligent Tutoring System MATHEMATICS linear Program Solver Service for solving linear Programming Problems
下载PDF
A COLUMN RECURRENCE ALGORITHM FOR SOLVING LINEAR LEAST SQUARES PROBLEM 被引量:1
2
作者 J.X. Zhao(Department of Mathematics, Nanjing University, Nanjing China) 《Journal of Computational Mathematics》 SCIE CSCD 1996年第4期301-310,共10页
A new column recurrence algorithm based on the classical Greville method and modified Huang update is proposed for computing generalized inverse matrix and least squares solution. The numerical results have shown the ... A new column recurrence algorithm based on the classical Greville method and modified Huang update is proposed for computing generalized inverse matrix and least squares solution. The numerical results have shown the high efficiency and stability of the algorithm. 展开更多
关键词 MATH A COLUMN RECURRENCE ALGORITHM FOR solving linear LEAST SQUARES PROBLEM ABS
原文传递
Optimization Model and Algorithm for Multi-Label Learning
3
作者 Zhengyang Li 《Journal of Applied Mathematics and Physics》 2021年第5期969-975,共7页
<div style="text-align:justify;"> This paper studies a kind of urban security risk assessment model based on multi-label learning, which is transformed into the solution of linear equations through a s... <div style="text-align:justify;"> This paper studies a kind of urban security risk assessment model based on multi-label learning, which is transformed into the solution of linear equations through a series of transformations, and then the solution of linear equations is transformed into an optimization problem. Finally, this paper uses some classical optimization algorithms to solve these optimization problems, the convergence of the algorithm is proved, and the advantages and disadvantages of several optimization methods are compared. </div> 展开更多
关键词 Operations Research Multi-Label Learning linear Equations solving Optimization Algorithm
下载PDF
ANALYSING THE EFFICIENCY OF SOLVING DENSE LINEAR EQUATIONS ON DWNING1000
4
作者 X.B. Chi(Institute of Software, Chinese Academy of Sciences, Beijing, China) 《Journal of Computational Mathematics》 SCIE CSCD 1996年第4期383-386,共4页
In this paper, we consider solving dense linear equations on Dawning1000 byusing matrix partitioning technique. Based on this partitioning of matrix, we give aparallel block LU decomposition method. The efficiency of ... In this paper, we consider solving dense linear equations on Dawning1000 byusing matrix partitioning technique. Based on this partitioning of matrix, we give aparallel block LU decomposition method. The efficiency of solving linear equationsby different ways is analysed. The numerical results are given on Dawning1000.By running our parallel program, the best speed up on 32 processors is over 25. 展开更多
关键词 ANALYSING THE EFFICIENCY OF solving DENSE linear EQUATIONS ON DWNING1000
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部