Richard Fateman CS 282 Lecture 21 Basic Domains of Interest used in Computer Algebra Systems Lecture 2.

Slides:



Advertisements
Similar presentations
Richard Fateman CS 282 Lecture eea1 Extended Euclidean Algorithm Lecture eea.
Advertisements

Cryptography and Network Security, Finite Fields From Third Edition by William Stallings Lecture slides by Mustafa Sakalli so much modified..
Cryptography and Network Security
Number Theory and Cryptography
RATIONAL EXPRESSIONS Chapter Quotients of Monomials.
ENGG2013 Unit 11 Row-Rank Feb,
Richard Fateman CS 282 Lecture 31 Operations, representations Lecture 3.
Richard Fateman CS 282 Lecture 101 The Finite-Field FFT Lecture 10.
Discrete Mathematics Lecture 4 Harper Langston New York University.
Richard Fateman CS 282 Lecture 2b1 Basic Domains of Interest used in Computer Algebra Systems Lecture 2b.
CSE115/ENGR160 Discrete Mathematics 03/17/11 Ming-Hsuan Yang UC Merced 1.
Polynomial Division, Remainder,GCD
Richard Fateman CS 282 Lecture 111 Determinants Lecture 11.
Richard Fateman CS 282 Lecture 41 Polynomial representations Lecture 4.
Richard Fateman CS 282 Lecture 31 Operations, representations Lecture 3.
Richard Fateman CS 282 Lecture 2c1 Basic Extensions for Computer Algebra System Domains Lecture 2c.
Richard Fateman CS 282 Lecture 61 Evaluation/Interpolation (I) Lecture 6.
THE REAL NUMBERS College Algebra. Sets Set notation Union of sets Intersection of sets Subsets Combinations of three or more sets Applications.
Section 5.5 – The Real Zeros of a Rational Function
Fall 2002CMSC Discrete Structures1 Let us get into… Number Theory.
BY MISS FARAH ADIBAH ADNAN IMK
1 1.0 Students solve equations and inequalities involving absolute value. Algebra 2 Standards.
Chapter 2 The Fundamentals: Algorithms, the Integers, and Matrices
Slide 5-1 Copyright © 2005 Pearson Education, Inc. SEVENTH EDITION and EXPANDED SEVENTH EDITION.
February 24, 2015Applied Discrete Mathematics Week 4: Number Theory 1 Modular Arithmetic Let a be an integer and m be a positive integer. We denote by.
Number Systems - Part II
CS105 INTRODUCTION TO COMPUTER CONCEPTS BINARY VALUES & NUMBER SYSTEMS Instructor: Cuong (Charlie) Pham.
MATH 224 – Discrete Mathematics
Numerical Computations in Linear Algebra. Mathematically posed problems that are to be solved, or whose solution is to be confirmed on a digital computer.
CPSC 3730 Cryptography and Network Security
Information Security and Management 4. Finite Fields 8
Polynomials and Polynomial Functions
Great Theoretical Ideas in Computer Science.
Rational Expressions Much of the terminology and many of the techniques for the arithmetic of fractions of real numbers carry over to algebraic fractions,
CompSci 102 Discrete Math for Computer Science February 16, 2012 Prof. Rodger.
Prabhas Chongstitvatana1 Factorizing large integers Finding the unique decomposition of n into a product of prime factors. Factorize(n) if n is prime done.
Richard Fateman CS 282 Lecture 71 Polynomial Division, Remainder,GCD Lecture 7.
Chapter 4 – Finite Fields
Data Security and Encryption (CSE348) 1. Lecture # 12 2.
Polynomials Integrated Math 4 Mrs. Tyrpak. Definition.
Great Theoretical Ideas in Computer Science.
Rational Numbers and Fields
Copyright © 2009 Pearson Education, Inc. Chapter 5 Section 1 - Slide 1 Chapter 1 Number Theory and the Real Number System.
College Algebra Sixth Edition James Stewart Lothar Redlin Saleem Watson.
Lecture 1: Construction & Extension: Story of Numbers Addressed by Z.Liu.
Information Security Lab. Dept. of Computer Engineering 87/121 PART I Symmetric Ciphers CHAPTER 4 Finite Fields 4.1 Groups, Rings, and Fields 4.2 Modular.
Section 3.3 Theorems about Zeros of Polynomial Functions.
Section 5.5 The Real Zeros of a Polynomial Function.
Cryptography and Network Security Chapter 4. Introduction  will now introduce finite fields  of increasing importance in cryptography AES, Elliptic.
Module #9 – Number Theory 1/5/ Algorithms, The Integers and Matrices.
Algebra Rational Algebraic Expressions. WARMUP Simplify:
Ch04-Number Theory and Cryptography 1. Introduction to Number Theory Number theory is about integers and their properties. We will start with the basic.
Number Theory Lecture 1 Text book: Discrete Mathematics and its Applications, 7 th Edition.
Slide Copyright © 2009 Pearson Education, Inc. Slide Copyright © 2009 Pearson Education, Inc. Chapter 1 Number Theory and the Real Number System.
Fuw-Yi Yang1 Textbook: Introduction to Cryptography 2nd ed. By J.A. Buchmann Chap 1 Integers Department of Computer Science and Information Engineering,
Chapter 3 The Fundamentals: Algorithms, the integers, and matrices Section 3.4: The integers and division Number theory: the part of mathematics involving.
Page : 1 bfolieq.drw Technical University of Braunschweig IDA: Institute of Computer and Network Engineering  W. Adi 2011 Lecture-5 Mathematical Background:
Agenda Review:  Relation Properties Lecture Content:  Divisor and Prime Number  Binary, Octal, Hexadecimal Review & Exercise.
Number Theory. Introduction to Number Theory Number theory is about integers and their properties. We will start with the basic principles of divisibility,
CS480 Cryptography and Information Security
Number Systems and Binary Arithmetic
Dr. Clincy Professor of CS
Notes Over 3.4 The Rational Zero Test
CS1010 Programming Methodology
Basic Extensions for Computer Algebra System Domains
Polynomial Division, Remainder,GCD
Zeros of a Polynomial Function
MA5242 Wavelets Lecture 1 Numbers and Vector Spaces
Zeros of polynomial functions
Presentation transcript:

