Descriptor
Source
| Mathematics Teacher | 3 |
| American Mathematical Monthly | 1 |
| College Mathematics Journal | 1 |
| MATYC Journal | 1 |
| Mathematics Magazine | 1 |
Author
| Ibrahim, Aziz | 2 |
| Goff, Gerald K. | 1 |
| Gucker, Edward | 1 |
| Gucker, Edward J. | 1 |
| Kalman, Dan | 1 |
| McKellips, Terral L. | 1 |
| Miller, Eldon L. | 1 |
| Newton, Tyre A. | 1 |
| Rozema, Edward | 1 |
Publication Type
| Guides - Classroom - Teacher | 3 |
| Journal Articles | 3 |
Education Level
Audience
| Practitioners | 2 |
| Teachers | 2 |
Location
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Peer reviewedGoff, Gerald K.; McKellips, Terral L. – Mathematics Teacher, 1974
Descriptors: Algebra, Algorithms, Matrices, Multiplication
Peer reviewedIbrahim, Aziz; Gucker, Edward – Mathematics Teacher, 1972
Descriptors: Algebra, Algorithms, Arithmetic, Computers
Miller, Eldon L. – MATYC Journal, 1978
Chio's method of evaluating determinants by successive reduction of size is explained. (MN)
Descriptors: Algebra, Algorithms, College Mathematics, Computation
Peer reviewedIbrahim, Aziz; Gucker, Edward J. – Mathematics Teacher, 1975
Descriptors: Algebra, Algorithms, Mathematical Concepts, Mathematical Enrichment
Peer reviewedRozema, Edward – College Mathematics Journal, 1988
The article discusses the use of computers to teacher college level mathematics. In particular, the Gaussian elimination procedure for solving a system of n linear equations in n unknowns, using a computer, is examined. (PK)
Descriptors: Algebra, Algorithms, College Mathematics, Computer Assisted Instruction
Peer reviewedNewton, Tyre A. – American Mathematical Monthly, 1990
Presented is a method where a quadratic equation is solved and from its roots the eigenvalues and corresponding eigenvectors are determined immediately. Included are the proposition, the procedure, and comments. (KR)
Descriptors: Algebra, Algorithms, College Mathematics, Equations (Mathematics)
Peer reviewedKalman, Dan – Mathematics Magazine, 1990
Presented is a scheduling algorithm that uses all the busses at each step for any rectangular array. Included are two lemmas, proofs, a theorem, the solution, and variations on this problem. (KR)
Descriptors: Algebra, Algorithms, College Mathematics, Computer Science
