FX570MS

Proceedings of the International Conference
on Computational and Mathematical Methods

in Science and Engineering, CMMSE 2008
1316 June 2008.
Squeezing the most out of the casio
fx-570ms for electrical/electronics engineers
Pablo Guerrero-Garca
1
and

Angel Santos-Palomo
1
1
Department of Applied Mathematics, University of Malaga,
Complejo Tecnologico, Campus de Teatinos s/n, 29071 Malaga (Spain)
emails: pablito@ctima.uma.es, santos@ctima.uma.es
Abstract
A collection of non-trivial keystroke sequences is oered to highlight that,
in order to design illustrative examples for a whole course on numerical meth-
ods like those envisaged for the Education Reform at an undergraduate electri-
cal/electronics engineering level, all we need is a humble standard scientic calcu-
lator like the casio fx-570ms when a computer lab or a graphic calculator are not
aordable. The only requirement is a carefully chosen schedule of both the data
structures and the computational ordering.
Key words: standard scientic calculator, numerical methods, teaching methods,
classroom techniques
MSC 2000: 65-01, 97D40, 47N70
Outline
There are situations in which a computer lab or a graphic calculator are not aordable,
mainly when some kind of massive evaluation is involved. The avoidance of electronic
chatting via wireless devices and the lack of labs large enough to accommodate all
pupils at once have led to the academic authorities to prohibit the very same resources
whose use they encourage for teaching purposes. This lead to inconsistencies like that
of teachers using Matlab or a classpad 330 in the classroom, but pupils having to
manage themselves with a standard scientic calculator for evaluation purposes.
The main aim of this contribution is to provide a collection of non-trivial keystroke
sequences to design illustrative examples for a whole course on numerical methods with
Technical Report MA-08/01, 30th March 2008, http://www.satd.uma.es/matap/investig.htm. Con-

tribution to be presented by the starred author (to whom correspondence should be addressed) at the
8th CMMSE International Conference, Special Session on Mathematics, the Education Reform and the
use of New Teaching Resources, La Manga del Mar Menor (Murcia, Spain), June 2008.
@ CMMSE Volume I Page 307 of 720 ISBN: 978-84-612-1982-7
Squeezing the most out of the casio fx-570ms
a humble standard scientic calculator like the casio fx-570ms [1]. Our teaching expe-
rience with electrical/electronics engineers revealed that pupils can only deal with direct
expressions as opposite to iterative procedures, and they are not aware of most of the
features of their inexpensive standard scientic calculators. A carefully chosen schedule
of both the data structures and the computational ordering allow them to discover all
the computational power they had been missing, and now they acquire this skillfulness
in a specic ad-hoc course entitled The standard scientic calculator at our university,
cf. page 2 of http://hs.sci.uma.es:8070/ht/ProgramacionDocente Centro 306.pdf.
Unfortunately, to collect a handful of specic examples to illustrate every aspect
of a numerical course is a tedious task, but the outcomes are highly satisfactory. The
variety of strategies employed implies that the adaptation is by no means trivial: it has
to be done in a concise manner, because each example must be explained and solved
in no more than twenty minutes since we do not want to spend more than ten hours in
total throughout the ad-hoc course. The examples, which have been taken from [2, 3, 4]
and the references therein, can be classied as follows:
1. Expressions and nonlinear algebra
Floating-point arithmetic model
Determinant of the product of two matrices
Computing roots of algebraic equations
Function tables and xed point iterations
Newtons method for nonlinear equations
Nonlinear equations and multiple roots
Birge-Viettas method for algebraic equations
2. Linear algebra
Premultiplying by elementary matrices
Solving a system of linear equations (SLE)
Jacobis iterative method for solving an SLE
Gauss-Seidels iterative method for solving an SLE
Deation in algebraic equations of degree greater than 3
Power method
3. Interpolation and approximation
Osculatory interpolation (general scheme)
Osculatory interpolation (intermediate computations)
Linear tting (quadratic)
Nonlinear tting (exponential)
Nonlinear tting (hyperbolic)
P. Guerrero-Garc
a and

A. Santos-Palomo
DFT as a sum of complex exponentials
IDFT as a sum of complex exponentials
4. Dierential problems
Choice of step length in numerical dierentiation
Capacitor charge under current matching
Rombergs extrapolation (general scheme)
Rombergs extrapolation (intermediate computations)
Eulers method
Predictor-corrector method
This battery could be helpful for other numerical teachers during their lesson prepa-
ration to highlight some specic numerical issues that increase the broadcasting level
of the way in which a numerical analyst works even when a computer is not at hand,
in the same way that a magician has her own bouquet of enchanting tricks. In the
following pages you can nd our twenty-six cards. Which ones are yours?
References
[1] Casio, fx-570ms users guide and additional functions, 2003.
[2] P. Guerrero-Garc
a, Slides for a Course on Numerical Methods (Spanish),

Dpto. Matematica Aplicada, Universidad de Malaga, December 2003.
a and

A. Santos-Palomo, Motivational numeri-
cal examples for electrical/electronics engineers, Technical Report MA-
06/01, Dpto. Matematica Aplicada, Universidad de Malaga, March 2006,
http://www.satd.uma.es/matap/investig.htm. Poster presented at the Interna-
tional Congress of Mathematicians, Madrid 2006, pp. 184185.
[4]

A. Santos-Palomo, Slides for a Course on Numerical Methods (Spanish),
Dpto. Matematica Aplicada, Universidad de Malaga, September 2003.
First Prev Next Last Go Back Full Screen Close Quit
Floating-point arithmetic model
To compute x
1
(x
2
(x
3
x
4
)) in rounded 4-digit arithmetic,
x
1
= 1.2342, x
2
= 0.34291, x
3
= 0.012896, x
4
= 0.0009875,
we proceed as follows:
MODE
5
2 (Sci) 4
.0009875 =
+ .01290 =
SHIFT
Rnd
+ .3429 =
SHIFT
Rnd
+ 1.234 =
SHIFT
Rnd
1.59110
00
Determinant of the product of two matrices
To compute det(M
T
1
M
1
) rst input M
1
as A into memory,
M
1
=
2 0 3
1 1 2
1 0 2
MODE
3
2 (Mat)
SHIFT
MAT
1 (Dim) 1 (A) 3 = 3 =
2 = = 3 = 1 = 1 = 2 = 1 = = 2 = AC
and then proceed as follows:
SHIFT
MAT
2 (Trn)
SHIFT
MAT
3 (Mat) 1 (A)
SHIFT
MAT
3 (Mat) 1 (A) =
6 -1 6 -1 1 2 6 2 17
SHIFT
MAT
1 (Det)
SHIFT
MAT
3 (Mat) 4 (Ans) =
1
P. Guerrero-Garc
a and

A. Santos-Palomo
Computing roots of algebraic equations
To compute the roots of
2
19 + 45 = 0 we did:
MODE
3
1 (Eqn) 2
1 = 19 = 45 =
16.22681202 2.773187976
whereas to compute those of
3
+ 24
2
84 + 1 = 0 we did:
MODE
3
1 (Eqn) 3
1 = 24 = 84 = 1 =
19.74923447 0.011945511 4.238820018
Function tables and xed point iterations
To construct a table with the values of g(x) = x exp(x):
ALPHA
X

SHIFT
e
x ALPHA
X
CALC 3 = CALC 1 = CALC 0 =
-0.14936 -0.36788 0.0000
CALC 1 = CALC 3 = CALC .5 =
2.7183 60.257 -0.30327
The same technique can be used to implement xed point iterations for
g(x) =
10 x
3
/2 starting from x
0
= 1.5 until x
1.3652:
( 10
ALPHA
X
SHIFT
x
3
) 2 MODE
5
2 (Sci) 5
CALC 1.5 = CALC Ans = CALC Ans = CALC Ans =
SHIFT
Rnd
1.2870 1.4025 1.3455
CALC Ans = CALC Ans = CALC Ans =
1.3752 1.3601 1.3678
Using 5-digit arithmetic, the only dierence is 1.3751 rather than 1.3752.
Newtons method for nonlinear equations
Nonlinear equation solver (Newton) allow us to obtain (in case of conver-
gence) the zeros of f(x) one at a time starting from good starting points:
f() =
3
+ 24
2
84 + 1 = 0
ALPHA
X
SHIFT
x
3
+ 24
ALPHA
X
x
2
84
ALPHA
X
+ 1
SHIFT
SOLVE
18 =
SHIFT
SOLVE
19.74923447
SHIFT
SOLVE
0 =
SHIFT
SOLVE
0.011945511
SHIFT
SOLVE
3 =
SHIFT
SOLVE
4.238820018
SHIFT
SOLVE
SHIFT
10
x
8 =
SHIFT
SOLVE
Cant solve
Nonlinear equations and multiple roots
To tune the resistance R of a potentiometer for energy dissipation implies
f(R) = exp(A R) cos(B
C D R
2
) E = 0,
where A = 0.005, B = 0.05, C = 2000, D = 0.01 y E = 0.01. Thus,
MODE
4
2 (Rad)
SHIFT
e
x
(
ALPHA
A

ALPHA
X
)
cos (
ALPHA
B

(
ALPHA
C

ALPHA
D

ALPHA
X
x
2
) )
ALPHA
E
SHIFT
SOLVE
.005 = .05 = 2000 = .01 = .01 =
SHIFT
SOLVE
328.1514291
with 0 as starting point. But the solver cannot compute the roots of
f(x) = (x 1)
7
= 0
(
ALPHA
X
1 ) 7
SHIFT
SOLVE
0 =
SHIFT
SOLVE

