Can Computers Solve Transcendental Equations?

  • Thread starter Thread starter physics4ever
  • Start date Start date
physics4ever
Messages
18
Reaction score
0
Hi
I wanted to find out what transcendental equations actually are. Can the computer solve such equations?
Thanks,
Sunayana.
 
Physics news on Phys.org
Elementary Operations :
+,-,*,/,nthroot()

If any equation can be described by these operations alone, then such an equation is called algebraic equation. If not, they are called transcendental equations.

Can computers solve such equations?
Approximate solutions ofcourse, exact solutions ofcourse not!

-- AI
 
I think you're under a slight misapprehension: computers can't (even) solve (algebraic) equations generally, if you mean outputting a number in a recognizable form that is a/the precise answer. There are almost no equations algebraic or transcendental that have solutions that can be output as a finite binary expansion which is all a computer deals with (possibly up to base change). I am ignoring the few symbolic manipulations that can be done.i'd like to add that algebraic things involve finitely many of those operations, so that

2=1+x+x^2/2! + x^3/3!+...

is not algebraic (its exact solution is of course x=log(2)...
 
Last edited:
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
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