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
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>polylib: matrix.c Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<!-- Generated by Doxygen 1.6.1 -->
<div class="navigation" id="top">
<div class="tabs">
<ul>
<li><a href="main.html"><span>Main Page</span></a></li>
<li><a href="annotated.html"><span>Classes</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div class="tabs">
<ul>
<li><a href="files.html"><span>File List</span></a></li>
<li><a href="globals.html"><span>File Members</span></a></li>
</ul>
</div>
<h1>matrix.c</h1><a href="matrix_8c.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*</span>
<a name="l00002"></a>00002 <span class="comment"> This file is part of PolyLib.</span>
<a name="l00003"></a>00003 <span class="comment"></span>
<a name="l00004"></a>00004 <span class="comment"> PolyLib is free software: you can redistribute it and/or modify</span>
<a name="l00005"></a>00005 <span class="comment"> it under the terms of the GNU General Public License as published by</span>
<a name="l00006"></a>00006 <span class="comment"> the Free Software Foundation, either version 3 of the License, or</span>
<a name="l00007"></a>00007 <span class="comment"> (at your option) any later version.</span>
<a name="l00008"></a>00008 <span class="comment"></span>
<a name="l00009"></a>00009 <span class="comment"> PolyLib is distributed in the hope that it will be useful,</span>
<a name="l00010"></a>00010 <span class="comment"> but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00011"></a>00011 <span class="comment"> MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span>
<a name="l00012"></a>00012 <span class="comment"> GNU General Public License for more details.</span>
<a name="l00013"></a>00013 <span class="comment"></span>
<a name="l00014"></a>00014 <span class="comment"> You should have received a copy of the GNU General Public License</span>
<a name="l00015"></a>00015 <span class="comment"> along with PolyLib. If not, see <http://www.gnu.org/licenses/>.</span>
<a name="l00016"></a>00016 <span class="comment">*/</span>
<a name="l00017"></a>00017
<a name="l00018"></a>00018 <span class="comment">/* matrix.c </span>
<a name="l00019"></a>00019 <span class="comment"> COPYRIGHT</span>
<a name="l00020"></a>00020 <span class="comment"> Both this software and its documentation are</span>
<a name="l00021"></a>00021 <span class="comment"></span>
<a name="l00022"></a>00022 <span class="comment"> Copyright 1993 by IRISA /Universite de Rennes I -</span>
<a name="l00023"></a>00023 <span class="comment"> France, Copyright 1995,1996 by BYU, Provo, Utah</span>
<a name="l00024"></a>00024 <span class="comment"> all rights reserved.</span>
<a name="l00025"></a>00025 <span class="comment"></span>
<a name="l00026"></a>00026 <span class="comment"> Permission is granted to copy, use, and distribute</span>
<a name="l00027"></a>00027 <span class="comment"> for any commercial or noncommercial purpose under the terms</span>
<a name="l00028"></a>00028 <span class="comment"> of the GNU General Public license, version 2, June 1991</span>
<a name="l00029"></a>00029 <span class="comment"> (see file : LICENSING).</span>
<a name="l00030"></a>00030 <span class="comment">*/</span>
<a name="l00031"></a>00031
<a name="l00032"></a>00032 <span class="preprocessor">#include <stdio.h></span>
<a name="l00033"></a>00033 <span class="preprocessor">#include <stdlib.h></span>
<a name="l00034"></a>00034 <span class="preprocessor">#include <string.h></span>
<a name="l00035"></a>00035 <span class="preprocessor">#include <ctype.h></span>
<a name="l00036"></a>00036 <span class="preprocessor">#include <<a class="code" href="polylib_8h.html">polylib/polylib.h</a>></span>
<a name="l00037"></a>00037
<a name="l00038"></a>00038 <span class="preprocessor">#ifdef mac_os</span>
<a name="l00039"></a>00039 <span class="preprocessor"></span><span class="preprocessor"> #define abs __abs</span>
<a name="l00040"></a>00040 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00041"></a>00041 <span class="preprocessor"></span>
<a name="l00042"></a>00042 <span class="comment">/* </span>
<a name="l00043"></a>00043 <span class="comment"> * Allocate space for matrix dimensioned by 'NbRows X NbColumns'.</span>
<a name="l00044"></a>00044 <span class="comment"> */</span>
<a name="l00045"></a><a class="code" href="matrix_8h.html#ac0b29e1d99a2823ad00b5f2157879d80">00045</a> <a class="code" href="structmatrix.html">Matrix</a> *<a class="code" href="matrix_8c.html#ac0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(<span class="keywordtype">unsigned</span> NbRows,<span class="keywordtype">unsigned</span> NbColumns) {
<a name="l00046"></a>00046
<a name="l00047"></a>00047 <a class="code" href="structmatrix.html">Matrix</a> *Mat;
<a name="l00048"></a>00048 Value *<a class="code" href="vector_8c.html#aa45b2e3dcf291527c5aedc420819adfc">p</a>, **q;
<a name="l00049"></a>00049 <span class="keywordtype">int</span> i,j;
<a name="l00050"></a>00050
<a name="l00051"></a>00051 Mat=(<a class="code" href="structmatrix.html">Matrix</a> *)malloc(<span class="keyword">sizeof</span>(<a class="code" href="structmatrix.html">Matrix</a>));
<a name="l00052"></a>00052 <span class="keywordflow">if</span>(!Mat) {
<a name="l00053"></a>00053 <a class="code" href="errormsg_8c.html#a1ac398d9106568a1991a001172e0e00b">errormsg1</a>(<span class="stringliteral">"Matrix_Alloc"</span>, <span class="stringliteral">"outofmem"</span>, <span class="stringliteral">"out of memory space"</span>);
<a name="l00054"></a>00054 <span class="keywordflow">return</span> 0;
<a name="l00055"></a>00055 }
<a name="l00056"></a>00056 Mat-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a>=NbRows;
<a name="l00057"></a>00057 Mat-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a>=NbColumns;
<a name="l00058"></a>00058 <span class="keywordflow">if</span> (NbRows==0 || NbColumns==0) {
<a name="l00059"></a>00059 Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a> = (Value **)0;
<a name="l00060"></a>00060 Mat-><a class="code" href="structmatrix.html#a9c294a3fd4d273963e27a0c8cd819bd5">p_Init</a>= (Value *)0;
<a name="l00061"></a>00061 Mat-><a class="code" href="structmatrix.html#a5dc523eba55ca76f0a7eba9ec325cbe5">p_Init_size</a> = 0;
<a name="l00062"></a>00062 } <span class="keywordflow">else</span> {
<a name="l00063"></a>00063 q = (Value **)malloc(NbRows * <span class="keyword">sizeof</span>(*q));
<a name="l00064"></a>00064 <span class="keywordflow">if</span>(!q) {
<a name="l00065"></a>00065 free(Mat);
<a name="l00066"></a>00066 <a class="code" href="errormsg_8c.html#a1ac398d9106568a1991a001172e0e00b">errormsg1</a>(<span class="stringliteral">"Matrix_Alloc"</span>, <span class="stringliteral">"outofmem"</span>, <span class="stringliteral">"out of memory space"</span>);
<a name="l00067"></a>00067 <span class="keywordflow">return</span> 0;
<a name="l00068"></a>00068 }
<a name="l00069"></a>00069 p = <a class="code" href="vector_8c.html#ae8b0745702c689f66f3d12bc17f93f58">value_alloc</a>(NbRows * NbColumns, &Mat-><a class="code" href="structmatrix.html#a5dc523eba55ca76f0a7eba9ec325cbe5">p_Init_size</a>);
<a name="l00070"></a>00070 <span class="keywordflow">if</span>(!p) {
<a name="l00071"></a>00071 free(q);
<a name="l00072"></a>00072 free(Mat);
<a name="l00073"></a>00073 <a class="code" href="errormsg_8c.html#a1ac398d9106568a1991a001172e0e00b">errormsg1</a>(<span class="stringliteral">"Matrix_Alloc"</span>, <span class="stringliteral">"outofmem"</span>, <span class="stringliteral">"out of memory space"</span>);
<a name="l00074"></a>00074 <span class="keywordflow">return</span> 0;
<a name="l00075"></a>00075 }
<a name="l00076"></a>00076 Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a> = q;
<a name="l00077"></a>00077 Mat-><a class="code" href="structmatrix.html#a9c294a3fd4d273963e27a0c8cd819bd5">p_Init</a> = p;
<a name="l00078"></a>00078 <span class="keywordflow">for</span> (i=0;i<NbRows;i++) {
<a name="l00079"></a>00079 *q++ = p;
<a name="l00080"></a>00080 p += NbColumns;
<a name="l00081"></a>00081 }
<a name="l00082"></a>00082 }
<a name="l00083"></a>00083 p = NULL;
<a name="l00084"></a>00084 q = NULL;
<a name="l00085"></a>00085
<a name="l00086"></a>00086 <span class="keywordflow">return</span> Mat;
<a name="l00087"></a>00087 } <span class="comment">/* Matrix_Alloc */</span>
<a name="l00088"></a>00088
<a name="l00089"></a>00089 <span class="comment">/* </span>
<a name="l00090"></a>00090 <span class="comment"> * Free the memory space occupied by Matrix 'Mat' </span>
<a name="l00091"></a>00091 <span class="comment"> */</span>
<a name="l00092"></a><a class="code" href="matrix_8h.html#afcb312b7c12a6997cd66964ecc34e1a6">00092</a> <span class="keywordtype">void</span> <a class="code" href="matrix_8c.html#afcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(<a class="code" href="structmatrix.html">Matrix</a> *Mat)
<a name="l00093"></a>00093 {
<a name="l00094"></a>00094 <span class="keywordflow">if</span> (Mat-><a class="code" href="structmatrix.html#a9c294a3fd4d273963e27a0c8cd819bd5">p_Init</a>)
<a name="l00095"></a>00095 <a class="code" href="vector_8c.html#a3e050c3a0fbb40af2a15f874835e34a4">value_free</a>(Mat-><a class="code" href="structmatrix.html#a9c294a3fd4d273963e27a0c8cd819bd5">p_Init</a>, Mat-><a class="code" href="structmatrix.html#a5dc523eba55ca76f0a7eba9ec325cbe5">p_Init_size</a>);
<a name="l00096"></a>00096
<a name="l00097"></a>00097 <span class="keywordflow">if</span> (Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>)
<a name="l00098"></a>00098 free(Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>);
<a name="l00099"></a>00099 free(Mat);
<a name="l00100"></a>00100
<a name="l00101"></a>00101 } <span class="comment">/* Matrix_Free */</span>
<a name="l00102"></a>00102
<a name="l00103"></a><a class="code" href="matrix_8h.html#a22b92aad923f05a327d06d761f0396e0">00103</a> <span class="keywordtype">void</span> <a class="code" href="matrix_8c.html#a22b92aad923f05a327d06d761f0396e0">Matrix_Extend</a>(<a class="code" href="structmatrix.html">Matrix</a> *Mat, <span class="keywordtype">unsigned</span> NbRows)
<a name="l00104"></a>00104 {
<a name="l00105"></a>00105 Value *<a class="code" href="vector_8c.html#aa45b2e3dcf291527c5aedc420819adfc">p</a>, **q;
<a name="l00106"></a>00106 <span class="keywordtype">int</span> i,j;
<a name="l00107"></a>00107
<a name="l00108"></a>00108 q = (Value **)realloc(Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>, NbRows * <span class="keyword">sizeof</span>(*q));
<a name="l00109"></a>00109 <span class="keywordflow">if</span>(!q) {
<a name="l00110"></a>00110 <a class="code" href="errormsg_8c.html#a1ac398d9106568a1991a001172e0e00b">errormsg1</a>(<span class="stringliteral">"Matrix_Extend"</span>, <span class="stringliteral">"outofmem"</span>, <span class="stringliteral">"out of memory space"</span>);
<a name="l00111"></a>00111 <span class="keywordflow">return</span>;
<a name="l00112"></a>00112 }
<a name="l00113"></a>00113 Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a> = q;
<a name="l00114"></a>00114 <span class="keywordflow">if</span> (Mat-><a class="code" href="structmatrix.html#a5dc523eba55ca76f0a7eba9ec325cbe5">p_Init_size</a> < NbRows * Mat-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a>) {
<a name="l00115"></a>00115 p = (Value *)realloc(Mat-><a class="code" href="structmatrix.html#a9c294a3fd4d273963e27a0c8cd819bd5">p_Init</a>, NbRows * Mat-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a> * <span class="keyword">sizeof</span>(Value));
<a name="l00116"></a>00116 <span class="keywordflow">if</span>(!p) {
<a name="l00117"></a>00117 <a class="code" href="errormsg_8c.html#a1ac398d9106568a1991a001172e0e00b">errormsg1</a>(<span class="stringliteral">"Matrix_Extend"</span>, <span class="stringliteral">"outofmem"</span>, <span class="stringliteral">"out of memory space"</span>);
<a name="l00118"></a>00118 <span class="keywordflow">return</span>;
<a name="l00119"></a>00119 }
<a name="l00120"></a>00120 Mat-><a class="code" href="structmatrix.html#a9c294a3fd4d273963e27a0c8cd819bd5">p_Init</a> = p;
<a name="l00121"></a>00121 <a class="code" href="vector_8c.html#a27ccb3ea01f3a496bb799fb99e9e3075">Vector_Set</a>(Mat-><a class="code" href="structmatrix.html#a9c294a3fd4d273963e27a0c8cd819bd5">p_Init</a> + Mat-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a>*Mat-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a>, 0,
<a name="l00122"></a>00122 Mat-><a class="code" href="structmatrix.html#a5dc523eba55ca76f0a7eba9ec325cbe5">p_Init_size</a> - Mat-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a>*Mat-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a>);
<a name="l00123"></a>00123 <span class="keywordflow">for</span> (i = Mat-><a class="code" href="structmatrix.html#a5dc523eba55ca76f0a7eba9ec325cbe5">p_Init_size</a>; i < Mat->NbColumns*NbRows; ++i)
<a name="l00124"></a>00124 <a class="code" href="source_2arith_2arithmetique_8h.html#af71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(Mat-><a class="code" href="structmatrix.html#a9c294a3fd4d273963e27a0c8cd819bd5">p_Init</a>[i]);
<a name="l00125"></a>00125 Mat-><a class="code" href="structmatrix.html#a5dc523eba55ca76f0a7eba9ec325cbe5">p_Init_size</a> = Mat-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a>*NbRows;
<a name="l00126"></a>00126 } <span class="keywordflow">else</span>
<a name="l00127"></a>00127 <a class="code" href="vector_8c.html#a27ccb3ea01f3a496bb799fb99e9e3075">Vector_Set</a>(Mat-><a class="code" href="structmatrix.html#a9c294a3fd4d273963e27a0c8cd819bd5">p_Init</a> + Mat-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a>*Mat-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a>, 0,
<a name="l00128"></a>00128 (NbRows - Mat-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a>) * Mat-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a>);
<a name="l00129"></a>00129 <span class="keywordflow">for</span> (i=0;i<NbRows;i++) {
<a name="l00130"></a>00130 Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i] = Mat-><a class="code" href="structmatrix.html#a9c294a3fd4d273963e27a0c8cd819bd5">p_Init</a> + (i * Mat-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a>);
<a name="l00131"></a>00131 }
<a name="l00132"></a>00132 Mat-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a> = NbRows;
<a name="l00133"></a>00133 }
<a name="l00134"></a>00134
<a name="l00135"></a>00135 <span class="comment">/* </span>
<a name="l00136"></a>00136 <span class="comment"> * Print the contents of the Matrix 'Mat'</span>
<a name="l00137"></a>00137 <span class="comment"> */</span>
<a name="l00138"></a><a class="code" href="matrix_8h.html#ad4c3c350dba633f72bbcf3609b6b67d7">00138</a> <span class="keywordtype">void</span> <a class="code" href="matrix_8c.html#ad4c3c350dba633f72bbcf3609b6b67d7">Matrix_Print</a>(FILE *Dst, <span class="keyword">const</span> <span class="keywordtype">char</span> *Format, <a class="code" href="structmatrix.html">Matrix</a> *Mat)
<a name="l00139"></a>00139 {
<a name="l00140"></a>00140 Value *<a class="code" href="vector_8c.html#aa45b2e3dcf291527c5aedc420819adfc">p</a>;
<a name="l00141"></a>00141 <span class="keywordtype">int</span> i, j;
<a name="l00142"></a>00142 <span class="keywordtype">unsigned</span> NbRows, NbColumns;
<a name="l00143"></a>00143
<a name="l00144"></a>00144 fprintf(Dst,<span class="stringliteral">"%d %d\n"</span>, NbRows=Mat-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a>, NbColumns=Mat-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a>);
<a name="l00145"></a>00145 <span class="keywordflow">if</span> (NbColumns ==0) {
<a name="l00146"></a>00146 fprintf(Dst, <span class="stringliteral">"\n"</span>);
<a name="l00147"></a>00147 <span class="keywordflow">return</span>;
<a name="l00148"></a>00148 }
<a name="l00149"></a>00149 <span class="keywordflow">for</span> (i=0;i<NbRows;i++) {
<a name="l00150"></a>00150 p=*(Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>+i);
<a name="l00151"></a>00151 <span class="keywordflow">for</span> (j=0;j<NbColumns;j++) {
<a name="l00152"></a>00152 <span class="keywordflow">if</span> (!Format) {
<a name="l00153"></a>00153 <a class="code" href="source_2arith_2arithmetique_8h.html#ad34605b56b571830b928b50a74d618b7">value_print</a>(Dst,<span class="stringliteral">" "</span><a class="code" href="types_8h.html#ae6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a><span class="stringliteral">" "</span>,*p++);
<a name="l00154"></a>00154 }
<a name="l00155"></a>00155 <span class="keywordflow">else</span> {
<a name="l00156"></a>00156 <a class="code" href="source_2arith_2arithmetique_8h.html#ad34605b56b571830b928b50a74d618b7">value_print</a>(Dst,Format,*p++);
<a name="l00157"></a>00157 }
<a name="l00158"></a>00158 }
<a name="l00159"></a>00159 fprintf(Dst, <span class="stringliteral">"\n"</span>);
<a name="l00160"></a>00160 }
<a name="l00161"></a>00161 } <span class="comment">/* Matrix_Print */</span>
<a name="l00162"></a>00162
<a name="l00163"></a>00163 <span class="comment">/* </span>
<a name="l00164"></a>00164 <span class="comment"> * Read the contents of the Matrix 'Mat' </span>
<a name="l00165"></a>00165 <span class="comment"> */</span>
<a name="l00166"></a><a class="code" href="matrix_8h.html#a40c219a9893d0f0ea7f9448ad27fcc3d">00166</a> <span class="keywordtype">void</span> <a class="code" href="matrix_8c.html#a40c219a9893d0f0ea7f9448ad27fcc3d">Matrix_Read_Input</a>(<a class="code" href="structmatrix.html">Matrix</a> *Mat) {
<a name="l00167"></a>00167
<a name="l00168"></a>00168 Value *<a class="code" href="vector_8c.html#aa45b2e3dcf291527c5aedc420819adfc">p</a>;
<a name="l00169"></a>00169 <span class="keywordtype">int</span> i,j,<a class="code" href="polyparam_8c.html#a76f11d9a0a47b94f72c2d0e77fb32240">n</a>;
<a name="l00170"></a>00170 <span class="keywordtype">char</span> *c, <a class="code" href="polytest_8c.html#a27d9a0cff1341bbc004fabd1ad8a1543">s</a>[1024],str[1024];
<a name="l00171"></a>00171
<a name="l00172"></a>00172 p = Mat-><a class="code" href="structmatrix.html#a9c294a3fd4d273963e27a0c8cd819bd5">p_Init</a>;
<a name="l00173"></a>00173 <span class="keywordflow">for</span> (i=0;i<Mat-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a>;i++) {
<a name="l00174"></a>00174 <span class="keywordflow">do</span> {
<a name="l00175"></a>00175 c = fgets(s, 1024, stdin);
<a name="l00176"></a>00176 <span class="keywordflow">while</span>(isspace(*c) && *c!=<span class="charliteral">'\n'</span>)
<a name="l00177"></a>00177 ++c;
<a name="l00178"></a>00178 } <span class="keywordflow">while</span>(c && (*c ==<span class="charliteral">'#'</span> || *c== <span class="charliteral">'\n'</span>));
<a name="l00179"></a>00179
<a name="l00180"></a>00180 <span class="keywordflow">if</span> (!c) {
<a name="l00181"></a>00181 <a class="code" href="errormsg_8c.html#a1ac398d9106568a1991a001172e0e00b">errormsg1</a>( <span class="stringliteral">"Matrix_Read"</span>, <span class="stringliteral">"baddim"</span>, <span class="stringliteral">"not enough rows"</span> );
<a name="l00182"></a>00182 <span class="keywordflow">break</span>;
<a name="l00183"></a>00183 }
<a name="l00184"></a>00184 <span class="keywordflow">for</span> (j=0;j<Mat-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a>;j++) {
<a name="l00185"></a>00185 <span class="keywordflow">if</span>(!c || *c==<span class="charliteral">'\n'</span> || *c==<span class="charliteral">'#'</span>) {
<a name="l00186"></a>00186 <a class="code" href="errormsg_8c.html#a1ac398d9106568a1991a001172e0e00b">errormsg1</a>(<span class="stringliteral">"Matrix_Read"</span>, <span class="stringliteral">"baddim"</span>, <span class="stringliteral">"not enough columns"</span>);
<a name="l00187"></a>00187 <span class="keywordflow">break</span>;
<a name="l00188"></a>00188 }
<a name="l00189"></a>00189 <span class="keywordflow">if</span> (sscanf(c,<span class="stringliteral">"%s%n"</span>,str,&n) == 0) {
<a name="l00190"></a>00190 <a class="code" href="errormsg_8c.html#a1ac398d9106568a1991a001172e0e00b">errormsg1</a>( <span class="stringliteral">"Matrix_Read"</span>, <span class="stringliteral">"baddim"</span>, <span class="stringliteral">"not enough columns"</span> );
<a name="l00191"></a>00191 <span class="keywordflow">break</span>;
<a name="l00192"></a>00192 }
<a name="l00193"></a>00193 <a class="code" href="source_2arith_2arithmetique_8h.html#ab8a77ddf3765fd598f31d8ca2ac4705c">value_read</a>(*(p++),str);
<a name="l00194"></a>00194 c += n;
<a name="l00195"></a>00195 }
<a name="l00196"></a>00196 }
<a name="l00197"></a>00197 } <span class="comment">/* Matrix_Read_Input */</span>
<a name="l00198"></a>00198
<a name="l00199"></a>00199 <span class="comment">/* </span>
<a name="l00200"></a>00200 <span class="comment"> * Read the contents of the matrix 'Mat' from standard input. </span>
<a name="l00201"></a>00201 <span class="comment"> * A '#' in the first column is a comment line </span>
<a name="l00202"></a>00202 <span class="comment"> */</span>
<a name="l00203"></a><a class="code" href="matrix_8h.html#a3a087ae9a03d5baf0b81831177931143">00203</a> <a class="code" href="structmatrix.html">Matrix</a> *<a class="code" href="matrix_8c.html#a3a087ae9a03d5baf0b81831177931143">Matrix_Read</a>(<span class="keywordtype">void</span>) {
<a name="l00204"></a>00204
<a name="l00205"></a>00205 <a class="code" href="structmatrix.html">Matrix</a> *Mat;
<a name="l00206"></a>00206 <span class="keywordtype">unsigned</span> NbRows, NbColumns;
<a name="l00207"></a>00207 <span class="keywordtype">char</span> <a class="code" href="polytest_8c.html#a27d9a0cff1341bbc004fabd1ad8a1543">s</a>[1024];
<a name="l00208"></a>00208
<a name="l00209"></a>00209 <span class="keywordflow">if</span> (fgets(s, 1024, stdin) == NULL)
<a name="l00210"></a>00210 <span class="keywordflow">return</span> NULL;
<a name="l00211"></a>00211 <span class="keywordflow">while</span> ((*s==<span class="charliteral">'#'</span> || *s==<span class="charliteral">'\n'</span>) ||
<a name="l00212"></a>00212 (sscanf(s, <span class="stringliteral">"%d %d"</span>, &NbRows, &NbColumns)<2)) {
<a name="l00213"></a>00213 <span class="keywordflow">if</span> (fgets(s, 1024, stdin) == NULL)
<a name="l00214"></a>00214 <span class="keywordflow">return</span> NULL;
<a name="l00215"></a>00215 }
<a name="l00216"></a>00216 Mat = <a class="code" href="matrix_8c.html#ac0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(NbRows,NbColumns);
<a name="l00217"></a>00217 <span class="keywordflow">if</span>(!Mat) {
<a name="l00218"></a>00218 <a class="code" href="errormsg_8c.html#a1ac398d9106568a1991a001172e0e00b">errormsg1</a>(<span class="stringliteral">"Matrix_Read"</span>, <span class="stringliteral">"outofmem"</span>, <span class="stringliteral">"out of memory space"</span>);
<a name="l00219"></a>00219 <span class="keywordflow">return</span>(NULL);
<a name="l00220"></a>00220 }
<a name="l00221"></a>00221 <a class="code" href="matrix_8c.html#a40c219a9893d0f0ea7f9448ad27fcc3d">Matrix_Read_Input</a>(Mat);
<a name="l00222"></a>00222 <span class="keywordflow">return</span> Mat;
<a name="l00223"></a>00223 } <span class="comment">/* Matrix_Read */</span>
<a name="l00224"></a>00224
<a name="l00225"></a>00225 <span class="comment">/* </span>
<a name="l00226"></a>00226 <span class="comment"> * Basic hermite engine </span>
<a name="l00227"></a>00227 <span class="comment"> */</span>
<a name="l00228"></a><a class="code" href="matrix_8c.html#a0913852253401fd132b31cc4a205c1de">00228</a> <span class="keyword">static</span> <span class="keywordtype">int</span> <a class="code" href="matrix_8c.html#a0913852253401fd132b31cc4a205c1de">hermite</a>(<a class="code" href="structmatrix.html">Matrix</a> *H,<a class="code" href="structmatrix.html">Matrix</a> *U,<a class="code" href="structmatrix.html">Matrix</a> *Q) {
<a name="l00229"></a>00229
<a name="l00230"></a>00230 <span class="keywordtype">int</span> nc, <a class="code" href="polyparam_8c.html#a2833bf188e6bf292fa7d61e2dd54d622">nr</a>, i, j, k, rank, reduced, pivotrow;
<a name="l00231"></a>00231 Value pivot,x,aux;
<a name="l00232"></a>00232 Value *temp1, *temp2;
<a name="l00233"></a>00233
<a name="l00234"></a>00234 <span class="comment">/* T -1 T */</span>
<a name="l00235"></a>00235 <span class="comment">/* Computes form: A = Q H and U A = H and U = Q */</span>
<a name="l00236"></a>00236
<a name="l00237"></a>00237 <span class="keywordflow">if</span> (!H) {
<a name="l00238"></a>00238 <a class="code" href="errormsg_8c.html#a1ac398d9106568a1991a001172e0e00b">errormsg1</a>(<span class="stringliteral">"Domlib"</span>, <span class="stringliteral">"nullH"</span>, <span class="stringliteral">"hermite: ? Null H"</span>);
<a name="l00239"></a>00239 <span class="keywordflow">return</span> -1;
<a name="l00240"></a>00240 }
<a name="l00241"></a>00241 nc = H-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a>;
<a name="l00242"></a>00242 nr = H-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a>;
<a name="l00243"></a>00243 temp1 = (Value *) malloc(nc * <span class="keyword">sizeof</span>(Value));
<a name="l00244"></a>00244 temp2 = (Value *) malloc(nr * <span class="keyword">sizeof</span>(Value));
<a name="l00245"></a>00245 <span class="keywordflow">if</span> (!temp1 ||!temp2) {
<a name="l00246"></a>00246 <a class="code" href="errormsg_8c.html#a1ac398d9106568a1991a001172e0e00b">errormsg1</a>(<span class="stringliteral">"Domlib"</span>, <span class="stringliteral">"outofmem"</span>, <span class="stringliteral">"out of memory space"</span>);
<a name="l00247"></a>00247 <span class="keywordflow">return</span> -1;
<a name="l00248"></a>00248 }
<a name="l00249"></a>00249
<a name="l00250"></a>00250 <span class="comment">/* Initialize all the 'Value' variables */</span>
<a name="l00251"></a>00251 <a class="code" href="source_2arith_2arithmetique_8h.html#af71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(pivot); <a class="code" href="source_2arith_2arithmetique_8h.html#af71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(x);
<a name="l00252"></a>00252 <a class="code" href="source_2arith_2arithmetique_8h.html#af71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(aux);
<a name="l00253"></a>00253 <span class="keywordflow">for</span>(i=0;i<nc;i++)
<a name="l00254"></a>00254 <a class="code" href="source_2arith_2arithmetique_8h.html#af71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(temp1[i]);
<a name="l00255"></a>00255 <span class="keywordflow">for</span>(i=0;i<nr;i++)
<a name="l00256"></a>00256 <a class="code" href="source_2arith_2arithmetique_8h.html#af71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(temp2[i]);
<a name="l00257"></a>00257
<a name="l00258"></a>00258 <span class="preprocessor">#ifdef DEBUG</span>
<a name="l00259"></a>00259 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"Start -----------\n"</span>);
<a name="l00260"></a>00260 <a class="code" href="matrix_8c.html#ad4c3c350dba633f72bbcf3609b6b67d7">Matrix_Print</a>(stderr,0,H);
<a name="l00261"></a>00261 <span class="preprocessor">#endif</span>
<a name="l00262"></a>00262 <span class="preprocessor"></span> <span class="keywordflow">for</span> (k=0, rank=0; k<nc && rank<nr; k=k+1) {
<a name="l00263"></a>00263 reduced = 1; <span class="comment">/* go through loop the first time */</span>
<a name="l00264"></a>00264 <span class="preprocessor">#ifdef DEBUG</span>
<a name="l00265"></a>00265 <span class="preprocessor"></span> fprintf(stderr, <span class="stringliteral">"Working on col %d. Rank=%d ----------\n"</span>, k+1, rank+1);
<a name="l00266"></a>00266 <span class="preprocessor">#endif</span>
<a name="l00267"></a>00267 <span class="preprocessor"></span> <span class="keywordflow">while</span> (reduced) {
<a name="l00268"></a>00268 reduced=0;
<a name="l00269"></a>00269
<a name="l00270"></a>00270 <span class="comment">/* 1. find pivot row */</span>
<a name="l00271"></a>00271 <a class="code" href="source_2arith_2arithmetique_8h.html#a6eee595d027bdf64a6c529b5f138720f">value_absolute</a>(pivot,H-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[rank][k]);
<a name="l00272"></a>00272
<a name="l00273"></a>00273 <span class="comment">/* the kth-diagonal element */</span>
<a name="l00274"></a>00274 pivotrow = rank;
<a name="l00275"></a>00275
<a name="l00276"></a>00276 <span class="comment">/* find the row i>rank with smallest nonzero element in col k */</span>
<a name="l00277"></a>00277 <span class="keywordflow">for</span> (i=rank+1; i<nr; i++) {
<a name="l00278"></a>00278 <a class="code" href="source_2arith_2arithmetique_8h.html#a6eee595d027bdf64a6c529b5f138720f">value_absolute</a>(x,H-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][k]);
<a name="l00279"></a>00279 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#a47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(x) &&
<a name="l00280"></a>00280 (<a class="code" href="source_2arith_2arithmetique_8h.html#ad87a1fcce82a9885ffd8518f4fba2c0e">value_lt</a>(x,pivot) || <a class="code" href="source_2arith_2arithmetique_8h.html#a827532f2140ae2aa96e46baebae09723">value_zero_p</a>(pivot))) {
<a name="l00281"></a>00281 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(pivot,x);
<a name="l00282"></a>00282 pivotrow = i;
<a name="l00283"></a>00283 }
<a name="l00284"></a>00284 }
<a name="l00285"></a>00285
<a name="l00286"></a>00286 <span class="comment">/* 2. Bring pivot to diagonal (exchange rows pivotrow and rank) */</span>
<a name="l00287"></a>00287 <span class="keywordflow">if</span> (pivotrow != rank) {
<a name="l00288"></a>00288 <a class="code" href="vector_8c.html#a88f4d69371f16d6d28e8a87c496b0730">Vector_Exchange</a>(H-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[pivotrow],H-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[rank],nc);
<a name="l00289"></a>00289 <span class="keywordflow">if</span> (U)
<a name="l00290"></a>00290 <a class="code" href="vector_8c.html#a88f4d69371f16d6d28e8a87c496b0730">Vector_Exchange</a>(U-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[pivotrow],U-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[rank],nr);
<a name="l00291"></a>00291 <span class="keywordflow">if</span> (Q)
<a name="l00292"></a>00292 <a class="code" href="vector_8c.html#a88f4d69371f16d6d28e8a87c496b0730">Vector_Exchange</a>(Q-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[pivotrow],Q-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[rank],nr);
<a name="l00293"></a>00293
<a name="l00294"></a>00294 <span class="preprocessor">#ifdef DEBUG</span>
<a name="l00295"></a>00295 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"Exchange rows %d and %d -----------\n"</span>, rank+1, pivotrow+1);
<a name="l00296"></a>00296 <a class="code" href="matrix_8c.html#ad4c3c350dba633f72bbcf3609b6b67d7">Matrix_Print</a>(stderr,0,H);
<a name="l00297"></a>00297 <span class="preprocessor">#endif</span>
<a name="l00298"></a>00298 <span class="preprocessor"></span> }
<a name="l00299"></a>00299 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(pivot,H-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[rank][k]); <span class="comment">/* actual ( no abs() ) pivot */</span>
<a name="l00300"></a>00300
<a name="l00301"></a>00301 <span class="comment">/* 3. Invert the row 'rank' if pivot is negative */</span>
<a name="l00302"></a>00302 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#af031da52c8a160fd1ee6e4c793f8c78a">value_neg_p</a>(pivot)) {
<a name="l00303"></a>00303 <a class="code" href="source_2arith_2arithmetique_8h.html#a0daf9a8ecdc14e7a274832b0d2add830">value_oppose</a>(pivot,pivot); <span class="comment">/* pivot = -pivot */</span>
<a name="l00304"></a>00304 <span class="keywordflow">for</span> (j=0; j<nc; j++)
<a name="l00305"></a>00305 <a class="code" href="source_2arith_2arithmetique_8h.html#a0daf9a8ecdc14e7a274832b0d2add830">value_oppose</a>(H-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[rank][j],H-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[rank][j]);
<a name="l00306"></a>00306
<a name="l00307"></a>00307 <span class="comment">/* H->p[rank][j] = -(H->p[rank][j]); */</span>
<a name="l00308"></a>00308 <span class="keywordflow">if</span> (U)
<a name="l00309"></a>00309 <span class="keywordflow">for</span> (j=0; j<nr; j++)
<a name="l00310"></a>00310 <a class="code" href="source_2arith_2arithmetique_8h.html#a0daf9a8ecdc14e7a274832b0d2add830">value_oppose</a>(U-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[rank][j],U-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[rank][j]);
<a name="l00311"></a>00311
<a name="l00312"></a>00312 <span class="comment">/* U->p[rank][j] = -(U->p[rank][j]); */</span>
<a name="l00313"></a>00313 <span class="keywordflow">if</span> (Q)
<a name="l00314"></a>00314 <span class="keywordflow">for</span> (j=0; j<nr; j++)
<a name="l00315"></a>00315 <a class="code" href="source_2arith_2arithmetique_8h.html#a0daf9a8ecdc14e7a274832b0d2add830">value_oppose</a>(Q-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[rank][j],Q-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[rank][j]);
<a name="l00316"></a>00316
<a name="l00317"></a>00317 <span class="comment">/* Q->p[rank][j] = -(Q->p[rank][j]); */</span>
<a name="l00318"></a>00318 <span class="preprocessor">#ifdef DEBUG</span>
<a name="l00319"></a>00319 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"Negate row %d -----------\n"</span>, rank+1);
<a name="l00320"></a>00320 <a class="code" href="matrix_8c.html#ad4c3c350dba633f72bbcf3609b6b67d7">Matrix_Print</a>(stderr,0,H);
<a name="l00321"></a>00321 <span class="preprocessor">#endif</span>
<a name="l00322"></a>00322 <span class="preprocessor"></span>
<a name="l00323"></a>00323 }
<a name="l00324"></a>00324 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#a47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(pivot)) {
<a name="l00325"></a>00325
<a name="l00326"></a>00326 <span class="comment">/* 4. Reduce the column modulo the pivot */</span>
<a name="l00327"></a>00327 <span class="comment">/* This eventually zeros out everything below the */</span>
<a name="l00328"></a>00328 <span class="comment">/* diagonal and produces an upper triangular matrix */</span>
<a name="l00329"></a>00329
<a name="l00330"></a>00330 <span class="keywordflow">for</span> (i=rank+1;i<nr;i++) {
<a name="l00331"></a>00331 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(x,H-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][k]);
<a name="l00332"></a>00332 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#a47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(x)) {
<a name="l00333"></a>00333 <a class="code" href="source_2arith_2arithmetique_8h.html#ae77f928488d756f77270649775dbdc1d">value_modulus</a>(aux,x,pivot);
<a name="l00334"></a>00334
<a name="l00335"></a>00335 <span class="comment">/* floor[integer division] (corrected for neg x) */</span>
<a name="l00336"></a>00336 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#af031da52c8a160fd1ee6e4c793f8c78a">value_neg_p</a>(x) && <a class="code" href="source_2arith_2arithmetique_8h.html#a47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(aux)) {
<a name="l00337"></a>00337
<a name="l00338"></a>00338 <span class="comment">/* x=(x/pivot)-1; */</span>
<a name="l00339"></a>00339 <a class="code" href="source_2arith_2arithmetique_8h.html#ac633e4bcd9ed1d8412c67cda6d8ddb11">value_division</a>(x,x,pivot);
<a name="l00340"></a>00340 <a class="code" href="source_2arith_2arithmetique_8h.html#a7e293e9652086118cc5b660e6022767c">value_decrement</a>(x,x);
<a name="l00341"></a>00341 }
<a name="l00342"></a>00342 <span class="keywordflow">else</span>
<a name="l00343"></a>00343 <a class="code" href="source_2arith_2arithmetique_8h.html#ac633e4bcd9ed1d8412c67cda6d8ddb11">value_division</a>(x,x,pivot);
<a name="l00344"></a>00344 <span class="keywordflow">for</span> (j=0; j<nc; j++) {
<a name="l00345"></a>00345 <a class="code" href="source_2arith_2arithmetique_8h.html#ac9986d34264874727344f666079e2294">value_multiply</a>(aux,x,H-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[rank][j]);
<a name="l00346"></a>00346 <a class="code" href="source_2arith_2arithmetique_8h.html#ae92a58eee3b6f5c6a99e6837e68407e1">value_subtract</a>(H-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j],H-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j],aux);
<a name="l00347"></a>00347 }
<a name="l00348"></a>00348
<a name="l00349"></a>00349 <span class="comment">/* U->p[i][j] -= (x * U->p[rank][j]); */</span>
<a name="l00350"></a>00350 <span class="keywordflow">if</span> (U)
<a name="l00351"></a>00351 <span class="keywordflow">for</span> (j=0; j<nr; j++) {
<a name="l00352"></a>00352 <a class="code" href="source_2arith_2arithmetique_8h.html#ac9986d34264874727344f666079e2294">value_multiply</a>(aux,x,U-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[rank][j]);
<a name="l00353"></a>00353 <a class="code" href="source_2arith_2arithmetique_8h.html#ae92a58eee3b6f5c6a99e6837e68407e1">value_subtract</a>(U-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j],U-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j],aux);
<a name="l00354"></a>00354 }
<a name="l00355"></a>00355
<a name="l00356"></a>00356 <span class="comment">/* Q->p[rank][j] += (x * Q->p[i][j]); */</span>
<a name="l00357"></a>00357 <span class="keywordflow">if</span> (Q)
<a name="l00358"></a>00358 <span class="keywordflow">for</span>(j=0;j<nr;j++) {
<a name="l00359"></a>00359 <a class="code" href="source_2arith_2arithmetique_8h.html#a9900fbd029b36f5887e587642a064a52">value_addmul</a>(Q-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[rank][j], x, Q-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j]);
<a name="l00360"></a>00360 }
<a name="l00361"></a>00361 reduced = 1;
<a name="l00362"></a>00362
<a name="l00363"></a>00363 <span class="preprocessor">#ifdef DEBUG</span>
<a name="l00364"></a>00364 <span class="preprocessor"></span> fprintf(stderr,
<a name="l00365"></a>00365 <span class="stringliteral">"row %d = row %d - %d row %d -----------\n"</span>, i+1, i+1, x, rank+1);
<a name="l00366"></a>00366 <a class="code" href="matrix_8c.html#ad4c3c350dba633f72bbcf3609b6b67d7">Matrix_Print</a>(stderr,0,H);
<a name="l00367"></a>00367 <span class="preprocessor">#endif</span>
<a name="l00368"></a>00368 <span class="preprocessor"></span>
<a name="l00369"></a>00369 } <span class="comment">/* if (x) */</span>
<a name="l00370"></a>00370 } <span class="comment">/* for (i) */</span>
<a name="l00371"></a>00371 } <span class="comment">/* if (pivot != 0) */</span>
<a name="l00372"></a>00372 } <span class="comment">/* while (reduced) */</span>
<a name="l00373"></a>00373
<a name="l00374"></a>00374 <span class="comment">/* Last finish up this column */</span>
<a name="l00375"></a>00375 <span class="comment">/* 5. Make pivot column positive (above pivot row) */</span>
<a name="l00376"></a>00376 <span class="comment">/* x should be zero for i>k */</span>
<a name="l00377"></a>00377
<a name="l00378"></a>00378 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#a47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(pivot)) {
<a name="l00379"></a>00379 <span class="keywordflow">for</span> (i=0; i<rank; i++) {
<a name="l00380"></a>00380 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(x,H-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][k]);
<a name="l00381"></a>00381 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#a47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(x)) {
<a name="l00382"></a>00382 <a class="code" href="source_2arith_2arithmetique_8h.html#ae77f928488d756f77270649775dbdc1d">value_modulus</a>(aux,x,pivot);
<a name="l00383"></a>00383
<a name="l00384"></a>00384 <span class="comment">/* floor[integer division] (corrected for neg x) */</span>
<a name="l00385"></a>00385 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#af031da52c8a160fd1ee6e4c793f8c78a">value_neg_p</a>(x) && <a class="code" href="source_2arith_2arithmetique_8h.html#a47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(aux)) {
<a name="l00386"></a>00386 <a class="code" href="source_2arith_2arithmetique_8h.html#ac633e4bcd9ed1d8412c67cda6d8ddb11">value_division</a>(x,x,pivot);
<a name="l00387"></a>00387 <a class="code" href="source_2arith_2arithmetique_8h.html#a7e293e9652086118cc5b660e6022767c">value_decrement</a>(x,x);
<a name="l00388"></a>00388
<a name="l00389"></a>00389 <span class="comment">/* x=(x/pivot)-1; */</span>
<a name="l00390"></a>00390 }
<a name="l00391"></a>00391 <span class="keywordflow">else</span>
<a name="l00392"></a>00392 <a class="code" href="source_2arith_2arithmetique_8h.html#ac633e4bcd9ed1d8412c67cda6d8ddb11">value_division</a>(x,x,pivot);
<a name="l00393"></a>00393
<a name="l00394"></a>00394 <span class="comment">/* H->p[i][j] -= x * H->p[rank][j]; */</span>
<a name="l00395"></a>00395 <span class="keywordflow">for</span> (j=0; j<nc; j++) {
<a name="l00396"></a>00396 <a class="code" href="source_2arith_2arithmetique_8h.html#ac9986d34264874727344f666079e2294">value_multiply</a>(aux,x,H-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[rank][j]);
<a name="l00397"></a>00397 <a class="code" href="source_2arith_2arithmetique_8h.html#ae92a58eee3b6f5c6a99e6837e68407e1">value_subtract</a>(H-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j],H-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j],aux);
<a name="l00398"></a>00398 }
<a name="l00399"></a>00399
<a name="l00400"></a>00400 <span class="comment">/* U->p[i][j] -= x * U->p[rank][j]; */</span>
<a name="l00401"></a>00401 <span class="keywordflow">if</span> (U)
<a name="l00402"></a>00402 <span class="keywordflow">for</span> (j=0; j<nr; j++) {
<a name="l00403"></a>00403 <a class="code" href="source_2arith_2arithmetique_8h.html#ac9986d34264874727344f666079e2294">value_multiply</a>(aux,x,U-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[rank][j]);
<a name="l00404"></a>00404 <a class="code" href="source_2arith_2arithmetique_8h.html#ae92a58eee3b6f5c6a99e6837e68407e1">value_subtract</a>(U-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j],U-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j],aux);
<a name="l00405"></a>00405 }
<a name="l00406"></a>00406
<a name="l00407"></a>00407 <span class="comment">/* Q->p[rank][j] += x * Q->p[i][j]; */</span>
<a name="l00408"></a>00408 <span class="keywordflow">if</span> (Q)
<a name="l00409"></a>00409 <span class="keywordflow">for</span> (j=0; j<nr; j++) {
<a name="l00410"></a>00410 <a class="code" href="source_2arith_2arithmetique_8h.html#a9900fbd029b36f5887e587642a064a52">value_addmul</a>(Q-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[rank][j], x, Q-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j]);
<a name="l00411"></a>00411 }
<a name="l00412"></a>00412 <span class="preprocessor">#ifdef DEBUG</span>
<a name="l00413"></a>00413 <span class="preprocessor"></span> fprintf(stderr,
<a name="l00414"></a>00414 <span class="stringliteral">"row %d = row %d - %d row %d -----------\n"</span>, i+1, i+1, x, rank+1);
<a name="l00415"></a>00415 <a class="code" href="matrix_8c.html#ad4c3c350dba633f72bbcf3609b6b67d7">Matrix_Print</a>(stderr,0,H);
<a name="l00416"></a>00416 <span class="preprocessor">#endif</span>
<a name="l00417"></a>00417 <span class="preprocessor"></span> } <span class="comment">/* if (x) */</span>
<a name="l00418"></a>00418 } <span class="comment">/* for (i) */</span>
<a name="l00419"></a>00419 rank++;
<a name="l00420"></a>00420 } <span class="comment">/* if (pivot!=0) */</span>
<a name="l00421"></a>00421 } <span class="comment">/* for (k) */</span>
<a name="l00422"></a>00422
<a name="l00423"></a>00423 <span class="comment">/* Clear all the 'Value' variables */</span>
<a name="l00424"></a>00424 <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(pivot); <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(x);
<a name="l00425"></a>00425 <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(aux);
<a name="l00426"></a>00426 <span class="keywordflow">for</span>(i=0;i<nc;i++)
<a name="l00427"></a>00427 <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(temp1[i]);
<a name="l00428"></a>00428 <span class="keywordflow">for</span>(i=0;i<nr;i++)
<a name="l00429"></a>00429 <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(temp2[i]);
<a name="l00430"></a>00430 free(temp2);
<a name="l00431"></a>00431 free(temp1);
<a name="l00432"></a>00432 <span class="keywordflow">return</span> rank;
<a name="l00433"></a>00433 } <span class="comment">/* Hermite */</span>
<a name="l00434"></a>00434
<a name="l00435"></a><a class="code" href="matrix_8h.html#a9d112ac078583626580f848b51a515f3">00435</a> <span class="keywordtype">void</span> <a class="code" href="matrix_8c.html#a9d112ac078583626580f848b51a515f3">right_hermite</a>(<a class="code" href="structmatrix.html">Matrix</a> *A,<a class="code" href="structmatrix.html">Matrix</a> **Hp,<a class="code" href="structmatrix.html">Matrix</a> **Up,<a class="code" href="structmatrix.html">Matrix</a> **Qp) {
<a name="l00436"></a>00436
<a name="l00437"></a>00437 <a class="code" href="structmatrix.html">Matrix</a> *H, *Q, *U;
<a name="l00438"></a>00438 <span class="keywordtype">int</span> i, j, <a class="code" href="polyparam_8c.html#a2833bf188e6bf292fa7d61e2dd54d622">nr</a>, nc, rank;
<a name="l00439"></a>00439 Value tmp;
<a name="l00440"></a>00440
<a name="l00441"></a>00441 <span class="comment">/* Computes form: A = QH , UA = H */</span>
<a name="l00442"></a>00442 nc = A-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a>;
<a name="l00443"></a>00443 nr = A-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a>;
<a name="l00444"></a>00444
<a name="l00445"></a>00445 <span class="comment">/* H = A */</span>
<a name="l00446"></a>00446 *Hp = H = <a class="code" href="matrix_8c.html#ac0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(nr,nc);
<a name="l00447"></a>00447 <span class="keywordflow">if</span> (!H) {
<a name="l00448"></a>00448 <a class="code" href="errormsg_8c.html#a1ac398d9106568a1991a001172e0e00b">errormsg1</a>(<span class="stringliteral">"DomRightHermite"</span>, <span class="stringliteral">"outofmem"</span>, <span class="stringliteral">"out of memory space"</span>);
<a name="l00449"></a>00449 <span class="keywordflow">return</span>;
<a name="l00450"></a>00450 }
<a name="l00451"></a>00451
<a name="l00452"></a>00452 <span class="comment">/* Initialize all the 'Value' variables */</span>
<a name="l00453"></a>00453 <a class="code" href="source_2arith_2arithmetique_8h.html#af71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(tmp);
<a name="l00454"></a>00454
<a name="l00455"></a>00455 <a class="code" href="vector_8c.html#ab6eca9ad03a2f4a60dd79182289e0e0b">Vector_Copy</a>(A-><a class="code" href="structmatrix.html#a9c294a3fd4d273963e27a0c8cd819bd5">p_Init</a>,H-><a class="code" href="structmatrix.html#a9c294a3fd4d273963e27a0c8cd819bd5">p_Init</a>,nr*nc);
<a name="l00456"></a>00456
<a name="l00457"></a>00457 <span class="comment">/* U = I */</span>
<a name="l00458"></a>00458 <span class="keywordflow">if</span> (Up) {
<a name="l00459"></a>00459 *Up = U = <a class="code" href="matrix_8c.html#ac0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(nr, nr);
<a name="l00460"></a>00460 <span class="keywordflow">if</span> (!U) {
<a name="l00461"></a>00461 <a class="code" href="errormsg_8c.html#a1ac398d9106568a1991a001172e0e00b">errormsg1</a>(<span class="stringliteral">"DomRightHermite"</span>, <span class="stringliteral">"outofmem"</span>, <span class="stringliteral">"out of memory space"</span>);
<a name="l00462"></a>00462 <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(tmp);
<a name="l00463"></a>00463 <span class="keywordflow">return</span>;
<a name="l00464"></a>00464 }
<a name="l00465"></a>00465 <a class="code" href="vector_8c.html#a27ccb3ea01f3a496bb799fb99e9e3075">Vector_Set</a>(U-><a class="code" href="structmatrix.html#a9c294a3fd4d273963e27a0c8cd819bd5">p_Init</a>,0,nr*nr); <span class="comment">/* zero's */</span>
<a name="l00466"></a>00466 <span class="keywordflow">for</span>(i=0;i<nr;i++) <span class="comment">/* with diagonal of 1's */</span>
<a name="l00467"></a>00467 <a class="code" href="source_2arith_2arithmetique_8h.html#a8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(U-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][i],1);
<a name="l00468"></a>00468 }
<a name="l00469"></a>00469 <span class="keywordflow">else</span>
<a name="l00470"></a>00470 U = (<a class="code" href="structmatrix.html">Matrix</a> *)0;
<a name="l00471"></a>00471
<a name="l00472"></a>00472 <span class="comment">/* Q = I */</span>
<a name="l00473"></a>00473 <span class="comment">/* Actually I compute Q transpose... its easier */</span>
<a name="l00474"></a>00474 <span class="keywordflow">if</span> (Qp) {
<a name="l00475"></a>00475 *Qp = Q = <a class="code" href="matrix_8c.html#ac0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(nr,nr);
<a name="l00476"></a>00476 <span class="keywordflow">if</span> (!Q) {
<a name="l00477"></a>00477 <a class="code" href="errormsg_8c.html#a1ac398d9106568a1991a001172e0e00b">errormsg1</a>(<span class="stringliteral">"DomRightHermite"</span>, <span class="stringliteral">"outofmem"</span>, <span class="stringliteral">"out of memory space"</span>);
<a name="l00478"></a>00478 <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(tmp);
<a name="l00479"></a>00479 <span class="keywordflow">return</span>;
<a name="l00480"></a>00480 }
<a name="l00481"></a>00481 <a class="code" href="vector_8c.html#a27ccb3ea01f3a496bb799fb99e9e3075">Vector_Set</a>(Q-><a class="code" href="structmatrix.html#a9c294a3fd4d273963e27a0c8cd819bd5">p_Init</a>,0,nr*nr); <span class="comment">/* zero's */</span>
<a name="l00482"></a>00482 <span class="keywordflow">for</span> (i=0;i<nr;i++) <span class="comment">/* with diagonal of 1's */</span>
<a name="l00483"></a>00483 <a class="code" href="source_2arith_2arithmetique_8h.html#a8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(Q-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][i],1);
<a name="l00484"></a>00484 }
<a name="l00485"></a>00485 <span class="keywordflow">else</span>
<a name="l00486"></a>00486 Q = (<a class="code" href="structmatrix.html">Matrix</a> *)0;
<a name="l00487"></a>00487
<a name="l00488"></a>00488 rank = <a class="code" href="matrix_8c.html#a0913852253401fd132b31cc4a205c1de">hermite</a>(H,U,Q);
<a name="l00489"></a>00489
<a name="l00490"></a>00490 <span class="comment">/* Q is returned transposed */</span>
<a name="l00491"></a>00491 <span class="comment">/* Transpose Q */</span>
<a name="l00492"></a>00492 <span class="keywordflow">if</span> (Q) {
<a name="l00493"></a>00493 <span class="keywordflow">for</span> (i=0; i<nr; i++) {
<a name="l00494"></a>00494 <span class="keywordflow">for</span> (j=i+1; j<nr; j++) {
<a name="l00495"></a>00495 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(tmp,Q-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j]);
<a name="l00496"></a>00496 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(Q-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j],Q-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][i] );
<a name="l00497"></a>00497 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(Q-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][i],tmp);
<a name="l00498"></a>00498 }
<a name="l00499"></a>00499 }
<a name="l00500"></a>00500 }
<a name="l00501"></a>00501 <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(tmp);
<a name="l00502"></a>00502 <span class="keywordflow">return</span>;
<a name="l00503"></a>00503 } <span class="comment">/* right_hermite */</span>
<a name="l00504"></a>00504
<a name="l00505"></a><a class="code" href="matrix_8h.html#adcbe5ee3f0c28fb35aed49f4e1f40f5b">00505</a> <span class="keywordtype">void</span> <a class="code" href="matrix_8c.html#adcbe5ee3f0c28fb35aed49f4e1f40f5b">left_hermite</a>(<a class="code" href="structmatrix.html">Matrix</a> *A,<a class="code" href="structmatrix.html">Matrix</a> **Hp,<a class="code" href="structmatrix.html">Matrix</a> **Qp,<a class="code" href="structmatrix.html">Matrix</a> **Up) {
<a name="l00506"></a>00506
<a name="l00507"></a>00507 <a class="code" href="structmatrix.html">Matrix</a> *H, *HT, *Q, *U;
<a name="l00508"></a>00508 <span class="keywordtype">int</span> i, j, nc, <a class="code" href="polyparam_8c.html#a2833bf188e6bf292fa7d61e2dd54d622">nr</a>, rank;
<a name="l00509"></a>00509 Value tmp;
<a name="l00510"></a>00510
<a name="l00511"></a>00511 <span class="comment">/* Computes left form: A = HQ , AU = H , </span>
<a name="l00512"></a>00512 <span class="comment"> T T T T T T</span>
<a name="l00513"></a>00513 <span class="comment"> using right form A = Q H , U A = H */</span>
<a name="l00514"></a>00514
<a name="l00515"></a>00515 nr = A-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a>;
<a name="l00516"></a>00516 nc = A-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a>;
<a name="l00517"></a>00517
<a name="l00518"></a>00518 <span class="comment">/* HT = A transpose */</span>
<a name="l00519"></a>00519 HT = <a class="code" href="matrix_8c.html#ac0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(nc, nr);
<a name="l00520"></a>00520 <span class="keywordflow">if</span> (!HT) {
<a name="l00521"></a>00521 <a class="code" href="errormsg_8c.html#a1ac398d9106568a1991a001172e0e00b">errormsg1</a>(<span class="stringliteral">"DomLeftHermite"</span>, <span class="stringliteral">"outofmem"</span>, <span class="stringliteral">"out of memory space"</span>);
<a name="l00522"></a>00522 <span class="keywordflow">return</span>;
<a name="l00523"></a>00523 }
<a name="l00524"></a>00524 <a class="code" href="source_2arith_2arithmetique_8h.html#af71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(tmp);
<a name="l00525"></a>00525 <span class="keywordflow">for</span> (i=0; i<nr; i++)
<a name="l00526"></a>00526 <span class="keywordflow">for</span> (j=0; j<nc; j++)
<a name="l00527"></a>00527 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(HT-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][i],A-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j]);
<a name="l00528"></a>00528
<a name="l00529"></a>00529 <span class="comment">/* U = I */</span>
<a name="l00530"></a>00530 <span class="keywordflow">if</span> (Up) {
<a name="l00531"></a>00531 *Up = U = <a class="code" href="matrix_8c.html#ac0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(nc,nc);
<a name="l00532"></a>00532 <span class="keywordflow">if</span> (!U) {
<a name="l00533"></a>00533 <a class="code" href="errormsg_8c.html#a1ac398d9106568a1991a001172e0e00b">errormsg1</a>(<span class="stringliteral">"DomLeftHermite"</span>, <span class="stringliteral">"outofmem"</span>, <span class="stringliteral">"out of memory space"</span>);
<a name="l00534"></a>00534 <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(tmp);
<a name="l00535"></a>00535 <span class="keywordflow">return</span>;
<a name="l00536"></a>00536 }
<a name="l00537"></a>00537 <a class="code" href="vector_8c.html#a27ccb3ea01f3a496bb799fb99e9e3075">Vector_Set</a>(U-><a class="code" href="structmatrix.html#a9c294a3fd4d273963e27a0c8cd819bd5">p_Init</a>,0,nc*nc); <span class="comment">/* zero's */</span>
<a name="l00538"></a>00538 <span class="keywordflow">for</span> (i=0;i<nc;i++) <span class="comment">/* with diagonal of 1's */</span>
<a name="l00539"></a>00539 <a class="code" href="source_2arith_2arithmetique_8h.html#a8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(U-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][i],1);
<a name="l00540"></a>00540 }
<a name="l00541"></a>00541 <span class="keywordflow">else</span> U=(<a class="code" href="structmatrix.html">Matrix</a> *)0;
<a name="l00542"></a>00542
<a name="l00543"></a>00543 <span class="comment">/* Q = I */</span>
<a name="l00544"></a>00544 <span class="keywordflow">if</span> (Qp) {
<a name="l00545"></a>00545 *Qp = Q = <a class="code" href="matrix_8c.html#ac0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(nc, nc);
<a name="l00546"></a>00546 <span class="keywordflow">if</span> (!Q) {
<a name="l00547"></a>00547 <a class="code" href="errormsg_8c.html#a1ac398d9106568a1991a001172e0e00b">errormsg1</a>(<span class="stringliteral">"DomLeftHermite"</span>, <span class="stringliteral">"outofmem"</span>, <span class="stringliteral">"out of memory space"</span>);
<a name="l00548"></a>00548 <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(tmp);
<a name="l00549"></a>00549 <span class="keywordflow">return</span>;
<a name="l00550"></a>00550 }
<a name="l00551"></a>00551 <a class="code" href="vector_8c.html#a27ccb3ea01f3a496bb799fb99e9e3075">Vector_Set</a>(Q-><a class="code" href="structmatrix.html#a9c294a3fd4d273963e27a0c8cd819bd5">p_Init</a>,0,nc*nc); <span class="comment">/* zero's */</span>
<a name="l00552"></a>00552 <span class="keywordflow">for</span> (i=0;i<nc;i++) <span class="comment">/* with diagonal of 1's */</span>
<a name="l00553"></a>00553 <a class="code" href="source_2arith_2arithmetique_8h.html#a8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(Q-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][i],1);
<a name="l00554"></a>00554 }
<a name="l00555"></a>00555 <span class="keywordflow">else</span> Q=(<a class="code" href="structmatrix.html">Matrix</a> *)0;
<a name="l00556"></a>00556 rank = <a class="code" href="matrix_8c.html#a0913852253401fd132b31cc4a205c1de">hermite</a>(HT,U,Q);
<a name="l00557"></a>00557
<a name="l00558"></a>00558 <span class="comment">/* H = HT transpose */</span>
<a name="l00559"></a>00559 *Hp = H = <a class="code" href="matrix_8c.html#ac0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(nr,nc);
<a name="l00560"></a>00560 <span class="keywordflow">if</span> (!H) {
<a name="l00561"></a>00561 <a class="code" href="errormsg_8c.html#a1ac398d9106568a1991a001172e0e00b">errormsg1</a>(<span class="stringliteral">"DomLeftHermite"</span>, <span class="stringliteral">"outofmem"</span>, <span class="stringliteral">"out of memory space"</span>);
<a name="l00562"></a>00562 <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(tmp);
<a name="l00563"></a>00563 <span class="keywordflow">return</span>;
<a name="l00564"></a>00564 }
<a name="l00565"></a>00565 <span class="keywordflow">for</span> (i=0; i<nr; i++)
<a name="l00566"></a>00566 <span class="keywordflow">for</span> (j=0;j<nc;j++)
<a name="l00567"></a>00567 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(H-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j],HT-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][i]);
<a name="l00568"></a>00568 <a class="code" href="matrix_8c.html#afcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(HT);
<a name="l00569"></a>00569
<a name="l00570"></a>00570 <span class="comment">/* Transpose U */</span>
<a name="l00571"></a>00571 <span class="keywordflow">if</span> (U) {
<a name="l00572"></a>00572 <span class="keywordflow">for</span> (i=0; i<nc; i++) {
<a name="l00573"></a>00573 <span class="keywordflow">for</span> (j=i+1; j<nc; j++) {
<a name="l00574"></a>00574 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(tmp,U-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j]);
<a name="l00575"></a>00575 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(U-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j],U-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][i] );
<a name="l00576"></a>00576 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(U-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][i],tmp);
<a name="l00577"></a>00577 }
<a name="l00578"></a>00578 }
<a name="l00579"></a>00579 }
<a name="l00580"></a>00580 <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(tmp);
<a name="l00581"></a>00581 } <span class="comment">/* left_hermite */</span>
<a name="l00582"></a>00582
<a name="l00583"></a>00583 <span class="comment">/*</span>
<a name="l00584"></a>00584 <span class="comment"> * Given a integer matrix 'Mat'(k x k), compute its inverse rational matrix </span>
<a name="l00585"></a>00585 <span class="comment"> * 'MatInv' k x (k+1). The last column of each row in matrix MatInv is used </span>
<a name="l00586"></a>00586 <span class="comment"> * to store the common denominator of the entries in a row. The output is 1,</span>
<a name="l00587"></a>00587 <span class="comment"> * if 'Mat' is non-singular (invertible), otherwise the output is 0. Note:: </span>
<a name="l00588"></a>00588 <span class="comment"> * (1) Matrix 'Mat' is modified during the inverse operation.</span>
<a name="l00589"></a>00589 <span class="comment"> * (2) Matrix 'MatInv' must be preallocated before passing into this function.</span>
<a name="l00590"></a>00590 <span class="comment"> */</span>
<a name="l00591"></a><a class="code" href="matrix_8h.html#a3fd6efb2ec63815561e0b8f143c6191f">00591</a> <span class="keywordtype">int</span> <a class="code" href="matrix_8c.html#ae2b2f031eb75c5011091536d7ef4befc">MatInverse</a>(<a class="code" href="structmatrix.html">Matrix</a> *Mat,<a class="code" href="structmatrix.html">Matrix</a> *MatInv ) {
<a name="l00592"></a>00592
<a name="l00593"></a>00593 <span class="keywordtype">int</span> i, k, j, c;
<a name="l00594"></a>00594 Value x, gcd, piv;
<a name="l00595"></a>00595 Value m1,m2;
<a name="l00596"></a>00596
<a name="l00597"></a>00597 <span class="keywordflow">if</span>(Mat-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a> != Mat-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a>) {
<a name="l00598"></a>00598 fprintf(stderr,<span class="stringliteral">"Trying to invert a non-square matrix !\n"</span>);
<a name="l00599"></a>00599 <span class="keywordflow">return</span> 0;
<a name="l00600"></a>00600 }
<a name="l00601"></a>00601
<a name="l00602"></a>00602 <span class="comment">/* Initialize all the 'Value' variables */</span>
<a name="l00603"></a>00603 <a class="code" href="source_2arith_2arithmetique_8h.html#af71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(x); <a class="code" href="source_2arith_2arithmetique_8h.html#af71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(gcd); <a class="code" href="source_2arith_2arithmetique_8h.html#af71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(piv);
<a name="l00604"></a>00604 <a class="code" href="source_2arith_2arithmetique_8h.html#af71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(m1); <a class="code" href="source_2arith_2arithmetique_8h.html#af71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(m2);
<a name="l00605"></a>00605
<a name="l00606"></a>00606 k = Mat-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a>;
<a name="l00607"></a>00607
<a name="l00608"></a>00608 <span class="comment">/* Initialise MatInv */</span>
<a name="l00609"></a>00609 <a class="code" href="vector_8c.html#a27ccb3ea01f3a496bb799fb99e9e3075">Vector_Set</a>(MatInv-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[0],0,k*(k+1));
<a name="l00610"></a>00610
<a name="l00611"></a>00611 <span class="comment">/* Initialize 'MatInv' to Identity matrix form. Each diagonal entry is set*/</span>
<a name="l00612"></a>00612 <span class="comment">/* to 1. Last column of each row (denominator of each entry in a row) is */</span>
<a name="l00613"></a>00613 <span class="comment">/* also set to 1. */</span>
<a name="l00614"></a>00614 <span class="keywordflow">for</span>(i=0;i<k;++i) {
<a name="l00615"></a>00615 <a class="code" href="source_2arith_2arithmetique_8h.html#a8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(MatInv-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][i],1);
<a name="l00616"></a>00616 <a class="code" href="source_2arith_2arithmetique_8h.html#a8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(MatInv-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][k],1); <span class="comment">/* denum */</span>
<a name="l00617"></a>00617 }
<a name="l00618"></a>00618 <span class="comment">/* Apply Gauss-Jordan elimination method on the two matrices 'Mat' and */</span>
<a name="l00619"></a>00619 <span class="comment">/* 'MatInv' in parallel. */</span>
<a name="l00620"></a>00620 <span class="keywordflow">for</span>(i=0;i<k;++i) {
<a name="l00621"></a>00621
<a name="l00622"></a>00622 <span class="comment">/* Check if the diagonal entry (new pivot) is non-zero or not */</span>
<a name="l00623"></a>00623 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#a827532f2140ae2aa96e46baebae09723">value_zero_p</a>(Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][i])) {
<a name="l00624"></a>00624
<a name="l00625"></a>00625 <span class="comment">/* Search for a non-zero pivot down the column(i) */</span>
<a name="l00626"></a>00626 <span class="keywordflow">for</span>(j=i;j<k;++j)
<a name="l00627"></a>00627 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#a47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][i]))
<a name="l00628"></a>00628 <span class="keywordflow">break</span>;
<a name="l00629"></a>00629
<a name="l00630"></a>00630 <span class="comment">/* If no non-zero pivot is found, the matrix 'Mat' is non-invertible */</span>
<a name="l00631"></a>00631 <span class="comment">/* Return 0. */</span>
<a name="l00632"></a>00632 <span class="keywordflow">if</span>(j==k) {
<a name="l00633"></a>00633
<a name="l00634"></a>00634 <span class="comment">/* Clear all the 'Value' variables */</span>
<a name="l00635"></a>00635 <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(x); <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(gcd); <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(piv);
<a name="l00636"></a>00636 <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(m1); <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(m2);
<a name="l00637"></a>00637 <span class="keywordflow">return</span> 0;
<a name="l00638"></a>00638 }
<a name="l00639"></a>00639
<a name="l00640"></a>00640 <span class="comment">/* Exchange the rows, row(i) and row(j) so that the diagonal element */</span>
<a name="l00641"></a>00641 <span class="comment">/* Mat->p[i][i] (pivot) is non-zero. Repeat the same operations on */</span>
<a name="l00642"></a>00642 <span class="comment">/* matrix 'MatInv'. */</span>
<a name="l00643"></a>00643 <span class="keywordflow">for</span>(c=0;c<k;++c) {
<a name="l00644"></a>00644
<a name="l00645"></a>00645 <span class="comment">/* Interchange rows, row(i) and row(j) of matrix 'Mat' */</span>
<a name="l00646"></a>00646 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(x,Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][c]);
<a name="l00647"></a>00647 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][c],Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][c]);
<a name="l00648"></a>00648 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][c],x);
<a name="l00649"></a>00649
<a name="l00650"></a>00650 <span class="comment">/* Interchange rows, row(i) and row(j) of matrix 'MatInv' */</span>
<a name="l00651"></a>00651 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(x,MatInv-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][c]);
<a name="l00652"></a>00652 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(MatInv-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][c],MatInv-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][c]);
<a name="l00653"></a>00653 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(MatInv-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][c],x);
<a name="l00654"></a>00654 }
<a name="l00655"></a>00655 }
<a name="l00656"></a>00656
<a name="l00657"></a>00657 <span class="comment">/* Make all the entries in column(i) of matrix 'Mat' zero except the */</span>
<a name="l00658"></a>00658 <span class="comment">/* diagonal entry. Repeat the same sequence of operations on matrix */</span>
<a name="l00659"></a>00659 <span class="comment">/* 'MatInv'. */</span>
<a name="l00660"></a>00660 <span class="keywordflow">for</span>(j=0;j<k;++j) {
<a name="l00661"></a>00661 <span class="keywordflow">if</span> (j==i) <span class="keywordflow">continue</span>; <span class="comment">/* Skip the pivot */</span>
<a name="l00662"></a>00662 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(x,Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][i]);
<a name="l00663"></a>00663 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#a47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(x)) {
<a name="l00664"></a>00664 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(piv,Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][i]);
<a name="l00665"></a>00665 <a class="code" href="source_2arith_2arithmetique_8h.html#a50a34e78517e58cd1c2494a99be1e62b">value_gcd</a>(gcd, x, piv);
<a name="l00666"></a>00666 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#a5f258141f9e07b66da01ff7f4fe3d56d">value_notone_p</a>(gcd) ) {
<a name="l00667"></a>00667 <a class="code" href="source_2arith_2arithmetique_8h.html#a4b01d50506e0c7691b69d57a87280f5d">value_divexact</a>(x, x, gcd);
<a name="l00668"></a>00668 <a class="code" href="source_2arith_2arithmetique_8h.html#a4b01d50506e0c7691b69d57a87280f5d">value_divexact</a>(piv, piv, gcd);
<a name="l00669"></a>00669 }
<a name="l00670"></a>00670 <span class="keywordflow">for</span>(c=((j>i)?i:0);c<k;++c) {
<a name="l00671"></a>00671 <a class="code" href="source_2arith_2arithmetique_8h.html#ac9986d34264874727344f666079e2294">value_multiply</a>(m1,piv,Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][c]);
<a name="l00672"></a>00672 <a class="code" href="source_2arith_2arithmetique_8h.html#ac9986d34264874727344f666079e2294">value_multiply</a>(m2,x,Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][c]);
<a name="l00673"></a>00673 <a class="code" href="source_2arith_2arithmetique_8h.html#ae92a58eee3b6f5c6a99e6837e68407e1">value_subtract</a>(Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][c],m1,m2);
<a name="l00674"></a>00674 }
<a name="l00675"></a>00675 <span class="keywordflow">for</span>(c=0;c<k;++c) {
<a name="l00676"></a>00676 <a class="code" href="source_2arith_2arithmetique_8h.html#ac9986d34264874727344f666079e2294">value_multiply</a>(m1,piv,MatInv-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][c]);
<a name="l00677"></a>00677 <a class="code" href="source_2arith_2arithmetique_8h.html#ac9986d34264874727344f666079e2294">value_multiply</a>(m2,x,MatInv-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][c]);
<a name="l00678"></a>00678 <a class="code" href="source_2arith_2arithmetique_8h.html#ae92a58eee3b6f5c6a99e6837e68407e1">value_subtract</a>(MatInv-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][c],m1,m2);
<a name="l00679"></a>00679 }
<a name="l00680"></a>00680
<a name="l00681"></a>00681 <span class="comment">/* Simplify row(j) of the two matrices 'Mat' and 'MatInv' by */</span>
<a name="l00682"></a>00682 <span class="comment">/* dividing the rows with the common GCD. */</span>
<a name="l00683"></a>00683 <a class="code" href="vector_8c.html#a801486b45cadc8b9d22d99a79af91fa1">Vector_Gcd</a>(&MatInv-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][0],k,&m1);
<a name="l00684"></a>00684 <a class="code" href="vector_8c.html#a801486b45cadc8b9d22d99a79af91fa1">Vector_Gcd</a>(&Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][0],k,&m2);
<a name="l00685"></a>00685 <a class="code" href="source_2arith_2arithmetique_8h.html#a50a34e78517e58cd1c2494a99be1e62b">value_gcd</a>(gcd, m1, m2);
<a name="l00686"></a>00686 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#a5f258141f9e07b66da01ff7f4fe3d56d">value_notone_p</a>(gcd)) {
<a name="l00687"></a>00687 <span class="keywordflow">for</span>(c=0;c<k;++c) {
<a name="l00688"></a>00688 <a class="code" href="source_2arith_2arithmetique_8h.html#a4b01d50506e0c7691b69d57a87280f5d">value_divexact</a>(Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][c], Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][c], gcd);
<a name="l00689"></a>00689 <a class="code" href="source_2arith_2arithmetique_8h.html#a4b01d50506e0c7691b69d57a87280f5d">value_divexact</a>(MatInv-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][c], MatInv-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][c], gcd);
<a name="l00690"></a>00690 }
<a name="l00691"></a>00691 }
<a name="l00692"></a>00692 }
<a name="l00693"></a>00693 }
<a name="l00694"></a>00694 }
<a name="l00695"></a>00695
<a name="l00696"></a>00696 <span class="comment">/* Simplify every row so that 'Mat' reduces to Identity matrix. Perform */</span>
<a name="l00697"></a>00697 <span class="comment">/* the same sequence of operations on the matrix 'MatInv'. */</span>
<a name="l00698"></a>00698 <span class="keywordflow">for</span>(j=0;j<k;++j) {
<a name="l00699"></a>00699 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(MatInv-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][k],Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][j]);
<a name="l00700"></a>00700
<a name="l00701"></a>00701 <span class="comment">/* Make the last column (denominator of each entry) of every row greater */</span>
<a name="l00702"></a>00702 <span class="comment">/* than zero. */</span>
<a name="l00703"></a>00703 <a class="code" href="vector_8c.html#a4095f8badebbf9903f88da363af136f8">Vector_Normalize_Positive</a>(&MatInv-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][0],k+1,k);
<a name="l00704"></a>00704 }
<a name="l00705"></a>00705
<a name="l00706"></a>00706 <span class="comment">/* Clear all the 'Value' variables */</span>
<a name="l00707"></a>00707 <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(x); <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(gcd); <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(piv);
<a name="l00708"></a>00708 <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(m1); <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(m2);
<a name="l00709"></a>00709
<a name="l00710"></a>00710 <span class="keywordflow">return</span> 1;
<a name="l00711"></a>00711 } <span class="comment">/* Mat_Inverse */</span>
<a name="l00712"></a>00712
<a name="l00713"></a>00713 <span class="comment">/*</span>
<a name="l00714"></a>00714 <span class="comment"> * Given (m x n) integer matrix 'X' and n x (k+1) rational matrix 'P', compute</span>
<a name="l00715"></a>00715 <span class="comment"> * the rational m x (k+1) rational matrix 'S'. The last column in each row of</span>
<a name="l00716"></a>00716 <span class="comment"> * the rational matrices is used to store the common denominator of elements</span>
<a name="l00717"></a>00717 <span class="comment"> * in a row. </span>
<a name="l00718"></a>00718 <span class="comment"> */</span>
<a name="l00719"></a><a class="code" href="matrix_8h.html#adb8526f2ba863572c60b255c8b27c186">00719</a> <span class="keywordtype">void</span> <a class="code" href="matrix_8c.html#adb8526f2ba863572c60b255c8b27c186">rat_prodmat</a>(<a class="code" href="structmatrix.html">Matrix</a> *S,<a class="code" href="structmatrix.html">Matrix</a> *X,<a class="code" href="structmatrix.html">Matrix</a> *P) {
<a name="l00720"></a>00720
<a name="l00721"></a>00721 <span class="keywordtype">int</span> i,j,k;
<a name="l00722"></a>00722 <span class="keywordtype">int</span> last_column_index = P-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a> - 1;
<a name="l00723"></a>00723 Value lcm, old_lcm,gcd,last_column_entry,s1;
<a name="l00724"></a>00724 Value m1,m2;
<a name="l00725"></a>00725
<a name="l00726"></a>00726 <span class="comment">/* Initialize all the 'Value' variables */</span>
<a name="l00727"></a>00727 <a class="code" href="source_2arith_2arithmetique_8h.html#af71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(lcm); <a class="code" href="source_2arith_2arithmetique_8h.html#af71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(old_lcm); <a class="code" href="source_2arith_2arithmetique_8h.html#af71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(gcd);
<a name="l00728"></a>00728 <a class="code" href="source_2arith_2arithmetique_8h.html#af71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(last_column_entry); <a class="code" href="source_2arith_2arithmetique_8h.html#af71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(s1);
<a name="l00729"></a>00729 <a class="code" href="source_2arith_2arithmetique_8h.html#af71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(m1); <a class="code" href="source_2arith_2arithmetique_8h.html#af71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(m2);
<a name="l00730"></a>00730
<a name="l00731"></a>00731 <span class="comment">/* Compute the LCM of last column entries (denominators) of rows */</span>
<a name="l00732"></a>00732 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(lcm,P-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[0][last_column_index]);
<a name="l00733"></a>00733 <span class="keywordflow">for</span>(k=1;k<P-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a>;++k) {
<a name="l00734"></a>00734 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(old_lcm,lcm);
<a name="l00735"></a>00735 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(last_column_entry,P-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[k][last_column_index]);
<a name="l00736"></a>00736 <a class="code" href="source_2arith_2arithmetique_8h.html#a50a34e78517e58cd1c2494a99be1e62b">value_gcd</a>(gcd, lcm, last_column_entry);
<a name="l00737"></a>00737 <a class="code" href="source_2arith_2arithmetique_8h.html#a4b01d50506e0c7691b69d57a87280f5d">value_divexact</a>(m1, last_column_entry, gcd);
<a name="l00738"></a>00738 <a class="code" href="source_2arith_2arithmetique_8h.html#ac9986d34264874727344f666079e2294">value_multiply</a>(lcm,lcm,m1);
<a name="l00739"></a>00739 }
<a name="l00740"></a>00740
<a name="l00741"></a>00741 <span class="comment">/* S[i][j] = Sum(X[i][k] * P[k][j] where Sum is extended over k = 1..nbrows*/</span>
<a name="l00742"></a>00742 <span class="keywordflow">for</span>(i=0;i<X-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a>;++i)
<a name="l00743"></a>00743 <span class="keywordflow">for</span>(j=0;j<P-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1;++j) {
<a name="l00744"></a>00744
<a name="l00745"></a>00745 <span class="comment">/* Initialize s1 to zero. */</span>
<a name="l00746"></a>00746 <a class="code" href="source_2arith_2arithmetique_8h.html#a8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(s1,0);
<a name="l00747"></a>00747 <span class="keywordflow">for</span>(k=0;k<P-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a>;++k) {
<a name="l00748"></a>00748
<a name="l00749"></a>00749 <span class="comment">/* If the LCM of last column entries is one, simply add the products */</span>
<a name="l00750"></a>00750 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#a61db0ba9ba925615ec70eb92e40b9ef4">value_one_p</a>(lcm)) {
<a name="l00751"></a>00751 <a class="code" href="source_2arith_2arithmetique_8h.html#a9900fbd029b36f5887e587642a064a52">value_addmul</a>(s1, X-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][k], P-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[k][j]);
<a name="l00752"></a>00752 }
<a name="l00753"></a>00753
<a name="l00754"></a>00754 <span class="comment">/* Numerator (num) and denominator (denom) of S[i][j] is given by :- */</span>
<a name="l00755"></a>00755 <span class="comment">/* numerator = Sum(X[i][k]*P[k][j]*lcm/P[k][last_column_index]) and */</span>
<a name="l00756"></a>00756 <span class="comment">/* denominator= lcm where Sum is extended over k = 1..nbrows. */</span>
<a name="l00757"></a>00757 <span class="keywordflow">else</span> {
<a name="l00758"></a>00758 <a class="code" href="source_2arith_2arithmetique_8h.html#ac9986d34264874727344f666079e2294">value_multiply</a>(m1,X-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][k],P-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[k][j]);
<a name="l00759"></a>00759 <a class="code" href="source_2arith_2arithmetique_8h.html#ac633e4bcd9ed1d8412c67cda6d8ddb11">value_division</a>(m2,lcm,P-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[k][last_column_index]);
<a name="l00760"></a>00760 <a class="code" href="source_2arith_2arithmetique_8h.html#a9900fbd029b36f5887e587642a064a52">value_addmul</a>(s1, m1, m2);
<a name="l00761"></a>00761 }
<a name="l00762"></a>00762 }
<a name="l00763"></a>00763 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(S-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j],s1);
<a name="l00764"></a>00764 }
<a name="l00765"></a>00765
<a name="l00766"></a>00766 <span class="keywordflow">for</span>(i=0;i<S-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a>;++i) {
<a name="l00767"></a>00767 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(S-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][last_column_index],lcm);
<a name="l00768"></a>00768
<a name="l00769"></a>00769 <span class="comment">/* Normalize the rows so that last element >=0 */</span>
<a name="l00770"></a>00770 <a class="code" href="vector_8c.html#a4095f8badebbf9903f88da363af136f8">Vector_Normalize_Positive</a>(&S-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][0],S-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a>,S-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1);
<a name="l00771"></a>00771 }
<a name="l00772"></a>00772
<a name="l00773"></a>00773 <span class="comment">/* Clear all the 'Value' variables */</span>
<a name="l00774"></a>00774 <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(lcm); <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(old_lcm); <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(gcd);
<a name="l00775"></a>00775 <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(last_column_entry); <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(s1);
<a name="l00776"></a>00776 <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(m1); <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(m2);
<a name="l00777"></a>00777
<a name="l00778"></a>00778 <span class="keywordflow">return</span>;
<a name="l00779"></a>00779 } <span class="comment">/* rat_prodmat */</span>
<a name="l00780"></a>00780
<a name="l00781"></a>00781 <span class="comment">/*</span>
<a name="l00782"></a>00782 <span class="comment"> * Given a matrix 'Mat' and vector 'p1', compute the matrix-vector product </span>
<a name="l00783"></a>00783 <span class="comment"> * and store the result in vector 'p2'. </span>
<a name="l00784"></a>00784 <span class="comment"> */</span>
<a name="l00785"></a><a class="code" href="matrix_8h.html#a5c3c6a49794ba7b1c6f0e39729f6af56">00785</a> <span class="keywordtype">void</span> <a class="code" href="matrix_8c.html#a4623e4f52b5c7b43d38dfb14015781ce">Matrix_Vector_Product</a>(<a class="code" href="structmatrix.html">Matrix</a> *Mat,Value *p1,Value *p2) {
<a name="l00786"></a>00786
<a name="l00787"></a>00787 <span class="keywordtype">int</span> NbRows, NbColumns, i, j;
<a name="l00788"></a>00788 Value **cm, *q, *cp1, *cp2;
<a name="l00789"></a>00789
<a name="l00790"></a>00790 NbRows=Mat-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a>;
<a name="l00791"></a>00791 NbColumns=Mat-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a>;
<a name="l00792"></a>00792
<a name="l00793"></a>00793 cm = Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>;
<a name="l00794"></a>00794 cp2 = p2;
<a name="l00795"></a>00795 <span class="keywordflow">for</span>(i=0;i<NbRows;i++) {
<a name="l00796"></a>00796 q = *cm++;
<a name="l00797"></a>00797 cp1 = p1;
<a name="l00798"></a>00798 <a class="code" href="source_2arith_2arithmetique_8h.html#ac9986d34264874727344f666079e2294">value_multiply</a>(*cp2,*q,*cp1);
<a name="l00799"></a>00799 q++;
<a name="l00800"></a>00800 cp1++;
<a name="l00801"></a>00801
<a name="l00802"></a>00802 <span class="comment">/* *cp2 = *q++ * *cp1++ */</span>
<a name="l00803"></a>00803 <span class="keywordflow">for</span>(j=1;j<NbColumns;j++) {
<a name="l00804"></a>00804 <a class="code" href="source_2arith_2arithmetique_8h.html#a9900fbd029b36f5887e587642a064a52">value_addmul</a>(*cp2, *q, *cp1);
<a name="l00805"></a>00805 q++;
<a name="l00806"></a>00806 cp1++;
<a name="l00807"></a>00807 }
<a name="l00808"></a>00808 cp2++;
<a name="l00809"></a>00809 }
<a name="l00810"></a>00810 <span class="keywordflow">return</span>;
<a name="l00811"></a>00811 } <span class="comment">/* Matrix_Vector_Product */</span>
<a name="l00812"></a>00812
<a name="l00813"></a>00813 <span class="comment">/*</span>
<a name="l00814"></a>00814 <span class="comment"> * Given a vector 'p1' and a matrix 'Mat', compute the vector-matrix product </span>
<a name="l00815"></a>00815 <span class="comment"> * and store the result in vector 'p2'</span>
<a name="l00816"></a>00816 <span class="comment"> */</span>
<a name="l00817"></a><a class="code" href="matrix_8h.html#a314e578183a3d3f48f56a2b1a5637f15">00817</a> <span class="keywordtype">void</span> <a class="code" href="matrix_8c.html#a15129f9f57a6a92234f4226cb71bcb39">Vector_Matrix_Product</a>(Value *p1,<a class="code" href="structmatrix.html">Matrix</a> *Mat,Value *p2) {
<a name="l00818"></a>00818
<a name="l00819"></a>00819 <span class="keywordtype">int</span> NbRows, NbColumns, i, j;
<a name="l00820"></a>00820 Value **cm, *cp1, *cp2;
<a name="l00821"></a>00821
<a name="l00822"></a>00822 NbRows=Mat-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a>;
<a name="l00823"></a>00823 NbColumns=Mat-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a>;
<a name="l00824"></a>00824 cp2 = p2;
<a name="l00825"></a>00825 cm = Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>;
<a name="l00826"></a>00826 <span class="keywordflow">for</span> (j=0;j<NbColumns;j++) {
<a name="l00827"></a>00827 cp1 = p1;
<a name="l00828"></a>00828 <a class="code" href="source_2arith_2arithmetique_8h.html#ac9986d34264874727344f666079e2294">value_multiply</a>(*cp2,*(*cm+j),*cp1);
<a name="l00829"></a>00829 cp1++;
<a name="l00830"></a>00830
<a name="l00831"></a>00831 <span class="comment">/* *cp2= *(*cm+j) * *cp1++; */</span>
<a name="l00832"></a>00832 <span class="keywordflow">for</span> (i=1;i<NbRows;i++) {
<a name="l00833"></a>00833 <a class="code" href="source_2arith_2arithmetique_8h.html#a9900fbd029b36f5887e587642a064a52">value_addmul</a>(*cp2, *(*(cm+i)+j), *cp1);
<a name="l00834"></a>00834 cp1++;
<a name="l00835"></a>00835 }
<a name="l00836"></a>00836 cp2++;
<a name="l00837"></a>00837 }
<a name="l00838"></a>00838 <span class="keywordflow">return</span>;
<a name="l00839"></a>00839 } <span class="comment">/* Vector_Matrix_Product */</span>
<a name="l00840"></a>00840
<a name="l00841"></a>00841 <span class="comment">/* </span>
<a name="l00842"></a>00842 <span class="comment"> * Given matrices 'Mat1' and 'Mat2', compute the matrix product and store in </span>
<a name="l00843"></a>00843 <span class="comment"> * matrix 'Mat3' </span>
<a name="l00844"></a>00844 <span class="comment"> */</span>
<a name="l00845"></a><a class="code" href="matrix_8h.html#ae08cf1c743e8b893f07a51a57e2cb1a2">00845</a> <span class="keywordtype">void</span> <a class="code" href="matrix_8c.html#a1e967c74adaa2eec868fd737a55b6624">Matrix_Product</a>(<a class="code" href="structmatrix.html">Matrix</a> *Mat1,<a class="code" href="structmatrix.html">Matrix</a> *Mat2,<a class="code" href="structmatrix.html">Matrix</a> *Mat3) {
<a name="l00846"></a>00846
<a name="l00847"></a>00847 <span class="keywordtype">int</span> Size, i, j, k;
<a name="l00848"></a>00848 <span class="keywordtype">unsigned</span> NbRows, NbColumns;
<a name="l00849"></a>00849 Value **q1, **q2, *p1, *p3,sum;
<a name="l00850"></a>00850
<a name="l00851"></a>00851 NbRows = Mat1-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a>;
<a name="l00852"></a>00852 NbColumns = Mat2-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a>;
<a name="l00853"></a>00853
<a name="l00854"></a>00854 Size = Mat1-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a>;
<a name="l00855"></a>00855 <span class="keywordflow">if</span>(Mat2-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a>!=Size||Mat3-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a>!=NbRows||Mat3-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a>!=NbColumns) {
<a name="l00856"></a>00856 fprintf(stderr, <span class="stringliteral">"? Matrix_Product : incompatable matrix dimension\n"</span>);
<a name="l00857"></a>00857 <span class="keywordflow">return</span>;
<a name="l00858"></a>00858 }
<a name="l00859"></a>00859 <a class="code" href="source_2arith_2arithmetique_8h.html#af71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(sum);
<a name="l00860"></a>00860 p3 = Mat3-><a class="code" href="structmatrix.html#a9c294a3fd4d273963e27a0c8cd819bd5">p_Init</a>;
<a name="l00861"></a>00861 q1 = Mat1-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>;
<a name="l00862"></a>00862 q2 = Mat2-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>;
<a name="l00863"></a>00863
<a name="l00864"></a>00864 <span class="comment">/* Mat3[i][j] = Sum(Mat1[i][k]*Mat2[k][j] where sum is over k = 1..nbrows */</span>
<a name="l00865"></a>00865 <span class="keywordflow">for</span> (i=0;i<NbRows;i++) {
<a name="l00866"></a>00866 <span class="keywordflow">for</span> (j=0;j<NbColumns;j++) {
<a name="l00867"></a>00867 p1 = *(q1+i);
<a name="l00868"></a>00868 <a class="code" href="source_2arith_2arithmetique_8h.html#a8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(sum,0);
<a name="l00869"></a>00869 <span class="keywordflow">for</span> (k=0;k<Size;k++) {
<a name="l00870"></a>00870 <a class="code" href="source_2arith_2arithmetique_8h.html#a9900fbd029b36f5887e587642a064a52">value_addmul</a>(sum, *p1, *(*(q2+k)+j));
<a name="l00871"></a>00871 p1++;
<a name="l00872"></a>00872 }
<a name="l00873"></a>00873 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(*p3,sum);
<a name="l00874"></a>00874 p3++;
<a name="l00875"></a>00875 }
<a name="l00876"></a>00876 }
<a name="l00877"></a>00877 <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(sum);
<a name="l00878"></a>00878 <span class="keywordflow">return</span>;
<a name="l00879"></a>00879 } <span class="comment">/* Matrix_Product */</span>
<a name="l00880"></a>00880
<a name="l00881"></a>00881 <span class="comment">/*</span>
<a name="l00882"></a>00882 <span class="comment"> * Given a rational matrix 'Mat'(k x k), compute its inverse rational matrix </span>
<a name="l00883"></a>00883 <span class="comment"> * 'MatInv' k x k.</span>
<a name="l00884"></a>00884 <span class="comment"> * The output is 1,</span>
<a name="l00885"></a>00885 <span class="comment"> * if 'Mat' is non-singular (invertible), otherwise the output is 0. Note:: </span>
<a name="l00886"></a>00886 <span class="comment"> * (1) Matrix 'Mat' is modified during the inverse operation.</span>
<a name="l00887"></a>00887 <span class="comment"> * (2) Matrix 'MatInv' must be preallocated before passing into this function.</span>
<a name="l00888"></a>00888 <span class="comment"> */</span>
<a name="l00889"></a><a class="code" href="matrix_8h.html#a97aa755c011357ce2146d71ddb88ded6">00889</a> <span class="keywordtype">int</span> <a class="code" href="matrix_8c.html#a97aa755c011357ce2146d71ddb88ded6">Matrix_Inverse</a>(<a class="code" href="structmatrix.html">Matrix</a> *Mat,<a class="code" href="structmatrix.html">Matrix</a> *MatInv ) {
<a name="l00890"></a>00890
<a name="l00891"></a>00891 <span class="keywordtype">int</span> i, k, j, c;
<a name="l00892"></a>00892 Value x, gcd, piv;
<a name="l00893"></a>00893 Value m1,m2;
<a name="l00894"></a>00894 Value *den;
<a name="l00895"></a>00895
<a name="l00896"></a>00896 <span class="keywordflow">if</span>(Mat-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a> != Mat-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a>) {
<a name="l00897"></a>00897 fprintf(stderr,<span class="stringliteral">"Trying to invert a non-square matrix !\n"</span>);
<a name="l00898"></a>00898 <span class="keywordflow">return</span> 0;
<a name="l00899"></a>00899 }
<a name="l00900"></a>00900
<a name="l00901"></a>00901 <span class="comment">/* Initialize all the 'Value' variables */</span>
<a name="l00902"></a>00902 <a class="code" href="source_2arith_2arithmetique_8h.html#af71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(x); <a class="code" href="source_2arith_2arithmetique_8h.html#af71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(gcd); <a class="code" href="source_2arith_2arithmetique_8h.html#af71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(piv);
<a name="l00903"></a>00903 <a class="code" href="source_2arith_2arithmetique_8h.html#af71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(m1); <a class="code" href="source_2arith_2arithmetique_8h.html#af71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(m2);
<a name="l00904"></a>00904
<a name="l00905"></a>00905 k = Mat-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a>;
<a name="l00906"></a>00906
<a name="l00907"></a>00907 <span class="comment">/* Initialise MatInv */</span>
<a name="l00908"></a>00908 <a class="code" href="vector_8c.html#a27ccb3ea01f3a496bb799fb99e9e3075">Vector_Set</a>(MatInv-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[0],0,k*k);
<a name="l00909"></a>00909
<a name="l00910"></a>00910 <span class="comment">/* Initialize 'MatInv' to Identity matrix form. Each diagonal entry is set*/</span>
<a name="l00911"></a>00911 <span class="comment">/* to 1. Last column of each row (denominator of each entry in a row) is */</span>
<a name="l00912"></a>00912 <span class="comment">/* also set to 1. */</span>
<a name="l00913"></a>00913 <span class="keywordflow">for</span>(i=0;i<k;++i) {
<a name="l00914"></a>00914 <a class="code" href="source_2arith_2arithmetique_8h.html#a8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(MatInv-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][i],1);
<a name="l00915"></a>00915 <span class="comment">/* value_set_si(MatInv->p[i][k],1); /* denum */</span>
<a name="l00916"></a>00916 }
<a name="l00917"></a>00917 <span class="comment">/* Apply Gauss-Jordan elimination method on the two matrices 'Mat' and */</span>
<a name="l00918"></a>00918 <span class="comment">/* 'MatInv' in parallel. */</span>
<a name="l00919"></a>00919 <span class="keywordflow">for</span>(i=0;i<k;++i) {
<a name="l00920"></a>00920
<a name="l00921"></a>00921 <span class="comment">/* Check if the diagonal entry (new pivot) is non-zero or not */</span>
<a name="l00922"></a>00922 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#a827532f2140ae2aa96e46baebae09723">value_zero_p</a>(Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][i])) {
<a name="l00923"></a>00923
<a name="l00924"></a>00924 <span class="comment">/* Search for a non-zero pivot down the column(i) */</span>
<a name="l00925"></a>00925 <span class="keywordflow">for</span>(j=i;j<k;++j)
<a name="l00926"></a>00926 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#a47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][i]))
<a name="l00927"></a>00927 <span class="keywordflow">break</span>;
<a name="l00928"></a>00928
<a name="l00929"></a>00929 <span class="comment">/* If no non-zero pivot is found, the matrix 'Mat' is non-invertible */</span>
<a name="l00930"></a>00930 <span class="comment">/* Return 0. */</span>
<a name="l00931"></a>00931 <span class="keywordflow">if</span>(j==k) {
<a name="l00932"></a>00932
<a name="l00933"></a>00933 <span class="comment">/* Clear all the 'Value' variables */</span>
<a name="l00934"></a>00934 <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(x); <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(gcd); <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(piv);
<a name="l00935"></a>00935 <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(m1); <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(m2);
<a name="l00936"></a>00936 <span class="keywordflow">return</span> 0;
<a name="l00937"></a>00937 }
<a name="l00938"></a>00938
<a name="l00939"></a>00939 <span class="comment">/* Exchange the rows, row(i) and row(j) so that the diagonal element */</span>
<a name="l00940"></a>00940 <span class="comment">/* Mat->p[i][i] (pivot) is non-zero. Repeat the same operations on */</span>
<a name="l00941"></a>00941 <span class="comment">/* matrix 'MatInv'. */</span>
<a name="l00942"></a>00942 <span class="keywordflow">for</span>(c=0;c<k;++c) {
<a name="l00943"></a>00943
<a name="l00944"></a>00944 <span class="comment">/* Interchange rows, row(i) and row(j) of matrix 'Mat' */</span>
<a name="l00945"></a>00945 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(x,Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][c]);
<a name="l00946"></a>00946 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][c],Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][c]);
<a name="l00947"></a>00947 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][c],x);
<a name="l00948"></a>00948
<a name="l00949"></a>00949 <span class="comment">/* Interchange rows, row(i) and row(j) of matrix 'MatInv' */</span>
<a name="l00950"></a>00950 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(x,MatInv-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][c]);
<a name="l00951"></a>00951 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(MatInv-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][c],MatInv-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][c]);
<a name="l00952"></a>00952 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(MatInv-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][c],x);
<a name="l00953"></a>00953 }
<a name="l00954"></a>00954 }
<a name="l00955"></a>00955
<a name="l00956"></a>00956 <span class="comment">/* Make all the entries in column(i) of matrix 'Mat' zero except the */</span>
<a name="l00957"></a>00957 <span class="comment">/* diagonal entry. Repeat the same sequence of operations on matrix */</span>
<a name="l00958"></a>00958 <span class="comment">/* 'MatInv'. */</span>
<a name="l00959"></a>00959 <span class="keywordflow">for</span>(j=0;j<k;++j) {
<a name="l00960"></a>00960 <span class="keywordflow">if</span> (j==i) <span class="keywordflow">continue</span>; <span class="comment">/* Skip the pivot */</span>
<a name="l00961"></a>00961 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(x,Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][i]);
<a name="l00962"></a>00962 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#a47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(x)) {
<a name="l00963"></a>00963 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(piv,Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][i]);
<a name="l00964"></a>00964 <a class="code" href="source_2arith_2arithmetique_8h.html#a50a34e78517e58cd1c2494a99be1e62b">value_gcd</a>(gcd, x, piv);
<a name="l00965"></a>00965 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#a5f258141f9e07b66da01ff7f4fe3d56d">value_notone_p</a>(gcd) ) {
<a name="l00966"></a>00966 <a class="code" href="source_2arith_2arithmetique_8h.html#a4b01d50506e0c7691b69d57a87280f5d">value_divexact</a>(x, x, gcd);
<a name="l00967"></a>00967 <a class="code" href="source_2arith_2arithmetique_8h.html#a4b01d50506e0c7691b69d57a87280f5d">value_divexact</a>(piv, piv, gcd);
<a name="l00968"></a>00968 }
<a name="l00969"></a>00969 <span class="keywordflow">for</span>(c=((j>i)?i:0);c<k;++c) {
<a name="l00970"></a>00970 <a class="code" href="source_2arith_2arithmetique_8h.html#ac9986d34264874727344f666079e2294">value_multiply</a>(m1,piv,Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][c]);
<a name="l00971"></a>00971 <a class="code" href="source_2arith_2arithmetique_8h.html#ac9986d34264874727344f666079e2294">value_multiply</a>(m2,x,Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][c]);
<a name="l00972"></a>00972 <a class="code" href="source_2arith_2arithmetique_8h.html#ae92a58eee3b6f5c6a99e6837e68407e1">value_subtract</a>(Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][c],m1,m2);
<a name="l00973"></a>00973 }
<a name="l00974"></a>00974 <span class="keywordflow">for</span>(c=0;c<k;++c) {
<a name="l00975"></a>00975 <a class="code" href="source_2arith_2arithmetique_8h.html#ac9986d34264874727344f666079e2294">value_multiply</a>(m1,piv,MatInv-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][c]);
<a name="l00976"></a>00976 <a class="code" href="source_2arith_2arithmetique_8h.html#ac9986d34264874727344f666079e2294">value_multiply</a>(m2,x,MatInv-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][c]);
<a name="l00977"></a>00977 <a class="code" href="source_2arith_2arithmetique_8h.html#ae92a58eee3b6f5c6a99e6837e68407e1">value_subtract</a>(MatInv-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][c],m1,m2);
<a name="l00978"></a>00978 }
<a name="l00979"></a>00979
<a name="l00980"></a>00980 <span class="comment">/* Simplify row(j) of the two matrices 'Mat' and 'MatInv' by */</span>
<a name="l00981"></a>00981 <span class="comment">/* dividing the rows with the common GCD. */</span>
<a name="l00982"></a>00982 <a class="code" href="vector_8c.html#a801486b45cadc8b9d22d99a79af91fa1">Vector_Gcd</a>(&MatInv-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][0],k,&m1);
<a name="l00983"></a>00983 <a class="code" href="vector_8c.html#a801486b45cadc8b9d22d99a79af91fa1">Vector_Gcd</a>(&Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][0],k,&m2);
<a name="l00984"></a>00984 <a class="code" href="source_2arith_2arithmetique_8h.html#a50a34e78517e58cd1c2494a99be1e62b">value_gcd</a>(gcd, m1, m2);
<a name="l00985"></a>00985 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#a5f258141f9e07b66da01ff7f4fe3d56d">value_notone_p</a>(gcd)) {
<a name="l00986"></a>00986 <span class="keywordflow">for</span>(c=0;c<k;++c) {
<a name="l00987"></a>00987 <a class="code" href="source_2arith_2arithmetique_8h.html#a4b01d50506e0c7691b69d57a87280f5d">value_divexact</a>(Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][c], Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][c], gcd);
<a name="l00988"></a>00988 <a class="code" href="source_2arith_2arithmetique_8h.html#a4b01d50506e0c7691b69d57a87280f5d">value_divexact</a>(MatInv-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][c], MatInv-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][c], gcd);
<a name="l00989"></a>00989 }
<a name="l00990"></a>00990 }
<a name="l00991"></a>00991 }
<a name="l00992"></a>00992 }
<a name="l00993"></a>00993 }
<a name="l00994"></a>00994
<a name="l00995"></a>00995 <span class="comment">/* Find common denom for each row */</span>
<a name="l00996"></a>00996 den = (Value *)malloc(k*<span class="keyword">sizeof</span>(Value));
<a name="l00997"></a>00997 <a class="code" href="source_2arith_2arithmetique_8h.html#a8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(x,1);
<a name="l00998"></a>00998 <span class="keywordflow">for</span>(j=0 ; j<k ; ++j) {
<a name="l00999"></a>00999 <a class="code" href="source_2arith_2arithmetique_8h.html#af71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(den[j]);
<a name="l01000"></a>01000 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(den[j],Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][j]);
<a name="l01001"></a>01001
<a name="l01002"></a>01002 <span class="comment">/* gcd is always positive */</span>
<a name="l01003"></a>01003 <a class="code" href="vector_8c.html#a801486b45cadc8b9d22d99a79af91fa1">Vector_Gcd</a>(&MatInv-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][0],k,&gcd);
<a name="l01004"></a>01004 <a class="code" href="source_2arith_2arithmetique_8h.html#a50a34e78517e58cd1c2494a99be1e62b">value_gcd</a>(gcd, gcd, den[j]);
<a name="l01005"></a>01005 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#af031da52c8a160fd1ee6e4c793f8c78a">value_neg_p</a>(den[j]))
<a name="l01006"></a>01006 <a class="code" href="source_2arith_2arithmetique_8h.html#a0daf9a8ecdc14e7a274832b0d2add830">value_oppose</a>(gcd,gcd); <span class="comment">/* make denominator positive */</span>
<a name="l01007"></a>01007 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#a5f258141f9e07b66da01ff7f4fe3d56d">value_notone_p</a>(gcd)) {
<a name="l01008"></a>01008 <span class="keywordflow">for</span> (c=0; c<k; c++)
<a name="l01009"></a>01009 <a class="code" href="source_2arith_2arithmetique_8h.html#a4b01d50506e0c7691b69d57a87280f5d">value_divexact</a>(MatInv-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][c], MatInv-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][c], gcd); <span class="comment">/* normalize */</span>
<a name="l01010"></a>01010 <a class="code" href="source_2arith_2arithmetique_8h.html#a4b01d50506e0c7691b69d57a87280f5d">value_divexact</a>(den[j], den[j], gcd);
<a name="l01011"></a>01011 }
<a name="l01012"></a>01012 <a class="code" href="source_2arith_2arithmetique_8h.html#a50a34e78517e58cd1c2494a99be1e62b">value_gcd</a>(gcd, x, den[j]);
<a name="l01013"></a>01013 <a class="code" href="source_2arith_2arithmetique_8h.html#a4b01d50506e0c7691b69d57a87280f5d">value_divexact</a>(m1, den[j], gcd);
<a name="l01014"></a>01014 <a class="code" href="source_2arith_2arithmetique_8h.html#ac9986d34264874727344f666079e2294">value_multiply</a>(x,x,m1);
<a name="l01015"></a>01015 }
<a name="l01016"></a>01016 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#a5f258141f9e07b66da01ff7f4fe3d56d">value_notone_p</a>(x))
<a name="l01017"></a>01017 <span class="keywordflow">for</span>(j=0 ; j<k ; ++j) {
<a name="l01018"></a>01018 <span class="keywordflow">for</span> (c=0; c<k; c++) {
<a name="l01019"></a>01019 <a class="code" href="source_2arith_2arithmetique_8h.html#ac633e4bcd9ed1d8412c67cda6d8ddb11">value_division</a>(m1,x,den[j]);
<a name="l01020"></a>01020 <a class="code" href="source_2arith_2arithmetique_8h.html#ac9986d34264874727344f666079e2294">value_multiply</a>(MatInv-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][c],MatInv-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][c],m1); <span class="comment">/* normalize */</span>
<a name="l01021"></a>01021 }
<a name="l01022"></a>01022 }
<a name="l01023"></a>01023
<a name="l01024"></a>01024 <span class="comment">/* Clear all the 'Value' variables */</span>
<a name="l01025"></a>01025 <span class="keywordflow">for</span>(j=0 ; j<k ; ++j) {
<a name="l01026"></a>01026 <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(den[j]);
<a name="l01027"></a>01027 }
<a name="l01028"></a>01028 <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(x); <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(gcd); <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(piv);
<a name="l01029"></a>01029 <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(m1); <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(m2);
<a name="l01030"></a>01030 free(den);
<a name="l01031"></a>01031
<a name="l01032"></a>01032 <span class="keywordflow">return</span> 1;
<a name="l01033"></a>01033 } <span class="comment">/* Matrix_Inverse */</span>
<a name="l01034"></a>01034
<a name="l01035"></a>01035
<a name="l01036"></a>01036
<a name="l01037"></a>01037
<a name="l01038"></a>01038
<a name="l01039"></a>01039
<a name="l01040"></a>01040
<a name="l01041"></a>01041
</pre></div></div>
<hr size="1"/><address style="text-align: right;"><small>Generated on Wed Nov 25 17:45:26 2009 for polylib by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.6.1 </small></address>
</body>
</html>
|