SHIFT
SOLVE
2 =
SHIFT
SOLVE
SHIFT
SOLVE
Cant solve (0.9982) Cant solve (1.002)
P. Guerrero-Garc
a and

A. Santos-Palomo
Birge-Viettas method for algebraic equations
We get into trouble when the starting point is a zero of P
(x), where
P(x) = x
3
3x
2
7
ALPHA
X
SHIFT
x
3
3
ALPHA
X
x
2
7
SHIFT
SOLVE
2 =
SHIFT
SOLVE

SHIFT
SOLVE
1 =
SHIFT
SOLVE
Cant solve Cant solve
SHIFT
SOLVE
0 =
SHIFT
SOLVE

SHIFT
SOLVE
4 =
SHIFT
SOLVE
Cant solve 3.554149219
To compute the roots of P(x) = 0 we did:
MODE
3
1 (Eqn) 3
1 = 3 = = 7 =
3.554
SHIFT
ReIm
0.2771 +1.376i
SHIFT
ReIm
0.2771 1.376i
Premultiplying by elementary matrices
We want to premultiply by B = F
32
(1) a given matrix A:
1 0 0
0 1 0
0 1 1
1 2 3
4 5 6
7 8 9
.
First input A and B into memory,
MODE
3
2 (Mat)
SHIFT
MAT
1 (Dim) 1 (A) 3 = 3 =
1 = 2 = 3 = 4 = 5 = 6 = 7 = 8 = 9 = AC
SHIFT
MAT
1 (Dim) 2 (B) 3 = 3 =
1 = = = = 1 = = = 1 = 1 = AC
SHIFT
MAT
3 (Mat) 2 (B)
SHIFT
MAT
3 (Mat) 1 (A) =
1 2 3 4 5 6 3 3 3
Solving a system of linear equations (SLE)
Given = 10
4
, we want to solve the linear systems
1 1 +
1 1

x
1
x
2
1 + +
2
1
1 1
2
1 +
2

y
1
y
2
1
1
,
whose solutions are readily checked to be
x =
, y =
(1 2)(1 )
2
(1 + )
1
(1 )
2
.
We proceed as follows, using Cramers rule:
MODE
3
1 (Eqn) 2 (Unknowns)
1 = 1.0001 = 1.00010001 = .9999 = 1 = 1 =
1 0 AC
.9999 = .99999999 = 1 = 1 = .00010001 = 1 =
0.99999999 1.0001000210
4
The condition number of the former is 4 10
8
and ( x) = 10
4
, whereas
the condition number of the latter is 2.6 and ( y) = 2 10
12
.
Jacobis iterative method for solving an SLE
We want to carry out two iterations of Jacobis method for
1 x
1
+ 2 x
2
+ 3 x
3
= 9
4 x
1
+ 5 x
2
+ 6 x
3
= 12
7 x
1
+ 8 x
2
+ 10 x
3
= 13
A = ( 2 B 3 C + 9) 1
B = (4 A 6 C + 12) 5
C = (7 A 8 B + 13) 10
and we obtain x
(0)
J
=
0
0
0
; x
(1)
J
=
9
2.4
1.3
; x
(2)
J
=
0.3
6.36
6.92
.
ALPHA
A
ALPHA
=
( 2
ALPHA
B
3
ALPHA
C
+ 9 ) 1 =
ALPHA
B
ALPHA
=
( 4
ALPHA
A
6
ALPHA
C
+ 12 ) 5 =
ALPHA
C
ALPHA
=
( 7
ALPHA
A
8
ALPHA
B
+ 13 ) 10 =
CALC 0 = 0 = 9 CALC 2.4 = = 0.3
CALC 0 = 0 = 2.4 CALC 9 = = 6.36
CALC 0 = 0 = 1.3 CALC = 2.4 = 6.92
P. Guerrero-Garc
a and

A. Santos-Palomo
Gauss-Seidels iterative method for solving an SLE
We want to carry out two iterations of Gauss-Seidels method for
1 x
1
+ 2 x
2
+ 3 x
3
= 9
4 x
1
+ 5 x
2
+ 6 x
3
= 12
7 x
1
+ 8 x
2
+ 10 x
3
= 13
A = ( 2 B 3 C + 9) 1
B = (4 A 6 C + 12) 5
C = (7 A 8 B + 13) 10
and we obtain x
(0)
GS
=
0
0
0
; x
(1)
GS
=
9
4.8
1.16
; x
(2)
GS
=
22.08
13.872
3.0584
.
ALPHA
A
ALPHA
=
( 2
ALPHA
B
3
ALPHA
C
+ 9 ) 1 =
ALPHA
B
ALPHA
=
( 4
ALPHA
A
6
ALPHA
C
+ 12 ) 5 =
ALPHA
C
ALPHA
=
( 7
ALPHA
A
8
ALPHA
B
+ 13 ) 10 =
CALC 0 = 0 = 9 CALC = = 22.08
CALC = 0 = 4.8 CALC = = 13.872
CALC = = 1.16 CALC = = 3.0584
Deation in algebraic equations of degree greater than 3
Compute poles of system with tranfer function H(s) = N(s)/D(s), where
D(s) = s(s + 3)(s
2
+ 2s + 2) + (s + 2) = s
4
+ 5s
3
+ 8s
2
+ 7s + 2,
ALPHA
X
4 + 5
ALPHA
X
SHIFT
x
3
+ 8
ALPHA
X
x
2
+ 7
ALPHA
X
+ 2
SHIFT
SOLVE
5 =
SHIFT
SOLVE

SHIFT
SOLVE
5 =
SHIFT
SOLVE
3.065994892 0.472901719
Deating D(s) in 4-digit arithmetic by 0.4729 we obtain remainder 0
and E(s) = s
3
+ 4.527s
2
+ 5.859s + 4.229, whose zeros are
MODE
3
1 (Eqn) 3 1 = 4.527 = 5.859 = 4.229 =
3.066
SHIFT
ReIm
0.7306 +0.9196i
SHIFT
ReIm
0.7306 0.9196i
However, if we deate E(s) in same arithmetic by 3.066 then we obtain
F(s) = s
2
+ 1.461s + 1.380 but remainder 2 10
3
, whose zeros are
MODE
3
1 (Eqn) 2 1 = 1.461 = 1.380 =
SHIFT
ReIm
0.7305 + 0.9200i
SHIFT
ReIm
0.7305 0.9200i
Power method
Starting from x
(0)
= [1; 1; 1] = B, to apply the power method to
A =
4 14 0
5 13 0
1 0 2
,
rst input A and B into memory, and let MatAns have B:
MODE
3
2 (Mat)
SHIFT
MAT
1 (Dim) 1 (A) 3 = 3 =
4 = 14 = = 5 = 13 = = 1 = = 2 = AC
SHIFT
MAT
1 (Dim) 2 (B) 3 = =
1 = 1 = 1 = AC
SHIFT
MAT
3 (Mat) 2 (B) 1 =
SHIFT
MAT
3 (Mat) 1 (A)
SHIFT
MAT
3 (Mat) 4 (Ans) 1 = 10 8 1 AC
= 72 54 8 AC = 468 342 88 AC = 2916 2106 644
To normalize in
, divide into 10 (rather than into 1) at the end of the

rst line above (then into 7.2, next into 6.5 and so on).
Osculatory interpolation (general scheme)
We want to compute the osculatory interpolation polynomial in 2-digit
arithmetic for:
i x
i
f(x
i
) f
(x
i
) f
(x
i
)
0 1 1 0.5 2
1 2 2 1
The suitable scheme to compute Nevilles divided diferences is:
i z
i
f[z
i
] f[z
i1
, z
i
] f[z
i2
, . . . , z
i
] f[z
i3
, . . . , z
i
] f[z
i4
, . . . , z
i
]
0 1 1.0 A
1 1 1.0 B 0.50 B
2 1 1.0 C 0.50 C 1.0 C
3 2 2.0 D 1.0 D 0.50 D 0.50 D
4 2 2.0 E 1.0 E 2.0 E 2.5 E 2.0 E
and hence the osculatory interpolation polynomial can be written as
P
4
(x) = A + B(x 1) + C(x 1)
2
+ D(x 1)
3
+ E(x 1)
3
(x 2)
where intermediate results (from bottom to top) were obtained as follows:
P. Guerrero-Garc
a and

