DOCSLIB.ORG

Algorithms for Computer Algebra Algorithms for Computer Algebra

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Algorithms for Computer Algebra Algorithms for Computer Algebra Algorithms for Computer Algebra Algorithms for Computer Algebra K.O . Geddes University of Wa e loo S.R. Czapo La en ian Uni e i G. Labahn Uni e i of Wa e loo \/ Kl we Academi P bliP1he B o on/Do d e h /Lon don Distributors for North America: Kluwer Academic Publishers 101 Philip Drive Assinippi Park Norwell, Massachusetts 02061 USA Distributors for all other countries: Kluwer Academic Publishers Group Distribution Centre Post Office Box 322 3300 AH Dordrecht, THE NETHERLANDS Library of Congress Cataloging-in-PublicationData Geddes, K.O. (Keith O.), 1947- Algorithms for computer algebra / K.O. Geddes, S.R. Czapor, G. Labahn. p. cm. Includes bibliographical references and index. ISBN 0-7923-9259-0 (alk. paper) 1. Algebra--Data processing. 2. Algorithms. I. Czapor, S.R. (Stephen R.), 1957- . 11. Labahn, G. (George), 1951- 111. Title. QA155.7.E4G43 1992 512'.00285--dc20 92-25697 CIP Copyright O 1992 by Kluwer Academic Publishers All rights reserved. No part of this publication may be reproduced, stored in a retrieval system or transmitted in any form or by any means, mechanical, photo-copying, recording, or otherwise, without the prior written permission of the publisher, Kluwer Academic Publishers, 101 Philip Drive, Assinippi Park, Norwell, Massachusetts 02061. Printed on acid-free paper. Printed in the United States of America Dedi a ion Fo hei ppo in n me o wa , hi boo i dedi a ed o Debbie, Kim, Ka h n, and Ki en Alexand a, Me le, Se ge, and Ma ga e La a, Cla dia, Jeff e , and Philip CONTENTS P efa e x Chap e 1 In od ion o Comp e Algeb a 1 .1 In od ion 1 1.2 S mboli e N me i Comp a ion 2 1 .3 A B ief Hi o i al S e h 4 1.4 An Example of a Comp e Algeb a S em : MAPLE 11 Exe i e 20 Chap e 2 Algeb a of Pol nomial , Ra ional F n ion , and Powe Se ie 2.1 In od ion 23 2.2 Ring and Field 23 2.3 Di i ibili and Fa o iza ion in In eg al Domain 26 2 .4 The E lidean Algo i hm 32 2 .5 Uni a ia e Pol nomial Domain 38 2.6 M l i a ia e Pol nomial Domain 46 2 .7 The P imi i e E lidean Algo i hm 52 2.8 Q o ien Field and Ra ional F n ion 60 2.9 Powe Seie and Ex ended Powe Seie 63 2.10 Rela ion hip among Domain 70 Exe i e 73 Chap e 3 No mal Fo m and Algeb ai Rep e en a ion 3.1 In od ion 79 3 .2 Le el of Ab a ion 79 3.3 No mal Fo m and Canoni al Fo m 80 3.4 No mal Fo m fo Pol nomial 84 3.5 No mal Fo m fo Ra ional F n ion and Powe Se ie 88 3.6 Da a S e fo M l ip e i ion In ege and Ra ional N mbe 93 3.7 Da a S e fo Pol nomial , Ra ional F n ion , and Powe Se ie 96 Exe i e 105 ia Algoi hm fo Comp e Algeb a Chap e 4 A i hme i of Pol nomial , Ra ional F n ion , and Powe Se ie 4.1 In od ion 11 i 4.2 Ba i A i hme i Algo i hm 112 4 .3 Fa A i hme i Algo i hm : Ka a ba' Algo i hm 118 4.4 Mod la Rep e en a ion 120 4 .5 The Fa Fo ie T an fo m 123 4.6 The In e e Fo ie T an fo m 128 4.7 Fa Pol nomial M l ipli a ion 132 4.8 Comp ing P imi i e N- h Roo of Uni 133 4.9 New on' I e a ion fo Powe Seie Di i ion 136 Exe i e 145 Chap e 5 Homomo phi m and Chine e Remainde Algo i hm 5.1 In od ion 151 5 .2 In e media e Exp e ion Swell : An Example 151 5.3 Ring Mo phi m 153 5.4 Cha a e iza ion of Mo phi m 160 5.5 Homomo phi Image 167 5.6 The In ege Chine e Remainde Algoi hm 174 5.7 The Pol nomial In e pola ion Algoi hm 183 5.8 F he Di ion of he Two Algoi hm 189 Exe i e 196 Chap e 6 New on' I e a ion and he Hen el Con ion 6.1 In od ion 205 6.2 P-adi and Ideal-adi Rep e en a ion 205 6.3 New on' I e a ion fo F( )=0 214 6.4 Hen el' Lemma 226 6.5 The Uni a ia e Hen el Lif ing Algoi hm 232 6 .6 Spe ial Te hniq e fo he Non-moni Ca e 240 6.7 The M l i a ia e Gene aliza ion of Hen el' Lemma 250 6.8 The M l i a ia e Hen el Lif ing Algo i hm 260 Exe i e 274 Chap e 7 Pol nomial GCD Comp a ion 7.1 In od ion 279 7.2 Pol nomial Remainde Seq en e 280 7 .3 The S l e e Ma ix and S b e l an 285 7.4 The Mod la GCD Algo i hm 300 7.5 The Spa e Mod la GCD Algo i hm 311 7.6 GCD' ing Hen el Lif ing : The EZ-GCD Algo i hm 314 7 .7 A He i i Pol nomial GCD Algo i hm 320 Exe i e 331 Con en ix Chap e 8 Pol nomial Fa o iza ion 8 .1 In od ion 337 8 .2 Sq a e-F ee Fa o iza ion 337 8 .3 Sq a e-F ee Fa o iza ion O e Fini e Field 343 8 .4 Be le amp' Fa o iza ion Algo i hm 347 8 .5 The Big P ime Be le amp Algo i hm 359 8 .6 Di in Deg ee Fa o iza ion 368 8 .7 Fa oing Pol nomial o e he Ra ional 374 8 .8 Fa oing Pol nomial o e Algeb ai N mbe Field 378 Exe i e 384 Chap e 9 Sol ing S em of Eq a ion 9 .1 In od ion 389 9 .2 Linea Eq a ion and Ga ian Elimina ion 390 9 .3 F a ion-F ee Ga ian Elimina ion 393 9 .4 Al ena i e Me hod fo Sol ing Linea Eq a ion 399 9 .5 Nonlinea Eq a ion and Re l an 405 Exe i e 422 Chap e 10 G obne Ba e fo Pol nomial Ideal 10.1 In od ion 429 10.2 Te m O de ing and Red ion 431 10 .3 G obne Ba e and B hbe ge ' Algo i hm 439 10 .4 Imp o ing B hbe ge ' Algo i hm 447 10 .5 Appli a ion of G obne Ba e 451 10 .6 Addi ional Appli a ion 462 Exe i e 466 Chap e 11 In eg a ion of Ra ional F n ion 11 .1 In od ion 473 11 .2 Ba i Con ep of Diffe en ial Algeb a 474 11 .3 Ra ional Pa of he In eg al : He mi e' Me hod 482 11 .4 Ra ional Pa of he In eg al : Ho owi z' Me hod 488 11 .5 Loga i hmi Pa of he In eg al 492 Exe i e 508 x Algo i hm fo Comp e Algeb a Chap e 12 The Ri h In eg a ion Algo i hm 12 .1 In od ion 511 12 .2 Elemen a F n ion 512 12 .3 Diffe en ia ion of Elemen a F n ion 519 12 .4 Lio ille' P in iple 523 12 .5 The Ri h Algo i hm fo T an enden al Elemen a F n ion 529 12 .6 The Ri h Algo i hm fo Loga i hmi Ex en ion 530 12 .7 The Ri h Algo i hm fo Exponen ial Ex en ion 547 12 .8 In eg a ion of Algeb ai F n ion 561 Exe i e 569 No a ion 575 Index 577 LIST OF ALGORITHMS 2.1 E lidean Algo i hm 34 2.2 Ex ended E lidean Algo i hm 36 2.3 P imi i e E lidean Algo i hm 57 4.1 M l ip e i ion In ege M l ipli a ion 113 4.2 Ka a ba' M l ipli a ion Algo i hm 119 4.3 Pol nomial T ial Di i ion Algo i hm 122 4 .4 Fa Fo ie T an fo m (FFT) 128 4 .5 Fa Fo ie Pol nomial M l ipli a ion 132 4.6 New on' Me hod fo Powe Seie In e ion 140 4.7 New on' Me hod fo Sol ing P( ) = 0 144 5.1 Ga ne ' Chine e Remainde Algo i hm 180 5.2 New on In e polaion Algo i hm 188 6.1 Uni a ia e Hen el Lif ing Algoi hm 233 6.2 M l i a ia e Pol nomial Diophan ine Eq a ion 268 6.3 Uni a ia e Pol nomial Diophan ine Eq a ion 270 6.4 M l i a ia e Hen el Lif ing Algoi hm 272 7.1 Mod la GCD Algo i hm 307 7 .2 M l i a ia e GCD Red ion Algo i hm 309 7 .3 The Ex ended Za enha GCD Algo i hm 316 7.4 GCD He i i Algo i hm 330 8 .1 Sq a e-F ee Fa o iza ion 340 8.2 Y n' Sq a e-F ee Fa o iza ion 342 8.3 Fini e Field Sq a e-F ee Fa o iza ion 345 8.4 Be le amp' Fa o ing Algoi hm 352 8.5 Fo m Q Ma ix 353 8.6 N ll Spa e Ba i Algo i hm 356 8 .7 Big P ime Be le amp Fa o ing Algoi hm 367 8 .8 Di in Deg ee Fa o iza ion (Pa ial) 371 8.9 Di in Deg ee Fa oiza ion (Spli ing) 373 8.10 Fa o iza ion o e Algeb ai N mbe Field 383 xii Algo i hm fo Comp e Algeb a 9 .1 F a ion-F ee Ga ian Elimina ion 398 9 .2 Nonlinea Elimina ion Algo i hm 417 9 .3 Sol ion of a Nonlinea S em of Eq a ion 421 10 .1 F ll Red ion Algo i hm 436 10 .2 B hbe ge ' Algoi hm fo G obne Ba e 446 10 .3 Con ion of a Red ed Ideal Ba i 448 10 .4 Imp o ed Con ion of Red ed G obne Ba i 450 10 .5 Sol ion of S em fo One Va iable 457 10 .6 Comple e Sol ion of S em 458 10 .7 Sol ion ing Lexi og aphi G obne Ba i 461 11 .1 He mi e' Me hod fo Ra ional F n ion 485 11 .2 Ho owi z' Red ion fo Ra ional F n ion 490 11 .3 Ro h ein/T age Me hod 499 11 .4 Laza d/Rioboo/T age Imp o emen 506 LIST OF FIGURES 1 .1 FORTRAN p og am in ol ing Cheb he pol nomial 3 1 .2 ALTRAN p og am in ol ing Cheb he pol nomial 3 1 .3 O p f om ALTRAN p og am in Fig e 1 .2 4 1.4 MAPLE e ion in ol ing Cheb he pol nomial 5 2.1 Rela ion hip among fo domain o e an in eg al domain 71 2.2 Rela ion hip among nine domain 71 3.1 Le el of ab a ion fo m l i a ia e pol nomial ep e en a ion 86 3.2 A lin ed li ep e en a ion 98 3.3 A d nami a a ep e en a ion 100 3 .4 A de ip o blo ep e en a ion 101 5.1 Homomo phi m diag am fo Chine e emainde and in e pola ion algo i hm 195 6.1 Homomo phi m diag am fo p-adi and ideal-adi New on' i e a ion 226 6.2 Homomo phi m diag am fo ni aia e and m l i aia e Hen el on ion ....251 LIST OF TABLES 1 .1 The fi fi e Cheb he pol nomial 2 2.1 Defini ion of algeb ai e 25 2.2 Addi ion and m l ipli a ion able fo Z5 25 2 .3 Hie a h of domain 31 PREFACE The field of computer algebra has gained widespread attention in recent years because of the increasing use of computer algebra systems in the scientific community.
Load more

