Harley Flanders

Harley Flanders (born September 13, 1925) is an American mathematician, known for several textbooks and contributions to his fields: algebra and algebraic number theory, linear algebra, electrical networks, scientific computing.

He received his bachelors (1946), masters (1947) and PhD (1949) at the University of Chicago on the dissertation Unification of class field theory advised by Otto Schilling and André Weil.^[1] He held the Bateman Fellowship at Caltech. He joined the faculty at University of California at Berkeley, then became professor at Purdue University (1960), and was with the faculty at Tel Aviv University (1970–77), visiting professor at Georgia Tech (1977–78), visiting scholar at Florida Atlantic University (1978–85), University of Michigan, Ann Arbor (1985–97, 2000–), University of North Florida (1997–2000) and, distinguished mathematician in residence at Jacksonville University (1997–2000).^[2] He was Editor-in-Chief, American Mathematical Monthly, 1969–1973. Flanders also wrote calculus software MicroCalc, ver 1–7 (1975–).^[3][4]

Awards

• MAA Lester R. Ford Award 1969
• NCRIPTAL/EDUCOM Distinguished Software Award 1987
• NCRIPTAL/EDUCOM Distinguished Software Award 1989
• Lifetime Senior Member, IEEE 1998

Books

• Differential forms, with applications to the physical sciences (1964)
• Calculus (Academic Press, 1970). With Justin Jesse Price and Robert R. Korfhage.
• Elementary functions and analytic geometry (Academic Press, 1973). With Price.
• First course in calculus with analytic geometry (Academic Press, 1974). With Korfhage and Price.
• Introductory college mathematics: With linear algebra and finite mathematics (Academic Press, 1974). With Price.
• C. Loewner's Lectures on Continuous Groups, (MIT Press, 1971). With Murray H. Protter.
• Second course in calculus (Academic Press, 1974). With Korfhage and Price.
• Algebra (Academic Press, 1975). With Price
• Calculus (1985).
• Single-variable calculus (Academic Press, 1981)
• Trigonometry (Academic Press, 1975). With Price.
• Pre-calculus mathematics (Academic Press, 1981). With Price.
• College algebra (Academic Press, 1982). With Price.
• Algebra and trigonometry (Academic Press, 1981). With Price
• Scientific Pascal (1984).^[4]
• Scientific Pascal 2/e (Birkhauser 1996)
• Calculus: A lab course with MicroCalc (Springer-Verlag, 1996).

Selected papers

• Elementary Divisors of AB and BA, Proc. Amer. Math. Soc. 2 (1951)
• Generalization of a Theorem of Ankeny and Rogers, Ann. of Math. 57 (1953)
• Development of an Extended Exterior Differential Calculus, Trans. Amer. Math. Soc. 75 (1953)
• On Certain Functions with Positive Definite Hessian, Ann. of Math. 71 (1960)
• Meaning of the Form Calculus in Classical Ideal Theory, Trans. Amer. Math. Soc. 95 (1960)
• On Spaces of Linear Transformations of Bounded Rank, J. London Math. Soc. 37 (1962)
• Satellites of Half Exact Functors, a correction, Proc. Amer. Math. Soc. 15 (1964)
• Local Theory of Affine Hypersurfaces, J. Anal. Math. 15 (1965)
• The Steiner Point of a Closed Hypersurface, Mathematika 13 (1966)
• Tensor and Exterior Powers, J. Algebra 7 (1967)
• Relations on Minimal Hypersurfaces, Pacific J. Math. 29 (1969)
• The Schwarzian as a Curvature, J. Diff. Geom. 4 (1970)
• Infinite Networks I – Resistive Networks, IEEE Trans. Circuit Theory 18 (1971)
• Natural Frequencies of Cyclic Linear Networks (with P.M. Lin), IEEE Trans. Circuit Theory 18 (1971)
• A New Proof of R. Foster's Averaging Theorem, Linear Algebra and its Applications 8 (1974)
• Positive Operators and a Problem in Control Theory, (with Harold Wimmer) Linear Algebra and its Applications 8 (1974)
• An Extremal Problem in the Space of Positive Definite Matrices, linear and Multilinear Algebra 3 (1975)
• On the Maximal Power Transfer Theorem for n-ports, Int. J. of Circuit Theory and Applications 4 (1976)
• On the matrix equations AX − XB = C and AX − YB = C, (with H. Wimmer), SIAM Jour. Math. Anal. 32 (1977)
• Coroutines in Pascal, ACM Sigplan Notices 18 (December 1983)
• Automatic differentiation of composite functions, in Griewank, A. and Corliss, G. F., Automatic Differentiation of Algorithms, SIAM, 1991
• A minimal code list (with Herbert Fischer), Theoretical Computer Science 215 (1999)
• Functions not satisfying implicit, polynomial ODE, J Diff Eqs 240:1 (2007)

References