A. Santos-Palomo
Osculatory interpolation (intermediate computations)
MODE
5
2 (Sci) 2
1.0 =
SHIFT
Rnd
Ans
SHIFT
STO
E =
2.0 =
SHIFT
Rnd
Ans
SHIFT
STO
D = 1.0 =
SHIFT
Rnd
Ans
SHIFT
STO
C =
(
ALPHA
D

ALPHA
C
) (2 1) =
SHIFT
Rnd
Ans
SHIFT
STO
D =
0.50 =
SHIFT
Rnd
Ans
SHIFT
STO
C =
0.50 =
SHIFT
Rnd
Ans
SHIFT
STO
B =
1.0 =
SHIFT
Rnd
Ans
SHIFT
STO
A =
(
ALPHA
E

ALPHA
D
) (2 1) =
SHIFT
Rnd
Ans
SHIFT
STO
E =
2
(
ALPHA
D

ALPHA
C
) (2 1) =
SHIFT
Rnd
Ans
SHIFT
STO
D =
2.0 2 =
SHIFT
Rnd
Ans
SHIFT
STO
C =
8
(
ALPHA
E

ALPHA
D
) (2 1) =
SHIFT
Rnd
Ans
SHIFT
STO
E =
8
(
ALPHA
D

ALPHA
C
) (2 1) =
SHIFT
Rnd
Ans
SHIFT
STO
D =
5
(
ALPHA
E

ALPHA
D
) (2 1) =
SHIFT
Rnd
Ans
SHIFT
STO
E =
ALPHA
A
=
ALPHA
B
=
ALPHA
C
=
ALPHA
D
=
ALPHA
E
=
Linear tting (quadratic)
To nd the best parabola (x) = a
0
+ a
1
x + a
2
x
2
to t
i 0 1 2 3 4
x
i
0 2 3 5 6
f(x
i
) 1 3 3 5 4
we proceed as follows:
MODE
2
2 (Reg) 3 (Quad)
SHIFT
CLR
1 (Scl) =
0 , 1 DT 2 , 3 DT 3 , 3 DT 5 , 5 DT 6 , 4 DT
SHIFT
S-SUM
1 (
x
2
) =
SHIFT
S-SUM
3 (
xy) =
74 64
SHIFT
S-SUM
1 (
x
3
) =
SHIFT
S-SUM
2 (
x
2
y) =
376 308
SHIFT
S-VAR
1 (A) =
SHIFT
S-VAR
2 (B) =
SHIFT
S-VAR
3 (C) =
0.95238 1.1429 0.095238
Nonlinear tting (exponential)
To perform an exponential tting for the data of the following table:
i 0 1 2 3 4
x
i
1.00 1.25 1.50 1.75 2.00
f(x
i
) 5.10 5.79 6.53 7.45 8.46
we proceed as described below:
MODE
2
2 (Reg) 3 (Exp)
SHIFT
CLR
1 (Scl) =
1 , 5.1 DT 1.25 , 5.79 DT 1.5 , 6.53 DT 1.75 , 7.45 DT 2 , 8.46 DT
SHIFT
S-SUM
1 (
x
2
) =
SHIFT
S-SUM
3 (
xy) =
11.875 14.424
SHIFT
S-SUM
1 (
y
2
) =
SHIFT
S-SUM
2 (
y) =
17.852 9.4053
SHIFT
S-VAR
1 (A) =
SHIFT
S-VAR
2 (B) =
3.0725 0.50572
Nonlinear tting (hyperbolic)
To perform an hyperbolic tting as y = a/(c + bx) where a = g(b, c) =
exp(c + b) for the data (with 6 correct signicant digits)
x
i
0.00000 1.00000 2.00000 3.00000
y
i
0.250000 0.142857 0.100000 0.0769231
we rst carry out a linear tting for 1/y = C + Bx,
MODE
2
2 (Reg) 1 (Lin)
SHIFT
CLR
1 (Scl) =
0 , 1 .25 DT 1 , 1 .142857 DT 2 , 1 .1 DT 3 , 1 .0769231 DT
SHIFT
S-VAR
1 (A) =
SHIFT
S-VAR
2 (B) =
4.00000358 2.99999813
Since c = Ca and b = Ba, to obtain a it suces to solve the NLE
a = exp(c + b) = exp(Ca + Ba) = exp((C + B)a) = g(a);
ALPHA
X

SHIFT
e
x
( 7
ALPHA
X
)
SHIFT
SOLVE
SHIFT
SOLVE
0.2177636
Hence in this case a 0.217764 is the only xed point in [0, 1] for g(a) =
exp(7a), therefore c = 4a 0.871054 and b = 3a 0.653291.
P. Guerrero-Garc
a and

A. Santos-Palomo
DFT as a sum of complex exponentials
The discrete Fourier transform for y = [2; 1; 1; 4] is:
c
k
=
3
r=0
y
r
e
ikx
r
= 2e
ikx
0
+(1)e
ikx
1
+1e
ikx
2
+4e
ikx
3
, k 0: 3,
where the x
r
are 4 equally spaced nodes in [0, 2), hence
c
0
= 2 e
i00
+ (1) e
i0/2
+ 1 e
i0
+ 4 e
i03/2
= 6
c
1
= 2 e
i10
+ (1) e
i1/2
+ 1 e
i1
+ 4 e
i13/2
= 1 + 5i
c
2
= 2 e
i20
+ (1) e
i2/2
+ 1 e
i2
+ 4 e
i23/2
= 0
c
3
= 2 e
i30
+ (1) e
i3/2
+ 1 e
i3
+ 4 e
i33/2
= 1 5i
MODE
4
2 (Rad) MODE 2 (Cmplx)
2 1
SFT
( 0 2 ) + 1
SFT
( 0 ) + 4
SFT
( 0 3 2 ) =
SFT
ReIm
2 1
SFT
( 1 2 ) + 1
SFT
( 1 ) + 4
SFT
( 1 3 2 ) =
SFT
ReIm
2 1
SFT
( 2 2 ) + 1
SFT
( 2 ) + 4
SFT
( 2 3 2 ) =
SFT
ReIm
2 1
SFT
( 3 2 ) + 1
SFT
( 3 ) + 4
SFT
( 3 3 2 ) =
SFT
ReIm
IDFT as a sum of complex exponentials
The inverse discrete Fourier transform for c = [6; 1 + 5i; 0; 1 5i] is:
y
r
=
1
4
3
k=0
c
k
e
ikx
r
=
1
4
(6e
i0x
r
+(1+5i)e
i1x
r
+0e
i2x
r
+(15i)e
i3x
r
), r 0: 3,
where the x
r
are 4 equally spaced nodes in [0, 2), hence
y
0
= (6 e
i0x
0
+ (1 + 5i) e
i1x
0
+ 0 e
i2x
0
+ (1 5i) e
i3x
0
)/4 = 2
y
1
= (6 e
i0x
1
+ (1 + 5i) e
i1x
1
+ 0 e
i2x
1
+ (1 5i) e
i3x
1
)/4 = 1
y
2
= (6 e
i0x
2
+ (1 + 5i) e
i1x
2
+ 0 e
i2x
2
+ (1 5i) e
i3x
2
)/4 = 1
y
3
= (6 e
i0x
3
+ (1 + 5i) e
i1x
3
+ 0 e
i2x
3
+ (1 5i) e
i3x
3
)/4 = 4
MODE
4
2 (Rad) MODE 2 (Cmplx) 1 + 5
SFT
i
SFT
STO
A =
( 6 +
AHA
A
1
SFT
( 0 2 ) +
SFT
Conjg
AHA
A
1
SFT
( 3 0 2 ) ) 4 =
( 6 +
AHA
A
1
SFT
( 1 2 ) +
SFT
Conjg
AHA
A
1
SFT
( 3 1 2 ) ) 4 =
( 6 +
AHA
A
1
SFT
( 2 2 ) +
SFT
Conjg
AHA
A
1
SFT
( 3 2 2 ) ) 4 =
( 6 +
AHA
A
1
SFT
( 3 2 ) +
SFT
Conjg
AHA
A
1
SFT
( 3 3 2 ) ) 4 =
Choice of step length in numerical dierentiation
Given f(x) = ln(x), we want to approximate f
(2.00) by using
f
(a)
3 f(a) + 4 f(a + h) f(a + 2h)
2 h
when the following values with 5 correct decimals are known:
i 0 1 2 3 4
x
i
2.00 2.01 2.02 2.06 2.12
f(x
i
) 0.69315 0.69813 0.70310 0.72271 0.75142
( 3
ALPHA
A
+ 4
ALPHA
B

ALPHA
C
) ( 2
ALPHA
D
)
CALC .69315 = .69813 = .70310 = .01 =
0.49850
CALC = .72271 = .75142 = .06 =
0.49975
SHIFT
d/dx
ln
ALPHA
X
, 2 , .01 ) =
SHIFT
d/dx
ln
ALPHA
X
, 2 , .06 ) =
0.500000010 0.499999979
Capacitor charge under current matching
We want to estimate Q(t
) =
0
(t)dt with Simpsons formula, where
(t) = I
1
(t) I
2
(t), I
1
(t) = sin(t), I
2
(t) = exp(t 1)t,
for t
> 0 root of f(t) = g(t) t = sin(t)exp(1 t) t computed with 7

