DOCSLIB.ORG

Parareal Algorithm Implementation and Simulation in Julia

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Parareal Algorithm Implementation and Simulation in Julia Parareal Algorithm Implementation and Simulation in Julia Tyler M. Masthay Saverio Perugini The Institute for Computational Engineering and Sciences Department of Computer Science The University of Texas at Austin University of Dayton Austin, Texas Dayton, Ohio [email protected] [email protected] ABSTRACT either synchronous or asynchronous, and can be typed. However, if We present a full implementation of the parareal algorithm—an no type is specified in the definition of a channel, then values ofany integration technique to solve differential equations in parallel— type can be written to that channel, much like unix pipes. Messages in the Julia programming language for a fully general, first-order, are passed between coroutines through channels with the put! and initial-value problem. We provide a brief overview of Julia—a con- take!() functions. To add tasks to be automatically scheduled, use current programming language for scientific computing. Our im- the schedule() function, or the @schedule and @sync macros. Of plementation of the parareal algorithm accepts both coarse and fine course, coroutines have little overhead, but will always run on the integrators as functional arguments. We use Euler’s method and same cpu. another Runge-Kutta integration technique as the integrators in our The current version of Julia multiplexes all tasks onto experiments. We also present a simulation of the algorithm for pur- a single os thread. Thus, while tasks involving i/o poses of pedagogy and as a tool for investigating the performance operations benefit from parallel execution, compute of the algorithm. bound tasks are effectively executed sequentially on a single os thread. Future versions of Julia may sup- KEYWORDS port scheduling of tasks on multiple threads, in which Concurrent programming, Euler’s method, Julia, Runge-Kutta meth- case compute bound tasks will see benefits of parallel ods, parareal algorithm, ordinary differential equations. execution too[2]. 1 INTRODUCTION 2.2 Parallel Computing In addition to tasks, Julia supports parallel computing—functions The parareal algorithm was first proposed in 2001 by Lions, Ma- running on multiple cpus or distributed computers. New processes day, and Turinici [6] as an integration technique to solve differ- are spawned with addproc(<n>), where <n> is the number of ential equations in parallel. We present a full implementation of processes desired. The function addproc returns the pids of the the parareal algorithm in the Julia programming language (https: created processes. The function workers returns a list of the pro- //julialang.org) [7] for a fully general, first-order, initial-value prob- cesses. Alternatively, the Julia interpreter can be started with the lem. Furthermore, we present a simulation of the algorithm for -p <n> option, where <n> is the number of processes desired. For purposes of pedagogy and as a tool for investigating the perfor- instance: mance of the algorithm. Our implementation accepts both coarse and fine integrators as functional arguments. We use Euler’s method $ j u l i a and another Runge-Kutta integration technique as the integrators julia> addprocs(3) in our experiments. We start with a brief introduction to the Julia 3− element Array{Int64 ,1}: programming language. 2 2 AN INTRODUCTION TO JULIA: DYNAMIC, 3 YET EFFICIENT, SCIENTIFIC/NUMERICAL 4 arXiv:1706.08569v2 [cs.MS] 13 Dec 2018 PROGRAMMING julia> workers() Julia is a multi-paradigm language designed for scientific comput- 3− element Array{Int64 ,1}: ing; it supports multidimensional arrays, concurrency, and metapro- 2 gramming. Due to both Julia’s LLVM-based Just-In-Time com- 3 piler and the language design, Julia programs run computation- ally efficient—approaching and sometimes matching the speed of 4 languages like C. See [1] for a graph depicting the relative perfor- mance of Julia compared to other common languages for scientific ^D computing on a set of micro-benchmarks. $ $ j u l i a −p 3 2.1 Coroutines and Channels in Julia julia> workers() Coroutines are typically referred to as tasks in Julia, and are not 3− element Array{Int64 ,1}: scheduled to run on separate CPU cores. Channels in Julia can be 2 T.M. Masthay & S. Perugini 3 4 ^D $ Note that the process ids start at 2 because the Julia REPL shell is process 1. Processes in Julia, which are either locally running or remotely distributed, communicate with each other through message passing. The function remotecall(<Function>, <ProcessID>, <args ... >) executes <Function> on worker <ProcessID> and returns a value of the Future type, which contains a reference to a location from which the return value can be retrieved, once <Function> has completed its execution. The Future value can be extracted with the function fetch(), which blocks until the result is available. Thus, the function remotecall is used to send a Figure 1: Right endpoint error. message while the function fetch is used to receive a message. For instance: e l s e julia> addprocs(2) x = @spawn fib_parallel(n −1) julia> future = remotecall( sqrt , 2 , 4 ) y = fib_parallel(n −2) Future(2,1,3,Nullable{Any}()) return f e t c h ( x ) + y julia> fetch(future) end 2 . 0 end After the function remotecall is run, the worker process simply julia> @time fib(42) remotecall waits for the next call to . 2.271563 seconds (793 allocations: 40.718 KB) julia> counter1 = new_counter(3) 267914296 (::#1) (generic function with 1 method) julia> @time fib_parallel(42) julia> future = remotecall(counter1 , 2) 3.483601 seconds (344.48 k allocations: Future(2,1,23,Nullable{Any}()) 15.344 MB, 0.25 % gc time ) julia> fetch(future) There are also remote channels which are writable for more control 4 over synchronizing processes. The Julia macro @spawn simplifies this message-passing protocol for the programmer and obviates the need for explicit use of the 2.3 Multidimensional Arrays low-level remotecall function. Similarly, the macro @parallel Julia supports multidimensional arrays, an important data structure can be used to run each iteration of a (for) loop in its own process. in scientific computing applications, with a simple syntax and their julia> future = @spawn sqrt ( 4 ) efficient creation and interpretation over many dimensions [4]. The julia> fetch(future) function call ArrayType(<dimensions>) creates an array, where 2 . 0 the nth argument in <dimensions> specifies the size of the nth julia> addprocs(2) dimension of the array. Similarly, the programmer manipulates 2− element Array{Int64 ,1}: these arrays using function calls that support infinite-dimensional 3 arrays given only limitations on computational time. In summary, Julia incorporates concepts and mechanisms— 4 particularly concurrency and multidimensional arrays—which sup- julia > @everywhere function f i b ( n ) port efficient scientific computing. i f ( n < 2 ) return n 3 THE PARAREAL ALGORITHM e l s e The parareal algorithm is designed to perform parallel-in-time in- return f i b ( n −1) + f i b ( n −2) tegration for a first-order initial-value problem. The algorithm in- end volves two integration techniques, often known as the ‘coarse’ end integrator and the ‘fine’ integrator. For the algorithm to be effective, julia > @everywhere function fib_parallel(n) the coarse integrator must be of substantially lower computational i f ( n < 3 5 ) cost than the fine integrator. The reason will become apparent later return f i b ( n ) in this section. Consider the differential equation (1) given by Parareal Algorithm Implementation and Simulation in Julia if fine integration were simply done sequentially. Thus, each k de- y0¹tº = f ¹t;y¹tºº t 2 »a;b¼ (1) notes fine integration over the whole interval. This means thatthe total computation performed is much greater than if fine integra- with its associated initial-value problem (2) tion were performed sequentially. However, the time efficiency of ∗ ∗ ∗ y¹t º = y t 2 »a;b¼: (2) each iteration has the potential to be improved through concur- For simplicity, let us assume t∗ = a, so that the solution only ex- rency. Since fine integration is more computationally intensive, this tends rightward. To obtain an approximate solution to equation (1) improvement in the run-time efficiency may compensate for the satisfying the initial condition (2), we partition our domain into cumulative computation performed. Let K be the total number of iterations necessary to achieve a »t0 = a; :::; tN = b¼ with uniform step size ∆. We now precisely define an ‘integrator’ as a function from ¹0; 1º × R2 × R to R where desired accuracy of solution and P be the number of subintervals R is the set of all Riemann integrable functions. For example, the into which we divide according to the coarse integrator. If K = integrator I given by 1, then we achieve perfect parallel efficiency. If K = P, then we likely slowed the computation down. The parareal algorithm is I¹δ; x0;y0;дº = y0 + д¹x0;y0ºδ guaranteed to converge to the solution given by the sequential is the integrator corresponding to Euler’s method with step size δ. fine integrator within P iterations. For a more complete treatment Let C and F be the coarse and fine integrators, respectively. Define of this convergence analysis, we refer the reader to [5]. For fully general pseudocode, we refer the reader to [3, 8]. ∗ y0;1 = y¹t0º = y yn+1;1 = y¹tn+1º = C¹∆; tn;yn;1; f º: 4 PARAREAL ALGORITHM Sinceyn+1;1 depends onyn;1, this algorithm is inherently sequential. IMPLEMENTATION IN JULIA 0 m M Partition »tn; tn+1¼ into ftn = tn; :::; tn ; :::tn = tn+1g with uniform Listing 1 presents an implementation of the parareal algorithm step size δ < ∆. Define (from the prior section) in Julia. The @async macro within the loop causes the program to evaluate the first expression to its right as z0 = y¹t0 º = y n;1 n n;1 a concurrent task (i.e., the for loop assigning values to sub).
Load more

Recommended publications
  • Ordinary Differential Equations (ODE) Using Euler's Technique And
    Mathematical Models and Methods in Modern Science Ordinary Differential Equations (ODE) using Euler’s Technique and SCILAB Programming ZULZAMRI SALLEH Applied Sciences and Advance Technology Universiti Kuala Lumpur Malaysian Institute of Marine Engineering Technology Bandar Teknologi Maritim Jalan Pantai Remis 32200 Lumut, Perak MALAYSIA [email protected] http://www.mimet.edu.my Abstract: - Mathematics is very important for the engineering and scientist but to make understand the mathematics is very difficult if without proper tools and suitable measurement. A numerical method is one of the algorithms which involved with computer programming. In this paper, Scilab is used to carter the problems related the mathematical models such as Matrices, operation with ODE’s and solving the Integration. It remains true that solutions of the vast majority of first order initial value problems cannot be found by analytical means. Therefore, it is important to be able to approach the problem in other ways. Today there are numerous methods that produce numerical approximations to solutions of differential equations. Here, we introduce the oldest and simplest such method, originated by Euler about 1768. It is called the tangent line method or the Euler method. It uses a fixed step size h and generates the approximate solution. The purpose of this paper is to show the details of implementing of Euler’s method and made comparison between modify Euler’s and exact value by integration solution, as well as solve the ODE’s use built-in functions available in Scilab programming. Key-Words: - Numerical Methods, Scilab programming, Euler methods, Ordinary Differential Equation. 1 Introduction availability of digital computers has led to a Numerical methods are techniques by which veritable explosion in the use and development of mathematical problems are formulated so that they numerical methods [1].
    [Show full text]
  • Numerical Methods for Ordinary Differential Equations
    CHAPTER 1 Numerical Methods for Ordinary Differential Equations In this chapter we discuss numerical method for ODE . We will discuss the two basic methods, Euler’s Method and Runge-Kutta Method. 1. Numerical Algorithm and Programming in Mathcad 1.1. Numerical Algorithm. If you look at dictionary, you will the following definition for algorithm, 1. a set of rules for solving a problem in a finite number of steps; 2. a sequence of steps designed for programming a computer to solve a specific problem. A numerical algorithm is a set of rules for solving a problem in finite number of steps that can be easily implemented in computer using any programming language. The following is an algorithm for compute the root of f(x) = 0; Input f, a, N and tol . Output: the approximate solution to f(x) = 0 with initial guess a or failure message. ² Step One: Set x = a ² Step Two: For i=0 to N do Step Three - Four f(x) Step Three: Compute x = x ¡ f 0(x) Step Four: If f(x) · tol return x ² Step Five return ”failure”. In analogy, a numerical algorithm is like a cook recipe that specify the input — cooking material, the output—the cooking product, and steps of carrying computation — cooking steps. In an algorithm, you will see loops (for, while), decision making statements(if, then, else(otherwise)) and return statements. ² for loop: Typically used when specific number of steps need to be carried out. You can break a for loop with return or break statement. 1 2 1. NUMERICAL METHODS FOR ORDINARY DIFFERENTIAL EQUATIONS ² while loop: Typically used when unknown number of steps need to be carried out.
    [Show full text]
  • Getting Started with Euler
    Getting started with Euler Samuel Fux High Performance Computing Group, Scientific IT Services, ETH Zurich ETH Zürich | Scientific IT Services | HPC Group Samuel Fux | 19.02.2020 | 1 Outlook . Introduction . Accessing the cluster . Data management . Environment/LMOD modules . Using the batch system . Applications . Getting help ETH Zürich | Scientific IT Services | HPC Group Samuel Fux | 19.02.2020 | 2 Outlook . Introduction . Accessing the cluster . Data management . Environment/LMOD modules . Using the batch system . Applications . Getting help ETH Zürich | Scientific IT Services | HPC Group Samuel Fux | 19.02.2020 | 3 Intro > What is EULER? . EULER stands for . Erweiterbarer, Umweltfreundlicher, Leistungsfähiger ETH Rechner . It is the 5th central (shared) cluster of ETH . 1999–2007 Asgard ➔ decommissioned . 2004–2008 Hreidar ➔ integrated into Brutus . 2005–2008 Gonzales ➔ integrated into Brutus . 2007–2016 Brutus . 2014–2020+ Euler . It benefits from the 15 years of experience gained with those previous large clusters ETH Zürich | Scientific IT Services | HPC Group Samuel Fux | 19.02.2020 | 4 Intro > Shareholder model . Like its predecessors, Euler has been financed (for the most part) by its users . So far, over 100 (!) research groups from almost all departments of ETH have invested in Euler . These so-called “shareholders” receive a share of the cluster’s resources (processors, memory, storage) proportional to their investment . The small share of Euler financed by IT Services is open to all members of ETH . The only requirement
    [Show full text]
  • Freemat V3.6 Documentation
    FreeMat v3.6 Documentation Samit Basu November 16, 2008 2 Contents 1 Introduction and Getting Started 5 1.1 INSTALL Installing FreeMat . 5 1.1.1 General Instructions . 5 1.1.2 Linux . 5 1.1.3 Windows . 6 1.1.4 Mac OS X . 6 1.1.5 Source Code . 6 2 Variables and Arrays 7 2.1 CELL Cell Array Definitions . 7 2.1.1 Usage . 7 2.1.2 Examples . 7 2.2 Function Handles . 8 2.2.1 Usage . 8 2.3 GLOBAL Global Variables . 8 2.3.1 Usage . 8 2.3.2 Example . 9 2.4 INDEXING Indexing Expressions . 9 2.4.1 Usage . 9 2.4.2 Array Indexing . 9 2.4.3 Cell Indexing . 13 2.4.4 Structure Indexing . 14 2.4.5 Complex Indexing . 16 2.5 MATRIX Matrix Definitions . 17 2.5.1 Usage . 17 2.5.2 Examples . 17 2.6 PERSISTENT Persistent Variables . 19 2.6.1 Usage . 19 2.6.2 Example . 19 2.7 STRING String Arrays . 20 2.7.1 Usage . 20 2.8 STRUCT Structure Array Constructor . 22 2.8.1 Usage . 22 2.8.2 Example . 22 3 4 CONTENTS 3 Functions and Scripts 25 3.1 ANONYMOUS Anonymous Functions . 25 3.1.1 Usage . 25 3.1.2 Examples . 25 3.2 FUNCTION Function Declarations . 26 3.2.1 Usage . 26 3.2.2 Examples . 28 3.3 KEYWORDS Function Keywords . 30 3.3.1 Usage . 30 3.3.2 Example . 31 3.4 NARGIN Number of Input Arguments . 32 3.4.1 Usage .
    [Show full text]
  • A Case Study in Fitting Area-Proportional Euler Diagrams with Ellipses Using Eulerr
    A Case Study in Fitting Area-Proportional Euler Diagrams with Ellipses using eulerr Johan Larsson and Peter Gustafsson Department of Statistics, School of Economics and Management, Lund University, Lund, Sweden [email protected] [email protected] Abstract. Euler diagrams are common and user-friendly visualizations for set relationships. Most Euler diagrams use circles, but circles do not always yield accurate diagrams. A promising alternative is ellipses, which, in theory, enable accurate diagrams for a wider range of input. Elliptical diagrams, however, have not yet been implemented for more than three sets or three-set diagrams where there are disjoint or subset relationships. The aim of this paper is to present eulerr: a software package for elliptical Euler diagrams for, in theory, any number of sets. It fits Euler diagrams using numerical optimization and exact-area algorithms through a two-step procedure, first generating an initial layout using pairwise relationships and then finalizing this layout using all set relationships. 1 Background The Euler diagram, first described by Leonard Euler in 1802 [1], is a generalization of the popular Venn diagram. Venn and Euler diagrams both visualize set relationships by mapping areas in the diagram to relationships in the data. They differ, however, in that Venn diagrams require all intersections to be present| even if they are empty|whilst Euler diagrams do not, which means that Euler diagrams lend themselves well to be area-proportional. Euler diagrams may be fashioned out of any closed shape, and have been implemented for triangles [2], rectangles [2], ellipses [3], smooth curves [4], poly- gons [2], and circles [5, 2].
    [Show full text]
  • The Python Interpreter
    The Python interpreter Remi Lehe Lawrence Berkeley National Laboratory (LBNL) US Particle Accelerator School (USPAS) Summer Session Self-Consistent Simulations of Beam and Plasma Systems S. M. Lund, J.-L. Vay, R. Lehe & D. Winklehner Colorado State U, Ft. Collins, CO, 13-17 June, 2016 Python interpreter: Outline 1 Overview of the Python language 2 Python, numpy and matplotlib 3 Reusing code: functions, modules, classes 4 Faster computation: Forthon Overview Scientific Python Reusing code Forthon Overview of the Python programming language Interpreted language (i.e. not compiled) ! Interactive, but not optimal for computational speed Readable and non-verbose No need to declare variables Indentation is enforced Free and open-source + Large community of open-souce packages Well adapted for scientific and data analysis applications Many excellent packages, esp. numerical computation (numpy), scientific applications (scipy), plotting (matplotlib), data analysis (pandas, scikit-learn) 3 Overview Scientific Python Reusing code Forthon Interfaces to the Python language Scripting Interactive shell Code written in a file, with a Obtained by typing python or text editor (gedit, vi, emacs) (better) ipython Execution via command line Commands are typed in and (python + filename) executed one by one Convenient for exploratory work, Convenient for long-term code debugging, rapid feedback, etc... 4 Overview Scientific Python Reusing code Forthon Interfaces to the Python language IPython (a.k.a Jupyter) notebook Notebook interface, similar to Mathematica. Intermediate between scripting and interactive shell, through reusable cells Obtained by typing jupyter notebook, opens in your web browser Convenient for exploratory work, scientific analysis and reports 5 Overview Scientific Python Reusing code Forthon Overview of the Python language This lecture Reminder of the main points of the Scipy lecture notes through an example problem.
    [Show full text]
  • Freemat V4.0 Documentation
    FreeMat v4.0 Documentation Samit Basu October 4, 2009 2 Contents 1 Introduction and Getting Started 39 1.1 INSTALL Installing FreeMat . 39 1.1.1 General Instructions . 39 1.1.2 Linux . 39 1.1.3 Windows . 40 1.1.4 Mac OS X . 40 1.1.5 Source Code . 40 2 Variables and Arrays 41 2.1 CELL Cell Array Definitions . 41 2.1.1 Usage . 41 2.1.2 Examples . 41 2.2 Function Handles . 42 2.2.1 Usage . 42 2.3 GLOBAL Global Variables . 42 2.3.1 Usage . 42 2.3.2 Example . 42 2.4 INDEXING Indexing Expressions . 43 2.4.1 Usage . 43 2.4.2 Array Indexing . 43 2.4.3 Cell Indexing . 46 2.4.4 Structure Indexing . 47 2.4.5 Complex Indexing . 49 2.5 MATRIX Matrix Definitions . 49 2.5.1 Usage . 49 2.5.2 Examples . 49 2.6 PERSISTENT Persistent Variables . 51 2.6.1 Usage . 51 2.6.2 Example . 51 2.7 STRUCT Structure Array Constructor . 51 2.7.1 Usage . 51 2.7.2 Example . 52 3 4 CONTENTS 3 Functions and Scripts 55 3.1 ANONYMOUS Anonymous Functions . 55 3.1.1 Usage . 55 3.1.2 Examples . 55 3.2 FUNCTION Function Declarations . 56 3.2.1 Usage . 56 3.2.2 Examples . 57 3.3 KEYWORDS Function Keywords . 60 3.3.1 Usage . 60 3.3.2 Example . 60 3.4 NARGIN Number of Input Arguments . 61 3.4.1 Usage . 61 3.4.2 Example . 61 3.5 NARGOUT Number of Output Arguments .
    [Show full text]
  • MATHCAD's PROGRAM FUNCTION and APPLICATION in TEACHING of MATH
    MATHCAD'S PROGRAM FUNCTION and APPLICATION IN TEACHING OF MATH DE TING WU Depart of Math Morehouse College Atlanta, GA.30314, USA [email protected] 1. Introduction 1.1 About Mathcad Mathcad is one of popular computer algebra system (math software) in the world. Like other CAS's, it has the capabilities to perform algebraic operations, calculus operations and draw graph of 2 or 3 dimensions. We can use it to get numerical, symbolic and graphic solution of math problem. Besides above common capabilities, it has some feature: its words processor function is better than other CAS. This feature makes it look like a scientifical words processor and it easy to create a woksheet. Following current trend to add program function to math software, it added program function to itself , started in Mathcad V7. This improvement makes its function more complete and more powerful. 1.2 Role of program function in teac hing of Math. Without doubt, math softwares and technology are helpful aide in teaching of Math. They are effecting the teaching of Math profoundly and it can be expected the emerging newer technologies will penetrate and reconfigure the teaching of Math. The program function is a new function of math software. It is natural we want to know whether or not it is useful in teaching of Math? I think: although for most problems we meet in teaching of Math it is enough to use computation ability, in certain cases the program function becomes necessary and very helpful. For example, for Numerical Analysis the program function is very useful but for Abstract Algebra it is less necessary.
    [Show full text]
  • Programming for Computations – Python
    15 Svein Linge · Hans Petter Langtangen Programming for Computations – Python Editorial Board T. J.Barth M.Griebel D.E.Keyes R.M.Nieminen D.Roose T.Schlick Texts in Computational 15 Science and Engineering Editors Timothy J. Barth Michael Griebel David E. Keyes Risto M. Nieminen Dirk Roose Tamar Schlick More information about this series at http://www.springer.com/series/5151 Svein Linge Hans Petter Langtangen Programming for Computations – Python A Gentle Introduction to Numerical Simulations with Python Svein Linge Hans Petter Langtangen Department of Process, Energy and Simula Research Laboratory Environmental Technology Lysaker, Norway University College of Southeast Norway Porsgrunn, Norway On leave from: Department of Informatics University of Oslo Oslo, Norway ISSN 1611-0994 Texts in Computational Science and Engineering ISBN 978-3-319-32427-2 ISBN 978-3-319-32428-9 (eBook) DOI 10.1007/978-3-319-32428-9 Springer Heidelberg Dordrecht London New York Library of Congress Control Number: 2016945368 Mathematic Subject Classification (2010): 26-01, 34A05, 34A30, 34A34, 39-01, 40-01, 65D15, 65D25, 65D30, 68-01, 68N01, 68N19, 68N30, 70-01, 92D25, 97-04, 97U50 © The Editor(s) (if applicable) and the Author(s) 2016 This book is published open access. Open Access This book is distributed under the terms of the Creative Commons Attribution-Non- Commercial 4.0 International License (http://creativecommons.org/licenses/by-nc/4.0/), which permits any noncommercial use, duplication, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, a link is provided to the Creative Commons license and any changes made are indicated.
    [Show full text]
  • CAS Maxima Workbook
    CAS Maxima Workbook Roland Salz January 7, 2021 Vers. 0.3.6 This work is published under the terms of the Creative Commons (CC) BY-NC-ND 4.0 license. You are free to: Share — copy and redistribute the material in any medium or format Under the following terms: Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use. NonCommercial — You may not use the material for commercial purposes. NoDerivatives — If you remix, transform, or build upon the material, you may not distribute the modified material. No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits. As an exception to the above stated terms, the Maxima team is free to incorporate any material from this work into the official Maxima manual, and to remix, transform, or build upon this material within the official Maxima manual, to be published under its own license terms. No attribution is required in this case. Copyright © Roland Salz 2018-2021 No warranty whatsoever is given for the correctness or completeness of the information provided. Maple, Mathematica, Windows, and YouTube are registered trademarks. This project is work in progress. Comments and suggestions for improvement are welcome. Roland Salz Braunsberger Str. 26 D-44809 Bochum [email protected] i In some cases the objective is clear, and the results are surprising. Richard J. Fateman ii Preface Maxima was developed from 1968-1982 at MIT (Massachusetts Institute of Tech- nology) as the first comprehensive computer algebra system (CAS).
    [Show full text]
  • Application of the Maxima in the Teaching of Science Subjects at Different Levels of Knowledge
    Advances in Science and Technology Research Journal Volume 8, No. 24, Dec. 2014, pages 44–50 Original Article DOI: 10.12913/22998624/566 APPLICATION OF THE MAXIMA IN THE TEACHING OF SCIENCE SUBJECTS AT DIFFERENT LEVELS OF KNOWLEDGE Anna Makarewicz1 1 Department of Applied Mathematics, Lublin University of Technology, Nadbystrzycka 38, 20-618 Lublin, Poland, e-mail: [email protected] Received: 2014.10.18 ABSTRACT Accepted: 2014.11.12 In this paper I present a program Maxima, which is one of the best computer algebra Published: 2014.12.01 system (CAS). The program is easy to use and offers many possibilities. In the text the interface, basic commands, and various examples to facilitate complex calculations in almost every field of mathematics are preented. I prove that the program can be used in secondary schools, upper secondary schools and college. Program’s capabilities are presented, including, among others, differentiation and symbolic integration, symbol- ic solving equations (including differential), simplifying algebraic expressions, matrix operations, the possibility of drawing graphs of 2D / 3D and others. Keywords: computer program, numerical computation, symbolic computation, sym- bolic differentiation, symbolic integration, graph, graph three-dimensional, function. INTRODUCTION • symbolic solving equations (including differ- ential), Maxima is a computer program, performing • symbolic solving systems of equations, mathematical calculations, both symbolic and nu- • symbolic differentiation and integration, meric. The use of symbolic computation allows to • matrix operations, solve many mathematical problems in an accurate • drawing graphs of functions, manner. Maxima can work as a calculator, which • perform calculations in the field of probability can be used in secondary schools.
    [Show full text]
  • Maple 12 Tutorial
    Maple 12 Tutorial Updated: August 2012 Maple 12 Tutorial Table of Contents SECTION 1. INTRODUCTION...................................................................................... 3 ABOUT THE DOCUMENT .................................................................................................. 3 MAPLE INTRODUCTION .................................................................................................... 3 ACCESS TO MAPLE ........................................................................................................... 3 GETTING STARTED ........................................................................................................... 4 THE MAPLE APPLICATION INTERFACE ............................................................................. 5 THE HELP WINDOW ......................................................................................................... 7 BASIC CONVENTIONS IN MAPLE ...................................................................................... 8 BASIC DATA STRUCTURES IN MAPLE ............................................................................ 11 SECTION 3. NUMERICAL COMPUTATION........................................................... 12 FLOATING POINT NUMBER COMPUTATION .................................................................... 12 INTEGER COMPUTATIONS ............................................................................................... 13 COMPLEX NUMBER COMPUTATION ..............................................................................
    [Show full text]