Scilab Bag Of Tricks - Claymore

More documents

Recommendations

Info

Scilab Bag Of Tricks: The Scilab-2.5.x IAQ (Infrequently Asked Questions) by Lydia E. van Dijk and Christoph L. Spiel Copyright © 2000 by L. E. van Dijk, Ch. L. Spiel sci-BOT – the Scilab Bag Of Tricks – is a collection of Scilab experience that come from every day use. We warn of common pitfalls, discuss stylistic issues, shed light on unknown spots, and show many different ways of increasing the performance of Scilab functions. The document is not meant to be comprehensive or even suitable to a particular level of knowledge. Some sections are at the beginners level, some even surprise long-time users. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.1 or any later version published by the Free Software Foundation; with no invariant sections, with the Front-Cover Texts being “Scilab Bag Of Tricks”, and with no Back-Cover Texts. A copy of the license is included in the appendix “GNU Free Documentation License”. Trademarks: DIGITAL is a trademark of Digital Equipment Corp. IBM is a trademark of International Business Machines Corp. Intel is a trademark of Intel Corp. Matlab is a trademark of The Mathworks, Inc. PostScript is a trademark of Adobe, Inc. SGI is a trademark of Silicon Graphics International, Inc. SUN is a trademark of Sun Microsystems, Inc. TeX is a trademark of the American Mathematical Society Copyrights: GNU/Linux© copyrighted by Linus Torvalds GNUPlot© copyrighted by Thomas Williams, Colin Kelley and many others MuPAD© copyrighted by Benno Fuchsensteiner Octave© copyrighted by John W. Eaton Pari© copyrighted by C. Batut, K. Belabas, D. Bernardi, H. Cohen, and M. Olivier PlotMTV© copyrighted by Kenny Toh Scilab© copyrighted by INRIA, France Tela© copyrighted by Pekka Janhunnen
Page 1: Scilab Bag Of Tricks The Scilab-2.5
Page 5 and 6: Table of Contents Preface .........
Page 7 and 8: 5.2.1. Comparison Of The Link Overh
Page 9: 1. APPLICABILITY AND DEFINITIONS ..
Page 12 and 13: 6-3. Scilab functional.............
Page 14 and 15: Preface down into the extension of
Page 16 and 17: meta-variable Preface This typeface
Page 18 and 19: Chapter 1. Introduction 18
Page 20 and 21: (1.) / ([1 2 3]) Chapter 2. Pitfall
Page 22 and 23: function y .. = foo(x) function y =
Page 24 and 25: a = 1. ->bar(3.5) ans = 2. ->bar(-1
Page 26 and 27: 7. ->a a = 3. Obviously, a is uncha
Page 28 and 29: will clear all global variables. 2.
Page 30 and 31: For example m1 = [ 1+%i -1+%i; .. -
Page 32 and 33: end ... end // while end for p = i
Page 34 and 35: [y, dy] = fun(x); end; x Chapter 3.
Page 36 and 37: Chapter 3. Style The two special ca
Page 38 and 39: Chapter 4. Unknown Spots Lisp as a
Page 40 and 41: target = source(index1, index2, ...
Page 42 and 43: Variable type Code string Code inde
Page 44 and 45: Operator Code Note Chapter 4. Unkno
Page 46 and 47: Chapter 4. Unknown Spots [p_red, q_
Page 48 and 49: precedence operator associativity c
Page 50 and 51: et_false ret_false ans = 4.4. Funct
Page 52 and 53:
Example 4-2. Function accepting opt
Page 54 and 55:
Chapter 4. Unknown Spots It is conc
Page 56 and 57:
4.4.6. Functions as Parameters in F
Page 58 and 59:
->_f = t("fun"); _f(0), clear _f an
Page 60 and 61:
Chapter 4. Unknown Spots The functi
Page 62 and 63:
Example 4-5. Generate names for lib
Page 64 and 65:
Chapter 4. Unknown Spots Multiple f
Page 66 and 67:
4.6.3. Tuple Assignment Chapter 4.
Page 68 and 69:
->exec(’script.sci’) without se
Page 70 and 71:
s = 0 // line 1 for i = 1:n // line
Page 72 and 73:
end case ’c’ then for i = cols
Page 74 and 75:
In general a nxm matrix mat can be
Page 76 and 77:
Furthermore, note that zeros() is n
Page 78 and 79:
Chapter 5. Performance The inner ca
Page 80 and 81:
Chapter 5. Performance To get the n
Page 82 and 83:
! 1141.1661 ! ! 1192.5186 ! ! 1246.
Page 84 and 85:
! 72. 23. 6. ! ! 19. 23. 56. ! ! 54
Page 86 and 87:
! 2. ! ! 8. ! ! 3. ! ! 9. ! ! 4. !
Page 88 and 89:
Chapter 5. Performance Scilab. We f
Page 90 and 91:
Chapter 5. Performance intersci, co
Page 92 and 93:
Chapter 5. Performance • Of cours
Page 94 and 95:
#include "machine.h" double C2F(fge
Page 96 and 97:
Chapter 5. Performance 00000000 W c
Page 98 and 99:
Chapter 5. Performance ld -i -o tes
Page 100 and 101:
-fschedule-insns2 Chapter 5. Perfor
Page 102 and 103:
Table 6-1. pAda to Fortran-77 and C
Page 104 and 105:
addr + 3*Float’Size : CpxVec(2).I
Page 106 and 107:
Chapter 6. Scilab Core But as Scila
Page 108 and 109:
6.3. Writing Native Scilab Function
Page 110 and 111:
Info : out Integer); - error indica
Page 112 and 113:
eturn endif call dorgqr(m, n, tausz
Page 114 and 115:
Chapter 6. Scilab Core Note how the
Page 116 and 117:
Result : out Float; ErrorAbsolute :
Page 118 and 119:
Chapter 6. Scilab Core * pop mandat
Page 120 and 121:
Chapter 6. Scilab Core ➐ For ints
Page 122 and 123:
Chapter 6. Scilab Core If there is
Page 124 and 125:
6.5.1.1. checkrhs Synopsis function
Page 126 and 127:
Description See also Chapter 6. Sci
Page 128 and 129:
6.5.2.3. getrvect Synopsis function
Page 130 and 131:
eturn Boolean; Description Chapter
Page 132 and 133:
See also Functionals, Dispatch Tabl
Page 134 and 135:
6.6.1.2. CheckLhs Synopsis function
Page 136 and 137:
6.6.1.5. GetType Synopsis function
Page 138 and 139:
Example Chapter 6. Scilab Core On s
Page 140 and 141:
Example ... See also ... 6.6.2.5. L
Page 142 and 143:
Example Chapter 6. Scilab Core On r
Page 144 and 145:
See also ... 6.6.3.5. WriteString S
Page 146 and 147:
6.6.4.3. ReadString Synopsis proced
Page 148 and 149:
Chapter 6. Scilab Core 148
Page 150 and 151:
Chapter 7. Further Information We r
Page 152 and 153:
Chapter 7. Further Information Comm
Page 154 and 155:
Chapter 7. Further Information 154
Page 156 and 157:
if q == 0, error(’not a fraction
Page 158 and 159:
= %frac_o_frac(f, frac(s)) function
Page 160 and 161:
end Chapter 8. Complete Examples t
Page 162 and 163:
(recursive implementation) select l
Page 164 and 165:
f / g == 2 f / 2 == g 2 / f == 3 9
Page 166 and 167:
Chapter 8. Complete Examples s = fr
Page 168 and 169:
end // run real test disp(’+++ ru
Page 170 and 171:
if n1 == 0 & n2 == 0, return, end i
Page 172 and 173:
Copyright 1999, 2000 by Enrico Segr
Page 174 and 175:
Chapter 8. Complete Examples tnam =
Page 176 and 177:
end //disp(r) 8.5.2. prec.sci if eq
Page 178 and 179:
end end end 8.5.3. parser.sci end /
Page 180 and 181:
end if size(macname, ’*’) ~= 1
Page 182 and 183:
’intgen’, ’intgk’, ’intin
Page 184 and 185:
Appendix A. GNU Free Documentation
Page 186 and 187:
D. Preserve all the copyright notic
Page 188 and 189:
Appendix A. GNU Free Documentation
Page 190 and 191:
Appendix B. GNU General Public Lice
Page 192 and 193:
Page 194 and 195:
9. FUTURE REVISIONS OF THIS LICENSE
Page 196 and 197:
Page 198 and 199:
Bibliography 198
Page 200 and 201:
B C pseudo (See pseudo Ada) Ada ext
Page 202 and 203:
genlib, 63 size of, 36 functions AP
Page 204 and 205:
O native functions (See Scilab, nat
Page 206 and 207:
S save (See function, save) scalar
Page 208:
clearing, 28 global, 27, 28 local,
show all

Scilab Bag Of Tricks - Claymore

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?