# accsum Commit Details

Date: 2011-03-23 21:04:23 (7 years 9 months ago) Michael Baudin 17 16 Moved help page of orderdynamic.

## 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
 ␊ ␊ ␊ ␊ ␊ ␊ ␊ accsum_orderdynamicTry to find an order which makes the sum perform bad/good.␊ ␊ ␊ ␊ Calling Sequence␊ s = accsum_orderdynamic ( x , order )␊ ␊ ␊ ␊ Parametersx : a m-by-n, matrix of doublesorder : 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 accuracys : a 1-by-1 matrix of doubles, the sum␊ ␊ Description␊ Try to find an order which makes the sum perform bad/good.␊ ␊ ␊ Examples␊ ␊ AuthorsMichael Baudin, 2010␊ ␊ Bibliography"Stability and numerical accuracy of algorithms", Nicolas Higham"Handbook of Floating Point Computations", Muller et alhttps://hpcrd.lbl.gov/SCG/ocean/NRS/ECMWF/img16.htm
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
 ␊ ␊ ␊ ␊ ␊ ␊ ␊ accsum_orderdynamicTry to find an order which makes the sum perform bad/good.␊ ␊ ␊ ␊ Calling Sequence␊ s = accsum_orderdynamic ( x , order )␊ ␊ ␊ ␊ Parametersx : a m-by-n, matrix of doublesorder : 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 accuracys : a 1-by-1 matrix of doubles, the sum␊ ␊ Description␊ Try to find an order which makes the sum perform bad/good.␊ ␊ ␊ Examples␊ ␊ AuthorsMichael Baudin, 2010␊ ␊ Bibliography"Stability and numerical accuracy of algorithms", Nicolas Higham"Handbook of Floating Point Computations", Muller et alhttps://hpcrd.lbl.gov/SCG/ocean/NRS/ECMWF/img16.htm

Revision: 17