correct signicant digits by using t
k+1
= g(t
k
) starting from t
0
= 0.5:
MODE
4
2 (Rad) sin
ALPHA
X

SHIFT
e
x
( 1
ALPHA
X
)
CALC .5 = CALC Ans = CALC Ans = CALC Ans =
0.7904391 0.8763436 0.8695468 0.8703867
sin
ALPHA
X

SHIFT
e
x
(
ALPHA
X
1 )
ALPHA
X
CALC .8703867 2 = .8703867 4 6
0.10108
dx sin
ALPHA
X

SHIFT
e
x
(
ALPHA
X
1 )
ALPHA
X
, 0 , .8703867 , 1 )
Math error
dx sin
ALPHA
X

SHIFT
e
x
(
ALPHA
X
1 )
ALPHA
X
, 0 , .8703867 , 4 )
0.10145
P. Guerrero-Garc
a and

A. Santos-Palomo
Rombergs extrapolation (general scheme)
Given f(x) = exp(x
2
), we want to approximate
1.5
1
f(x)dx with Rom-
bergs extrapolation in 7-digit arithmetic:
MODE
5
2 (Sci) 7
SHIFT
e
x
ALPHA
X
x
2
CALC 1 =
SHIFT
Rnd
Ans
SHIFT
STO
A =
2
f(1) 3.678794 10
01
A
CALC 1.125 =
SHIFT
Rnd
Ans
SHIFT
STO
B =
2
f(1.125) 2.82063010
01
B
CALC 1.25 =
SHIFT
Rnd
Ans
SHIFT
STO
C =
2
f(1.25) 2.096114 10
01
C
CALC 1.375 =
SHIFT
Rnd
Ans
SHIFT
STO
D =
2
f(1.375) 1.50977410
01
D
CALC 1.5 =
SHIFT
Rnd
Ans
SHIFT
STO
E = f(1.5) 1.05399210
01
E
The suitable scheme for this deferred approach to the limit is:
T
1
(h) = 0.1183197 B
T
2
(h) = 0.1093104 C
T
1
(h/2) = 0.1115627 C T
3
(h) = 0.1093644
T
2
(h/2) = 0.1093610 D
T
1
(h/4) = 0.1099114 D
where intermediate results (from bottom to top) were obtained as follows:
Rombergs extrapolation (intermediate computations)
(
ALPHA
A
+
ALPHA
E
+ 2 (
ALPHA
C
+
ALPHA
B
+
ALPHA
D
) ) 16
=
SHIFT
Rnd
Ans
SHIFT
STO
D =
2
T
1
(h/4) = 1.09911410
01
D
(
ALPHA
A
+
ALPHA
E
+ 2
ALPHA
C
) 8
=
SHIFT
Rnd
Ans
SHIFT
STO
C =
2
T
1
(h/2) = 1.11562710
01
C
(
ALPHA
A
+
ALPHA
E
) 4
=
SHIFT
Rnd
Ans
SHIFT
STO
B =
2
T
1
(h) = 1.183197 10
01
B
( 4
ALPHA
D

ALPHA
C
) 3
=
SHIFT
Rnd
Ans
SHIFT
STO
D =
2
T
2
(h/2) = 1.09361010
01
D
( 4
ALPHA
C

ALPHA
B
) 3
=
SHIFT
Rnd
Ans
SHIFT
STO
C =
5
T
2
(h) = 1.093104 10
01
C
( 16
ALPHA
D

ALPHA
C
) 15 = T
3
(h) = 1.09364410
01
SHIFT
CLR
2 (Mode) = AC
dx
SHIFT
e
x
ALPHA
X
x
2
, 1 , 1.5 , 5 )
0.1093643 Simpson option 5 (i.e., 33 points)
Eulers method
To solve y
(x) = sin(x y(x)) with y(0) = 3 in the interval 0 x 5 by

using Eulers method with h = 1 in 4-digit arithmetic:
MODE
4
2 (Rad) MODE
5
2 (Sci) 4
ALPHA
Y
+ 1 sin (
ALPHA
X

ALPHA
Y
)
CALC 3 = 0 =
SHIFT
Rnd
3.00010
00
CALC Ans = 1 =
SHIFT
Rnd
3.14110
00
CALC Ans = 2 =
SHIFT
Rnd
3.14010
00
CALC Ans = 3 =
SHIFT
Rnd
3.14510
00
CALC Ans = 4 =
SHIFT
Rnd
3.15910
00
Predictor-corrector method
To solve y
(x) = (x y(x))/2 with y(0) = 2 in 0 x 1 by using (with

h = 0.5 and 4-digit arithmetic) the predictor-corrector method
k
1
= hf
i
A, k
2
= hf(x
i
+h/2, w
i
+k
1
/2) B, w
i+1
= w
i
+k
2
C,
w
P
i+1
= w
i
+
h
2
(3f
i
f
i1
) D, w
i+1
=
4
3
w
i
1
3
w
i1
+
2h
3
f
P
i+1
E
MODE
5
2 (Sci) 4 (
ALPHA
X

ALPHA
Y
) 2 CALC 0 = 2 =
SHIFT
Rnd
.5 =
SHIFT
Rnd
Ans
SHIFT
STO
A = -5.00010
01
3
CALC 0 + .5 2 = 2 +
ALPHA
A
2 =
SHIFT
Rnd
.5 =
SHIFT
Rnd
Ans
SHIFT
STO
B = -3.75010
01
2 +
ALPHA
B
=
SHIFT
Rnd
Ans
SHIFT
STO
C = 1.62510
00
6
CALC .5 =
ALPHA
C
=
SHIFT
Rnd
-5.62510
01
ALPHA
C
+ .5 ( 3 Ans + 1 ) 2 =
SHIFT
Rnd
Ans
SHIFT
STO
D = 1.45310
00
3
CALC 1 =
ALPHA
D
=
SHIFT
Rnd
-2.26510
01
( 4
ALPHA
C
2 + 2 .5 Ans ) 3 =
SHIFT
Rnd
Ans
SHIFT
STO
E = 1.42510
00
Proceedings of the International Conference
on Computational and Mathematical Methods
in Science and Engineering, CMMSE 2008
1316 June 2008.
Sacandole partido a la casio fx-570ms
en sistemas electronicos de telecomunicacion
*
Pablo Guerrero-Garca
1
y

Angel Santos-Palomo
1
1
Departmento de Matematica Aplicada, Universidad de Malaga,
Complejo Tecnologico, Campus de Teatinos s/n, 29071 Malaga (Espa na)
emails: pablito@ctima.uma.es, santos@ctima.uma.es
Resumen
Se ofrece una coleccion de secuencias no triviales de tecleado para enfatizar
que, a la hora de dise nar ejemplos ilustrativos para un curso completo de metodos
numericos como los que se preveen para la Reforma Educativa en los cursos previos
a la obtencion del grado en sistemas electronicos de telecomunicacion, todo lo
que se necesita es una humilde calculadora cientca estandar como la casio fx-
570ms cuando un laboratorio de ordenadores o una calculadora graca no son
asequibles. El unico requisito es una planicacion cuidadosamente elegida tanto de
las estructuras de datos como de la ordenacion computacional.
Palabras clave: calculadora cientca estandar, metodos numericos, metodos de
ense nanza, tecnicas para el aula
MSC 2000: 65-01, 97D40, 47N70
Semblanza
Hay situaciones en las que un laboratorio de ordenadores o una calculadora graca
no son asequibles, principalmente cuando hay implicada alg un tipo de evaluacion ma-
siva. El tratar de evitar el copieteo electronico a traves de dispositivos inalambricos y
la asusencia de laboratorios lo sucientemente grandes como para acomodar a todos
los alumnos a la vez ha llevado a las autoridades academicas a prohibir precisamente
los mismos recursos cuyo uso promueven cuando se trata de ense nar. Esto lleva a in-
consistencias como la de que los profesores usan Matlab o una classpad 330 en el
*
Informe Tecnico MA-08/01, 30 Marzo 2008, http://www.satd.uma.es/matap/investig.htm. Contri-
bucion a presentar por el autor indicado con una estrella (a quien debe dirigirse la correspondencia) en
el 8th CMMSE International Conference, Special Session on Mathematics, the Education Reform and
the use of New Teaching Resources, La Manga del Mar Menor (Murcia, Espa na), Junio 2008.
Sac
andole partido a la casio fx-570ms