Richard Fateman CS 282 Lecture 21 Basic Domains of Interest used in Computer Algebra Systems Lecture 2

Richard Fateman CS 282 Lecture 22 Recall that we can compute with any finitely representable objects, at least in principle From any algebraic system With any algorithms –All steps specified precisely –Terminating And probably with some set of not-necessarily terminating heuristics, if we use some time/space limits. But we tend to concentrate on domains that occur in applied math, physical sciences, etc.

Richard Fateman CS 282 Lecture 23 The Usual Operations Integer and Rational: –Ring and Field operations +- * exact quotient, remainder GCD, factoring of integers Approximation via rootfinding Polynomial operations –Ring, Field, GCD, factor –Truncated power series –Solution of polynomial systems Matrix operations (add determinant, resultant, eigenvalues, etc.)

Richard Fateman CS 282 Lecture 24 More Operations Sorting (e.g. of monomials) Union Tests for zero Extraction of parts (polynomial degree, constant coefficient, leading coefficient) Conversion to different forms (“expand”, express algebraic function in a minimal extension, “simplify”)

Richard Fateman CS 282 Lecture 25 Yet More Operations Differentiate Integrate Limit Prove Find region in which (in)equalities hold Confirm (as: steps in a proof) Expand in series

Richard Fateman CS 282 Lecture 26 Yet More Operations Plot plot3d(exp(-x^2-y^2)*x,x,-2,2,y,-1.5,2.5)

Richard Fateman CS 282 Lecture 27 Yet More Operations Typesetting

Richard Fateman CS 282 Lecture 28 Integer representations, operations The ring operations +*- Euclidean Domain: quotient & remainder, GCD UFD : factorization

Richard Fateman CS 282 Lecture 29 Unfortunately computers don’t do these operations directly Addition modulo is rarely what we need. How do we do arbitrary precision integer arithmetic? (If we could do this, we could build the rationals, and via intervals or some other construction, we could make reals)

Richard Fateman CS 282 Lecture 210 Is it hard to do arbitrary integer (bignum) arithmetic? In spite of your knowledge of this subject, there are subtleties, especially in long division! You must choose fast algorithms (moderate size) or asymptotically optimal algorithms (large size): what’s your target?

Richard Fateman CS 282 Lecture 211 Who cares about integer arithmetic? You need fast long arithmetic to compute billions of digits of  e.g. DH Bailey's home pageDH Bailey's home page You need fast moderate-length arithmetic to play integer-factoring games. Arguably, there are sensitive geometric predicates that require very high precision (floats). You need all lengths to build a computer algebra system: without it your system tells lies. Every Common Lisp has bignums built in.

Richard Fateman CS 282 Lecture 212 Some ideas just for representing integers Integers are sequences of characters, Integers are sequences of words modulo 10 9 which is the largest power of 10 less than Integers are sequences of hexadecimal digits. Integers are sequences of 32-bit words. Integers are sequences of 64-bit double-floats (with 8 bits wasted). Sequences are linked lists Sequences are vectors Sequences are stored in sequential disk locations

Richard Fateman CS 282 Lecture 213 Yet more ideas Integers are sequences of 64-bit double-floats (with 8 bits used to position the bits) e.g takes 2 words Integers are stored in redundant form a+b+… Integer are stored modulo set of different primes Integers are stored in p-adic form as a sequence of x mod p, x mod p 2, …

Richard Fateman CS 282 Lecture 214 To be continued.. Integers and more.