DOCSLIB.ORG

Ordinary Differential Equations with SCILAB

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Ordinary Differential Equations with SCILAB Ordinary Differential Equations with SCILAB By Gilberto E. Urroz, Ph.D., P.E. Distributed by i nfoClearinghouse.com ©2001 Gilberto E. Urroz All Rights Reserved A "zip" file containing all of the programs in this document (and other SCILAB documents at InfoClearinghouse.com) can be downloaded at the following site: http://www.engineering.usu.edu/cee/faculty/gurro/Software_Calculato rs/Scilab_Docs/ScilabBookFunctions.zip The author's SCILAB web page can be accessed at: http://www.engineering.usu.edu/cee/faculty/gurro/Scilab.html Please report any errors in this document to: [email protected] Download at InfoClearinghouse.com 1 © 2001 Gilberto E. Urroz ORDINARY DIFFERENTIAL EQUATIONS 4 Introduction to differential equations 4 Definitions 5 Ordinary and partial differential equations 5 Order and degree of an equation 5 Linear and non-linear equations 5 Constant or variable coefficients 6 Homogeneous and non-homogeneous equations 6 Solutions 6 General and particular solutions 7 Verifying solutions using SCILAB 7 Initial conditions and boundary conditions 8 Symbolic solutions to ordinary differential equations 8 Solution techniques for first-order, linear ODEs with constant coefficients 9 Integrating factors for first-order, linear ODEs with variable coefficients 11 Exact differential equations 12 Solutions of homogeneous linear equations of any order with constant coefficients 12 Obtaining the particular solution for a second-order, linear ODE with constant coefficients 14 Applications of ODEs I : analysis of damped and undamped free oscillations 17 Undamped motion 17 Damped motion 18 Initial conditions for damped oscillatory motion 19 Creating phase portraits of oscillatory motion 22 Applications of ODEs II : analysis of damped and undamped forced oscillations 24 Applications of ODEs III: Oscillations in electric circuits 27 Finite differences and numerical solutions 29 Finite differences 29 Finite difference formulas based on Taylor series expansions 31 Forward, backward and centered finite difference approximations to the first derivative 32 Forward, backward and centered finite difference approximations to the second derivative 33 Solution of a first-order ODE using finite differences - Euler forward method 33 A function to implement Euler’s first-order method 35 Finite difference formulas using indexed variables 39 Solution of a first-order ODE using finite differences - an implicit method 40 Explicit versus implicit methods 42 Outline of explicit solution for a second-order ODE 42 Outline of the implicit solution for a second-order ODE 43 Systems of ordinary differential equations 44 Systems of ordinary differential equations using matrices 44 Systems of linear homogeneous ODEs - solution using matrices 45 Systems of linear nonhomogeneous ODEs - solution using matrices 49 Converting second-order linear equations to a system of equations 50 SCILAB functions for the numerical solutions of initial value problems (IVP) 52 Download at InfoClearinghouse.com 2 © 2001 Gilberto E. Urroz Applications of numerical solutions to IVPs 65 Systems of ODEs from mechanical systems 65 System of ODEs from Electric Circuits 68 Solving a fourth-order equation 72 The Van der Pol equation 74 The Rössler flow 77 Solutions to boundary value problems (BVPs) 79 The shooting method 80 A function to implement the shooting method 80 Outline of the implicit solution for a second-order BVP 83 Function bvode for the solution of boundary value problems 84 Function bvode applied to a third-order boundary value problem 88 Application of bvode to a third-order problem with one interior fixed point 89 Application of bvode to a fourth-order problem with two interior fixed points 91 Boundary value problems with eigenvalues 93 Numerical solution to a boundary value problem with eigenvalues 93 A function for calculating eigenvalues for a boundary value problem 95 Exercises 97 Download at InfoClearinghouse.com 3 © 2001 Gilberto E. Urroz Ordinary Differential Equations The chapter starts with a review of concepts of differential equations and symbolic solution techniques that can be applied using SCILAB. Since SCILAB is not a symbolic environment, its applications to symbolic solutions of ordinary differential equations (ODEs) is limited. However, SCILAB can be used to calculate intermediate numerical steps in the solutions. The strength of SCILAB in solving ODEs is in its numerical applications. Thus, the chapter also includes a number of numerical solutions to ODEs through user-programmed and pre- programmed SCILAB functions. Introduction to differential equations Differential equations are equations involving derivatives of a function. Because many physical quantities are given in terms of rates of change of a certain quantity with respect to one or more independent quantities, derivatives appear frequently in the statement of physical laws. For example, the flux of heat, q [J/m2], in a one-dimensional direction is given by q = -k⋅(dT/dx), where T[K or oC] is the temperature, x [m] is positions, and k [J/(m K) or J/(m oC)]. This equation can be considered as a differential equation if q and k are known, and we are trying to solve for the temperature as a function of x, i.e., T = T(x). The equation of conservation of energy for heat transfer in one-dimension, where there are no sources or sink of heat, requires that the rate of change of the heat flux across an area perpendicular to the x-axis be zero, i.e., dq/dx = 0,or, d dT − k ⋅ = 0 . dx dx If k is a constant, i.e., not a function of x, then, the equation of conservation of energy reduces to d2T/dx2 = 0. The last two expressions are also differential equations. The solution for these equations will be a function T = T(x) representing the temperature. Download at InfoClearinghouse.com 4 © 2001 Gilberto E. Urroz Definitions The following definitions allow us to classify equations, thus providing general guidelines for obtaining solutions. Ordinary and partial differential equations When the dependent variable is a function of a single independent variable, as in the cases presented above, the differential equation is said to be an ordinary differential equation (ODE). If the dependent variable is a function of more than one variable, a differential equation involving derivatives of this dependent variable is said to be a partial differential equation (PDE). An example of a partial differential equation would be the time-dependent would be the Laplace’s equation for the stream function, ψ(x,y,z), of a three-dimensional, inviscid flow: ∂2ψ/∂x2 + ∂2ψ/∂y2 + ∂2ψ/∂x2 = 0. Order and degree of an equation The order of a differential equation is the order of the highest-order derivative involved in the equation. Thus, the ODE dy/dx + 3xy = 0 is a first-order equation, while Laplace’s equation (shown above) is a second-order equation. The degree of a differential equation is the highest power to which the highest-order derivative is raised. Therefore, the equation (d3y/dt3)2+(d2y/dx2)5-xy = ex, is a third order, second-degree ODE, while the equation ∂y/∂t = c⋅(∂y/∂x), is a first-order, first-degree PDE. Linear and non-linear equations An equation in which the dependent variable and all its pertinent derivatives are of the first degree is referred to as a linear differential equation. Otherwise, the equation is said to be non-linear. Examples of linear differential equations are: 2 2 d x/dt + β⋅(dx/dt) + ωo⋅x = A sin ωf t, and ∂C/∂t + u⋅(∂C/∂x) = D⋅(∂2C/∂x2). Download at InfoClearinghouse.com 5 © 2001 Gilberto E. Urroz Constant or variable coefficients The following equation: d3y/dt3+π⋅ (d2y/dx2)2-5⋅y = ex, where all the coefficients accompanying the dependent variable and its derivative are constant, would be classified as a third order, linear ODE with constant coefficients. Instead, the equation ∂2C/∂t2 – u(x,t)⋅ (∂C/∂x) = 0, would be classified as a second-order, linear PDE with variable coefficients. Homogeneous and non-homogeneous equations Typically, differential equations are arranged so that all the terms involving the dependent variable are placed on the left-hand side of the equation leaving only constant terms or terms involving the independent variable(s) only in the right-hand side. When arranged in this fashion, a differential equation that has a zero right-hand side is referred to as a homogeneous equation. Examples of homogeneous equations are: 2 2 d x/dt + β⋅(dx/dt) + ωo⋅x = 0, and (x-1)⋅(dy/dx) + 2⋅x⋅y = 0. On the other hand, if the right-hand side of the equation, after placing the terms involving the dependent variable and its derivatives on the left-hand side, is non-zero, the equation is said to be non-homogeneous. Non-homogeneous versions of the last two equations are: 2 2 -t/τ d x/dt + β⋅(dx/dt) + ωo⋅x = Ao⋅e , and (x-1)⋅(dy/dx) + 2⋅x⋅y = x2-2x. Solutions A solution to a differential equation is a function of the independent variable(s) that, when replaced in the equation, produces an expression that can be reduced, through algebraic manipulation, to the form 0 = 0. For example, the function y = sin x, is a solution to the equation d2y/dx2 + y = 0, because when we replace y into the equation we have -sin x + sin x = 0, Download at InfoClearinghouse.com 6 © 2001 Gilberto E. Urroz or, 0 = 0, for all values of x. This follows from the fact that dy/dx = cos(x), and d2y/dx2 = -sin(x). General and particular solutions A general solution is one involving integration constants so that any choice of those constants represents a solution to the differential equation. For example, the function x = C⋅e-t, is a general solution to the equation dx/dt + x = 0, because, substituting C⋅e-t for x in the equation produces - C⋅e-t + C⋅e-t = 0.
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]