aula, pero los alumnos tienen que apa narselas con una calculadora cientca estandar
cuando tienen que evaluarse.
El principal objetivo de esta contribucion es proporcionar una coleccion de secuen-
cias no triviales de tecleado para dise nar ejemplos ilustrativos para un curso completo
de metodos numericos con una humilde calculadora cientca estandar como la casio
fx-570ms [1]. Nuestra experiencia docente con ingenieros en sistemas electronicos de
telecomunicacion nos revelo que los alumnos solo son capaces de manejar expresiones
directas en contraposicion con procedimientos iterativos, y que ellos no estan al tanto
de la mayora de las caractersticas de sus baratas calculadoras cientcas estandar.
Una planicacion cuidadosamente elegida tanto de las estructuras de datos como de
la ordenacion computacional les permite descubrir toda la potencia computacional que
se haban estado perdiendo, y ahora ellos adquieren esta destreza en un curso ad-hoc
especco titulado La calculadora cientca estandar impartido en nuestra universidad,
cf. pagina 2 de http://hs.sci.uma.es:8070/ht/ProgramacionDocente Centro 306.pdf.
Desgraciadamente, recopilar una coleccion de ejemplos especcos para ilustrar to-
dos los aspectos de un curso numerico es una tarea tediosa, pero los resultados son
ampliamente satisfactorios. La variedad de estrategias empleadas implica que la adap-
tacion no es ni mucho menos trivial: debe hacerse de manera concisa, ya que cada
ejemplo debe explicarse y resolverse en menos de veinte minutos ya que no se quiere
dedicar mas de diez horas en total del curso ad-hoc completo. Los ejemplos, que han
sido extrados de [2, 3, 4] y referencias citadas en ellos, pueden clasicarse como sigue:
1. Evaluacion y algebra no lineal
Modelo aritmetico de punto otante
Determinante del producto de dos matrices
Calculo de races de ecuaciones algebraicas
Tablas de funciones e iteraciones de punto jo
Metodo de Newton para ecuaciones no lineales
Ecuaciones no lineales y races m ultiples
Metodo de Birge-Vietta para ecuaciones algebraicas
2.

Algebra lineal
Premultiplicado por matrices elementales
Resolucion de sistemas de ecuaciones lineales
Metodo iterativo de Jacobi para resolver un SEL
Metodo iterativo de Gauss-Seidel para resolver un SEL
Deaccion en ecuaciones algebraicas de grado mayor que 3
Metodo de las potencias
3. Interpolacion y aproximacion
P. Guerrero-Garc
a y

A. Santos-Palomo
Interpolacion osculatoria (esquema general)
Interpolacion osculatoria (calculos intermedios)
Ajuste lineal (cuadratico)
Ajuste no lineal (exponencial)
Ajuste no lineal (hiperbolico)
TFD como suma de exponenciales complejas
TIFD como suma de exponenciales complejas
4. Problemas diferenciales
Eleccion del tama no de paso en derivacion numerica
Carga de condensador bajo coincidencia de intensidades
Extrapolacion de Romberg (esquema general)
Extrapolacion de Romberg (calculos intermedios)
Metodo de Euler
Metodo predictor-corrector
Este muestrario podra ayudar a otros profesores numericos en la preparacion de
sus clases para enfatizar ciertos aspectos numericos especcos que incrementen el nivel
de difusion de la forma de trabajar del analista numerico cuando no tiene a mano un
ordenador, de la misma forma que un mago tiene su propio ramillete de trucos. En las
paginas siguientes puedes encontrar nuestras veintiseis cartas. Cuales son las tuyas?
Referencias
[1] Casio, fx-570ms gua del usuario y funciones adicionales, 2003.
a, Transparencias de Metodos Numericos, Dpto. Matematica

Aplicada, Universidad de Malaga, Diciembre 2003.
a y

A. Santos-Palomo, Ejemplos numericos de mo-
tivacion sobre sistemas electronicos de telecomunicacion, Informe Tecnico
MA-06/01, Dpto. Matematica Aplicada, Universidad de Malaga, Marzo 2006,
http://www.satd.uma.es/matap/investig.htm. Version en ingles presentada como
poster en el International Congress of Mathematicians, Madrid 2006, pp. 184185.
[4]

A. Santos-Palomo, Transparencias de Metodos Numericos, Dpto. Matematica
Aplicada, Universidad de Malaga, Septiembre 2003.
Sac