Recommended publications
  • Sage: Unifying Mathematical Software for Scientists, Engineers, and Mathematicians
    Sage: Unifying Mathematical Software for Scientists, Engineers, and Mathematicians 1 Introduction The goal of this proposal is to further the development of Sage, which is comprehensive unified open source software for mathematical and scientific computing that builds on high-quality mainstream methodologies and tools. Sage [12] uses Python, one of the world's most popular general-purpose interpreted programming languages, to create a system that scales to modern interdisciplinary prob- lems. Sage is also Internet friendly, featuring a web-based interface (see http://www.sagenb.org) that can be used from any computer with a web browser (PC's, Macs, iPhones, Android cell phones, etc.), and has sophisticated interfaces to nearly all other mathematics software, includ- ing the commercial programs Mathematica, Maple, MATLAB and Magma. Sage is not tied to any particular commercial mathematics software platform, is open source, and is completely free. With sufficient new work, Sage has the potential to have a transformative impact on the compu- tational sciences, by helping to set a high standard for reproducible computational research and peer reviewed publication of code. Our vision is that Sage will have a broad impact by supporting cutting edge research in a wide range of areas of computational mathematics, ranging from applied numerical computation to the most abstract realms of number theory. Already, Sage combines several hundred thousand lines of new code with over 5 million lines of code from other projects. Thousands of researchers use Sage in their work to find new conjectures and results (see [13] for a list of over 75 publications that use Sage).
    [Show full text]
  • Design and Implementation of a Modern Algebraic Manipulator for Celestial Mechanics
    Design and implementation of a modern algebraic manipulator for Celestial Mechanics Francesco Biscani January 30, 2008 “Design and implementation of a modern algebraic manipulator for Celestial Me- chanics”, by Francesco Biscani ([email protected]), is licensed under a Creative Commons Attribution-Noncommercial-Share Alike 3.0 Unported License (http://creativecommons.org/licenses/by/3.0/). Copyright © 2007 by Francesco Biscani. Created with LYX and X TE EX. Dedicata alla memoria di Elisa. Summary¹ e goals of this research are the design and implementation of a modern and efficient algebraic manipulator specialised for Celestial Mechanics. Specialised algebraic manipulators are funda- mental tools both in classical Celestial Mechanics and in modern studies on the behaviour of dynamical systems, and they are routinely employed in such diverse tasks as the elaboration of theories of motion of celestial bodies, geodetical and terrestrial orientation studies, perturbation theories for artificial satellites and studies about the long-term evolution of the Solar System. Specialised manipulators for Celestial Mechanics are usually concerned with mathematical objects known as Poisson series (see Danby et al. [1966]), which are defined as multivariate Fourier series with multivariate Laurent series as coefficients: X ( ) cos P (i1y1 + i2y2 + ... + inyn) , i sin i where the Pi are multivariate polynomials. Poisson series manipulators have been developed continuously since the ’60s and today there are many different packages available (an incomplete list includes Herget and Musen [1959], Broucke and Garthwaite [1969], Jefferys [1970, 1972], Rom [1970], Bourne and Horton [1971], Babaev et al. [1980], Dasenbrock [1982], Richardson [1989], Abad and San-Juan [1994], Ivanova [1996], Chapront [2003b,a] and Gastineau and Laskar [2005]).
    [Show full text]
  • The Piranha Algebraic Manipulator
    THE PIRANHA ALGEBRAIC MANIPULATOR FRANCESCO BISCANI∗ Key words. Celestial Mechanics, algebraic manipulation, computer algebra, Poisson series, multivariate polynomials Abstract. In this paper we present a specialised algebraic manipulation package devoted to Celestial Mechanics. The system, called Piranha, is built on top of a generic and extensible frame- work, which allows to treat eciently and in a unied way the algebraic structures most commonly encountered in Celestial Mechanics (such as multivariate polynomials and Poisson series). In this contribution we explain the architecture of the software, with special focus on the implementation of series arithmetics, show its current capabilities, and present benchmarks indicating that Piranha is competitive, performance-wise, with other specialised manipulators. 1. Introduction. Since the late Fifties ([27]) researchers in the eld of Celestial Mechanics have manifested a steady and constant interest in software systems able to manipulate the long algebraic expressions arising in the application of perturbative methods. Despite the widespread availability of commercial general-purpose algebraic manipulators, researchers have often preferred to develop and employ specialised ad- hoc programs (we recall here, without claims of completeness, [10], [31, 32], [48], [7], [4], [18], [47], [1], [29], [13, 12] and [23]). The reason for this preference lies mainly in the higher performance that can be obtained by these. Specialised manipulators are built to deal only with specic algebraic structures, and thus they can adopt fast algo- rithm and data structures and avoid the overhead inherent in general-purpose systems (which instead are designed to deal with a wide variety of mathematical expressions). The performance gap between specialised and general-purpose manipulators is often measured in orders of magnitude, especially for the most computationally-intensive operations.
    [Show full text]
  • Basic Concepts and Algorithms of Computer Algebra Stefan Weinzierl
    Basic Concepts and Algorithms of Computer Algebra Stefan Weinzierl Institut fur¨ Physik, Universitat¨ Mainz I. Introduction II. Data Structures III. Efficiency IV. Classical Algorithms Literature Books: D. Knuth, “The Art of Computer Programming”, Addison-Wesley, third edition, 1997 • K. Geddes, S. Czapor and G. Labahn, “Algorithms for Computer Algebra”, Kluwer, • 1992 J. von zur Gathen and J. Gerhard, “Modern Computer Algebra”, Cambridge • University Press, 1999 Lecture notes: S.W., “Computer Algebra in Particle Physics”, hep-ph/0209234. • The need for precision Hunting for the Higgs and other yet-to-be-discovered particles requires accurate and precise predictions from theory. Theoretical predictions are calculated as a power expansion in the coupling. Higher precision is reached by including the next higher term in the perturbative expansion. State of the art: Third or fourth order calculations for a few selected quantities (R-ratio, QCD β- • function, anomalous magnetic moment of the muon). Fully differential NNLO calculations for a few selected 2 2 and 2 3 processes. • ! ! Automated NLO calculations for 2 n (n = 4::6;7) processes. • ! Computer algebra programs are a standard tool ! History The early days, mainly LISP based systems: 1965 MATHLAB 1958 FORTRAN 1967 SCHOONSHIP 1960 LISP 1968 REDUCE 1970 SCRATCHPAD, evolved into AXIOM 1971 MACSYMA 1979 muMATH, evolved into DERIVE Commercialization and migration to C: 1981 SMP, with successor MATHEMATICA 1972 C 1988 MAPLE 1992 MuPAD Specialized systems: 1975 CAYLEY (group theory), with
    [Show full text]
  • Applications of Computer Algebra
    22nd Conference on Applications of Computer Algebra ACA 2016 Kassel (Germany) st th August 1 – 4 Chairs Wolfram Koepf and Werner Seiler (general) Georg Regensburger Winfried Neun Michael Wester (program) Advisory Committee: Eugenio Roanes-Lozano Stanly Steinberg Michael Wester Contact: [email protected] Deadline for submissions: March 31st, 2016 submission of session proposals May 29th, 2016 submission of talks Notification of acceptance: 1 July 13th, 2016 http://www.mathematik.uni-kassel.de/ACA2016 Contents Sponsors vi Schedule vii Plenary Talks 1 Computer Algebra Systems and the Lambert W Function D. Jeffrey .........................................2 Real Problems over the Reals: From Complete Elimination Procedures to Subtropical Decisions T. Sturm .........................................2 Exploring a Homotopy Approach to the Science of Data: Huge Scenarios, Topological Scintigraphy and Flagellate Structures P. Real ..........................................2 Sponsor Talks 3 What's New in Mathematica? S. Szurmant ........................................4 What's New in Maple 2016? J. Gerhard ........................................4 S1 Computer Algebra for Modeling in Science and Engineering 5 Application of Computer Algebra System and the Mean-Value Theory for Evaluating Electrostatic Potential and its Associated Field for Nontrivial Configurations H. Sarafian ........................................6 Experimental and Finite Elements Stress Analysis of a Double Edge Notched Specimen A. Bilek, M. Beldi, T. Cherfi, S. Djebali and S. Larbi ................ 12 Modelling and Simulation of Solid Particle Sidementation in an Incompressible Newtonian Fluid S. Zouaoui, H. Djebouri, A. Bilek and K. Mohammedi ................ 18 Interfacing KetCindy and CASs, and its Applications to Scientific Problems Modeling S. Takato, J. A. Vallejo and M. Kaneko ........................ 23 On the Visualization of Random Fibonacci-Padovan Sequences T. Myll¨ari,A.
    [Show full text]
  • A Controlled Study of the Flipped Classroom with Numerical Methods for Engineers
    Utah State University DigitalCommons@USU All Graduate Theses and Dissertations Graduate Studies 5-2013 A Controlled Study of the Flipped Classroom With Numerical Methods for Engineers Jacob L. Bishop Utah State University Follow this and additional works at: https://digitalcommons.usu.edu/etd Part of the Engineering Education Commons Recommended Citation Bishop, Jacob L., "A Controlled Study of the Flipped Classroom With Numerical Methods for Engineers" (2013). All Graduate Theses and Dissertations. 2008. https://digitalcommons.usu.edu/etd/2008 This Dissertation is brought to you for free and open access by the Graduate Studies at DigitalCommons@USU. It has been accepted for inclusion in All Graduate Theses and Dissertations by an authorized administrator of DigitalCommons@USU. For more information, please contact [email protected]. A CONTROLLED STUDY OF THE FLIPPED CLASSROOM WITH NUMERICAL METHODS FOR ENGINEERS by Jacob L. Bishop A dissertation submitted in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY in Engineering Education Approved: Dr. Gilberto E. Urroz Dr. Matthew A. Verleger Major Professor Committee Member Dr. Oenardi Lawanto Dr. Ning Fang Committee Member Committee Member Dr. Christian Geiser Dr. Mark R. McLellan Committee Member Vice President for Research and Dean of the School of Graduate Studies UTAH STATE UNIVERSITY Logan, Utah 2013 ii Copyright c Jacob L. Bishop 2013 All Rights Reserved iii Abstract A Controlled Study of the Flipped Classroom with Numerical Methods for Engineers by Jacob L. Bishop, Doctor of Philosophy Utah State University, 2013 Major Professor: Dr. Gilberto E. Urroz Department: Engineering Education Recent advances in technology and ideology have unlocked entirely new directions for education research.
    [Show full text]
  • More Power Through Symbolic Computation: Extending Stata by Using the Maxima Computer Algebra System
    The Stata Journal Editors H. Joseph Newton Nicholas J. Cox Department of Statistics Department of Geography Texas A&M University Durham University College Station, Texas Durham, UK [email protected] [email protected] Associate Editors Christopher F. Baum, Boston College Frauke Kreuter, Univ. of Maryland–College Park Nathaniel Beck, New York University Peter A. Lachenbruch, Oregon State University Rino Bellocco, Karolinska Institutet, Sweden, and Jens Lauritsen, Odense University Hospital University of Milano-Bicocca, Italy Stanley Lemeshow, Ohio State University Maarten L. Buis, University of Konstanz, Germany J. Scott Long, Indiana University A. Colin Cameron, University of California–Davis Roger Newson, Imperial College, London Mario A. Cleves, University of Arkansas for Austin Nichols, Urban Institute, Washington DC Medical Sciences Marcello Pagano, Harvard School of Public Health William D. Dupont , Vanderbilt University Sophia Rabe-Hesketh, Univ. of California–Berkeley Philip Ender , University of California–Los Angeles J. Patrick Royston, MRC Clinical Trials Unit, David Epstein, Columbia University London Allan Gregory, Queen’s University Philip Ryan, University of Adelaide James Hardin, University of South Carolina Mark E. Schaffer, Heriot-Watt Univ., Edinburgh Ben Jann, University of Bern, Switzerland Jeroen Weesie, Utrecht University Stephen Jenkins, London School of Economics and Ian White, MRC Biostatistics Unit, Cambridge Political Science Nicholas J. G. Winter, University of Virginia Ulrich Kohler , University of Potsdam, Germany Jeffrey Wooldridge, Michigan State University Stata Press Editorial Manager Stata Press Copy Editors Lisa Gilmore David Culwell, Shelbi Seiner, and Deirdre Skaggs The Stata Journal publishes reviewed papers together with shorter notes or comments, regular columns, book reviews, and other material of interest to Stata users.
    [Show full text]
  • Curriculum Vitae John Peter Fitch Personal Details: Employment Record
    Curriculum Vitae John Peter Fitch March 16, 2019 Note: I also use the name John ffitch and have published under that name, especially in music. Also I am sometimes referenced as such by others, whatever the name on the actual paper. Personal Details: Home Address: \Alta" Horsecombe Vale Combe Down Bath BA2 5QR England e-mail: [email protected] Date of Birth: 10 December 1945 Place of Birth: Barnsley, Yorkshire Marital Status: Married to Audrey Fitch, n´ee Heath since 1968, no children Employment Record: Senior Assistant in Research, The Computer Laboratory, Cambridge, 1971 { 1977 Assistant Visiting Professor, Department of Computer Science, University of Utah, 1977 { 1978 Lecturer, Department of Computer Studies, University of Leeds, 1978 { 1980 Director, The Computer Unit, University of Bath, 1980 { 1983 Professor of Software Engineering, University of Bath, 1980 { 2011 (variously in School of Mathe- matics, School of Mathematical Sciences, Department of Mathematical Sciences, and Department of Computer Science) Visiting Professor, Department of Computer Science, University of Bath 2011 { 2015 Adjunct Honorary Professor, Department of Music, National University of Ireland, Maynooth, 2011 { 2021 Partner, Fitch-Norman, LISP Software and Consultancy, 1983 { 1989 Director, Codemist Ltd, 1988 { 2016 Director, Composers Desktop Project Ltd, 2013 { date 1 Academic Record: 1956 { 1964, Brockenhurst Grammar School, Hampshire 13 `O' levels plus \Use of English", 4 `A' levels and 2 `S' levels (A1A2AA). 1964 { 1971, St John's College, University of Cambridge 1965 Mathematical Tripos Pt Ia (2nd class) 1966 Mathematical Tripos Pt Ib (2nd class) 1967 Mathematical Tripos Pt II (Senior Optime) B.A. Degree 1968 Diploma in Computer Science, with Distinction Elected to College Scholarship Awarded College Prize 1968 { 1971 Research Student in The Mathematical Laboratory Later the Computer Laboratory 1971 M.A.
    [Show full text]
  • Structures in Real Theory Application: a Study in Feasible Epistemology
    Western University Scholarship@Western Electronic Thesis and Dissertation Repository 8-13-2013 12:00 AM Structures in Real Theory Application: A Study in Feasible Epistemology Robert H. C. Moir The University of Western Ontario Supervisor Robert W. Batterman The University of Western Ontario Joint Supervisor John L. Bell The University of Western Ontario Graduate Program in Philosophy A thesis submitted in partial fulfillment of the equirr ements for the degree in Doctor of Philosophy © Robert H. C. Moir 2013 Follow this and additional works at: https://ir.lib.uwo.ca/etd Part of the Epistemology Commons, Logic and Foundations of Mathematics Commons, and the Philosophy of Science Commons Recommended Citation Moir, Robert H. C., "Structures in Real Theory Application: A Study in Feasible Epistemology" (2013). Electronic Thesis and Dissertation Repository. 1578. https://ir.lib.uwo.ca/etd/1578 This Dissertation/Thesis is brought to you for free and open access by Scholarship@Western. It has been accepted for inclusion in Electronic Thesis and Dissertation Repository by an authorized administrator of Scholarship@Western. For more information, please contact [email protected]. Structures in Real Theory Application: A Study in Feasible Epistemology (Thesis Format: Monograph) by Robert H. C. Moir Graduate Program in Philosophy A thesis submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy The School of Graduate and Postdoctoral Studies The University of Western Ontario London, Ontario, Canada ©Robert H. C. Moir 2013 Abstract This thesis considers the following problem: What methods should the episte- mology of science use to gain insight into the structure and behaviour of scientific knowledge and method in actual scientific practice? After arguing that the elucidation of epistemological and methodological phenomena in science requires a method that is rooted in formal methods, I consider two alternative methods for epistemology of science.
    [Show full text]
  • A Computer Algebra System Dedicated to Celestial Mechanics and Perturbation Series
    TRIP - a computer algebra system dedicated to celestial mechanics and perturbation series Mickaël Gastineau Jacques Laskar Astronomie et Systèmes Dynamiques Astronomie et Systèmes Dynamiques IMCCE-CNRS UMR8028, Observatoire de Paris, IMCCE-CNRS UMR8028, Observatoire de Paris, UPMC UPMC 77 Avenue Denfert-Rochereau 77 Avenue Denfert-Rochereau 75014 Paris, France 75014 Paris, France [email protected] [email protected] ABSTRACT tational equations for the computation of the long-time be- TRIP is an interactive computer algebra system that is de- havior of the Solar System, he also had to write some very voted to perturbation series computations, and specially dedicated FORTRAN programs that hid most of the analyt- adapted to celestial mechanics. Its development started ical computations in the series products or derivations[24]. in 1988, as an upgrade of the special purpose FORTRAN Using these tools, he could then compute to a never reached routines elaborated by J. Laskar for the demonstration of state a 150 000 terms complex polynomial in 32 variables the chaotic behavior of the Solar System. TRIP is now a that was then numerically integrated for the demonstration mature and efficient tool for handling multivariate general- that the Solar System planetary motion is chaotic[25, 26]. ized power series, and contains also a numerical kernel. A The problem of these efficient, but dedicated routines is limited version of TRIP is freely available on the WEB at that they were not very flexible and requested specific pro- www.imcce.fr/trip. gramming for each different application. The absence, at this time, of any available efficient general computer algebra tool led then J.
    [Show full text]
  • Towards an Implementation of a Computer Algebra System in a Functional Language
    Towards an Implementation of a Computer Algebra System in a Functional Language Oleg Lobachev and Rita Loogen Philipps–Universität Marburg, Fachbereich Mathematik und Informatik Hans–Mehrwein–Straße, D–35032 Marburg, Germany {lobachev,loogen}@informatik.uni-marburg.de Abstract. This paper discusses the pros and cons of using a functional language for implementing a computer algebra system. The contributions of the paper are twofold. Firstly, we discuss some language–centered design aspects of a computer algebra system — the “language unity” concept. Secondly, we provide an implementation of a fast polynomial multiplication algorithm, which is one of the core elements of a com- puter algebra system. The goal of the paper is to test the feasibility of an implementation of (some elements of) a computer algebra system in a modern functional language. Keywords: computer algebra, software technology, language and system design. 1 Introduction With the flow of the history of computing, exact methods gained more and more importance. It was clear since almost the beginning, that imprecise, numerical 20 − operations may and will fail. The Wilkinson Monster j=1(x j) is a nice – and old! [45,46] – example for the thesis “the way we compute it matters”. One of the crucial points of computer algebra systems (CAS) is the implementation of fast algorithms. One of the core algorithms is fast multiplication, be it of numbers or of polynomials. Current approaches include methods by Karatsuba, Toom and Cook [20, 44, 24] and Schönhage and Strassen [38, 37]. An implementation of the latter in the functional language Haskell [33] is presented in this paper to test the suitability of functional languages for implementing computer alge- bra algorithms.
    [Show full text]
  • Distributed Symbolic Computations
    Distributed Symbolic Computations Dana Petcu Western University of Timisoara And Institute e-Austria Timisoara, Romania [email protected] Overview The problem The past The present The future? ISPDC 2007, June 6th 2 The problem Symbolic computation? Automation of the steps of mathematical problem solving Modern field of CS and Math which deals with symbolic objects, e.g. logical or algebraic formulae, rules or programs Main goal is exactness Examples of operations: diff, integral, factors, roots ISPDC 2007, June 6th 4 Subfields of symbolic computing computer algebra (CA), automated theorem proving, computational combinatorics, computational geometry, automated programming, functional or logic programming. ISPDC 2007, June 6th 5 Symbolic methods - applications computer aided design software development VLSI design geometric modelling reasoning robot programming human genome etc ISPDC 2007, June 6th 6 Problems behind CA systems Lagging relative to numerical computing, mainly due to the inadequacy of available computational resources: 1. computer memory 2. processor power. Solution: parallel & distributed CA Solving larger problems Build new algorithms Build new systems ISPDC 2007, June 6th 7 The past Distributed computations emerge ISPDC 2007, June 6th 9 General reasons for parallelism ability to reduce the wall-clock time i.e. the user’s waiting time for the solution problems that are processor bound Ability to solve problems that cannot fit into memory of a ``workstation'' problems that are memory bound Memory
    [Show full text]