accsum

accsum Commit Details

Date:2011-03-23 21:04:23 (7 years 1 month ago)
Author:Michael Baudin
Commit:17
Parents: 16
Message:Moved help page of orderdynamic.
Changes:
R/help/en_US/support/accsum_orderdynamic.xml → /help/en_US/accsum_orderdynamic.xml

File differences

help/en_US/accsum_orderdynamic.xml
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
<?xml version="1.0" encoding="UTF-8"?>
<!--
*
* This help file was generated from accsum_orderdynamic.sci using help_from_sci().
*
-->
<refentry version="5.0-subset Scilab" xml:id="accsum_orderdynamic" xml:lang="en"
xmlns="http://docbook.org/ns/docbook"
xmlns:xlink="http://www.w3.org/1999/xlink"
xmlns:svg="http://www.w3.org/2000/svg"
xmlns:ns3="http://www.w3.org/1999/xhtml"
xmlns:mml="http://www.w3.org/1998/Math/MathML"
xmlns:db="http://docbook.org/ns/docbook">
<refnamediv>
<refname>accsum_orderdynamic</refname><refpurpose>Try to find an order which makes the sum perform bad/good.</refpurpose>
</refnamediv>
<refsynopsisdiv>
<title>Calling Sequence</title>
<synopsis>
s = accsum_orderdynamic ( x , order )
</synopsis>
</refsynopsisdiv>
<refsection>
<title>Parameters</title>
<variablelist>
<varlistentry><term>x :</term>
<listitem><para> a m-by-n, matrix of doubles</para></listitem></varlistentry>
<varlistentry><term>order :</term>
<listitem><para> a 1-by-1 matrix of doubles, a positive integer, the order. order = 1 : search for the entry which makes the smallest |s+y(i)|, good for accuracy, order = 2 : search for the entry which makes the largest |s+y(i)|, bad for accuracy</para></listitem></varlistentry>
<varlistentry><term>s :</term>
<listitem><para> a 1-by-1 matrix of doubles, the sum</para></listitem></varlistentry>
</variablelist>
</refsection>
<refsection>
<title>Description</title>
<para>
Try to find an order which makes the sum perform bad/good.
</para>
<para>
</para>
</refsection>
<refsection>
<title>Examples</title>
<programlisting role="example"><![CDATA[
// Test on simple data
x = [-9.9 5.5 2.2 -3.3 -6.6 0 1.1]
sum(x)
s = accsum_orderdynamic ( x , 1 )
s = accsum_orderdynamic ( x , 2 )
// Test on difficult data
path = accsum_getpath ( );
filename=fullfile(path,"demos","etaana.dat");
x=fscanfMat(filename);
// 7.390949249267578125000
sum(x)
// 0.3437500000000000000000
s = accsum_orderdynamic ( x , 1 )
// - 73.015625
s = accsum_orderdynamic ( x , 2 )
]]></programlisting>
</refsection>
<refsection>
<title>Authors</title>
<simplelist type="vert">
<member>Michael Baudin, 2010</member>
</simplelist>
</refsection>
<refsection>
<title>Bibliography</title>
<para>"Stability and numerical accuracy of algorithms", Nicolas Higham</para>
<para>"Handbook of Floating Point Computations", Muller et al</para>
<para>https://hpcrd.lbl.gov/SCG/ocean/NRS/ECMWF/img16.htm</para>
</refsection>
</refentry>
help/en_US/support/accsum_orderdynamic.xml
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
<?xml version="1.0" encoding="UTF-8"?>
<!--
*
* This help file was generated from accsum_orderdynamic.sci using help_from_sci().
*
-->
<refentry version="5.0-subset Scilab" xml:id="accsum_orderdynamic" xml:lang="en"
xmlns="http://docbook.org/ns/docbook"
xmlns:xlink="http://www.w3.org/1999/xlink"
xmlns:svg="http://www.w3.org/2000/svg"
xmlns:ns3="http://www.w3.org/1999/xhtml"
xmlns:mml="http://www.w3.org/1998/Math/MathML"
xmlns:db="http://docbook.org/ns/docbook">
<refnamediv>
<refname>accsum_orderdynamic</refname><refpurpose>Try to find an order which makes the sum perform bad/good.</refpurpose>
</refnamediv>
<refsynopsisdiv>
<title>Calling Sequence</title>
<synopsis>
s = accsum_orderdynamic ( x , order )
</synopsis>
</refsynopsisdiv>
<refsection>
<title>Parameters</title>
<variablelist>
<varlistentry><term>x :</term>
<listitem><para> a m-by-n, matrix of doubles</para></listitem></varlistentry>
<varlistentry><term>order :</term>
<listitem><para> a 1-by-1 matrix of doubles, a positive integer, the order. order = 1 : search for the entry which makes the smallest |s+y(i)|, good for accuracy, order = 2 : search for the entry which makes the largest |s+y(i)|, bad for accuracy</para></listitem></varlistentry>
<varlistentry><term>s :</term>
<listitem><para> a 1-by-1 matrix of doubles, the sum</para></listitem></varlistentry>
</variablelist>
</refsection>
<refsection>
<title>Description</title>
<para>
Try to find an order which makes the sum perform bad/good.
</para>
<para>
</para>
</refsection>
<refsection>
<title>Examples</title>
<programlisting role="example"><![CDATA[
// Test on simple data
x = [-9.9 5.5 2.2 -3.3 -6.6 0 1.1]
sum(x)
s = accsum_orderdynamic ( x , 1 )
s = accsum_orderdynamic ( x , 2 )
// Test on difficult data
path = accsum_getpath ( );
filename=fullfile(path,"demos","etaana.dat");
x=fscanfMat(filename);
// 7.390949249267578125000
sum(x)
// 0.3437500000000000000000
s = accsum_orderdynamic ( x , 1 )
// - 73.015625
s = accsum_orderdynamic ( x , 2 )
]]></programlisting>
</refsection>
<refsection>
<title>Authors</title>
<simplelist type="vert">
<member>Michael Baudin, 2010</member>
</simplelist>
</refsection>
<refsection>
<title>Bibliography</title>
<para>"Stability and numerical accuracy of algorithms", Nicolas Higham</para>
<para>"Handbook of Floating Point Computations", Muller et al</para>
<para>https://hpcrd.lbl.gov/SCG/ocean/NRS/ECMWF/img16.htm</para>
</refsection>
</refentry>

Archive Download the corresponding diff file

Revision: 17