NotesFAQContact Us
Collection
Advanced
Search Tips
Showing all 5 results Save | Export
Peer reviewed Peer reviewed
Ten Berge, Jos M. F.; And Others – Psychometrika, 1994
The suggestion that the IDIOSCAL model be fitted by the TUCKALS2 algorithm for three-way components analysis is examined. The claim that resulting coordinate matrices will be identical is supported when the data matrices are semidefinite. Counterexamples for indefinite matrices are also constructed. (SLD)
Descriptors: Algorithms, Correlation, Equations (Mathematics), Goodness of Fit
Peer reviewed Peer reviewed
Murty, Vedula N.; Swetz, Frank J. – Mathematics Teacher, 1982
An approach to how to expand explorations of determinants is detailed that allows evaluation of the fourth order. The method is built from a close examination of the product terms found in the expansions of second- and third-order determinants. Students are provided with an experience in basic mathematical investigation. (MP)
Descriptors: Algorithms, Discovery Learning, Mathematical Concepts, Mathematical Enrichment
Peer reviewed Peer reviewed
Newton, 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)
Kenney, Margaret J., Ed.; Hirsch, Christian R., Ed. – 1991
This yearbook provides the mathematics education community with specific perceptions about discrete mathematics concerning its importance, its composition at various grade levels, and ideas about how to teach it. Many practical suggestions with respect to the implementation of a discrete mathematics school program are included. A unifying thread…
Descriptors: Algorithms, Computer Uses in Education, Elementary Secondary Education, Graphs
Peer reviewed Peer reviewed
Kalman, 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