How Do CAS and Programmable Calculators Evaluate Derivatives?

  • Thread starter Thread starter matqkks
  • Start date Start date
  • Tags Tags
    Cas Derivatives
matqkks
Messages
280
Reaction score
5
How do CAS systems and programmable calculators evaluate the derivative of a function?
Do they use matrix representation of linear transformations?
 
Physics news on Phys.org
I don't know the answer, but you should specify whether you are asking how they evaluate derivatives numerically or how they evaluate them symbollically. Is the result of the evaluation a formula? Or a graph? Or a numerical table?
 
Sorry for being vague but I meant symbolically.
 
I suspect that they convert whatever expression you want to differentiate into taylor series, differentiate (in the obvious way), then match the result to a taylor series that represents an elementary function and substitute back. Maybe not, but I can't imagine how else it would be done.
 
From what I heard CAS stores the information as a directed graph. In Mathematica you can use the FullForm command to see it directly for example
\sin(x^2)+3
would be
Plus[3,Sin[Power[x,2]]]
It then has rules for how to manipulate these objects. So the derivative operator D (I'm assuming wrt x) interacts with Plus via the rule
D[Plus[f,g]] = Plus[D[f],D[g]]
Mathematica knows that 3 is constant and so D[3]=0. It then reduces Plus[0,?] to just ?.
So we now have
D[Sin[Power[x,2]]]
It allies its chain rule and is programmed so that D[Sin] = Cos:
Multiply[Cos[Power[x,2]],D[Power[x,2]]]
And we know that the derivative of Power[x,2] as Multiply[2,x]
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top