Modelo aritmetico de punto otante
lara cacuar x
1
(x
2
(x
3
x
4
cn aritmctica dc ! d.itos y rcdondco.
x
1
1.23!2, x
2
0.3!291, x
3
0.012S9o, x
4
0.0009S`,
hay ouc haccr
MODE
5
2 (Sci 4
.0009S` =
+ .01290 =
SHIFT
Rnd
+ .3!29 =
SHIFT
Rnd
+ 1.23! =
SHIFT
Rnd
1`9110
00
Determinante del producto de dos matrices
lara cacuar dct(M
T
1
M
1
primcro introducir M
1
como A cn mcmoria.
M
1

2 0 3
1 1 2
1 0 2
MODE
3
2 (àt
SHIFT
MAT
1 (Lim 1 (A 3 = 3 =
2 = = 3 = 1 = 1 = 2 = 1 = = 2 = AC
y dcspucs proccdcr como si.uc
SHIFT
MAT
2 (Trn
SHIFT
MAT
3 (àt 1 (A
SHIFT
MAT
3 (àt 1 (A =
o -1 o -1 1 2 o 2 1
SHIFT
MAT
1 (Lct
SHIFT
MAT
3 (àt 4 (Ans =
1
P. Guerrero-Garc
a y

A. Santos-Palomo
C alculo de races de ecuaciones algebraicas
Para calcular las races de
2
19 + 45 = 0 hacemos:
MODE
3
1 (Eqn) 2
1 = 19 = 45 =
16.22681202 2.773187976
mientras que para calcular las de
3
+ 24
2
84 + 1 = 0 hacemos:
MODE
3
1 (Eqn) 3
1 = 24 = 84 = 1 =
19.74923447 0.011945511 4.238820018
Tablas de funciones e iteraciones de punto jo
Para hacer una tabla de valores para g(x) = x exp(x):
ALPHA
X

SHIFT
e
x ALPHA
X
CALC 3 = CALC 1 = CALC 0 =
-0.14936 -0.36788 0.0000
CALC 1 = CALC 3 = CALC .5 =
2.7183 60.257 -0.30327
La misma tecnica puede usarse para implementar iteraciones de punto jo
con g(x) =
10 x
3
/2 empezando desde x
0
= 1.5 hasta x
1.3652:
( 10
ALPHA
X
SHIFT
x
3
) 2 MODE
5
2 (Sci) 5
CALC 1.5 = CALC Ans = CALC Ans = CALC Ans =
SHIFT
Rnd
1.2870 1.4025 1.3455
CALC Ans = CALC Ans = CALC Ans =
1.3752 1.3601 1.3678
En aritmetica de 5 dgitos la unica diferencia es 1.3751 en vez de 1.3752.
Sac

Metodo de Newton para ecuaciones no lineales
L rcsoutor dc ccuacioncs no incacs (`cwton pcrmitc otcncr (si con-
vcr.c os ccros dc f(x uno a uno cmpczando dc un ucn punto inicia
f(
3
+ 2!
2
S! + 1 0
ALPHA
X
SHIFT
x
3
+ 2!
ALPHA
X
x
2
S!
ALPHA
X
+ 1
SHIFT
SOLVE
1S =
SHIFT
SOLVE
19!923!!
SHIFT
SOLVE
0 =
SHIFT
SOLVE
00119!``11
SHIFT
SOLVE
3 =
SHIFT
SOLVE
!23SS2001S
SHIFT
SOLVE
SHIFT
10
x
S =
SHIFT
SOLVE
Cant sovc
Ecuaciones no lineales y races m ultiples
Austar a rcsistcncia R dc potcnci omctro disipador dc cncr.a rcouicrc
f(R cxp(A R cos(B
C D R
2
E 0,
sicndo A 0.00`. B 0.0`. C 2000. D 0.01 y E 0.01 As.
MODE
4
2 (lad
SHIFT
e
x
(
ALPHA
A

ALPHA
X
)
cos (
ALPHA
B

(
ALPHA
C

ALPHA
D

ALPHA
X
x
2
) )
ALPHA
E
SHIFT
SOLVE
.00` = .0` = 2000 = .01 = .01 =
SHIFT
SOLVE
32S.1`1!291
con 0 como punto inicia lcro c rcsoutor no pucdc cacuar as raccs dc
f(x (x 1
7
0
(
ALPHA
X
1 )
SHIFT
SOLVE
0 =
SHIFT
SOLVE

SHIFT
SOLVE
2 =
SHIFT
SOLVE
SHIFT
SOLVE
Cant sovc (0.99S2 Cant sovc (1.002
P. Guerrero-Garc
a y

A. Santos-Palomo
Metodo de Birge-Vietta para ecuaciones algebraicas
Sur.cn procmas cuando c punto inicia cs un ccro dc P
(x. sicndo
P(x x
3
3x
2
ALPHA
X
SHIFT
x
3
3
ALPHA
X
x
2

SHIFT
SOLVE
2 =
SHIFT
SOLVE

SHIFT
SOLVE
1 =
SHIFT
SOLVE
Cant sovc Cant sovc
SHIFT
SOLVE
0 =
SHIFT
SOLVE

SHIFT
SOLVE
! =
SHIFT
SOLVE
Cant sovc 3``!1!9219
lara cacuar todas as raccs dc P(x 0 haccmos
MODE
3
1 (Lon 3
1 = 3 = = =
3.``!
SHIFT
ReIm
0.21 +1.3oi
SHIFT
ReIm
0.21 1.3oi
Premultiplicado por matrices elementales
Sc ouicrc prcmutipicar por B F
32
(1 una matriz A
1 0 0
0 1 0
0 1 1
1 2 3
! ` o
S 9
.
lrimcro introducir A y B cn mcmoria.
MODE
3
2 (àt
SHIFT
MAT
1 (Lim 1 (A 3 = 3 =
1 = 2 = 3 = ! = ` = o = = S = 9 = AC
SHIFT
MAT
1 (Lim 2 (L 3 = 3 =
1 = = = = 1 = = = 1 = 1 = AC
SHIFT
MAT
3 (àt 2 (L
SHIFT
MAT
3 (àt 1 (A =
1 2 3 ! ` o 3 3 3
Sac

Resoluci on de sistemas de ecuaciones lineales
Sicndo 10
4
. sc ouicrcn rcsovcr os sistcmas incacs
1 1 +
1 1

x
1
x
2
1 + +
2
1
1 1
2
1 +
2

y
1
y
2
1
1
,
cuyas soucioncs cs t aci comproar ouc son
x
, y
(1 2(1
2
(1 +
1
(1
2
.
lroccdcmos dc a torma si.uicntc. utiizando a rc.a dc Cramcr
MODE
3
1 (Lon 2 (nknowns
1 = 1.0001 = 1.00010001 = .9999 = 1 = 1 =
1 0 AC
.9999 = .99999999 = 1 = 1 = .00010001 = 1 =
099999999 10001000210
4
L n umcro dc condici on dc primcro cs ! 10
8
y ( x 10
4
. micntras ouc
c n umcro dc condici on dc sc.undo cs 2.o y ( y 2 10
12

Metodo iterativo de Jacobi para resolver un SEL
Sc ouicrcn rcaizar un par dc itcracioncs dc mctodo dc 1acoi para
1 x
1
+ 2 x
2
+ 3 x
3
9
! x
1
+ ` x
2
+ o x
3
12
x
1
+ S x
2
+ 10 x
3
13
A ( 2 B 3 C + 9 1
B (! A o C + 12 `
C ( A S B + 13 10
otcnicndosc x
(0)
J

0
0
0
. x
(1)
J

9
2.!
1.3
. x
(2)
J

0.3
o.3o
o.92
.
ALPHA
A
ALPHA
=
( 2
ALPHA
B
3
ALPHA
C
+ 9 ) 1 =
ALPHA
B
ALPHA
=
( !
ALPHA
A
o
ALPHA
C
+ 12 ) ` =
ALPHA
C
ALPHA
=
(
ALPHA
A
S
ALPHA
B
+ 13 ) 10 =
CALC 0 = 0 = 9 CALC 2.! = = 0.3
CALC 0 = 0 = 2.! CALC 9 = = o.3o
CALC 0 = 0 = 1.3 CALC = 2.! = o.92
P. Guerrero-Garc
a y

A. Santos-Palomo
Metodo iterativo de Gauss-Seidel para resolver un SEL
Se quieren realizar un par de iteraciones del metodo de Gauss-Seidel para
1 x
1
+ 2 x
2
+ 3 x
3
= 9
4 x
1
+ 5 x
2
+ 6 x
3
= 12
7 x
1
+ 8 x
2
+ 10 x
3
= 13
A = ( 2 B 3 C + 9) 1
B = (4 A 6 C + 12) 5
C = (7 A 8 B + 13) 10
obteniendose x
(0)
GS
=
0
0
0
; x
(1)
GS
=
9
4.8
1.16
; x
(2)
GS
=
22.08
13.872
3.0584
.
ALPHA
A
ALPHA
=
( 2
ALPHA
B
3
ALPHA
C
+ 9 ) 1 =
ALPHA
B
ALPHA
=
( 4
ALPHA
A
6
ALPHA
C
+ 12 ) 5 =
ALPHA
C
ALPHA
=
( 7
ALPHA
A
8
ALPHA
B
+ 13 ) 10 =
CALC 0 = 0 = 9 CALC = = 22.08
CALC = 0 = 4.8 CALC = = 13.872
CALC = = 1.16 CALC = = 3.0584
Deacci on en ecuaciones algebraicas de grado mayor que 3
Los polos de un sistema con func. transferencia H(s) = N(s)/D(s), donde
D(s) = s(s + 3)(s
2
+ 2s + 2) + (s + 2) = s
4
+ 5s
3
+ 8s
2
+ 7s + 2,
ALPHA
X
4 + 5
ALPHA
X
SHIFT
x
3
+ 8
ALPHA
X
x
2
+ 7
ALPHA
X
+ 2
SHIFT
SOLVE
5 =
SHIFT
SOLVE

SHIFT
SOLVE
5 =
SHIFT
SOLVE
3.065994892 0.472901719
Deaccionando D(s) en aritmetica de 4 dgitos con 0.4729 se obtiene
resto 0 y E(s) = s
3
+ 4.527s
2
+ 5.859s + 4.229, cuyas races son
MODE
3
1 (Eqn) 3 1 = 4.527 = 5.859 = 4.229 =
3.066
SHIFT
ReIm
0.7306 +0.9196i
SHIFT
ReIm
0.7306 0.9196i
Sin embargo, al deaccionar E(s) en la misma aritmetica con 3.066 se
obtiene F(s) = s
2
+ 1.461s + 1.380 pero resto 2 10
3
, cuyas races son
MODE
3
1 (Eqn) 2 1 = 1.461 = 1.380 =
SHIFT
ReIm
0.7305 + 0.9200i
SHIFT
ReIm
0.7305 0.9200i
Sac

Metodo de las potencias
Lmpczando dcsdc x
(0)
|1. 1. 1| B. para apicar mctodo potcncias a
A
! 1! 0
` 13 0
1 0 2
,
primcro introducir A y B cn mcmoria. y haccr ouc àtAns tcn.a B
MODE
3
2 (àt
SHIFT
MAT
1 (Lim 1 (A 3 = 3 =
! = 1! = = ` = 13 = = 1 = = 2 = AC
SHIFT
MAT
1 (Lim 2 (L 3 = =
1 = 1 = 1 = AC
SHIFT
MAT
3 (àt 2 (L 1 =
SHIFT
MAT
3 (àt 1 (A
SHIFT
MAT
3 (àt 4 (Ans 1 = 10 S 1 AC
= 2 `! S AC = !oS 3!2 SS AC = 291o 210o o!!
lara normaizaci on cn
. dividir por 10 (cn vcz dc por 1 a na dc a

primcra nca antcrior (uc.o por 2. dcspucs por o` y as succsivamcntc
Interpolaci on osculatoria (esquema general)
Sc dcsca otcncr c poinomio dc intcrpoaci on oscuatoria cn aritmctica
dc 2 d.itos para
i x
i
f(x
i
f
(x
i
f
(x
i
0 1 1 0.` 2
1 2 2 1
L csoucma a sc.uir para cacuar ditcrcncias divididas cstio `cvic cs
i z
i
f|z
i
| f|z
i1
, z
i
| f|z
i2
, . . . , z
i
| f|z
i3
, . . . , z
i
| f|z
i4
, . . . , z
i
|
0 1 1.0 A
1 1 1.0 L 0.50 L
2 1 1.0 C 0.50 C 1.0 C
3 2 2.0 L 1.0 L 0.`0 L 0.`0 L
! 2 2.0 L 1.0 L 2.0 L 2.` L 2.0 L
y cntonccs c poinomio dc intcrpoaci on oscuatoria oucda
P
4
(x A + L(x 1 + C(x 1
2
+ L(x 1
3
+ L(x 1
3
(x 2
dondc os c acuos intcrmcdios (dc aao hacia arria sc hicicron as
P. Guerrero-Garc
a y

A. Santos-Palomo
Interpolaci on osculatoria (calculos intermedios)
MODE
5
2 (Sci) 2
1.0 =
SHIFT
Rnd
Ans
SHIFT
STO
E =
2.0 =
SHIFT
Rnd
Ans
SHIFT
STO
D = 1.0 =
SHIFT
Rnd
Ans
SHIFT
STO
C =
(
ALPHA
D

ALPHA
C
) (2 1) =
SHIFT
Rnd
Ans
SHIFT
STO
D =
0.50 =
SHIFT
Rnd
Ans
SHIFT
STO
C =
0.50 =
SHIFT
Rnd
Ans
SHIFT
STO
B =
1.0 =
SHIFT
Rnd
Ans
SHIFT
STO
A =
(
ALPHA
E

ALPHA
D
) (2 1) =
SHIFT
Rnd
Ans
SHIFT
STO
E =
2
(
ALPHA
D

ALPHA
C
) (2 1) =
SHIFT
Rnd
Ans
SHIFT
STO
D =
2.0 2 =
SHIFT
Rnd
Ans
SHIFT
STO
C =
8
(
ALPHA
E

ALPHA
D
) (2 1) =
SHIFT
Rnd
Ans
SHIFT
STO
E =
8
(
ALPHA
D

ALPHA
C
) (2 1) =
SHIFT
Rnd
Ans
SHIFT
STO
D =
5
(
ALPHA
E

ALPHA
D
) (2 1) =
SHIFT
Rnd
Ans
SHIFT
STO
E =
ALPHA
A
=
ALPHA
B
=
ALPHA
C
=
ALPHA
D
=
ALPHA
E
=
Ajuste lineal (cuadr atico)
Para encontrar la par abola (x) = a
0
+a
1
x +a
2
x
2
que mejor aproxima a
i 0 1 2 3 4
x
i
0 2 3 5 6
f(x
i
) 1 3 3 5 4
procedemos de la forma siguiente:
MODE
2
2 (Reg) 3 (Quad)
SHIFT
CLR
1 (Scl) =
0 , 1 DT 2 , 3 DT 3 , 3 DT 5 , 5 DT 6 , 4 DT
SHIFT
S-SUM
1 (
x
2
) =
SHIFT
S-SUM
3 (
xy) =
74 64
SHIFT
S-SUM
1 (
x
3
) =
SHIFT
S-SUM
2 (
x
2
y) =
376 308
SHIFT
S-VAR
1 (A) =
SHIFT
S-VAR
2 (B) =
SHIFT
S-VAR
3 (C) =
0.95238 1.1429 0.095238
Sac

Ajuste no lineal (exponencial)
lara rcaizar un austc cxponcncia a os datos dc a si.uicntc taa
i 0 1 2 3 !
x
i
1.00 1.2` 1.`0 1.` 2.00
f(x
i
`.10 `.9 o.`3 .!` S.!o
proccdcmos como sc dcscric a continuacion
MODE
2
2 (lc. 3 (Lxp
SHIFT
CLR
1 (Sc =
1 , `.1 DT 1.2` , `.9 DT 1.` , o.`3 DT 1.` , .!` DT 2 , S.!o DT
SHIFT
S-SUM
1 (
x
2
=
SHIFT
S-SUM
3 (
xy =
11.S` 1!.!2!
SHIFT
S-SUM
1 (
y
2
=
SHIFT
S-SUM
2 (
y =
1.S`2 9.!0`3
SHIFT
S-VAR
1 (A =
SHIFT
S-VAR
2 (L =
3.02` 0.`0`2
Ajuste no lineal (hiperb olico)
lara rcaizar un austc hipcr oico dc a torma y a/(c + bx con a
g(b, c cxp(c + b a os datos (con o d.itos si.nicativos corrcctos dc
x
i
0.00000 1.00000 2.00000 3.00000
y
i
0.2`0000 0.1!2S` 0.100000 0.0o9231
haccmos primcro un austc inca para 1/y C + Bx.
MODE
2
2 (lc. 1 (Lin
SHIFT
CLR
1 (Sc =
0 , 1 .2` DT 1 , 1 .1!2S` DT 2 , 1 .1 DT 3 , 1 .0o9231 DT
SHIFT
S-VAR
1 (A =
SHIFT
S-VAR
2 (L =
!.000003`S 2.99999S13
Lado ouc c Ca y b Ba. para otcncr a asta rcsovcr a L`L
a cxp(c + b cxp(Ca + Ba cxp((C + Ba g(a.
ALPHA
X

SHIFT
e
x
(
ALPHA
X
)
SHIFT
SOLVE
SHIFT
SOLVE
021o3o
Luc.o cn cstc caso a 0.21o! cs c unico punto o cn |0, 1| dc g(a
cxp(a. con o cua c !a 0.S10`! y b 3a 0.o`3291
P. Guerrero-Garc
a y

A. Santos-Palomo
TFD como suma de exponenciales complejas
La transformada de Fourier discreta de y = [2; 1; 1; 4] es:
c
k
=
3
r=0
y
r
e
ikx
r
= 2e
ikx
0
+(1)e
ikx
1
+1e
ikx
2
+4e
ikx
3
, k 0: 3,
donde los x
r
son 4 nodos equiespaciados en [0, 2), luego
c
0
= 2 e
i00
+ (1) e
i0/2
+ 1 e
i0
+ 4 e
i03/2
= 6
c
1
= 2 e
i10
+ (1) e
i1/2
+ 1 e
i1
+ 4 e
i13/2
= 1 + 5i
c
2
= 2 e
i20
+ (1) e
i2/2
+ 1 e
i2
+ 4 e
i23/2
= 0
c
3
= 2 e
i30
+ (1) e
i3/2
+ 1 e
i3
+ 4 e
i33/2
= 1 5i
MODE
4
2 (Rad) MODE 2 (Cmplx)
2 1
SFT
( 0 2 ) + 1
SFT
( 0 ) + 4
SFT
( 0 3 2 ) =
SFT
ReIm
2 1
SFT
( 1 2 ) + 1
SFT
( 1 ) + 4
SFT
( 1 3 2 ) =
SFT
ReIm
2 1
SFT
( 2 2 ) + 1
SFT
( 2 ) + 4
SFT
( 2 3 2 ) =
SFT
ReIm
2 1
SFT
( 3 2 ) + 1
SFT
( 3 ) + 4
SFT
( 3 3 2 ) =
SFT
ReIm
TIFD como suma de exponenciales complejas
La transformada inversa de Fourier discreta de c = [6; 1 +5i; 0; 1 5i] es:
y
r
=
1
4
3
k=0
c
k
e
ikx
r
=
1
4
(6e
i0x
r
+(1+5i)e
i1x
r
+0e
i2x
r
+(15i)e
i3x
r
), r 0: 3,
donde los x
r
son 4 nodos equiespaciados en [0, 2), luego
y
0
= (6 e
i0x
0
+ (1 + 5i) e
i1x
0
+ 0 e
i2x
0
+ (1 5i) e
i3x
0
)/4 = 2
y
1
= (6 e
i0x
1
+ (1 + 5i) e
i1x
1
+ 0 e
i2x
1
+ (1 5i) e
i3x
1
)/4 = 1
y
2
= (6 e
i0x
2
+ (1 + 5i) e
i1x
2
+ 0 e
i2x
2
+ (1 5i) e
i3x
2
)/4 = 1
y
3
= (6 e
i0x
3
+ (1 + 5i) e
i1x
3
+ 0 e
i2x
3
+ (1 5i) e
i3x
3
)/4 = 4
MODE
4
2 (Rad) MODE 2 (Cmplx) 1 + 5
SFT
i
SFT
STO
A =
( 6 +
AHA
A
1
SFT
( 0 2 ) +
SFT
Conjg
AHA
A
1
SFT
( 3 0 2 ) ) 4 =
( 6 +
AHA
A
1
SFT
( 1 2 ) +
SFT
Conjg
AHA
A
1
SFT
( 3 1 2 ) ) 4 =
( 6 +
AHA
A
1
SFT
( 2 2 ) +
SFT
Conjg
AHA
A
1
SFT
( 3 2 2 ) ) 4 =
( 6 +
AHA
A
1
SFT
( 3 2 ) +
SFT
Conjg
AHA
A
1
SFT
( 3 3 2 ) ) 4 =
Sac

Elecci on del tama no de paso en derivacion numerica
lara f(x n(x. sc ouicrc aproximar f
(2.00 mcdiantc
f
(a
3 f(a + ! f(a + h f(a + 2h
2 h
conocidos os si.uicntcs vaorcs con ` dccimacs corrcctos
i 0 1 2 3 !
x
i
2.00 2.01 2.02 2.0o 2.12
f(x
i
0.o931` 0.o9S13 0.0310 0.221 0.`1!2
( 3
ALPHA
A
+ !
ALPHA
B

ALPHA
C
) ( 2
ALPHA
D
)
CALC .o931` = .o9S13 = .0310 = .01 =
0.!9S`0
CALC = .221 = .`1!2 = .0o =
0.!99`
SHIFT
d/dx
ln
ALPHA
X
, 2 , .01 ) =
SHIFT
d/dx
ln
ALPHA
X
, 2 , .0o ) =
0.`00000010 0.!9999999
Carga de condensador bajo coincidencia de intensidades
Sc dcsca cstimar Q(t
0
(tdt con a t ormua dc Simpson. sicndo
(t I
1
(t I
2
(t, I
1
(t scn(t, I
2
(t cxp(t 1t,
para t
> 0 raz dc f(t g(t t scn(tcxp(1 t t cacuada con

d.itos si.nicativos corrcctos mcdiantc t
k+1
g(t
k
a partir dc t
0
0.`
MODE
4
2 (lad sin
ALPHA
X

SHIFT
e
x
( 1
ALPHA
X
)
CALC .` = CALC Ans = CALC Ans = CALC Ans =
0.90!391 0.So3!3o 0.So9`!oS 0.S03So
sin
ALPHA
X

SHIFT
e
x
(
ALPHA
X
1 )
ALPHA
X
CALC .S03So 2 = .S03So ! o
0.1010S
dx sin
ALPHA
X

SHIFT
e
x
(
ALPHA
X
1 )
ALPHA
X
, 0 , S03So , 1 )
àth crror
dx sin
ALPHA
X

SHIFT
e
x
(
ALPHA
X
1 )
ALPHA
X
, 0 , S03So , ! )
0.101!`
P. Guerrero-Garc
a y

A. Santos-Palomo
Extrapolaci on de Romberg (esquema general)
Sicndo f(x cxp(x
2
. sc dcsca aproximar
1.5
1
f(xdx por cxtrapoa-
ci on dc lomcr. cn aritmctica dc d.itos
MODE
5
2 (Sci 7
SHIFT
e
x
ALPHA
X
x
2
CALC 1 =
SHIFT
Rnd
Ans
SHIFT
STO
A =
2
f(1 3.oS9! 10
01
A
CALC 1.12` =
SHIFT
Rnd
Ans
SHIFT
STO
B =
2
f(1.12` 2.S20o3010
01
L
CALC 1.2` =
SHIFT
Rnd
Ans
SHIFT
STO
C =
2
f(1.2` 2.09o11! 10
01
C
CALC 1.3` =
SHIFT
Rnd
Ans
SHIFT
STO
D =
2
f(1.3` 1.`09!10
01
L
CALC 1.` =
SHIFT
Rnd
Ans
SHIFT
STO
E = f(1.` 1.0`399210
01
L
L csoucma a sc.uir cn cstc proccso dc cxtrapoacion por paso a mitc cs
T
1
(h 0.11S319 L
T
2
(h 0.109310! C
T
1
(h/2 0.111ò2 C T
3
(h 0.1093o!!
T
2
(h/2 0.1093o10 L
T
1
(h/! 0.109911! L
dondc os c acuos intcrmcdios (dc aao hacia arria sc hicicron as
Extrapolaci on de Romberg (calculos intermedios)
(
ALPHA
A
+
ALPHA
E
+ 2 (
ALPHA
C
+
ALPHA
B
+
ALPHA
D
) ) 1o
=
SHIFT
Rnd
Ans
SHIFT
STO
D =
2
T
1
(h/! 1.09911!10
01
L
(
ALPHA
A
+
ALPHA
E
+ 2
ALPHA
C
) S
=
SHIFT
Rnd
Ans
SHIFT
STO
C =
2
T
1
(h/2 1.11ò210
01
C
(
ALPHA
A
+
ALPHA
E
) !
=
SHIFT
Rnd
Ans
SHIFT
STO
B =
2
T
1
(h 1.1S319 10
01
L
( !
ALPHA
D

ALPHA
C
) 3
=
SHIFT
Rnd
Ans
SHIFT
STO
D =
2
T
2
(h/2 1.093o1010
01
L
( !
ALPHA
C

ALPHA
B
) 3
=
SHIFT
Rnd
Ans
SHIFT
STO
C =
5
T
2
(h 1.09310! 10
01
C
( 1o
ALPHA
D

ALPHA
C
) 1` = T
3
(h 1.093o!!10
01
SHIFT
CLR
2 (òdc = AC
dx
SHIFT
e
x
ALPHA
X
x
2
, 1 , 1` , ` )
0.1093o!3 Simpson opci on ` (ic. 33 puntos
Sac

Metodo de Euler
Para resolver y
(x) = sen(x y(x)) con y(0) = 3 en el intervalo 0 x 5

usando el metodo de Euler con h = 1 en aritmetica de 4 dgitos:
MODE
4
2 (Rad) MODE
5
2 (Sci) 4
ALPHA
Y
+ 1 sin (
ALPHA
X

ALPHA
Y
)
CALC 3 = 0 =
SHIFT
Rnd
3.00010
00
CALC Ans = 1 =
SHIFT
Rnd
3.14110
00
CALC Ans = 2 =
SHIFT
Rnd
3.14010
00
CALC Ans = 3 =
SHIFT
Rnd
3.14510
00
CALC Ans = 4 =
SHIFT
Rnd
3.15910
00
Metodo predictor-corrector
Para resolver y
(x) = (x y(x))/2 con y(0) = 2 en 0 x 1 usando

(con h = 0.5 y aritmetica de 4 dgitos) el metodo predictor-corrector
k
1
= hf
i
A, k
2
= hf(x
i
+h/2, w
i
+k
1
/2) B, w
i+1
= w
i
+k
2
C,
w
P
i+1
= w
i
+
h
2
(3f
i
f
i1
) D, w
i+1
=
4
3
w
i
1
3
w
i1
+
2h
3
f
P
i+1
E
MODE
5
2 (Sci) 4 (
ALPHA
X

ALPHA
Y
) 2 CALC 0 = 2 =
SHIFT
Rnd
.5 =
SHIFT
Rnd
Ans
SHIFT
STO
A = -5.00010
01
3
CALC 0 + .5 2 = 2 +
ALPHA
A
2 =
SHIFT
Rnd
.5 =
SHIFT
Rnd
Ans
SHIFT
STO
B = -3.75010
01
2 +
ALPHA
B
=
SHIFT
Rnd
Ans
SHIFT
STO
C = 1.62510
00
6
CALC .5 =
ALPHA
C
=
SHIFT
Rnd
-5.62510
01
ALPHA
C
+ .5 ( 3 Ans + 1 ) 2 =
SHIFT
Rnd
Ans
SHIFT
STO
D = 1.45310
00
3
CALC 1 =
ALPHA
D
=
SHIFT
Rnd
-2.26510
01
( 4
ALPHA
C
2 + 2 .5 Ans ) 3 =
SHIFT
Rnd
Ans
SHIFT
STO
E = 1.42510
00

FX570MS

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

FX570MS

Uploaded by

Copyright:

Available Formats

Proceedings of the International Conference

on Computational and Mathematical Methods

Technical Report MA-08/01, 30th March 2008, http://www.satd.uma.es/matap/investig.htm. Con-

a, Slides for a Course on Numerical Methods (Spanish),

, divide into 10 (rather than into 1) at the end of the

> 0 root of f(t) = g(t) t = sin(t)exp(1 t) t computed with 7

(x) = sin(x y(x)) with y(0) = 3 in the interval 0 x 5 by

(x) = (x y(x))/2 with y(0) = 2 in 0 x 1 by using (with

andole partido a la casio fx-570ms

a, Transparencias de Metodos Numericos, Dpto. Matematica

andole partido a la casio fx-570ms

andole partido a la casio fx-570ms

andole partido a la casio fx-570ms

First Prev Next Last Go Back Full Screen Close Quit

andole partido a la casio fx-570ms

. dividir por 10 (cn vcz dc por 1 a na dc a

andole partido a la casio fx-570ms

andole partido a la casio fx-570ms

> 0 raz dc f(t g(t t scn(tcxp(1 t t cacuada con

andole partido a la casio fx-570ms

(x) = sen(x y(x)) con y(0) = 3 en el intervalo 0 x 5

(x) = (x y(x))/2 con y(0) = 2 en 0 x 1 usando

You might also like