Numerical Analysis in Zurich – 50 Years Ago

Total Page:16

File Type:pdf, Size:1020Kb

Numerical Analysis in Zurich – 50 Years Ago 2 Martin H. Gutknecht is a professor and senior scientist at ETH Zurich. He was also Scientific Director of the Swiss Center for Scientific Computing (CSCS/SCSC). Numerical Analysis in Zurich – 50 Years Ago Surely, applied mathematics originated in ancient gathering of this sort ever – as an opportunity to times and slowly matured through the centuries, recall some of the local contributions. We focus on but it started to blossom colorfully only when those in numerical analysis and scientific comput- electronic computers became available in the late ing, but we will also touch computers, computer 1940s and early 1950s. This was the gold miner’s languages, and compilers. time of computer builders and numerical analysts. Responsible for establishing (electronic) The venue was not the far west of the United scientific computing in Switzerland was primarily States, but rather some places in its eastern part, Eduard Stiefel (1909–1978): he took the initiative, such as Boston, Princeton, Philadelphia, and New raised the money, hired the right people, directed York, and also places in Europe, most notably, the projects, and, last but not least, made his own Manchester, Amsterdam, and Zurich. Only long lasting contributions to pure and applied math- after these projects had begun did it become ematics. Stiefel got his Dr. sc. math. from ETH in known that the electronic computer had been 1935 with a dissertation on Richtungsfelder und invented earlier by clever individuals: 1937–1939 Fernparallelismus in n-dimensionalen Mannig- by John V. Atanasoff and his gradute student faltigkeiten written under the famous Heinz Hopf. Clifford Berry at Iowa State College, Ames, Iowa, It culminated in the introduction of the Stiefel and, independently, 1935–1941 by Konrad Zuse in (-Whitney) classes, certain characteristic classes Berlin. We take the Sixth International Congress of associated with real vector bundles. Eduard Stiefel Industrial and Applied Mathematics – the biggest left further traces in pure mathematics with the Figure 1 The South Seas island of ERMETHIA Stiefel manifold and, later, in 1942, with the Stiefel diagram related to Lie groups and crystallographic groups. Decades later he would time and again capitalize on this knowledge by applying it to various problems in applied mathematics. InWWII, Stiefel spent much time in the army, where he reached the rank of a colonel, command- ing the artillery weather services. That must have whetted his appetite for numerical computations. Moreover, soon after the war he must have heard of projects to build electronic computers in other countries, and he quickly started an initiative for establishing an Institute for Applied Mathematics at ETH. Its prime aim would be to build an electronic computer – there were none for sale then – and to find out how to use it. There were no operating systems yet, no compilers, no program- ming languages, and little algorithmic thinking. As it turned out, Stiefel’s institute, which was Figure 2 Eduard Stiefel, the chief, who had an interest in fishing founded officially on January 1, 1948, became one of the few places worldwide that made fundamen- relays. It was, however, error-prone, but useful as tal contributions to all these areas within 10 years. a prototype to get support for his next project. The After establishing the institute, Stiefel soon Z3 was completed in 1941 and was a fully opera- hired two assistants: a young mathematician tional programmable computer based on the relay named Heinz Rutishauser (1918–1970) and a technology: 600 relays were used for the CPU, young electrical engineer named Ambros Speiser 1400 for the memory. A replica is now on display (1922–2003). Rutishauser had been working as in the German Museum in Munich. Finally, in a high-school teacher and was about to finish his 1942–1945, Zuse built the more powerful Z4. dissertation on a topic in complex analysis. Speiser In the last month of the war, he was able to flee the (1922–2003) was just about to get his diploma. capital with his Z4 packed up in boxes and to Next, Stiefel went for five months (from October retreat to the secluded village of Hinterstein, close 18, 1948, to March 12, 1949) on a fact finding to the Austrian border. Once the end-of-war mission to Amsterdam and the United States. turmoil had cooled down, Zuse moved to the He visited several computer building projects and better accessible Hopferau, where, in 1946–1949, some colleagues who worked on algorithms for he completed the Z4 in the former flour storage scientific computing. He also organized for each of room of a bakery. After inspecting the machine, his two assistants to spend the whole year of 1949 Stiefel leased the Z4 for CHF 30’000 for five years. in the US. Each of them could stay half the year It was installed at ETH in August 1950, often ran with Howard Aiken at Harvard University and the day and night, and proved very reliable, except for other half with John von Neumann at Princeton. the memory (64 32-bit numbers), which was still What a generous boss! And what a clever move for mechanical. The technical details have been know-how acquisition! Fostering these two young reported in many newspaper and journal articles, researchers payed off well – as it generally does. see, e.g., [2], [17], [5], and the references listed in When Stiefel returned in Spring 1949 he had to there. Some new features were added in Zurich, anticipate that designing and constructing an e.g., the treatment of conditional branches. electronic computer in Zurich would take several Despite the Z4, designing a more powerful years, and during this time work on numerical electronic computer to be called ERMETH algorithms would be limited by the impossibility (Elektronische Rechenmaschine der ETH) was of testing them. He was more than happy to learn still the main target of Stiefel’s quickly growing one day that Konrad Zuse who lived in the small institute. Responsible for this task was Ambros Bavarian village Hopferau offered to lease him an Speiser, in the meantime the technical director of operational digital electromechanical computer. a group of five engineers and three mechanics. Konrad Zuse was a real inventor. In 1935–1945 he But reportedly, Rutishauser’s ingenious views also designed a series of four digital computers with had a great influence on the design. Among the binary floating-point representation in his parents’ traces of their work are the two reports [16], [11], apartment in Berlin: while the Z1 was still fully the latter being Rutishauser’s habilitation thesis mechanical, the Z2 of 1940 had already an describing what we would call now a compiler. arithmetic unit assembled from electromagnetic Ultimately, the ERMETH started running in July 4 center head Article Figure 3 Ambros Speiser, who was always trying to maintain the site Figure 4 Heinz Rutishauser, fond of music, shown below a broken in order chain, in German Kettenbruch, i.e., continued fraction 1956 and remained operational till 1963. Its most working on the theory of a clever improvement impressive part was a large magnetic drum that of the Gauss-Seidel method. Young’s successive could store 10’000 floatingpoint numbers in overrelaxation (SOR) method proved to be very a 16-decimal representation with an 11-decimal efficient for many symmetric positive definite mantissa. For further details on the ERMETH see (spd) problems (and a few others). Stiefel also [10] and the references given there. knew of a number of other, competitive, “relaxa- Running the Z4 and at the same time building tion” methods that were equally simple to apply the ERMETH was a lot of hard work for the team and did not use a matrix splitting, but – like SOR – of the institute, work often carried out day and required choosing certain parameters. The best night. The excellent team spirit is reflected in our such method is known as Chebyshev iteration as it illustrations that show the mystic South Seas island makes use of Chebyshev polynomials. But Stiefel of ERMETHIA and the four most prominent team was looking for a better method that automatically members as its inhabitants. The drawings were adapts to each matrix and to the initial approxima- sketched by Alfred Schai in coal on large sheets of tion of the solution. He discovered it in 1951: an paper around 1956, but only photographs survived iterative method that delivers for spd problems in the years. Schai was an electrical engineer of the every step an optimal approximation of the team, who later, 1964 –1989, was director of the solution and constructs it with an update process well equipped Computer Center of ETH Zurich. based on simple 2-term recurrences. He called it The availability of the Z4 allowed Stiefel and his the n-step method, as it delivers the exact solution collaborators to explore numerical methods on it. of a linear n-byn system in at most n steps. He first They also attacked real applications from civil mentioned it in a paper submitted in July 1951, engineering (dams, plates), quantum chemistry in which he reviewed various approaches to the (eigenvalues), and airplane design (deformation of iterative solution of linear systems [18]. wings). Most of the textbook methods of this area In the same month he travelled to the United originated from the time when “computers” were States for a second, even longer visit (from July still human beings. Some of these methods were 1951 to February 1952), this time to the Institute suitable for programmable electronic computers, for Numerical Analysis (INA) of the National others proved inappropriate or inefficient. The Bureau of Standards, which was located at UCLA strong limitations regarding memory and program in Los Angeles.
Recommended publications
  • Vita Walter Gautschi
    VITA WALTER GAUTSCHI April 1, 2021 EDUCATION Ph.D. University of Basel, Switzerland 1953 (Thesis advisor: A. M. Ostrowski) PROFESSIONAL EXPERIENCE Research Fellow Istituto Nazionale per le Applicazioni del Calcolo, Rome 1954–55 Research Fellow Harvard Computation Lab. 1955–56 Research Mathematician Natl. Bureau of Standards 1956–59 Professor. Lecturer American U., Washington, D.C. Mathematician Oak Ridge National Lab. 1959–63 Professor of Math. & Computer Science Purdue University 1963–2000 Professor Emeritus Purdue University 2000– Visiting Professor Technical Univ. of Munich, Germany 1970–71 Visiting Professor Mathematics Res. Center, Univ. of WI 1976–77 Visiting Professor ETH Zurich 1996–2001 Visiting Professor University of Padova 1997 Visiting Professor University of Basel 2000 1 PROFESSIONAL SOCIETIES AND HONORS Schweizerische Mathematische Gesellschaft American Mathematical Society Mathematical Association of America Society for Industrial and Applied Mathematics Corresponding Member, Bavarian Academy of Sciences, Munich, 2001– Foreign Member, Academy of Sciences, Turin, 2001– SIAM Fellow, Class 2012 Member, Council of the American Mathematical Society, 1975–80, 1984–95 Fulbright Research Scholar, Munich, 1970–71 Listed in Who is Who in the World Listed in the International Biographical Centre’s Top 100 Educators 2009 and in 2000 Outstanding Intellectuals of the 21st Century Listed in S. Gottwald, H.-J. Ilgauds, and K.-H. Schlote, Lexikon bedeutender Mathematiker, 2d ed., Verlag Programm Mathematik, Leipzig, in preparation. RESEARCH INTERESTS Numerical Analysis Constructive Approximation Theory Special Functions Orthogonal Polynomials GENERAL INFORMATION Birthdate: December 11, 1927 Birthplace: Basel, Switzerland Marital Status: Married – Erika Children: 4 Citizenship: USA PUBLICATIONS Books B1. (with H. Bavinck and G. M. Willems) Colloquium approximatietheorie, MC Syllabus 14, Mathematisch Centrum Amsterdam, 1971.
    [Show full text]
  • Thomas Ströhlein's Endgame Tables: a 50Th Anniversary
    Thomas Ströhlein's Endgame Tables: a 50th Anniversary Article Supplemental Material The Festschrift on the 40th Anniversary of the Munich Faculty of Informatics Haworth, G. (2020) Thomas Ströhlein's Endgame Tables: a 50th Anniversary. ICGA Journal, 42 (2-3). pp. 165-170. ISSN 1389-6911 doi: https://doi.org/10.3233/ICG-200151 Available at http://centaur.reading.ac.uk/90000/ It is advisable to refer to the publisher’s version if you intend to cite from the work. See Guidance on citing . Published version at: https://content.iospress.com/articles/icga-journal/icg200151 To link to this article DOI: http://dx.doi.org/10.3233/ICG-200151 Publisher: The International Computer Games Association All outputs in CentAUR are protected by Intellectual Property Rights law, including copyright law. Copyright and IPR is retained by the creators or other copyright holders. Terms and conditions for use of this material are defined in the End User Agreement . www.reading.ac.uk/centaur CentAUR Central Archive at the University of Reading Reading’s research outputs online 40 Jahre Informatik in Munchen:¨ 1967 – 2007 Festschrift Herausgegeben von Friedrich L. Bauer unter Mitwirkung von Helmut Angstl, Uwe Baumgarten, Rudolf Bayer, Hedwig Berghofer, Arndt Bode, Wilfried Brauer, Stephan Braun, Manfred Broy, Roland Bulirsch, Hans-Joachim Bungartz, Herbert Ehler, Jurgen¨ Eickel, Ursula Eschbach, Anton Gerold, Rupert Gnatz, Ulrich Guntzer,¨ Hellmuth Haag, Winfried Hahn (†), Heinz-Gerd Hegering, Ursula Hill-Samelson, Peter Hubwieser, Eike Jessen, Fred Kroger,¨ Hans Kuß, Klaus Lagally, Hans Langmaack, Heinrich Mayer, Ernst Mayr, Gerhard Muller,¨ Heinrich Noth,¨ Manfred Paul, Ulrich Peters, Hartmut Petzold, Walter Proebster, Bernd Radig, Angelika Reiser, Werner Rub,¨ Gerd Sapper, Gunther Schmidt, Fred B.
    [Show full text]
  • Wearable-Based Pedestrian Inertial Navigation with Constraints Based on Biomechanical Models
    Wearable-based pedestrian inertial navigation with constraints based on biomechanical models Dina Bousdar Ahmed∗ and Kai Metzger† ∗ Institute of Communications and Navigation German Aerospace Center (DLR), Munich, Germany Email: [email protected] † Technical University of Munich, Germany Email: kai [email protected] Abstract—Our aim in this paper is to analyze inertial nav- sensor to correct the heading estimation [4]. The combina- igation systems (INSs) from the biomechanical point of view. tion of inertial sensors and WiFi measurements is useful in We wanted to improve the performance of a thigh INS by indoor environments. Chen et al. use the position estimated applying biomechanical constraints. To that end, we propose a biomechanical model of the leg. The latter establishes a through WiFi measurements to correct the position estimates relationship between the orientation of the thigh INS and the of an inertial navigation system [5]. The latter is based on a kinematic motion of the leg. This relationship allows to observe smartphone. the effect that the orientation errors have in the expected motion The detection of known landmarks, e.g. turns, elevators, etc, of the leg. We observe that the errors in the orientation estimation can improve the position estimation. Chen et al. [5] incorporate of an INS translate into incoherent human motion. Based on this analysis, we proposed a modified thigh INS to integrate landmarks to improve the performance of their navigation biomechanical constraints. The results show that the proposed system. Munoz et al. [6] use also landmarks to correct directly system outperforms the thigh INS in 50% regarding distance the heading estimation of a thigh-mounted inertial navigation error and 32% regarding orientation error.
    [Show full text]
  • The Advent of Recursion & Logic in Computer Science
    The Advent of Recursion & Logic in Computer Science MSc Thesis (Afstudeerscriptie) written by Karel Van Oudheusden –alias Edgar G. Daylight (born October 21st, 1977 in Antwerpen, Belgium) under the supervision of Dr Gerard Alberts, and submitted to the Board of Examiners in partial fulfillment of the requirements for the degree of MSc in Logic at the Universiteit van Amsterdam. Date of the public defense: Members of the Thesis Committee: November 17, 2009 Dr Gerard Alberts Prof Dr Krzysztof Apt Prof Dr Dick de Jongh Prof Dr Benedikt Löwe Dr Elizabeth de Mol Dr Leen Torenvliet 1 “We are reaching the stage of development where each new gener- ation of participants is unaware both of their overall technological ancestry and the history of the development of their speciality, and have no past to build upon.” J.A.N. Lee in 1996 [73, p.54] “To many of our colleagues, history is only the study of an irrele- vant past, with no redeeming modern value –a subject without useful scholarship.” J.A.N. Lee [73, p.55] “[E]ven when we can't know the answers, it is important to see the questions. They too form part of our understanding. If you cannot answer them now, you can alert future historians to them.” M.S. Mahoney [76, p.832] “Only do what only you can do.” E.W. Dijkstra [103, p.9] 2 Abstract The history of computer science can be viewed from a number of disciplinary perspectives, ranging from electrical engineering to linguistics. As stressed by the historian Michael Mahoney, different `communities of computing' had their own views towards what could be accomplished with a programmable comput- ing machine.
    [Show full text]
  • Preparation and Investigation of Highly Charged Ions in a Penning Trap for the Determination of Atomic Magnetic Moments
    Preparation and Investigation of Highly Charged Ions in a Penning Trap for the Determination of Atomic Magnetic Moments Präparation und Untersuchung von hochgeladenen Ionen in einer Penning-Falle zur Bestimmung atomarer magnetischer Momente Dissertation approved by the Fachbereich Physik of the Technische Universität Darmstadt in fulfillment of the requirements for the degree of Doctor of Natural Sciences (Dr. rer. nat.) by Dipl.-Phys. Marco Wiesel from Neustadt an der Weinstraße June 2017 — Darmstadt — D 17 Preparation and Investigation of Highly Charged Ions in a Penning Trap for the Determination of Atomic Magnetic Moments Dissertation approved by the Fachbereich Physik of the Technische Universität Darmstadt in fulfillment of the requirements for the degree of Doctor of Natural Sciences (Dr. rer. nat.) by Dipl.-Phys. Marco Wiesel from Neustadt an der Weinstraße 1. Referee: Prof. Dr. rer. nat. Gerhard Birkl 2. Referee: Privatdozent Dr. rer. nat. Wolfgang Quint Submission date: 18.04.2017 Examination date: 24.05.2017 Darmstadt 2017 D 17 Title: The logo of ARTEMIS – AsymmetRic Trap for the measurement of Electron Magnetic moments in IonS. Bitte zitieren Sie dieses Dokument als: URN: urn:nbn:de:tuda-tuprints-62803 URL: http://tuprints.ulb.tu-darmstadt.de/id/eprint/6280 Dieses Dokument wird bereitgestellt von tuprints, E-Publishing-Service der TU Darmstadt http://tuprints.ulb.tu-darmstadt.de [email protected] Die Veröffentlichung steht unter folgender Creative Commons Lizenz: Namensnennung – Keine kommerzielle Nutzung – Keine Bearbeitung 4.0 International https://creativecommons.org/licenses/by-nc-nd/4.0/ Abstract The ARTEMIS experiment aims at measuring magnetic moments of electrons bound in highly charged ions that are stored in a Penning trap.
    [Show full text]
  • Konrad Zuse Und Die Schweiz
    Research Collection Report Konrad Zuse und die Schweiz Relaisrechner Z4 an der ETH Zürich : Rechenlocher M9 für die Schweizer Remington Rand : Eigenbau des Röhrenrechners ERMETH : Zeitzeugenbericht zur Z4 : unbekannte Dokumente zur M9 : ein Beitrag zu den Anfängen der Schweizer Informatikgeschichte Author(s): Bruderer, Herbert Publication Date: 2011 Permanent Link: https://doi.org/10.3929/ethz-a-006517565 Rights / License: In Copyright - Non-Commercial Use Permitted This page was generated automatically upon download from the ETH Zurich Research Collection. For more information please consult the Terms of use. ETH Library Konrad Zuse und die Schweiz Relaisrechner Z4 an der ETH Zürich Rechenlocher M9 für die Schweizer Remington Rand Eigenbau des Röhrenrechners ERMETH Zeitzeugenbericht zur Z4 Unbekannte Dokumente zur M9 Ein Beitrag zu den Anfängen der Schweizer Informatikgeschichte Herbert Bruderer ETH Zürich Departement Informatik Professur für Informationstechnologie und Ausbildung Zürich, Juli 2011 Adresse des Verfassers: Herbert Bruderer ETH Zürich Informationstechnologie und Ausbildung CAB F 14 Universitätsstrasse 6 CH-8092 Zürich Telefon: +41 44 632 73 83 Telefax: +41 44 632 13 90 [email protected] www.ite.ethz.ch privat: Herbert Bruderer Bruderer Informatik Seehaldenstrasse 26 Postfach 47 CH-9401 Rorschach Telefon: +41 71 855 77 11 Telefax: +41 71 855 72 11 [email protected] Titelbild: Relaisschränke der Z4 (links: Heinz Rutishauser, rechts: Ambros Speiser), ETH Zürich 1950, © ETH-Bibliothek Zürich, Bildarchiv Bild 4. Umschlagseite: Verabschiedungsrede von Konrad Zuse an der Z4 am 6. Juli 1950 in der Zuse KG in Neukirchen (Kreis Hünfeld) © Privatarchiv Horst Zuse, Berlin Eidgenössische Technische Hochschule Zürich Departement Informatik Professur für Informationstechnologie und Ausbildung CH-8092 Zürich www.abz.inf.ethz.ch 1.
    [Show full text]
  • Edsger W. Dijkstra: a Commemoration
    Edsger W. Dijkstra: a Commemoration Krzysztof R. Apt1 and Tony Hoare2 (editors) 1 CWI, Amsterdam, The Netherlands and MIMUW, University of Warsaw, Poland 2 Department of Computer Science and Technology, University of Cambridge and Microsoft Research Ltd, Cambridge, UK Abstract This article is a multiauthored portrait of Edsger Wybe Dijkstra that consists of testimo- nials written by several friends, colleagues, and students of his. It provides unique insights into his personality, working style and habits, and his influence on other computer scientists, as a researcher, teacher, and mentor. Contents Preface 3 Tony Hoare 4 Donald Knuth 9 Christian Lengauer 11 K. Mani Chandy 13 Eric C.R. Hehner 15 Mark Scheevel 17 Krzysztof R. Apt 18 arXiv:2104.03392v1 [cs.GL] 7 Apr 2021 Niklaus Wirth 20 Lex Bijlsma 23 Manfred Broy 24 David Gries 26 Ted Herman 28 Alain J. Martin 29 J Strother Moore 31 Vladimir Lifschitz 33 Wim H. Hesselink 34 1 Hamilton Richards 36 Ken Calvert 38 David Naumann 40 David Turner 42 J.R. Rao 44 Jayadev Misra 47 Rajeev Joshi 50 Maarten van Emden 52 Two Tuesday Afternoon Clubs 54 2 Preface Edsger Dijkstra was perhaps the best known, and certainly the most discussed, computer scientist of the seventies and eighties. We both knew Dijkstra |though each of us in different ways| and we both were aware that his influence on computer science was not limited to his pioneering software projects and research articles. He interacted with his colleagues by way of numerous discussions, extensive letter correspondence, and hundreds of so-called EWD reports that he used to send to a select group of researchers.
    [Show full text]
  • Early Life: 1924–1945
    An interview with FRITZ BAUER Conducted by Ulf Hashagen on 21 and 26 July, 2004, at the Technische Universität München. Interview conducted by the Society for Industrial and Applied Mathematics, as part of grant # DE-FG02-01ER25547 awarded by the US Department of Energy. Transcript and original tapes donated to the Computer History Museum by the Society for Industrial and Applied Mathematics © Computer History Museum Mountain View, California ABSTRACT: Professor Friedrich L. Bauer describes his career in physics, computing, and numerical analysis. Professor Bauer was born in Thaldorf, Germany near Kelheim. After his schooling in Thaldorf and Pfarrkirchen, he received his baccalaureate at the Albertinium, a boarding school in Munich. He then faced the draft into the German Army, serving first in the German labor service. After training in France and a deployment to the Eastern Front in Kursk, he was sent to officer's school. His reserve unit was captured in the Ruhr Valley in 1945 during the American advance. He returned to Pfarrkirchen in September 1945 and in spring of 1946 enrolled in mathematics and physics at the Ludwig-Maximilians-Universitäat, München. He studied mathematics with Oscar Perron and Heinrich Tietze and physics with Arnold Sommerfeld and Paul August Mann. He was offered a full assistantship with Fritz Bopp and finished his Ph.D. in 1951 writing on group representations in particle physics. He then joined a group in Munich led by a professor of mathematics Robert Sauer and the electrical engineer Hans Piloty, working with a colleague Klaus Samelson on the design of the PERM, a computer based in part on the Whirlwind concept.
    [Show full text]
  • Milestones in Analog and Digital Computing
    Milestones in Analog and Digital Computing Contributions to the History of Mathematics and Information Technology by Herbert Bruderer Numerous recent discoveries of rare historical analog and digital calculators and previously unknown texts, drawings, and pictures from Germany, Austria, Switzerland, Liechtenstein, and France. Worldwide, multilingual bibliography regarding the history of computer science with over 3000 entries. 12 step-by-step set of instructions for the operation of historical analog and digital calculating devices. 75 comparative overviews in tabular form. 200 illustrations. 20 comprehensive lists. 7 timelines of computer history. Published by de Gruyter Oldenbourg. Berlin/Boston 2015, xxxii, 820 pages, 119.95 Euro. During the 1970's mechanical calculating instruments and machines suddenly disappeared from the scene. They were replaced by electronic versions. Most of these devices developed since the 17th century – often very clever constructions – have been forgotten. Who can imagine today how difficult calculation was only a few decades ago? This book introduces the reader to selected milestones from prehistory and early history of computing. The Antikythera Mechanism This puzzling device was made around 200 BC. It was discovered around 1900 by divers off the Greek island of Antikythera. It is believed to be the oldest known analog (or rather hybrid) computing device. Numerous replicas have been built to unravel the mysteries of this calendar calculator. It is suspected that the machine came from the school of Archimedes. 1 Androids, Music Boxes, Chess Automatons, Looms This treatise also explores topics related to computing technology: automated human and animal figures, mecha- nized musical instruments, music boxes, as well as punched tape controlled looms and typewriters.
    [Show full text]
  • Methods of Conjugate Gradients for Solving Linear Systems
    Methods of Conjugate Gradients for Solving Linear Systems The advent of electronic computers in the middle of systematic way in order to compute the solution. These the 20th century stimulated a flurry of activity in devel- methods were finite, but required a rather large amount oping numerical algorithms that could be applied to of computational effort with work growing as the cube computational problems much more difficult than those of the number of unknowns. The second type of al- solved in the past. The work described in this paper [1] gorithm used “relaxation techniques” to develop a se- was done at the Institute for Numerical Analysis, a quence of iterates converging to the solution. Although part of NBS on the campus of UCLA [2]. This institute convergence was often slow, these algorithms could be was an incredibly fertile environment for the develop- terminated, often with a reasonably accurate solution ment of algorithms that might exploit the potential estimate, whenever the human “computers” ran out of of these new automatic computing engines, especially time. algorithms for the solution of linear systems and matrix The ideal algorithm would be one that had finite eigenvalue problems. Some of these algorithms are termination but, if stopped early, would give a useful classified today under the term Krylov Subspace approximate solution. Hestenes and Stiefel succeeded in Iteration, and this paper describes the first of these developing an algorithm with exactly these characteris- methods to solve linear systems. tics, the method of conjugate gradients. Magnus Hestenes was a faculty member at UCLA The algorithm itself is beautiful, with deep connec- who became associated with this Institute, and Eduard tions to optimization theory, the Pad table, and quadratic Stiefel was a visitor from the Eidgeno¨ssischen Technis- forms.
    [Show full text]
  • A Static Analysis Framework for Security Properties in Mobile and Cryptographic Systems
    A Static Analysis Framework for Security Properties in Mobile and Cryptographic Systems Benyamin Y. Y. Aziz, M.Sc. School of Computing, Dublin City University A thesis presented in fulfillment of the requirements for the degree of Doctor of Philosophy Supervisor: Dr Geoff Hamilton September 2003 “Start by doing what’s necessary; then do what’s possible; and suddenly you are doing the impossible” St. Francis of Assisi To Yowell, Olivia and Clotilde Declaration I hereby certify that this material, which I now submit for assessment on the programme of study leading to the award of the degree of Doctor of Philosophy (Ph.D.) is entirely my own work and has not been taken from the work of others save and to the extent that such work has been cited and acknowledged within the text of my work. Signed: I.D. No.: Date: Acknowledgements I would like to thank all those people who were true sources of inspiration, knowledge, guidance and help to myself throughout the period of my doctoral research. In particular, I would like to thank my supervisor, Dr. Geoff Hamilton, without whom this work would not have seen the light. I would also like to thank Dr. David Gray, with whom I had many informative conversations, and my colleagues, Thomas Hack and Fr´ed´ericOehl, for their advice and guidance. Finally, I would like to mention that the work of this thesis was partially funded by project IMPROVE (Enterprise Ireland Strategic Grant ST/2000/94). Benyamin Aziz Abstract We introduce a static analysis framework for detecting instances of security breaches in infinite mobile and cryptographic systems specified using the languages of the π-calculus and its cryptographic extension, the spi calculus.
    [Show full text]
  • Die Gruncllehren Cler Mathematischen Wissenschaften
    Die Gruncllehren cler mathematischen Wissenschaften in Einzeldarstellungen mit besonderer Beriicksichtigung der Anwendungsgebiete Band 135 Herausgegeben von J. L. Doob . E. Heinz· F. Hirzebruch . E. Hopf . H. Hopf W. Maak . S. Mac Lane • W. Magnus. D. Mumford M. M. Postnikov . F. K. Schmidt· D. S. Scott· K. Stein Geschiiftsfiihrende Herausgeber B. Eckmann und B. L. van der Waerden Handbook for Automatic Computation Edited by F. L. Bauer· A. S. Householder· F. W. J. Olver H. Rutishauser . K. Samelson· E. Stiefel Volume I . Part a Heinz Rutishauser Description of ALGOL 60 Springer-Verlag New York Inc. 1967 Prof. Dr. H. Rutishauser Eidgenossische Technische Hochschule Zurich Geschaftsfuhrende Herausgeber: Prof. Dr. B. Eckmann Eidgenossische Tecbnische Hocbscbule Zurich Prof. Dr. B. L. van der Waerden Matbematisches Institut der Universitat ZUrich Aile Rechte, insbesondere das der Obersetzung in fremde Spracben, vorbebalten Ohne ausdriickliche Genehmigung des Verlages ist es auch nicht gestattet, dieses Buch oder Teile daraus auf photomechaniscbem Wege (Photokopie, Mikrokopie) oder auf andere Art zu vervielfaltigen ISBN-13: 978-3-642-86936-5 e-ISBN-13: 978-3-642-86934-1 DOl: 10.1007/978-3-642-86934-1 © by Springer-Verlag Berlin· Heidelberg 1967 Softcover reprint of the hardcover 1st edition 1%7 Library of Congress Catalog Card Number 67-13537 Titel-Nr. 5l1B Preface Automatic computing has undergone drastic changes since the pioneering days of the early Fifties, one of the most obvious being that today the majority of computer programs are no longer written in machine code but in some programming language like FORTRAN or ALGOL. However, as desirable as the time-saving achieved in this way may be, still a high proportion of the preparatory work must be attributed to activities such as error estimates, stability investigations and the like, and for these no programming aid whatsoever can be of help.
    [Show full text]