ruby-lapack 1.4.1a → 1.5

Sign up to get free protection for your applications and to get access to all the features.
Files changed (1638) hide show
  1. data/Rakefile +1 -2
  2. data/ext/cbbcsd.c +34 -34
  3. data/ext/cbdsqr.c +20 -20
  4. data/ext/cgbbrd.c +12 -12
  5. data/ext/cgbcon.c +13 -13
  6. data/ext/cgbequ.c +3 -3
  7. data/ext/cgbequb.c +2 -2
  8. data/ext/cgbrfs.c +22 -22
  9. data/ext/cgbrfsx.c +43 -43
  10. data/ext/cgbsv.c +2 -2
  11. data/ext/cgbsvx.c +25 -25
  12. data/ext/cgbsvxx.c +36 -36
  13. data/ext/cgbtf2.c +3 -3
  14. data/ext/cgbtrf.c +3 -3
  15. data/ext/cgbtrs.c +11 -11
  16. data/ext/cgebak.c +11 -11
  17. data/ext/cgebal.c +1 -1
  18. data/ext/cgebd2.c +1 -1
  19. data/ext/cgebrd.c +1 -1
  20. data/ext/cgecon.c +1 -1
  21. data/ext/cgees.c +3 -3
  22. data/ext/cgeesx.c +4 -4
  23. data/ext/cgeev.c +4 -4
  24. data/ext/cgeevx.c +5 -5
  25. data/ext/cgegs.c +2 -2
  26. data/ext/cgegv.c +3 -3
  27. data/ext/cgehd2.c +1 -1
  28. data/ext/cgehrd.c +2 -2
  29. data/ext/cgelqf.c +6 -6
  30. data/ext/cgels.c +2 -2
  31. data/ext/cgelsd.c +9 -9
  32. data/ext/cgelss.c +2 -2
  33. data/ext/cgelsx.c +12 -12
  34. data/ext/cgelsy.c +12 -12
  35. data/ext/cgeql2.c +1 -1
  36. data/ext/cgeqlf.c +1 -1
  37. data/ext/cgeqp3.c +11 -11
  38. data/ext/cgeqpf.c +11 -11
  39. data/ext/cgeqr2.c +1 -1
  40. data/ext/cgeqr2p.c +1 -1
  41. data/ext/cgeqrf.c +1 -1
  42. data/ext/cgeqrfp.c +1 -1
  43. data/ext/cgerfs.c +31 -31
  44. data/ext/cgerfsx.c +25 -25
  45. data/ext/cgerqf.c +6 -6
  46. data/ext/cgesc2.c +13 -13
  47. data/ext/cgesdd.c +3 -3
  48. data/ext/cgesvd.c +4 -4
  49. data/ext/cgesvx.c +32 -32
  50. data/ext/cgesvxx.c +26 -26
  51. data/ext/cgetf2.c +1 -1
  52. data/ext/cgetrf.c +1 -1
  53. data/ext/cgetri.c +10 -10
  54. data/ext/cgetrs.c +10 -10
  55. data/ext/cggbak.c +11 -11
  56. data/ext/cggbal.c +11 -11
  57. data/ext/cgges.c +15 -15
  58. data/ext/cggesx.c +6 -6
  59. data/ext/cggev.c +3 -3
  60. data/ext/cggevx.c +5 -5
  61. data/ext/cgghrd.c +14 -14
  62. data/ext/cggqrf.c +9 -9
  63. data/ext/cggrqf.c +1 -1
  64. data/ext/cggsvd.c +3 -3
  65. data/ext/cggsvp.c +4 -4
  66. data/ext/cgtcon.c +20 -20
  67. data/ext/cgtrfs.c +48 -48
  68. data/ext/cgtsv.c +8 -8
  69. data/ext/cgtsvx.c +55 -55
  70. data/ext/cgttrs.c +19 -19
  71. data/ext/cgtts2.c +20 -20
  72. data/ext/chbev.c +3 -3
  73. data/ext/chbevd.c +9 -9
  74. data/ext/chbevx.c +7 -7
  75. data/ext/chbgst.c +15 -15
  76. data/ext/chbgv.c +15 -15
  77. data/ext/chbgvd.c +20 -20
  78. data/ext/chbgvx.c +9 -9
  79. data/ext/chbtrd.c +13 -13
  80. data/ext/checon.c +12 -12
  81. data/ext/cheequb.c +1 -1
  82. data/ext/cheev.c +2 -2
  83. data/ext/cheevd.c +7 -7
  84. data/ext/cheevr.c +12 -12
  85. data/ext/cheevx.c +7 -7
  86. data/ext/chegs2.c +2 -2
  87. data/ext/chegst.c +2 -2
  88. data/ext/chegv.c +13 -13
  89. data/ext/chegvd.c +18 -18
  90. data/ext/chegvx.c +19 -19
  91. data/ext/cherfs.c +31 -31
  92. data/ext/cherfsx.c +43 -43
  93. data/ext/chesv.c +10 -10
  94. data/ext/chesvx.c +15 -15
  95. data/ext/chesvxx.c +41 -41
  96. data/ext/chetd2.c +1 -1
  97. data/ext/chetf2.c +1 -1
  98. data/ext/chetrd.c +2 -2
  99. data/ext/chetrf.c +2 -2
  100. data/ext/chetri.c +1 -1
  101. data/ext/chetrs.c +10 -10
  102. data/ext/chetrs2.c +10 -10
  103. data/ext/chfrk.c +6 -6
  104. data/ext/chgeqz.c +27 -27
  105. data/ext/chpcon.c +1 -1
  106. data/ext/chpev.c +2 -2
  107. data/ext/chpevd.c +2 -2
  108. data/ext/chpevx.c +7 -7
  109. data/ext/chpgst.c +10 -10
  110. data/ext/chpgv.c +2 -2
  111. data/ext/chpgvd.c +11 -11
  112. data/ext/chpgvx.c +8 -8
  113. data/ext/chprfs.c +10 -10
  114. data/ext/chpsv.c +1 -1
  115. data/ext/chpsvx.c +20 -20
  116. data/ext/chptrd.c +1 -1
  117. data/ext/chptrf.c +1 -1
  118. data/ext/chptri.c +1 -1
  119. data/ext/chptrs.c +1 -1
  120. data/ext/chsein.c +21 -21
  121. data/ext/chseqr.c +4 -4
  122. data/ext/cla_gbamv.c +14 -14
  123. data/ext/cla_gbrcond_c.c +33 -33
  124. data/ext/cla_gbrcond_x.c +32 -32
  125. data/ext/cla_gbrfsx_extended.c +75 -75
  126. data/ext/cla_gbrpvgrw.c +13 -13
  127. data/ext/cla_geamv.c +6 -6
  128. data/ext/cla_gercond_c.c +31 -31
  129. data/ext/cla_gercond_x.c +30 -30
  130. data/ext/cla_gerfsx_extended.c +81 -81
  131. data/ext/cla_heamv.c +12 -12
  132. data/ext/cla_hercond_c.c +31 -31
  133. data/ext/cla_hercond_x.c +30 -30
  134. data/ext/cla_herfsx_extended.c +82 -82
  135. data/ext/cla_herpvgrw.c +14 -14
  136. data/ext/cla_lin_berr.c +14 -14
  137. data/ext/cla_porcond_c.c +23 -23
  138. data/ext/cla_porcond_x.c +22 -22
  139. data/ext/cla_porfsx_extended.c +74 -74
  140. data/ext/cla_porpvgrw.c +2 -2
  141. data/ext/cla_rpvgrw.c +12 -12
  142. data/ext/cla_syamv.c +13 -13
  143. data/ext/cla_syrcond_c.c +31 -31
  144. data/ext/cla_syrcond_x.c +30 -30
  145. data/ext/cla_syrfsx_extended.c +82 -82
  146. data/ext/cla_syrpvgrw.c +14 -14
  147. data/ext/cla_wwaddw.c +11 -11
  148. data/ext/clabrd.c +2 -2
  149. data/ext/clacn2.c +2 -2
  150. data/ext/clacp2.c +1 -1
  151. data/ext/clacpy.c +1 -1
  152. data/ext/clacrm.c +11 -11
  153. data/ext/clacrt.c +12 -12
  154. data/ext/claed7.c +42 -42
  155. data/ext/claed8.c +27 -27
  156. data/ext/claein.c +14 -14
  157. data/ext/clags2.c +5 -5
  158. data/ext/clagtm.c +21 -21
  159. data/ext/clahef.c +1 -1
  160. data/ext/clahqr.c +6 -6
  161. data/ext/clahr2.c +1 -1
  162. data/ext/clahrd.c +1 -1
  163. data/ext/claic1.c +12 -12
  164. data/ext/clals0.c +37 -37
  165. data/ext/clalsa.c +72 -72
  166. data/ext/clalsd.c +4 -4
  167. data/ext/clangb.c +3 -3
  168. data/ext/clange.c +1 -1
  169. data/ext/clangt.c +10 -10
  170. data/ext/clanhb.c +2 -2
  171. data/ext/clanhe.c +1 -1
  172. data/ext/clanhf.c +3 -3
  173. data/ext/clanhp.c +2 -2
  174. data/ext/clanhs.c +1 -1
  175. data/ext/clanht.c +1 -1
  176. data/ext/clansb.c +2 -2
  177. data/ext/clansp.c +2 -2
  178. data/ext/clansy.c +1 -1
  179. data/ext/clantb.c +3 -3
  180. data/ext/clantp.c +2 -2
  181. data/ext/clantr.c +3 -3
  182. data/ext/clapll.c +10 -10
  183. data/ext/clapmr.c +1 -1
  184. data/ext/clapmt.c +11 -11
  185. data/ext/claqgb.c +2 -2
  186. data/ext/claqge.c +10 -10
  187. data/ext/claqhb.c +2 -2
  188. data/ext/claqhe.c +12 -12
  189. data/ext/claqhp.c +2 -2
  190. data/ext/claqp2.c +10 -10
  191. data/ext/claqps.c +20 -20
  192. data/ext/claqr0.c +3 -3
  193. data/ext/claqr1.c +4 -4
  194. data/ext/claqr2.c +18 -18
  195. data/ext/claqr3.c +18 -18
  196. data/ext/claqr4.c +3 -3
  197. data/ext/claqr5.c +21 -21
  198. data/ext/claqsb.c +13 -13
  199. data/ext/claqsp.c +2 -2
  200. data/ext/claqsy.c +12 -12
  201. data/ext/clar1v.c +15 -15
  202. data/ext/clar2v.c +19 -19
  203. data/ext/clarf.c +2 -2
  204. data/ext/clarfb.c +16 -16
  205. data/ext/clarfg.c +1 -1
  206. data/ext/clarfgp.c +1 -1
  207. data/ext/clarft.c +2 -2
  208. data/ext/clarfx.c +3 -3
  209. data/ext/clargv.c +2 -2
  210. data/ext/clarnv.c +1 -1
  211. data/ext/clarrv.c +40 -40
  212. data/ext/clarscl2.c +8 -8
  213. data/ext/clartv.c +20 -20
  214. data/ext/clarz.c +11 -11
  215. data/ext/clarzb.c +14 -14
  216. data/ext/clarzt.c +2 -2
  217. data/ext/clascl.c +4 -4
  218. data/ext/clascl2.c +8 -8
  219. data/ext/claset.c +4 -4
  220. data/ext/clasr.c +2 -2
  221. data/ext/classq.c +2 -2
  222. data/ext/claswp.c +2 -2
  223. data/ext/clasyf.c +1 -1
  224. data/ext/clatbs.c +14 -14
  225. data/ext/clatdf.c +21 -21
  226. data/ext/clatps.c +12 -12
  227. data/ext/clatrd.c +1 -1
  228. data/ext/clatrs.c +15 -15
  229. data/ext/clatrz.c +1 -1
  230. data/ext/clatzm.c +3 -3
  231. data/ext/clauu2.c +1 -1
  232. data/ext/clauum.c +1 -1
  233. data/ext/cpbcon.c +3 -3
  234. data/ext/cpbequ.c +1 -1
  235. data/ext/cpbrfs.c +12 -12
  236. data/ext/cpbstf.c +1 -1
  237. data/ext/cpbsv.c +1 -1
  238. data/ext/cpbsvx.c +23 -23
  239. data/ext/cpbtf2.c +1 -1
  240. data/ext/cpbtrf.c +1 -1
  241. data/ext/cpbtrs.c +1 -1
  242. data/ext/cpftrf.c +2 -2
  243. data/ext/cpftri.c +2 -2
  244. data/ext/cpftrs.c +2 -2
  245. data/ext/cpocon.c +1 -1
  246. data/ext/cporfs.c +23 -23
  247. data/ext/cporfsx.c +22 -22
  248. data/ext/cposv.c +9 -9
  249. data/ext/cposvx.c +12 -12
  250. data/ext/cposvxx.c +20 -20
  251. data/ext/cpotf2.c +1 -1
  252. data/ext/cpotrf.c +1 -1
  253. data/ext/cpotri.c +1 -1
  254. data/ext/cpotrs.c +9 -9
  255. data/ext/cppcon.c +1 -1
  256. data/ext/cppequ.c +1 -1
  257. data/ext/cpprfs.c +20 -20
  258. data/ext/cppsv.c +1 -1
  259. data/ext/cppsvx.c +12 -12
  260. data/ext/cpptrf.c +1 -1
  261. data/ext/cpptri.c +1 -1
  262. data/ext/cpptrs.c +1 -1
  263. data/ext/cpstf2.c +2 -2
  264. data/ext/cpstrf.c +2 -2
  265. data/ext/cptcon.c +1 -1
  266. data/ext/cpteqr.c +10 -10
  267. data/ext/cptrfs.c +12 -12
  268. data/ext/cptsv.c +8 -8
  269. data/ext/cptsvx.c +19 -19
  270. data/ext/cpttrs.c +1 -1
  271. data/ext/cptts2.c +1 -1
  272. data/ext/crot.c +11 -11
  273. data/ext/cspcon.c +1 -1
  274. data/ext/cspmv.c +3 -3
  275. data/ext/cspr.c +11 -11
  276. data/ext/csprfs.c +10 -10
  277. data/ext/cspsv.c +1 -1
  278. data/ext/cspsvx.c +20 -20
  279. data/ext/csptrf.c +1 -1
  280. data/ext/csptri.c +1 -1
  281. data/ext/csptrs.c +1 -1
  282. data/ext/csrscl.c +2 -2
  283. data/ext/cstedc.c +10 -10
  284. data/ext/cstegr.c +18 -18
  285. data/ext/cstein.c +14 -14
  286. data/ext/cstemr.c +22 -22
  287. data/ext/csteqr.c +10 -10
  288. data/ext/csycon.c +12 -12
  289. data/ext/csyconv.c +12 -12
  290. data/ext/csyequb.c +1 -1
  291. data/ext/csymv.c +13 -13
  292. data/ext/csyr.c +4 -4
  293. data/ext/csyrfs.c +31 -31
  294. data/ext/csyrfsx.c +43 -43
  295. data/ext/csysv.c +10 -10
  296. data/ext/csysvx.c +15 -15
  297. data/ext/csysvxx.c +41 -41
  298. data/ext/csyswapr.c +2 -2
  299. data/ext/csytf2.c +1 -1
  300. data/ext/csytrf.c +2 -2
  301. data/ext/csytri.c +1 -1
  302. data/ext/csytri2.c +3 -3
  303. data/ext/csytri2x.c +2 -2
  304. data/ext/csytrs.c +10 -10
  305. data/ext/csytrs2.c +10 -10
  306. data/ext/ctbcon.c +3 -3
  307. data/ext/ctbrfs.c +14 -14
  308. data/ext/ctbtrs.c +2 -2
  309. data/ext/ctfsm.c +5 -5
  310. data/ext/ctftri.c +1 -1
  311. data/ext/ctfttp.c +1 -1
  312. data/ext/ctfttr.c +1 -1
  313. data/ext/ctgevc.c +32 -32
  314. data/ext/ctgex2.c +14 -14
  315. data/ext/ctgexc.c +25 -25
  316. data/ext/ctgsen.c +37 -37
  317. data/ext/ctgsja.c +26 -26
  318. data/ext/ctgsna.c +24 -24
  319. data/ext/ctgsy2.c +22 -22
  320. data/ext/ctgsyl.c +42 -42
  321. data/ext/ctpcon.c +2 -2
  322. data/ext/ctprfs.c +13 -13
  323. data/ext/ctptri.c +1 -1
  324. data/ext/ctptrs.c +3 -3
  325. data/ext/ctpttf.c +1 -1
  326. data/ext/ctpttr.c +1 -1
  327. data/ext/ctrcon.c +3 -3
  328. data/ext/ctrevc.c +12 -12
  329. data/ext/ctrexc.c +1 -1
  330. data/ext/ctrrfs.c +11 -11
  331. data/ext/ctrsen.c +13 -13
  332. data/ext/ctrsna.c +20 -20
  333. data/ext/ctrsyl.c +11 -11
  334. data/ext/ctrti2.c +1 -1
  335. data/ext/ctrtri.c +1 -1
  336. data/ext/ctrtrs.c +10 -10
  337. data/ext/ctrttf.c +1 -1
  338. data/ext/ctrttp.c +1 -1
  339. data/ext/cunbdb.c +15 -15
  340. data/ext/cuncsd.c +27 -27
  341. data/ext/cung2l.c +9 -9
  342. data/ext/cung2r.c +9 -9
  343. data/ext/cungbr.c +1 -1
  344. data/ext/cunghr.c +7 -7
  345. data/ext/cungl2.c +1 -1
  346. data/ext/cunglq.c +9 -9
  347. data/ext/cungql.c +9 -9
  348. data/ext/cungqr.c +9 -9
  349. data/ext/cungr2.c +1 -1
  350. data/ext/cungrq.c +9 -9
  351. data/ext/cungtr.c +6 -6
  352. data/ext/cunm2l.c +12 -12
  353. data/ext/cunm2r.c +12 -12
  354. data/ext/cunmbr.c +3 -3
  355. data/ext/cunmhr.c +12 -12
  356. data/ext/cunml2.c +1 -1
  357. data/ext/cunmlq.c +7 -7
  358. data/ext/cunmql.c +12 -12
  359. data/ext/cunmqr.c +12 -12
  360. data/ext/cunmr2.c +1 -1
  361. data/ext/cunmr3.c +10 -10
  362. data/ext/cunmrq.c +7 -7
  363. data/ext/cunmrz.c +10 -10
  364. data/ext/cunmtr.c +17 -17
  365. data/ext/cupgtr.c +8 -8
  366. data/ext/cupmtr.c +2 -2
  367. data/ext/dbbcsd.c +29 -29
  368. data/ext/dbdsdc.c +6 -6
  369. data/ext/dbdsqr.c +20 -20
  370. data/ext/ddisna.c +1 -1
  371. data/ext/dgbbrd.c +12 -12
  372. data/ext/dgbcon.c +13 -13
  373. data/ext/dgbequ.c +3 -3
  374. data/ext/dgbequb.c +2 -2
  375. data/ext/dgbrfs.c +22 -22
  376. data/ext/dgbrfsx.c +43 -43
  377. data/ext/dgbsv.c +2 -2
  378. data/ext/dgbsvx.c +25 -25
  379. data/ext/dgbsvxx.c +36 -36
  380. data/ext/dgbtf2.c +3 -3
  381. data/ext/dgbtrf.c +3 -3
  382. data/ext/dgbtrs.c +11 -11
  383. data/ext/dgebak.c +11 -11
  384. data/ext/dgebal.c +1 -1
  385. data/ext/dgebd2.c +1 -1
  386. data/ext/dgebrd.c +1 -1
  387. data/ext/dgecon.c +1 -1
  388. data/ext/dgees.c +3 -3
  389. data/ext/dgeesx.c +4 -4
  390. data/ext/dgeev.c +3 -3
  391. data/ext/dgeevx.c +5 -5
  392. data/ext/dgegs.c +2 -2
  393. data/ext/dgegv.c +3 -3
  394. data/ext/dgehd2.c +1 -1
  395. data/ext/dgehrd.c +2 -2
  396. data/ext/dgejsv.c +16 -16
  397. data/ext/dgelqf.c +6 -6
  398. data/ext/dgels.c +2 -2
  399. data/ext/dgelsd.c +7 -7
  400. data/ext/dgelss.c +2 -2
  401. data/ext/dgelsx.c +12 -12
  402. data/ext/dgelsy.c +12 -12
  403. data/ext/dgeql2.c +1 -1
  404. data/ext/dgeqlf.c +1 -1
  405. data/ext/dgeqp3.c +11 -11
  406. data/ext/dgeqpf.c +11 -11
  407. data/ext/dgeqr2.c +1 -1
  408. data/ext/dgeqr2p.c +1 -1
  409. data/ext/dgeqrf.c +1 -1
  410. data/ext/dgeqrfp.c +1 -1
  411. data/ext/dgerfs.c +31 -31
  412. data/ext/dgerfsx.c +25 -25
  413. data/ext/dgerqf.c +6 -6
  414. data/ext/dgesc2.c +13 -13
  415. data/ext/dgesdd.c +3 -3
  416. data/ext/dgesvd.c +4 -4
  417. data/ext/dgesvj.c +15 -15
  418. data/ext/dgesvx.c +32 -32
  419. data/ext/dgesvxx.c +26 -26
  420. data/ext/dgetf2.c +1 -1
  421. data/ext/dgetrf.c +1 -1
  422. data/ext/dgetri.c +10 -10
  423. data/ext/dgetrs.c +10 -10
  424. data/ext/dggbak.c +11 -11
  425. data/ext/dggbal.c +11 -11
  426. data/ext/dgges.c +15 -15
  427. data/ext/dggesx.c +6 -6
  428. data/ext/dggev.c +3 -3
  429. data/ext/dggevx.c +4 -4
  430. data/ext/dgghrd.c +14 -14
  431. data/ext/dggqrf.c +9 -9
  432. data/ext/dggrqf.c +1 -1
  433. data/ext/dggsvd.c +3 -3
  434. data/ext/dggsvp.c +4 -4
  435. data/ext/dgsvj0.c +20 -20
  436. data/ext/dgsvj1.c +26 -26
  437. data/ext/dgtcon.c +20 -20
  438. data/ext/dgtrfs.c +48 -48
  439. data/ext/dgtsv.c +8 -8
  440. data/ext/dgtsvx.c +55 -55
  441. data/ext/dgttrs.c +19 -19
  442. data/ext/dgtts2.c +20 -20
  443. data/ext/dhgeqz.c +27 -27
  444. data/ext/dhsein.c +42 -42
  445. data/ext/dhseqr.c +4 -4
  446. data/ext/dla_gbamv.c +16 -16
  447. data/ext/dla_gbrcond.c +25 -25
  448. data/ext/dla_gbrfsx_extended.c +56 -56
  449. data/ext/dla_gbrpvgrw.c +13 -13
  450. data/ext/dla_geamv.c +4 -4
  451. data/ext/dla_gercond.c +31 -31
  452. data/ext/dla_gerfsx_extended.c +70 -70
  453. data/ext/dla_lin_berr.c +14 -14
  454. data/ext/dla_porcond.c +15 -15
  455. data/ext/dla_porfsx_extended.c +74 -74
  456. data/ext/dla_porpvgrw.c +2 -2
  457. data/ext/dla_rpvgrw.c +12 -12
  458. data/ext/dla_syamv.c +12 -12
  459. data/ext/dla_syrcond.c +31 -31
  460. data/ext/dla_syrfsx_extended.c +82 -82
  461. data/ext/dla_syrpvgrw.c +14 -14
  462. data/ext/dla_wwaddw.c +11 -11
  463. data/ext/dlabad.c +1 -1
  464. data/ext/dlabrd.c +2 -2
  465. data/ext/dlacn2.c +2 -2
  466. data/ext/dlacpy.c +1 -1
  467. data/ext/dlaebz.c +43 -43
  468. data/ext/dlaed0.c +2 -2
  469. data/ext/dlaed1.c +20 -20
  470. data/ext/dlaed2.c +21 -21
  471. data/ext/dlaed3.c +30 -30
  472. data/ext/dlaed4.c +12 -12
  473. data/ext/dlaed5.c +11 -11
  474. data/ext/dlaed6.c +12 -12
  475. data/ext/dlaed7.c +35 -35
  476. data/ext/dlaed8.c +16 -16
  477. data/ext/dlaed9.c +14 -14
  478. data/ext/dlaeda.c +31 -31
  479. data/ext/dlaein.c +13 -13
  480. data/ext/dlaexc.c +14 -14
  481. data/ext/dlag2s.c +2 -2
  482. data/ext/dlags2.c +4 -4
  483. data/ext/dlagtf.c +10 -10
  484. data/ext/dlagtm.c +21 -21
  485. data/ext/dlagts.c +13 -13
  486. data/ext/dlahqr.c +6 -6
  487. data/ext/dlahr2.c +1 -1
  488. data/ext/dlahrd.c +1 -1
  489. data/ext/dlaic1.c +12 -12
  490. data/ext/dlaln2.c +16 -16
  491. data/ext/dlals0.c +37 -37
  492. data/ext/dlalsa.c +72 -72
  493. data/ext/dlalsd.c +4 -4
  494. data/ext/dlamrg.c +1 -1
  495. data/ext/dlaneg.c +1 -1
  496. data/ext/dlangb.c +3 -3
  497. data/ext/dlange.c +1 -1
  498. data/ext/dlangt.c +10 -10
  499. data/ext/dlanhs.c +1 -1
  500. data/ext/dlansb.c +2 -2
  501. data/ext/dlansf.c +3 -3
  502. data/ext/dlansp.c +3 -3
  503. data/ext/dlanst.c +1 -1
  504. data/ext/dlansy.c +2 -2
  505. data/ext/dlantb.c +2 -2
  506. data/ext/dlantp.c +2 -2
  507. data/ext/dlantr.c +3 -3
  508. data/ext/dlapll.c +10 -10
  509. data/ext/dlapmr.c +1 -1
  510. data/ext/dlapmt.c +11 -11
  511. data/ext/dlaqgb.c +2 -2
  512. data/ext/dlaqge.c +10 -10
  513. data/ext/dlaqp2.c +10 -10
  514. data/ext/dlaqps.c +20 -20
  515. data/ext/dlaqr0.c +3 -3
  516. data/ext/dlaqr1.c +2 -2
  517. data/ext/dlaqr2.c +18 -18
  518. data/ext/dlaqr3.c +18 -18
  519. data/ext/dlaqr4.c +3 -3
  520. data/ext/dlaqr5.c +9 -9
  521. data/ext/dlaqsb.c +13 -13
  522. data/ext/dlaqsp.c +2 -2
  523. data/ext/dlaqsy.c +12 -12
  524. data/ext/dlaqtr.c +12 -12
  525. data/ext/dlar1v.c +15 -15
  526. data/ext/dlar2v.c +19 -19
  527. data/ext/dlarf.c +2 -2
  528. data/ext/dlarfb.c +16 -16
  529. data/ext/dlarfg.c +1 -1
  530. data/ext/dlarfgp.c +1 -1
  531. data/ext/dlarft.c +2 -2
  532. data/ext/dlarfx.c +2 -2
  533. data/ext/dlargv.c +2 -2
  534. data/ext/dlarnv.c +1 -1
  535. data/ext/dlarra.c +20 -20
  536. data/ext/dlarrb.c +22 -22
  537. data/ext/dlarrc.c +13 -13
  538. data/ext/dlarrd.c +25 -25
  539. data/ext/dlarre.c +17 -17
  540. data/ext/dlarrf.c +21 -21
  541. data/ext/dlarrj.c +23 -23
  542. data/ext/dlarrk.c +3 -3
  543. data/ext/dlarrv.c +40 -40
  544. data/ext/dlarscl2.c +8 -8
  545. data/ext/dlartv.c +20 -20
  546. data/ext/dlaruv.c +1 -1
  547. data/ext/dlarz.c +11 -11
  548. data/ext/dlarzb.c +14 -14
  549. data/ext/dlarzt.c +2 -2
  550. data/ext/dlascl.c +4 -4
  551. data/ext/dlascl2.c +8 -8
  552. data/ext/dlasd0.c +3 -3
  553. data/ext/dlasd1.c +13 -13
  554. data/ext/dlasd2.c +18 -18
  555. data/ext/dlasd3.c +15 -15
  556. data/ext/dlasd4.c +12 -12
  557. data/ext/dlasd5.c +11 -11
  558. data/ext/dlasd6.c +14 -14
  559. data/ext/dlasd7.c +25 -25
  560. data/ext/dlasd8.c +27 -27
  561. data/ext/dlasda.c +5 -5
  562. data/ext/dlasdq.c +20 -20
  563. data/ext/dlaset.c +3 -3
  564. data/ext/dlasq3.c +8 -8
  565. data/ext/dlasq4.c +5 -5
  566. data/ext/dlasq5.c +3 -3
  567. data/ext/dlasq6.c +1 -1
  568. data/ext/dlasr.c +2 -2
  569. data/ext/dlasrt.c +1 -1
  570. data/ext/dlassq.c +2 -2
  571. data/ext/dlaswp.c +2 -2
  572. data/ext/dlasy2.c +24 -24
  573. data/ext/dlasyf.c +1 -1
  574. data/ext/dlat2s.c +1 -1
  575. data/ext/dlatbs.c +14 -14
  576. data/ext/dlatdf.c +21 -21
  577. data/ext/dlatps.c +12 -12
  578. data/ext/dlatrd.c +1 -1
  579. data/ext/dlatrs.c +15 -15
  580. data/ext/dlatrz.c +1 -1
  581. data/ext/dlatzm.c +2 -2
  582. data/ext/dlauu2.c +1 -1
  583. data/ext/dlauum.c +1 -1
  584. data/ext/dopgtr.c +8 -8
  585. data/ext/dopmtr.c +2 -2
  586. data/ext/dorbdb.c +15 -15
  587. data/ext/dorcsd.c +13 -13
  588. data/ext/dorg2l.c +9 -9
  589. data/ext/dorg2r.c +9 -9
  590. data/ext/dorgbr.c +1 -1
  591. data/ext/dorghr.c +7 -7
  592. data/ext/dorgl2.c +1 -1
  593. data/ext/dorglq.c +9 -9
  594. data/ext/dorgql.c +9 -9
  595. data/ext/dorgqr.c +9 -9
  596. data/ext/dorgr2.c +1 -1
  597. data/ext/dorgrq.c +9 -9
  598. data/ext/dorgtr.c +6 -6
  599. data/ext/dorm2l.c +12 -12
  600. data/ext/dorm2r.c +12 -12
  601. data/ext/dormbr.c +3 -3
  602. data/ext/dormhr.c +12 -12
  603. data/ext/dorml2.c +1 -1
  604. data/ext/dormlq.c +7 -7
  605. data/ext/dormql.c +12 -12
  606. data/ext/dormqr.c +12 -12
  607. data/ext/dormr2.c +1 -1
  608. data/ext/dormr3.c +10 -10
  609. data/ext/dormrq.c +7 -7
  610. data/ext/dormrz.c +10 -10
  611. data/ext/dormtr.c +17 -17
  612. data/ext/dpbcon.c +3 -3
  613. data/ext/dpbequ.c +1 -1
  614. data/ext/dpbrfs.c +12 -12
  615. data/ext/dpbstf.c +1 -1
  616. data/ext/dpbsv.c +1 -1
  617. data/ext/dpbsvx.c +23 -23
  618. data/ext/dpbtf2.c +1 -1
  619. data/ext/dpbtrf.c +1 -1
  620. data/ext/dpbtrs.c +1 -1
  621. data/ext/dpftrf.c +2 -2
  622. data/ext/dpftri.c +2 -2
  623. data/ext/dpftrs.c +2 -2
  624. data/ext/dpocon.c +1 -1
  625. data/ext/dporfs.c +23 -23
  626. data/ext/dporfsx.c +22 -22
  627. data/ext/dposv.c +9 -9
  628. data/ext/dposvx.c +12 -12
  629. data/ext/dposvxx.c +20 -20
  630. data/ext/dpotf2.c +1 -1
  631. data/ext/dpotrf.c +1 -1
  632. data/ext/dpotri.c +1 -1
  633. data/ext/dpotrs.c +9 -9
  634. data/ext/dppcon.c +1 -1
  635. data/ext/dppequ.c +1 -1
  636. data/ext/dpprfs.c +20 -20
  637. data/ext/dppsv.c +1 -1
  638. data/ext/dppsvx.c +12 -12
  639. data/ext/dpptrf.c +1 -1
  640. data/ext/dpptri.c +1 -1
  641. data/ext/dpptrs.c +1 -1
  642. data/ext/dpstf2.c +2 -2
  643. data/ext/dpstrf.c +2 -2
  644. data/ext/dptcon.c +1 -1
  645. data/ext/dpteqr.c +10 -10
  646. data/ext/dptrfs.c +30 -30
  647. data/ext/dptsv.c +8 -8
  648. data/ext/dptsvx.c +19 -19
  649. data/ext/dpttrs.c +8 -8
  650. data/ext/dptts2.c +8 -8
  651. data/ext/drscl.c +2 -2
  652. data/ext/dsbev.c +3 -3
  653. data/ext/dsbevd.c +9 -9
  654. data/ext/dsbevx.c +7 -7
  655. data/ext/dsbgst.c +15 -15
  656. data/ext/dsbgv.c +15 -15
  657. data/ext/dsbgvd.c +20 -20
  658. data/ext/dsbgvx.c +10 -10
  659. data/ext/dsbtrd.c +13 -13
  660. data/ext/dsfrk.c +5 -5
  661. data/ext/dspcon.c +1 -1
  662. data/ext/dspev.c +2 -2
  663. data/ext/dspevd.c +7 -7
  664. data/ext/dspevx.c +7 -7
  665. data/ext/dspgst.c +10 -10
  666. data/ext/dspgv.c +2 -2
  667. data/ext/dspgvd.c +7 -7
  668. data/ext/dspgvx.c +8 -8
  669. data/ext/dsposv.c +10 -10
  670. data/ext/dsprfs.c +10 -10
  671. data/ext/dspsv.c +1 -1
  672. data/ext/dspsvx.c +20 -20
  673. data/ext/dsptrd.c +1 -1
  674. data/ext/dsptrf.c +1 -1
  675. data/ext/dsptri.c +1 -1
  676. data/ext/dsptrs.c +1 -1
  677. data/ext/dstebz.c +5 -5
  678. data/ext/dstedc.c +5 -5
  679. data/ext/dstegr.c +18 -18
  680. data/ext/dstein.c +14 -14
  681. data/ext/dstemr.c +22 -22
  682. data/ext/dsteqr.c +10 -10
  683. data/ext/dstev.c +1 -1
  684. data/ext/dstevd.c +7 -7
  685. data/ext/dstevr.c +16 -16
  686. data/ext/dstevx.c +6 -6
  687. data/ext/dsycon.c +12 -12
  688. data/ext/dsyconv.c +12 -12
  689. data/ext/dsyequb.c +1 -1
  690. data/ext/dsyev.c +2 -2
  691. data/ext/dsyevd.c +1 -1
  692. data/ext/dsyevr.c +6 -6
  693. data/ext/dsyevx.c +7 -7
  694. data/ext/dsygs2.c +2 -2
  695. data/ext/dsygst.c +2 -2
  696. data/ext/dsygv.c +13 -13
  697. data/ext/dsygvd.c +18 -18
  698. data/ext/dsygvx.c +19 -19
  699. data/ext/dsyrfs.c +31 -31
  700. data/ext/dsyrfsx.c +43 -43
  701. data/ext/dsysv.c +10 -10
  702. data/ext/dsysvx.c +15 -15
  703. data/ext/dsysvxx.c +41 -41
  704. data/ext/dsyswapr.c +2 -2
  705. data/ext/dsytd2.c +1 -1
  706. data/ext/dsytf2.c +1 -1
  707. data/ext/dsytrd.c +2 -2
  708. data/ext/dsytrf.c +2 -2
  709. data/ext/dsytri.c +1 -1
  710. data/ext/dsytri2.c +3 -3
  711. data/ext/dsytri2x.c +2 -2
  712. data/ext/dsytrs.c +10 -10
  713. data/ext/dsytrs2.c +10 -10
  714. data/ext/dtbcon.c +3 -3
  715. data/ext/dtbrfs.c +14 -14
  716. data/ext/dtbtrs.c +2 -2
  717. data/ext/dtfsm.c +13 -13
  718. data/ext/dtftri.c +1 -1
  719. data/ext/dtfttp.c +1 -1
  720. data/ext/dtfttr.c +2 -2
  721. data/ext/dtgevc.c +32 -32
  722. data/ext/dtgex2.c +23 -23
  723. data/ext/dtgexc.c +24 -24
  724. data/ext/dtgsen.c +37 -37
  725. data/ext/dtgsja.c +26 -26
  726. data/ext/dtgsna.c +24 -24
  727. data/ext/dtgsy2.c +22 -22
  728. data/ext/dtgsyl.c +42 -42
  729. data/ext/dtpcon.c +2 -2
  730. data/ext/dtprfs.c +13 -13
  731. data/ext/dtptri.c +1 -1
  732. data/ext/dtptrs.c +3 -3
  733. data/ext/dtpttf.c +1 -1
  734. data/ext/dtpttr.c +1 -1
  735. data/ext/dtrcon.c +3 -3
  736. data/ext/dtrevc.c +12 -12
  737. data/ext/dtrexc.c +1 -1
  738. data/ext/dtrrfs.c +11 -11
  739. data/ext/dtrsen.c +13 -13
  740. data/ext/dtrsna.c +20 -20
  741. data/ext/dtrsyl.c +11 -11
  742. data/ext/dtrti2.c +1 -1
  743. data/ext/dtrtri.c +1 -1
  744. data/ext/dtrtrs.c +10 -10
  745. data/ext/dtrttf.c +1 -1
  746. data/ext/dtrttp.c +1 -1
  747. data/ext/dzsum1.c +1 -1
  748. data/ext/icmax1.c +1 -1
  749. data/ext/ieeeck.c +1 -1
  750. data/ext/ilaclc.c +1 -1
  751. data/ext/ilaclr.c +1 -1
  752. data/ext/iladlc.c +1 -1
  753. data/ext/iladlr.c +1 -1
  754. data/ext/ilaenv.c +4 -4
  755. data/ext/ilaslc.c +1 -1
  756. data/ext/ilaslr.c +1 -1
  757. data/ext/ilazlc.c +1 -1
  758. data/ext/ilazlr.c +1 -1
  759. data/ext/iparmq.c +3 -3
  760. data/ext/izmax1.c +1 -1
  761. data/ext/rb_lapack.c +3146 -3146
  762. data/ext/rb_lapack.h +1 -1
  763. data/ext/sbbcsd.c +29 -29
  764. data/ext/sbdsdc.c +10 -10
  765. data/ext/sbdsqr.c +20 -20
  766. data/ext/scsum1.c +1 -1
  767. data/ext/sdisna.c +1 -1
  768. data/ext/sgbbrd.c +12 -12
  769. data/ext/sgbcon.c +13 -13
  770. data/ext/sgbequ.c +3 -3
  771. data/ext/sgbequb.c +2 -2
  772. data/ext/sgbrfs.c +22 -22
  773. data/ext/sgbrfsx.c +43 -43
  774. data/ext/sgbsv.c +2 -2
  775. data/ext/sgbsvx.c +25 -25
  776. data/ext/sgbsvxx.c +36 -36
  777. data/ext/sgbtf2.c +3 -3
  778. data/ext/sgbtrf.c +3 -3
  779. data/ext/sgbtrs.c +11 -11
  780. data/ext/sgebak.c +11 -11
  781. data/ext/sgebal.c +1 -1
  782. data/ext/sgebd2.c +1 -1
  783. data/ext/sgebrd.c +1 -1
  784. data/ext/sgecon.c +1 -1
  785. data/ext/sgees.c +3 -3
  786. data/ext/sgeesx.c +4 -4
  787. data/ext/sgeev.c +3 -3
  788. data/ext/sgeevx.c +5 -5
  789. data/ext/sgegs.c +2 -2
  790. data/ext/sgegv.c +3 -3
  791. data/ext/sgehd2.c +1 -1
  792. data/ext/sgehrd.c +2 -2
  793. data/ext/sgejsv.c +16 -16
  794. data/ext/sgelqf.c +6 -6
  795. data/ext/sgels.c +2 -2
  796. data/ext/sgelsd.c +7 -7
  797. data/ext/sgelss.c +2 -2
  798. data/ext/sgelsx.c +12 -12
  799. data/ext/sgelsy.c +12 -12
  800. data/ext/sgeql2.c +1 -1
  801. data/ext/sgeqlf.c +1 -1
  802. data/ext/sgeqp3.c +11 -11
  803. data/ext/sgeqpf.c +11 -11
  804. data/ext/sgeqr2.c +1 -1
  805. data/ext/sgeqr2p.c +1 -1
  806. data/ext/sgeqrf.c +1 -1
  807. data/ext/sgeqrfp.c +1 -1
  808. data/ext/sgerfs.c +31 -31
  809. data/ext/sgerfsx.c +25 -25
  810. data/ext/sgerqf.c +6 -6
  811. data/ext/sgesc2.c +13 -13
  812. data/ext/sgesdd.c +3 -3
  813. data/ext/sgesvd.c +4 -4
  814. data/ext/sgesvj.c +15 -15
  815. data/ext/sgesvx.c +32 -32
  816. data/ext/sgesvxx.c +26 -26
  817. data/ext/sgetf2.c +1 -1
  818. data/ext/sgetrf.c +1 -1
  819. data/ext/sgetri.c +10 -10
  820. data/ext/sgetrs.c +10 -10
  821. data/ext/sggbak.c +11 -11
  822. data/ext/sggbal.c +11 -11
  823. data/ext/sgges.c +15 -15
  824. data/ext/sggesx.c +6 -6
  825. data/ext/sggev.c +3 -3
  826. data/ext/sggevx.c +4 -4
  827. data/ext/sgghrd.c +14 -14
  828. data/ext/sggqrf.c +9 -9
  829. data/ext/sggrqf.c +1 -1
  830. data/ext/sggsvd.c +3 -3
  831. data/ext/sggsvp.c +4 -4
  832. data/ext/sgsvj0.c +20 -20
  833. data/ext/sgsvj1.c +26 -26
  834. data/ext/sgtcon.c +20 -20
  835. data/ext/sgtrfs.c +48 -48
  836. data/ext/sgtsv.c +8 -8
  837. data/ext/sgtsvx.c +55 -55
  838. data/ext/sgttrs.c +19 -19
  839. data/ext/sgtts2.c +20 -20
  840. data/ext/shgeqz.c +27 -27
  841. data/ext/shsein.c +42 -42
  842. data/ext/shseqr.c +4 -4
  843. data/ext/sla_gbamv.c +16 -16
  844. data/ext/sla_gbrcond.c +25 -25
  845. data/ext/sla_gbrfsx_extended.c +66 -66
  846. data/ext/sla_gbrpvgrw.c +13 -13
  847. data/ext/sla_geamv.c +4 -4
  848. data/ext/sla_gercond.c +31 -31
  849. data/ext/sla_gerfsx_extended.c +82 -82
  850. data/ext/sla_lin_berr.c +14 -14
  851. data/ext/sla_porcond.c +15 -15
  852. data/ext/sla_porfsx_extended.c +74 -74
  853. data/ext/sla_porpvgrw.c +2 -2
  854. data/ext/sla_rpvgrw.c +12 -12
  855. data/ext/sla_syamv.c +12 -12
  856. data/ext/sla_syrcond.c +31 -31
  857. data/ext/sla_syrfsx_extended.c +82 -82
  858. data/ext/sla_syrpvgrw.c +14 -14
  859. data/ext/sla_wwaddw.c +11 -11
  860. data/ext/slabad.c +1 -1
  861. data/ext/slabrd.c +2 -2
  862. data/ext/slacn2.c +2 -2
  863. data/ext/slacpy.c +1 -1
  864. data/ext/slaebz.c +43 -43
  865. data/ext/slaed0.c +2 -2
  866. data/ext/slaed1.c +20 -20
  867. data/ext/slaed2.c +21 -21
  868. data/ext/slaed3.c +30 -30
  869. data/ext/slaed4.c +12 -12
  870. data/ext/slaed5.c +11 -11
  871. data/ext/slaed6.c +12 -12
  872. data/ext/slaed7.c +35 -35
  873. data/ext/slaed8.c +16 -16
  874. data/ext/slaed9.c +14 -14
  875. data/ext/slaeda.c +31 -31
  876. data/ext/slaein.c +13 -13
  877. data/ext/slaexc.c +14 -14
  878. data/ext/slags2.c +4 -4
  879. data/ext/slagtf.c +10 -10
  880. data/ext/slagtm.c +21 -21
  881. data/ext/slagts.c +13 -13
  882. data/ext/slahqr.c +6 -6
  883. data/ext/slahr2.c +1 -1
  884. data/ext/slahrd.c +3 -3
  885. data/ext/slaic1.c +12 -12
  886. data/ext/slaln2.c +16 -16
  887. data/ext/slals0.c +37 -37
  888. data/ext/slalsa.c +72 -72
  889. data/ext/slalsd.c +4 -4
  890. data/ext/slamrg.c +2 -2
  891. data/ext/slaneg.c +1 -1
  892. data/ext/slangb.c +3 -3
  893. data/ext/slange.c +1 -1
  894. data/ext/slangt.c +10 -10
  895. data/ext/slanhs.c +1 -1
  896. data/ext/slansb.c +2 -2
  897. data/ext/slansf.c +3 -3
  898. data/ext/slansp.c +3 -3
  899. data/ext/slanst.c +1 -1
  900. data/ext/slansy.c +2 -2
  901. data/ext/slantb.c +2 -2
  902. data/ext/slantp.c +2 -2
  903. data/ext/slantr.c +3 -3
  904. data/ext/slapll.c +10 -10
  905. data/ext/slapmr.c +1 -1
  906. data/ext/slapmt.c +11 -11
  907. data/ext/slaqgb.c +2 -2
  908. data/ext/slaqge.c +10 -10
  909. data/ext/slaqp2.c +10 -10
  910. data/ext/slaqps.c +20 -20
  911. data/ext/slaqr0.c +3 -3
  912. data/ext/slaqr1.c +2 -2
  913. data/ext/slaqr2.c +18 -18
  914. data/ext/slaqr3.c +18 -18
  915. data/ext/slaqr4.c +3 -3
  916. data/ext/slaqr5.c +9 -9
  917. data/ext/slaqsb.c +13 -13
  918. data/ext/slaqsp.c +2 -2
  919. data/ext/slaqsy.c +12 -12
  920. data/ext/slaqtr.c +12 -12
  921. data/ext/slar1v.c +15 -15
  922. data/ext/slar2v.c +19 -19
  923. data/ext/slarf.c +2 -2
  924. data/ext/slarfb.c +16 -16
  925. data/ext/slarfg.c +1 -1
  926. data/ext/slarfgp.c +1 -1
  927. data/ext/slarft.c +2 -2
  928. data/ext/slarfx.c +2 -2
  929. data/ext/slargv.c +2 -2
  930. data/ext/slarnv.c +1 -1
  931. data/ext/slarra.c +20 -20
  932. data/ext/slarrb.c +22 -22
  933. data/ext/slarrc.c +13 -13
  934. data/ext/slarrd.c +25 -25
  935. data/ext/slarre.c +17 -17
  936. data/ext/slarrf.c +21 -21
  937. data/ext/slarrj.c +23 -23
  938. data/ext/slarrk.c +3 -3
  939. data/ext/slarrv.c +40 -40
  940. data/ext/slarscl2.c +8 -8
  941. data/ext/slartv.c +20 -20
  942. data/ext/slaruv.c +1 -1
  943. data/ext/slarz.c +11 -11
  944. data/ext/slarzb.c +14 -14
  945. data/ext/slarzt.c +2 -2
  946. data/ext/slascl.c +4 -4
  947. data/ext/slascl2.c +8 -8
  948. data/ext/slasd0.c +3 -3
  949. data/ext/slasd1.c +12 -12
  950. data/ext/slasd2.c +18 -18
  951. data/ext/slasd3.c +15 -15
  952. data/ext/slasd4.c +12 -12
  953. data/ext/slasd5.c +11 -11
  954. data/ext/slasd6.c +14 -14
  955. data/ext/slasd7.c +25 -25
  956. data/ext/slasd8.c +27 -27
  957. data/ext/slasda.c +5 -5
  958. data/ext/slasdq.c +20 -20
  959. data/ext/slaset.c +3 -3
  960. data/ext/slasq3.c +8 -8
  961. data/ext/slasq4.c +5 -5
  962. data/ext/slasq5.c +3 -3
  963. data/ext/slasq6.c +1 -1
  964. data/ext/slasr.c +2 -2
  965. data/ext/slasrt.c +1 -1
  966. data/ext/slassq.c +2 -2
  967. data/ext/slaswp.c +2 -2
  968. data/ext/slasy2.c +24 -24
  969. data/ext/slasyf.c +1 -1
  970. data/ext/slatbs.c +14 -14
  971. data/ext/slatdf.c +21 -21
  972. data/ext/slatps.c +12 -12
  973. data/ext/slatrd.c +1 -1
  974. data/ext/slatrs.c +15 -15
  975. data/ext/slatrz.c +1 -1
  976. data/ext/slatzm.c +2 -2
  977. data/ext/slauu2.c +1 -1
  978. data/ext/slauum.c +1 -1
  979. data/ext/sopgtr.c +8 -8
  980. data/ext/sopmtr.c +2 -2
  981. data/ext/sorbdb.c +15 -15
  982. data/ext/sorcsd.c +13 -13
  983. data/ext/sorg2l.c +9 -9
  984. data/ext/sorg2r.c +9 -9
  985. data/ext/sorgbr.c +1 -1
  986. data/ext/sorghr.c +7 -7
  987. data/ext/sorgl2.c +1 -1
  988. data/ext/sorglq.c +9 -9
  989. data/ext/sorgql.c +9 -9
  990. data/ext/sorgqr.c +9 -9
  991. data/ext/sorgr2.c +1 -1
  992. data/ext/sorgrq.c +9 -9
  993. data/ext/sorgtr.c +6 -6
  994. data/ext/sorm2l.c +12 -12
  995. data/ext/sorm2r.c +12 -12
  996. data/ext/sormbr.c +3 -3
  997. data/ext/sormhr.c +12 -12
  998. data/ext/sorml2.c +1 -1
  999. data/ext/sormlq.c +7 -7
  1000. data/ext/sormql.c +12 -12
  1001. data/ext/sormqr.c +12 -12
  1002. data/ext/sormr2.c +1 -1
  1003. data/ext/sormr3.c +10 -10
  1004. data/ext/sormrq.c +7 -7
  1005. data/ext/sormrz.c +10 -10
  1006. data/ext/sormtr.c +17 -17
  1007. data/ext/spbcon.c +3 -3
  1008. data/ext/spbequ.c +1 -1
  1009. data/ext/spbrfs.c +12 -12
  1010. data/ext/spbstf.c +1 -1
  1011. data/ext/spbsv.c +1 -1
  1012. data/ext/spbsvx.c +23 -23
  1013. data/ext/spbtf2.c +1 -1
  1014. data/ext/spbtrf.c +1 -1
  1015. data/ext/spbtrs.c +1 -1
  1016. data/ext/spftrf.c +2 -2
  1017. data/ext/spftri.c +2 -2
  1018. data/ext/spftrs.c +2 -2
  1019. data/ext/spocon.c +1 -1
  1020. data/ext/sporfs.c +23 -23
  1021. data/ext/sporfsx.c +22 -22
  1022. data/ext/sposv.c +9 -9
  1023. data/ext/sposvx.c +12 -12
  1024. data/ext/sposvxx.c +20 -20
  1025. data/ext/spotf2.c +1 -1
  1026. data/ext/spotrf.c +1 -1
  1027. data/ext/spotri.c +1 -1
  1028. data/ext/spotrs.c +9 -9
  1029. data/ext/sppcon.c +1 -1
  1030. data/ext/sppequ.c +1 -1
  1031. data/ext/spprfs.c +20 -20
  1032. data/ext/sppsv.c +1 -1
  1033. data/ext/sppsvx.c +12 -12
  1034. data/ext/spptrf.c +1 -1
  1035. data/ext/spptri.c +1 -1
  1036. data/ext/spptrs.c +1 -1
  1037. data/ext/spstf2.c +2 -2
  1038. data/ext/spstrf.c +2 -2
  1039. data/ext/sptcon.c +1 -1
  1040. data/ext/spteqr.c +10 -10
  1041. data/ext/sptrfs.c +30 -30
  1042. data/ext/sptsv.c +8 -8
  1043. data/ext/sptsvx.c +19 -19
  1044. data/ext/spttrs.c +8 -8
  1045. data/ext/sptts2.c +8 -8
  1046. data/ext/srscl.c +2 -2
  1047. data/ext/ssbev.c +3 -3
  1048. data/ext/ssbevd.c +9 -9
  1049. data/ext/ssbevx.c +7 -7
  1050. data/ext/ssbgst.c +15 -15
  1051. data/ext/ssbgv.c +15 -15
  1052. data/ext/ssbgvd.c +20 -20
  1053. data/ext/ssbgvx.c +10 -10
  1054. data/ext/ssbtrd.c +13 -13
  1055. data/ext/ssfrk.c +5 -5
  1056. data/ext/sspcon.c +1 -1
  1057. data/ext/sspev.c +2 -2
  1058. data/ext/sspevd.c +7 -7
  1059. data/ext/sspevx.c +7 -7
  1060. data/ext/sspgst.c +10 -10
  1061. data/ext/sspgv.c +2 -2
  1062. data/ext/sspgvd.c +7 -7
  1063. data/ext/sspgvx.c +8 -8
  1064. data/ext/ssprfs.c +10 -10
  1065. data/ext/sspsv.c +1 -1
  1066. data/ext/sspsvx.c +20 -20
  1067. data/ext/ssptrd.c +1 -1
  1068. data/ext/ssptrf.c +1 -1
  1069. data/ext/ssptri.c +1 -1
  1070. data/ext/ssptrs.c +1 -1
  1071. data/ext/sstebz.c +5 -5
  1072. data/ext/sstedc.c +5 -5
  1073. data/ext/sstegr.c +18 -18
  1074. data/ext/sstein.c +14 -14
  1075. data/ext/sstemr.c +22 -22
  1076. data/ext/ssteqr.c +10 -10
  1077. data/ext/sstev.c +1 -1
  1078. data/ext/sstevd.c +7 -7
  1079. data/ext/sstevr.c +16 -16
  1080. data/ext/sstevx.c +6 -6
  1081. data/ext/ssycon.c +12 -12
  1082. data/ext/ssyconv.c +12 -12
  1083. data/ext/ssyequb.c +1 -1
  1084. data/ext/ssyev.c +2 -2
  1085. data/ext/ssyevd.c +1 -1
  1086. data/ext/ssyevr.c +6 -6
  1087. data/ext/ssyevx.c +7 -7
  1088. data/ext/ssygs2.c +2 -2
  1089. data/ext/ssygst.c +2 -2
  1090. data/ext/ssygv.c +13 -13
  1091. data/ext/ssygvd.c +18 -18
  1092. data/ext/ssygvx.c +22 -22
  1093. data/ext/ssyrfs.c +31 -31
  1094. data/ext/ssyrfsx.c +43 -43
  1095. data/ext/ssysv.c +10 -10
  1096. data/ext/ssysvx.c +15 -15
  1097. data/ext/ssysvxx.c +41 -41
  1098. data/ext/ssyswapr.c +2 -2
  1099. data/ext/ssytd2.c +1 -1
  1100. data/ext/ssytf2.c +1 -1
  1101. data/ext/ssytrd.c +2 -2
  1102. data/ext/ssytrf.c +2 -2
  1103. data/ext/ssytri.c +1 -1
  1104. data/ext/ssytri2.c +11 -11
  1105. data/ext/ssytri2x.c +2 -2
  1106. data/ext/ssytrs.c +10 -10
  1107. data/ext/ssytrs2.c +10 -10
  1108. data/ext/stbcon.c +3 -3
  1109. data/ext/stbrfs.c +14 -14
  1110. data/ext/stbtrs.c +2 -2
  1111. data/ext/stfsm.c +13 -13
  1112. data/ext/stftri.c +1 -1
  1113. data/ext/stfttp.c +1 -1
  1114. data/ext/stfttr.c +1 -1
  1115. data/ext/stgevc.c +32 -32
  1116. data/ext/stgex2.c +16 -16
  1117. data/ext/stgexc.c +26 -26
  1118. data/ext/stgsen.c +37 -37
  1119. data/ext/stgsja.c +26 -26
  1120. data/ext/stgsna.c +24 -24
  1121. data/ext/stgsy2.c +22 -22
  1122. data/ext/stgsyl.c +42 -42
  1123. data/ext/stpcon.c +2 -2
  1124. data/ext/stprfs.c +13 -13
  1125. data/ext/stptri.c +1 -1
  1126. data/ext/stptrs.c +3 -3
  1127. data/ext/stpttf.c +1 -1
  1128. data/ext/stpttr.c +1 -1
  1129. data/ext/strcon.c +3 -3
  1130. data/ext/strevc.c +12 -12
  1131. data/ext/strexc.c +1 -1
  1132. data/ext/strrfs.c +11 -11
  1133. data/ext/strsen.c +13 -13
  1134. data/ext/strsna.c +20 -20
  1135. data/ext/strsyl.c +11 -11
  1136. data/ext/strti2.c +1 -1
  1137. data/ext/strtri.c +1 -1
  1138. data/ext/strtrs.c +10 -10
  1139. data/ext/strttf.c +1 -1
  1140. data/ext/strttp.c +1 -1
  1141. data/ext/xerbla_array.c +1 -1
  1142. data/ext/zbbcsd.c +34 -34
  1143. data/ext/zbdsqr.c +20 -20
  1144. data/ext/zcposv.c +10 -10
  1145. data/ext/zdrscl.c +2 -2
  1146. data/ext/zgbbrd.c +12 -12
  1147. data/ext/zgbcon.c +13 -13
  1148. data/ext/zgbequ.c +3 -3
  1149. data/ext/zgbequb.c +2 -2
  1150. data/ext/zgbrfs.c +22 -22
  1151. data/ext/zgbrfsx.c +43 -43
  1152. data/ext/zgbsv.c +2 -2
  1153. data/ext/zgbsvx.c +25 -25
  1154. data/ext/zgbsvxx.c +36 -36
  1155. data/ext/zgbtf2.c +3 -3
  1156. data/ext/zgbtrf.c +3 -3
  1157. data/ext/zgbtrs.c +11 -11
  1158. data/ext/zgebak.c +11 -11
  1159. data/ext/zgebal.c +1 -1
  1160. data/ext/zgebd2.c +1 -1
  1161. data/ext/zgebrd.c +1 -1
  1162. data/ext/zgecon.c +1 -1
  1163. data/ext/zgees.c +3 -3
  1164. data/ext/zgeesx.c +4 -4
  1165. data/ext/zgeev.c +4 -4
  1166. data/ext/zgeevx.c +5 -5
  1167. data/ext/zgegs.c +2 -2
  1168. data/ext/zgegv.c +3 -3
  1169. data/ext/zgehd2.c +1 -1
  1170. data/ext/zgehrd.c +2 -2
  1171. data/ext/zgelqf.c +6 -6
  1172. data/ext/zgels.c +2 -2
  1173. data/ext/zgelsd.c +9 -9
  1174. data/ext/zgelss.c +2 -2
  1175. data/ext/zgelsx.c +12 -12
  1176. data/ext/zgelsy.c +12 -12
  1177. data/ext/zgeql2.c +1 -1
  1178. data/ext/zgeqlf.c +1 -1
  1179. data/ext/zgeqp3.c +11 -11
  1180. data/ext/zgeqpf.c +11 -11
  1181. data/ext/zgeqr2.c +1 -1
  1182. data/ext/zgeqr2p.c +1 -1
  1183. data/ext/zgeqrf.c +1 -1
  1184. data/ext/zgeqrfp.c +1 -1
  1185. data/ext/zgerfs.c +31 -31
  1186. data/ext/zgerfsx.c +25 -25
  1187. data/ext/zgerqf.c +6 -6
  1188. data/ext/zgesc2.c +13 -13
  1189. data/ext/zgesdd.c +3 -3
  1190. data/ext/zgesvd.c +4 -4
  1191. data/ext/zgesvx.c +32 -32
  1192. data/ext/zgesvxx.c +26 -26
  1193. data/ext/zgetf2.c +1 -1
  1194. data/ext/zgetrf.c +1 -1
  1195. data/ext/zgetri.c +10 -10
  1196. data/ext/zgetrs.c +10 -10
  1197. data/ext/zggbak.c +11 -11
  1198. data/ext/zggbal.c +11 -11
  1199. data/ext/zgges.c +15 -15
  1200. data/ext/zggesx.c +6 -6
  1201. data/ext/zggev.c +3 -3
  1202. data/ext/zggevx.c +5 -5
  1203. data/ext/zgghrd.c +14 -14
  1204. data/ext/zggqrf.c +9 -9
  1205. data/ext/zggrqf.c +1 -1
  1206. data/ext/zggsvd.c +3 -3
  1207. data/ext/zggsvp.c +4 -4
  1208. data/ext/zgtcon.c +20 -20
  1209. data/ext/zgtrfs.c +48 -48
  1210. data/ext/zgtsv.c +8 -8
  1211. data/ext/zgtsvx.c +55 -55
  1212. data/ext/zgttrs.c +19 -19
  1213. data/ext/zgtts2.c +20 -20
  1214. data/ext/zhbev.c +3 -3
  1215. data/ext/zhbevd.c +9 -9
  1216. data/ext/zhbevx.c +7 -7
  1217. data/ext/zhbgst.c +15 -15
  1218. data/ext/zhbgv.c +15 -15
  1219. data/ext/zhbgvd.c +20 -20
  1220. data/ext/zhbgvx.c +9 -9
  1221. data/ext/zhbtrd.c +13 -13
  1222. data/ext/zhecon.c +12 -12
  1223. data/ext/zheequb.c +1 -1
  1224. data/ext/zheev.c +2 -2
  1225. data/ext/zheevd.c +7 -7
  1226. data/ext/zheevr.c +12 -12
  1227. data/ext/zheevx.c +7 -7
  1228. data/ext/zhegs2.c +2 -2
  1229. data/ext/zhegst.c +2 -2
  1230. data/ext/zhegv.c +13 -13
  1231. data/ext/zhegvd.c +18 -18
  1232. data/ext/zhegvx.c +19 -19
  1233. data/ext/zherfs.c +31 -31
  1234. data/ext/zherfsx.c +43 -43
  1235. data/ext/zhesv.c +10 -10
  1236. data/ext/zhesvx.c +15 -15
  1237. data/ext/zhesvxx.c +41 -41
  1238. data/ext/zhetd2.c +1 -1
  1239. data/ext/zhetf2.c +1 -1
  1240. data/ext/zhetrd.c +2 -2
  1241. data/ext/zhetrf.c +2 -2
  1242. data/ext/zhetri.c +1 -1
  1243. data/ext/zhetrs.c +10 -10
  1244. data/ext/zhetrs2.c +10 -10
  1245. data/ext/zhfrk.c +6 -6
  1246. data/ext/zhgeqz.c +27 -27
  1247. data/ext/zhpcon.c +1 -1
  1248. data/ext/zhpev.c +2 -2
  1249. data/ext/zhpevd.c +2 -2
  1250. data/ext/zhpevx.c +7 -7
  1251. data/ext/zhpgst.c +10 -10
  1252. data/ext/zhpgv.c +2 -2
  1253. data/ext/zhpgvd.c +11 -11
  1254. data/ext/zhpgvx.c +8 -8
  1255. data/ext/zhprfs.c +10 -10
  1256. data/ext/zhpsv.c +1 -1
  1257. data/ext/zhpsvx.c +20 -20
  1258. data/ext/zhptrd.c +1 -1
  1259. data/ext/zhptrf.c +1 -1
  1260. data/ext/zhptri.c +1 -1
  1261. data/ext/zhptrs.c +1 -1
  1262. data/ext/zhsein.c +21 -21
  1263. data/ext/zhseqr.c +4 -4
  1264. data/ext/zla_gbamv.c +14 -14
  1265. data/ext/zla_gbrcond_c.c +33 -33
  1266. data/ext/zla_gbrcond_x.c +32 -32
  1267. data/ext/zla_gbrfsx_extended.c +78 -78
  1268. data/ext/zla_gbrpvgrw.c +13 -13
  1269. data/ext/zla_geamv.c +4 -4
  1270. data/ext/zla_gercond_c.c +31 -31
  1271. data/ext/zla_gercond_x.c +30 -30
  1272. data/ext/zla_gerfsx_extended.c +70 -70
  1273. data/ext/zla_heamv.c +12 -12
  1274. data/ext/zla_hercond_c.c +31 -31
  1275. data/ext/zla_hercond_x.c +30 -30
  1276. data/ext/zla_herfsx_extended.c +82 -82
  1277. data/ext/zla_herpvgrw.c +14 -14
  1278. data/ext/zla_lin_berr.c +14 -14
  1279. data/ext/zla_porcond_c.c +23 -23
  1280. data/ext/zla_porcond_x.c +22 -22
  1281. data/ext/zla_porfsx_extended.c +74 -74
  1282. data/ext/zla_porpvgrw.c +2 -2
  1283. data/ext/zla_rpvgrw.c +12 -12
  1284. data/ext/zla_syamv.c +12 -12
  1285. data/ext/zla_syrcond_c.c +31 -31
  1286. data/ext/zla_syrcond_x.c +30 -30
  1287. data/ext/zla_syrfsx_extended.c +82 -82
  1288. data/ext/zla_syrpvgrw.c +14 -14
  1289. data/ext/zla_wwaddw.c +11 -11
  1290. data/ext/zlabrd.c +2 -2
  1291. data/ext/zlacn2.c +2 -2
  1292. data/ext/zlacp2.c +1 -1
  1293. data/ext/zlacpy.c +1 -1
  1294. data/ext/zlacrm.c +11 -11
  1295. data/ext/zlacrt.c +12 -12
  1296. data/ext/zlaed7.c +42 -42
  1297. data/ext/zlaed8.c +27 -27
  1298. data/ext/zlaein.c +14 -14
  1299. data/ext/zlag2c.c +2 -2
  1300. data/ext/zlags2.c +5 -5
  1301. data/ext/zlagtm.c +21 -21
  1302. data/ext/zlahef.c +1 -1
  1303. data/ext/zlahqr.c +6 -6
  1304. data/ext/zlahr2.c +1 -1
  1305. data/ext/zlahrd.c +1 -1
  1306. data/ext/zlaic1.c +12 -12
  1307. data/ext/zlals0.c +37 -37
  1308. data/ext/zlalsa.c +72 -72
  1309. data/ext/zlalsd.c +4 -4
  1310. data/ext/zlangb.c +3 -3
  1311. data/ext/zlange.c +1 -1
  1312. data/ext/zlangt.c +10 -10
  1313. data/ext/zlanhb.c +2 -2
  1314. data/ext/zlanhe.c +2 -2
  1315. data/ext/zlanhf.c +3 -3
  1316. data/ext/zlanhp.c +3 -3
  1317. data/ext/zlanhs.c +1 -1
  1318. data/ext/zlanht.c +1 -1
  1319. data/ext/zlansb.c +2 -2
  1320. data/ext/zlansp.c +3 -3
  1321. data/ext/zlansy.c +2 -2
  1322. data/ext/zlantb.c +2 -2
  1323. data/ext/zlantp.c +2 -2
  1324. data/ext/zlantr.c +3 -3
  1325. data/ext/zlapll.c +10 -10
  1326. data/ext/zlapmr.c +1 -1
  1327. data/ext/zlapmt.c +11 -11
  1328. data/ext/zlaqgb.c +2 -2
  1329. data/ext/zlaqge.c +10 -10
  1330. data/ext/zlaqhb.c +2 -2
  1331. data/ext/zlaqhe.c +12 -12
  1332. data/ext/zlaqhp.c +2 -2
  1333. data/ext/zlaqp2.c +10 -10
  1334. data/ext/zlaqps.c +20 -20
  1335. data/ext/zlaqr0.c +17 -17
  1336. data/ext/zlaqr1.c +4 -4
  1337. data/ext/zlaqr2.c +18 -18
  1338. data/ext/zlaqr3.c +18 -18
  1339. data/ext/zlaqr4.c +7 -7
  1340. data/ext/zlaqr5.c +21 -21
  1341. data/ext/zlaqsb.c +13 -13
  1342. data/ext/zlaqsp.c +2 -2
  1343. data/ext/zlaqsy.c +12 -12
  1344. data/ext/zlar1v.c +15 -15
  1345. data/ext/zlar2v.c +19 -19
  1346. data/ext/zlarf.c +2 -2
  1347. data/ext/zlarfb.c +16 -16
  1348. data/ext/zlarfg.c +1 -1
  1349. data/ext/zlarfgp.c +1 -1
  1350. data/ext/zlarft.c +2 -2
  1351. data/ext/zlarfx.c +3 -3
  1352. data/ext/zlargv.c +2 -2
  1353. data/ext/zlarnv.c +1 -1
  1354. data/ext/zlarrv.c +40 -40
  1355. data/ext/zlarscl2.c +8 -8
  1356. data/ext/zlartv.c +20 -20
  1357. data/ext/zlarz.c +11 -11
  1358. data/ext/zlarzb.c +14 -14
  1359. data/ext/zlarzt.c +2 -2
  1360. data/ext/zlascl.c +4 -4
  1361. data/ext/zlascl2.c +8 -8
  1362. data/ext/zlaset.c +4 -4
  1363. data/ext/zlasr.c +2 -2
  1364. data/ext/zlassq.c +2 -2
  1365. data/ext/zlaswp.c +2 -2
  1366. data/ext/zlasyf.c +1 -1
  1367. data/ext/zlat2c.c +1 -1
  1368. data/ext/zlatbs.c +14 -14
  1369. data/ext/zlatdf.c +21 -21
  1370. data/ext/zlatps.c +12 -12
  1371. data/ext/zlatrd.c +1 -1
  1372. data/ext/zlatrs.c +15 -15
  1373. data/ext/zlatrz.c +1 -1
  1374. data/ext/zlatzm.c +3 -3
  1375. data/ext/zlauu2.c +1 -1
  1376. data/ext/zlauum.c +1 -1
  1377. data/ext/zpbcon.c +3 -3
  1378. data/ext/zpbequ.c +1 -1
  1379. data/ext/zpbrfs.c +12 -12
  1380. data/ext/zpbstf.c +1 -1
  1381. data/ext/zpbsv.c +1 -1
  1382. data/ext/zpbsvx.c +23 -23
  1383. data/ext/zpbtf2.c +1 -1
  1384. data/ext/zpbtrf.c +1 -1
  1385. data/ext/zpbtrs.c +1 -1
  1386. data/ext/zpftrf.c +2 -2
  1387. data/ext/zpftri.c +2 -2
  1388. data/ext/zpftrs.c +2 -2
  1389. data/ext/zpocon.c +1 -1
  1390. data/ext/zporfs.c +23 -23
  1391. data/ext/zporfsx.c +22 -22
  1392. data/ext/zposv.c +9 -9
  1393. data/ext/zposvx.c +12 -12
  1394. data/ext/zposvxx.c +20 -20
  1395. data/ext/zpotf2.c +1 -1
  1396. data/ext/zpotrf.c +1 -1
  1397. data/ext/zpotri.c +1 -1
  1398. data/ext/zpotrs.c +9 -9
  1399. data/ext/zppcon.c +1 -1
  1400. data/ext/zppequ.c +1 -1
  1401. data/ext/zpprfs.c +20 -20
  1402. data/ext/zppsv.c +1 -1
  1403. data/ext/zppsvx.c +12 -12
  1404. data/ext/zpptrf.c +1 -1
  1405. data/ext/zpptri.c +1 -1
  1406. data/ext/zpptrs.c +1 -1
  1407. data/ext/zpstf2.c +2 -2
  1408. data/ext/zpstrf.c +2 -2
  1409. data/ext/zptcon.c +1 -1
  1410. data/ext/zpteqr.c +10 -10
  1411. data/ext/zptrfs.c +12 -12
  1412. data/ext/zptsv.c +1 -1
  1413. data/ext/zptsvx.c +19 -19
  1414. data/ext/zpttrs.c +1 -1
  1415. data/ext/zptts2.c +1 -1
  1416. data/ext/zrot.c +11 -11
  1417. data/ext/zspcon.c +1 -1
  1418. data/ext/zspmv.c +15 -15
  1419. data/ext/zspr.c +11 -11
  1420. data/ext/zsprfs.c +10 -10
  1421. data/ext/zspsv.c +1 -1
  1422. data/ext/zspsvx.c +20 -20
  1423. data/ext/zsptrf.c +1 -1
  1424. data/ext/zsptri.c +1 -1
  1425. data/ext/zsptrs.c +1 -1
  1426. data/ext/zstedc.c +10 -10
  1427. data/ext/zstegr.c +18 -18
  1428. data/ext/zstein.c +14 -14
  1429. data/ext/zstemr.c +22 -22
  1430. data/ext/zsteqr.c +10 -10
  1431. data/ext/zsycon.c +12 -12
  1432. data/ext/zsyconv.c +12 -12
  1433. data/ext/zsyequb.c +1 -1
  1434. data/ext/zsymv.c +13 -13
  1435. data/ext/zsyr.c +4 -4
  1436. data/ext/zsyrfs.c +31 -31
  1437. data/ext/zsyrfsx.c +43 -43
  1438. data/ext/zsysv.c +10 -10
  1439. data/ext/zsysvx.c +15 -15
  1440. data/ext/zsysvxx.c +41 -41
  1441. data/ext/zsyswapr.c +2 -2
  1442. data/ext/zsytf2.c +1 -1
  1443. data/ext/zsytrf.c +2 -2
  1444. data/ext/zsytri.c +1 -1
  1445. data/ext/zsytri2.c +3 -3
  1446. data/ext/zsytri2x.c +2 -2
  1447. data/ext/zsytrs.c +10 -10
  1448. data/ext/zsytrs2.c +10 -10
  1449. data/ext/ztbcon.c +3 -3
  1450. data/ext/ztbrfs.c +14 -14
  1451. data/ext/ztbtrs.c +2 -2
  1452. data/ext/ztfsm.c +5 -5
  1453. data/ext/ztftri.c +1 -1
  1454. data/ext/ztfttp.c +1 -1
  1455. data/ext/ztfttr.c +1 -1
  1456. data/ext/ztgevc.c +32 -32
  1457. data/ext/ztgex2.c +14 -14
  1458. data/ext/ztgexc.c +25 -25
  1459. data/ext/ztgsen.c +37 -37
  1460. data/ext/ztgsja.c +26 -26
  1461. data/ext/ztgsna.c +24 -24
  1462. data/ext/ztgsy2.c +22 -22
  1463. data/ext/ztgsyl.c +42 -42
  1464. data/ext/ztpcon.c +2 -2
  1465. data/ext/ztprfs.c +13 -13
  1466. data/ext/ztptri.c +1 -1
  1467. data/ext/ztptrs.c +3 -3
  1468. data/ext/ztpttf.c +1 -1
  1469. data/ext/ztpttr.c +1 -1
  1470. data/ext/ztrcon.c +3 -3
  1471. data/ext/ztrevc.c +12 -12
  1472. data/ext/ztrexc.c +1 -1
  1473. data/ext/ztrrfs.c +11 -11
  1474. data/ext/ztrsen.c +13 -13
  1475. data/ext/ztrsna.c +20 -20
  1476. data/ext/ztrsyl.c +11 -11
  1477. data/ext/ztrti2.c +1 -1
  1478. data/ext/ztrtri.c +1 -1
  1479. data/ext/ztrtrs.c +10 -10
  1480. data/ext/ztrttf.c +1 -1
  1481. data/ext/ztrttp.c +1 -1
  1482. data/ext/zunbdb.c +15 -15
  1483. data/ext/zuncsd.c +27 -27
  1484. data/ext/zung2l.c +9 -9
  1485. data/ext/zung2r.c +9 -9
  1486. data/ext/zungbr.c +1 -1
  1487. data/ext/zunghr.c +7 -7
  1488. data/ext/zungl2.c +1 -1
  1489. data/ext/zunglq.c +9 -9
  1490. data/ext/zungql.c +9 -9
  1491. data/ext/zungqr.c +9 -9
  1492. data/ext/zungr2.c +1 -1
  1493. data/ext/zungrq.c +9 -9
  1494. data/ext/zungtr.c +6 -6
  1495. data/ext/zunm2l.c +12 -12
  1496. data/ext/zunm2r.c +12 -12
  1497. data/ext/zunmbr.c +3 -3
  1498. data/ext/zunmhr.c +12 -12
  1499. data/ext/zunml2.c +1 -1
  1500. data/ext/zunmlq.c +7 -7
  1501. data/ext/zunmql.c +12 -12
  1502. data/ext/zunmqr.c +12 -12
  1503. data/ext/zunmr2.c +1 -1
  1504. data/ext/zunmr3.c +10 -10
  1505. data/ext/zunmrq.c +7 -7
  1506. data/ext/zunmrz.c +10 -10
  1507. data/ext/zunmtr.c +17 -17
  1508. data/ext/zupgtr.c +8 -8
  1509. data/ext/zupmtr.c +2 -2
  1510. metadata +3183 -3329
  1511. data/doc/bd.html +0 -16
  1512. data/doc/c.html +0 -36
  1513. data/doc/cbd.html +0 -161
  1514. data/doc/cgb.html +0 -1865
  1515. data/doc/cge.html +0 -5261
  1516. data/doc/cgg.html +0 -2027
  1517. data/doc/cgt.html +0 -711
  1518. data/doc/chb.html +0 -1031
  1519. data/doc/che.html +0 -3165
  1520. data/doc/chg.html +0 -201
  1521. data/doc/chp.html +0 -1696
  1522. data/doc/chs.html +0 -386
  1523. data/doc/cpb.html +0 -994
  1524. data/doc/cpo.html +0 -1520
  1525. data/doc/cpp.html +0 -770
  1526. data/doc/cpt.html +0 -706
  1527. data/doc/csp.html +0 -905
  1528. data/doc/cst.html +0 -742
  1529. data/doc/csy.html +0 -2194
  1530. data/doc/ctb.html +0 -284
  1531. data/doc/ctg.html +0 -1544
  1532. data/doc/ctp.html +0 -553
  1533. data/doc/ctr.html +0 -1281
  1534. data/doc/ctz.html +0 -211
  1535. data/doc/cun.html +0 -2553
  1536. data/doc/cup.html +0 -166
  1537. data/doc/d.html +0 -35
  1538. data/doc/dbd.html +0 -304
  1539. data/doc/ddi.html +0 -87
  1540. data/doc/dgb.html +0 -1857
  1541. data/doc/dge.html +0 -7267
  1542. data/doc/dgg.html +0 -2102
  1543. data/doc/dgt.html +0 -713
  1544. data/doc/dhg.html +0 -225
  1545. data/doc/dhs.html +0 -414
  1546. data/doc/di.html +0 -14
  1547. data/doc/dop.html +0 -166
  1548. data/doc/dor.html +0 -2540
  1549. data/doc/dpb.html +0 -992
  1550. data/doc/dpo.html +0 -1517
  1551. data/doc/dpp.html +0 -770
  1552. data/doc/dpt.html +0 -675
  1553. data/doc/dsb.html +0 -995
  1554. data/doc/dsp.html +0 -1777
  1555. data/doc/dst.html +0 -1422
  1556. data/doc/dsy.html +0 -3433
  1557. data/doc/dtb.html +0 -284
  1558. data/doc/dtg.html +0 -1730
  1559. data/doc/dtp.html +0 -532
  1560. data/doc/dtr.html +0 -1346
  1561. data/doc/dtz.html +0 -211
  1562. data/doc/gb.html +0 -16
  1563. data/doc/ge.html +0 -16
  1564. data/doc/gg.html +0 -16
  1565. data/doc/gt.html +0 -16
  1566. data/doc/hb.html +0 -14
  1567. data/doc/he.html +0 -14
  1568. data/doc/hg.html +0 -16
  1569. data/doc/hp.html +0 -14
  1570. data/doc/hs.html +0 -16
  1571. data/doc/index.html +0 -53
  1572. data/doc/op.html +0 -14
  1573. data/doc/or.html +0 -14
  1574. data/doc/others.html +0 -1142
  1575. data/doc/pb.html +0 -16
  1576. data/doc/po.html +0 -16
  1577. data/doc/pp.html +0 -16
  1578. data/doc/pt.html +0 -16
  1579. data/doc/s.html +0 -35
  1580. data/doc/sb.html +0 -14
  1581. data/doc/sbd.html +0 -303
  1582. data/doc/sdi.html +0 -87
  1583. data/doc/sgb.html +0 -1863
  1584. data/doc/sge.html +0 -7263
  1585. data/doc/sgg.html +0 -2102
  1586. data/doc/sgt.html +0 -713
  1587. data/doc/shg.html +0 -225
  1588. data/doc/shs.html +0 -414
  1589. data/doc/sop.html +0 -166
  1590. data/doc/sor.html +0 -2540
  1591. data/doc/sp.html +0 -16
  1592. data/doc/spb.html +0 -992
  1593. data/doc/spo.html +0 -1520
  1594. data/doc/spp.html +0 -770
  1595. data/doc/spt.html +0 -675
  1596. data/doc/ssb.html +0 -995
  1597. data/doc/ssp.html +0 -1647
  1598. data/doc/sst.html +0 -1423
  1599. data/doc/ssy.html +0 -3438
  1600. data/doc/st.html +0 -16
  1601. data/doc/stb.html +0 -284
  1602. data/doc/stg.html +0 -1729
  1603. data/doc/stp.html +0 -532
  1604. data/doc/str.html +0 -1346
  1605. data/doc/stz.html +0 -211
  1606. data/doc/sy.html +0 -16
  1607. data/doc/tb.html +0 -16
  1608. data/doc/tg.html +0 -16
  1609. data/doc/tp.html +0 -16
  1610. data/doc/tr.html +0 -16
  1611. data/doc/tz.html +0 -16
  1612. data/doc/un.html +0 -14
  1613. data/doc/up.html +0 -14
  1614. data/doc/z.html +0 -36
  1615. data/doc/zbd.html +0 -161
  1616. data/doc/zgb.html +0 -1862
  1617. data/doc/zge.html +0 -5258
  1618. data/doc/zgg.html +0 -2027
  1619. data/doc/zgt.html +0 -711
  1620. data/doc/zhb.html +0 -1031
  1621. data/doc/zhe.html +0 -3162
  1622. data/doc/zhg.html +0 -201
  1623. data/doc/zhp.html +0 -1697
  1624. data/doc/zhs.html +0 -386
  1625. data/doc/zpb.html +0 -994
  1626. data/doc/zpo.html +0 -1517
  1627. data/doc/zpp.html +0 -770
  1628. data/doc/zpt.html +0 -706
  1629. data/doc/zsp.html +0 -905
  1630. data/doc/zst.html +0 -743
  1631. data/doc/zsy.html +0 -2191
  1632. data/doc/ztb.html +0 -284
  1633. data/doc/ztg.html +0 -1544
  1634. data/doc/ztp.html +0 -553
  1635. data/doc/ztr.html +0 -1281
  1636. data/doc/ztz.html +0 -211
  1637. data/doc/zun.html +0 -2553
  1638. data/doc/zup.html +0 -166
data/doc/dtr.html DELETED
@@ -1,1346 +0,0 @@
1
- <HTML>
2
- <HEAD>
3
- <TITLE>DOUBLE PRECISION routines for triangular (or in some cases quasi-triangular) matrix</TITLE>
4
- </HEAD>
5
- <BODY>
6
- <A NAME="top"></A>
7
- <H1>DOUBLE PRECISION routines for triangular (or in some cases quasi-triangular) matrix</H1>
8
- <UL>
9
- <LI><A HREF="#dtrcon">dtrcon</A></LI>
10
- <LI><A HREF="#dtrevc">dtrevc</A></LI>
11
- <LI><A HREF="#dtrexc">dtrexc</A></LI>
12
- <LI><A HREF="#dtrrfs">dtrrfs</A></LI>
13
- <LI><A HREF="#dtrsen">dtrsen</A></LI>
14
- <LI><A HREF="#dtrsna">dtrsna</A></LI>
15
- <LI><A HREF="#dtrsyl">dtrsyl</A></LI>
16
- <LI><A HREF="#dtrti2">dtrti2</A></LI>
17
- <LI><A HREF="#dtrtri">dtrtri</A></LI>
18
- <LI><A HREF="#dtrtrs">dtrtrs</A></LI>
19
- <LI><A HREF="#dtrttf">dtrttf</A></LI>
20
- <LI><A HREF="#dtrttp">dtrttp</A></LI>
21
- </UL>
22
-
23
- <A NAME="dtrcon"></A>
24
- <H2>dtrcon</H2>
25
- <PRE>
26
- USAGE:
27
- rcond, info = NumRu::Lapack.dtrcon( norm, uplo, diag, a, [:usage => usage, :help => help])
28
-
29
-
30
- FORTRAN MANUAL
31
- SUBROUTINE DTRCON( NORM, UPLO, DIAG, N, A, LDA, RCOND, WORK, IWORK, INFO )
32
-
33
- * Purpose
34
- * =======
35
- *
36
- * DTRCON estimates the reciprocal of the condition number of a
37
- * triangular matrix A, in either the 1-norm or the infinity-norm.
38
- *
39
- * The norm of A is computed and an estimate is obtained for
40
- * norm(inv(A)), then the reciprocal of the condition number is
41
- * computed as
42
- * RCOND = 1 / ( norm(A) * norm(inv(A)) ).
43
- *
44
-
45
- * Arguments
46
- * =========
47
- *
48
- * NORM (input) CHARACTER*1
49
- * Specifies whether the 1-norm condition number or the
50
- * infinity-norm condition number is required:
51
- * = '1' or 'O': 1-norm;
52
- * = 'I': Infinity-norm.
53
- *
54
- * UPLO (input) CHARACTER*1
55
- * = 'U': A is upper triangular;
56
- * = 'L': A is lower triangular.
57
- *
58
- * DIAG (input) CHARACTER*1
59
- * = 'N': A is non-unit triangular;
60
- * = 'U': A is unit triangular.
61
- *
62
- * N (input) INTEGER
63
- * The order of the matrix A. N >= 0.
64
- *
65
- * A (input) DOUBLE PRECISION array, dimension (LDA,N)
66
- * The triangular matrix A. If UPLO = 'U', the leading N-by-N
67
- * upper triangular part of the array A contains the upper
68
- * triangular matrix, and the strictly lower triangular part of
69
- * A is not referenced. If UPLO = 'L', the leading N-by-N lower
70
- * triangular part of the array A contains the lower triangular
71
- * matrix, and the strictly upper triangular part of A is not
72
- * referenced. If DIAG = 'U', the diagonal elements of A are
73
- * also not referenced and are assumed to be 1.
74
- *
75
- * LDA (input) INTEGER
76
- * The leading dimension of the array A. LDA >= max(1,N).
77
- *
78
- * RCOND (output) DOUBLE PRECISION
79
- * The reciprocal of the condition number of the matrix A,
80
- * computed as RCOND = 1/(norm(A) * norm(inv(A))).
81
- *
82
- * WORK (workspace) DOUBLE PRECISION array, dimension (3*N)
83
- *
84
- * IWORK (workspace) INTEGER array, dimension (N)
85
- *
86
- * INFO (output) INTEGER
87
- * = 0: successful exit
88
- * < 0: if INFO = -i, the i-th argument had an illegal value
89
- *
90
-
91
- * =====================================================================
92
- *
93
-
94
-
95
- </PRE>
96
- <A HREF="#top">go to the page top</A>
97
-
98
- <A NAME="dtrevc"></A>
99
- <H2>dtrevc</H2>
100
- <PRE>
101
- USAGE:
102
- m, info, select, vl, vr = NumRu::Lapack.dtrevc( side, howmny, select, t, vl, vr, [:usage => usage, :help => help])
103
-
104
-
105
- FORTRAN MANUAL
106
- SUBROUTINE DTREVC( SIDE, HOWMNY, SELECT, N, T, LDT, VL, LDVL, VR, LDVR, MM, M, WORK, INFO )
107
-
108
- * Purpose
109
- * =======
110
- *
111
- * DTREVC computes some or all of the right and/or left eigenvectors of
112
- * a real upper quasi-triangular matrix T.
113
- * Matrices of this type are produced by the Schur factorization of
114
- * a real general matrix: A = Q*T*Q**T, as computed by DHSEQR.
115
- *
116
- * The right eigenvector x and the left eigenvector y of T corresponding
117
- * to an eigenvalue w are defined by:
118
- *
119
- * T*x = w*x, (y**H)*T = w*(y**H)
120
- *
121
- * where y**H denotes the conjugate transpose of y.
122
- * The eigenvalues are not input to this routine, but are read directly
123
- * from the diagonal blocks of T.
124
- *
125
- * This routine returns the matrices X and/or Y of right and left
126
- * eigenvectors of T, or the products Q*X and/or Q*Y, where Q is an
127
- * input matrix. If Q is the orthogonal factor that reduces a matrix
128
- * A to Schur form T, then Q*X and Q*Y are the matrices of right and
129
- * left eigenvectors of A.
130
- *
131
-
132
- * Arguments
133
- * =========
134
- *
135
- * SIDE (input) CHARACTER*1
136
- * = 'R': compute right eigenvectors only;
137
- * = 'L': compute left eigenvectors only;
138
- * = 'B': compute both right and left eigenvectors.
139
- *
140
- * HOWMNY (input) CHARACTER*1
141
- * = 'A': compute all right and/or left eigenvectors;
142
- * = 'B': compute all right and/or left eigenvectors,
143
- * backtransformed by the matrices in VR and/or VL;
144
- * = 'S': compute selected right and/or left eigenvectors,
145
- * as indicated by the logical array SELECT.
146
- *
147
- * SELECT (input/output) LOGICAL array, dimension (N)
148
- * If HOWMNY = 'S', SELECT specifies the eigenvectors to be
149
- * computed.
150
- * If w(j) is a real eigenvalue, the corresponding real
151
- * eigenvector is computed if SELECT(j) is .TRUE..
152
- * If w(j) and w(j+1) are the real and imaginary parts of a
153
- * complex eigenvalue, the corresponding complex eigenvector is
154
- * computed if either SELECT(j) or SELECT(j+1) is .TRUE., and
155
- * on exit SELECT(j) is set to .TRUE. and SELECT(j+1) is set to
156
- * .FALSE..
157
- * Not referenced if HOWMNY = 'A' or 'B'.
158
- *
159
- * N (input) INTEGER
160
- * The order of the matrix T. N >= 0.
161
- *
162
- * T (input) DOUBLE PRECISION array, dimension (LDT,N)
163
- * The upper quasi-triangular matrix T in Schur canonical form.
164
- *
165
- * LDT (input) INTEGER
166
- * The leading dimension of the array T. LDT >= max(1,N).
167
- *
168
- * VL (input/output) DOUBLE PRECISION array, dimension (LDVL,MM)
169
- * On entry, if SIDE = 'L' or 'B' and HOWMNY = 'B', VL must
170
- * contain an N-by-N matrix Q (usually the orthogonal matrix Q
171
- * of Schur vectors returned by DHSEQR).
172
- * On exit, if SIDE = 'L' or 'B', VL contains:
173
- * if HOWMNY = 'A', the matrix Y of left eigenvectors of T;
174
- * if HOWMNY = 'B', the matrix Q*Y;
175
- * if HOWMNY = 'S', the left eigenvectors of T specified by
176
- * SELECT, stored consecutively in the columns
177
- * of VL, in the same order as their
178
- * eigenvalues.
179
- * A complex eigenvector corresponding to a complex eigenvalue
180
- * is stored in two consecutive columns, the first holding the
181
- * real part, and the second the imaginary part.
182
- * Not referenced if SIDE = 'R'.
183
- *
184
- * LDVL (input) INTEGER
185
- * The leading dimension of the array VL. LDVL >= 1, and if
186
- * SIDE = 'L' or 'B', LDVL >= N.
187
- *
188
- * VR (input/output) DOUBLE PRECISION array, dimension (LDVR,MM)
189
- * On entry, if SIDE = 'R' or 'B' and HOWMNY = 'B', VR must
190
- * contain an N-by-N matrix Q (usually the orthogonal matrix Q
191
- * of Schur vectors returned by DHSEQR).
192
- * On exit, if SIDE = 'R' or 'B', VR contains:
193
- * if HOWMNY = 'A', the matrix X of right eigenvectors of T;
194
- * if HOWMNY = 'B', the matrix Q*X;
195
- * if HOWMNY = 'S', the right eigenvectors of T specified by
196
- * SELECT, stored consecutively in the columns
197
- * of VR, in the same order as their
198
- * eigenvalues.
199
- * A complex eigenvector corresponding to a complex eigenvalue
200
- * is stored in two consecutive columns, the first holding the
201
- * real part and the second the imaginary part.
202
- * Not referenced if SIDE = 'L'.
203
- *
204
- * LDVR (input) INTEGER
205
- * The leading dimension of the array VR. LDVR >= 1, and if
206
- * SIDE = 'R' or 'B', LDVR >= N.
207
- *
208
- * MM (input) INTEGER
209
- * The number of columns in the arrays VL and/or VR. MM >= M.
210
- *
211
- * M (output) INTEGER
212
- * The number of columns in the arrays VL and/or VR actually
213
- * used to store the eigenvectors.
214
- * If HOWMNY = 'A' or 'B', M is set to N.
215
- * Each selected real eigenvector occupies one column and each
216
- * selected complex eigenvector occupies two columns.
217
- *
218
- * WORK (workspace) DOUBLE PRECISION array, dimension (3*N)
219
- *
220
- * INFO (output) INTEGER
221
- * = 0: successful exit
222
- * < 0: if INFO = -i, the i-th argument had an illegal value
223
- *
224
-
225
- * Further Details
226
- * ===============
227
- *
228
- * The algorithm used in this program is basically backward (forward)
229
- * substitution, with scaling to make the the code robust against
230
- * possible overflow.
231
- *
232
- * Each eigenvector is normalized so that the element of largest
233
- * magnitude has magnitude 1; here the magnitude of a complex number
234
- * (x,y) is taken to be |x| + |y|.
235
- *
236
- * =====================================================================
237
- *
238
-
239
-
240
- </PRE>
241
- <A HREF="#top">go to the page top</A>
242
-
243
- <A NAME="dtrexc"></A>
244
- <H2>dtrexc</H2>
245
- <PRE>
246
- USAGE:
247
- info, t, q, ifst, ilst = NumRu::Lapack.dtrexc( compq, t, q, ifst, ilst, [:usage => usage, :help => help])
248
-
249
-
250
- FORTRAN MANUAL
251
- SUBROUTINE DTREXC( COMPQ, N, T, LDT, Q, LDQ, IFST, ILST, WORK, INFO )
252
-
253
- * Purpose
254
- * =======
255
- *
256
- * DTREXC reorders the real Schur factorization of a real matrix
257
- * A = Q*T*Q**T, so that the diagonal block of T with row index IFST is
258
- * moved to row ILST.
259
- *
260
- * The real Schur form T is reordered by an orthogonal similarity
261
- * transformation Z**T*T*Z, and optionally the matrix Q of Schur vectors
262
- * is updated by postmultiplying it with Z.
263
- *
264
- * T must be in Schur canonical form (as returned by DHSEQR), that is,
265
- * block upper triangular with 1-by-1 and 2-by-2 diagonal blocks; each
266
- * 2-by-2 diagonal block has its diagonal elements equal and its
267
- * off-diagonal elements of opposite sign.
268
- *
269
-
270
- * Arguments
271
- * =========
272
- *
273
- * COMPQ (input) CHARACTER*1
274
- * = 'V': update the matrix Q of Schur vectors;
275
- * = 'N': do not update Q.
276
- *
277
- * N (input) INTEGER
278
- * The order of the matrix T. N >= 0.
279
- *
280
- * T (input/output) DOUBLE PRECISION array, dimension (LDT,N)
281
- * On entry, the upper quasi-triangular matrix T, in Schur
282
- * Schur canonical form.
283
- * On exit, the reordered upper quasi-triangular matrix, again
284
- * in Schur canonical form.
285
- *
286
- * LDT (input) INTEGER
287
- * The leading dimension of the array T. LDT >= max(1,N).
288
- *
289
- * Q (input/output) DOUBLE PRECISION array, dimension (LDQ,N)
290
- * On entry, if COMPQ = 'V', the matrix Q of Schur vectors.
291
- * On exit, if COMPQ = 'V', Q has been postmultiplied by the
292
- * orthogonal transformation matrix Z which reorders T.
293
- * If COMPQ = 'N', Q is not referenced.
294
- *
295
- * LDQ (input) INTEGER
296
- * The leading dimension of the array Q. LDQ >= max(1,N).
297
- *
298
- * IFST (input/output) INTEGER
299
- * ILST (input/output) INTEGER
300
- * Specify the reordering of the diagonal blocks of T.
301
- * The block with row index IFST is moved to row ILST, by a
302
- * sequence of transpositions between adjacent blocks.
303
- * On exit, if IFST pointed on entry to the second row of a
304
- * 2-by-2 block, it is changed to point to the first row; ILST
305
- * always points to the first row of the block in its final
306
- * position (which may differ from its input value by +1 or -1).
307
- * 1 <= IFST <= N; 1 <= ILST <= N.
308
- *
309
- * WORK (workspace) DOUBLE PRECISION array, dimension (N)
310
- *
311
- * INFO (output) INTEGER
312
- * = 0: successful exit
313
- * < 0: if INFO = -i, the i-th argument had an illegal value
314
- * = 1: two adjacent blocks were too close to swap (the problem
315
- * is very ill-conditioned); T may have been partially
316
- * reordered, and ILST points to the first row of the
317
- * current position of the block being moved.
318
- *
319
-
320
- * =====================================================================
321
- *
322
-
323
-
324
- </PRE>
325
- <A HREF="#top">go to the page top</A>
326
-
327
- <A NAME="dtrrfs"></A>
328
- <H2>dtrrfs</H2>
329
- <PRE>
330
- USAGE:
331
- ferr, berr, info = NumRu::Lapack.dtrrfs( uplo, trans, diag, a, b, x, [:usage => usage, :help => help])
332
-
333
-
334
- FORTRAN MANUAL
335
- SUBROUTINE DTRRFS( UPLO, TRANS, DIAG, N, NRHS, A, LDA, B, LDB, X, LDX, FERR, BERR, WORK, IWORK, INFO )
336
-
337
- * Purpose
338
- * =======
339
- *
340
- * DTRRFS provides error bounds and backward error estimates for the
341
- * solution to a system of linear equations with a triangular
342
- * coefficient matrix.
343
- *
344
- * The solution matrix X must be computed by DTRTRS or some other
345
- * means before entering this routine. DTRRFS does not do iterative
346
- * refinement because doing so cannot improve the backward error.
347
- *
348
-
349
- * Arguments
350
- * =========
351
- *
352
- * UPLO (input) CHARACTER*1
353
- * = 'U': A is upper triangular;
354
- * = 'L': A is lower triangular.
355
- *
356
- * TRANS (input) CHARACTER*1
357
- * Specifies the form of the system of equations:
358
- * = 'N': A * X = B (No transpose)
359
- * = 'T': A**T * X = B (Transpose)
360
- * = 'C': A**H * X = B (Conjugate transpose = Transpose)
361
- *
362
- * DIAG (input) CHARACTER*1
363
- * = 'N': A is non-unit triangular;
364
- * = 'U': A is unit triangular.
365
- *
366
- * N (input) INTEGER
367
- * The order of the matrix A. N >= 0.
368
- *
369
- * NRHS (input) INTEGER
370
- * The number of right hand sides, i.e., the number of columns
371
- * of the matrices B and X. NRHS >= 0.
372
- *
373
- * A (input) DOUBLE PRECISION array, dimension (LDA,N)
374
- * The triangular matrix A. If UPLO = 'U', the leading N-by-N
375
- * upper triangular part of the array A contains the upper
376
- * triangular matrix, and the strictly lower triangular part of
377
- * A is not referenced. If UPLO = 'L', the leading N-by-N lower
378
- * triangular part of the array A contains the lower triangular
379
- * matrix, and the strictly upper triangular part of A is not
380
- * referenced. If DIAG = 'U', the diagonal elements of A are
381
- * also not referenced and are assumed to be 1.
382
- *
383
- * LDA (input) INTEGER
384
- * The leading dimension of the array A. LDA >= max(1,N).
385
- *
386
- * B (input) DOUBLE PRECISION array, dimension (LDB,NRHS)
387
- * The right hand side matrix B.
388
- *
389
- * LDB (input) INTEGER
390
- * The leading dimension of the array B. LDB >= max(1,N).
391
- *
392
- * X (input) DOUBLE PRECISION array, dimension (LDX,NRHS)
393
- * The solution matrix X.
394
- *
395
- * LDX (input) INTEGER
396
- * The leading dimension of the array X. LDX >= max(1,N).
397
- *
398
- * FERR (output) DOUBLE PRECISION array, dimension (NRHS)
399
- * The estimated forward error bound for each solution vector
400
- * X(j) (the j-th column of the solution matrix X).
401
- * If XTRUE is the true solution corresponding to X(j), FERR(j)
402
- * is an estimated upper bound for the magnitude of the largest
403
- * element in (X(j) - XTRUE) divided by the magnitude of the
404
- * largest element in X(j). The estimate is as reliable as
405
- * the estimate for RCOND, and is almost always a slight
406
- * overestimate of the true error.
407
- *
408
- * BERR (output) DOUBLE PRECISION array, dimension (NRHS)
409
- * The componentwise relative backward error of each solution
410
- * vector X(j) (i.e., the smallest relative change in
411
- * any element of A or B that makes X(j) an exact solution).
412
- *
413
- * WORK (workspace) DOUBLE PRECISION array, dimension (3*N)
414
- *
415
- * IWORK (workspace) INTEGER array, dimension (N)
416
- *
417
- * INFO (output) INTEGER
418
- * = 0: successful exit
419
- * < 0: if INFO = -i, the i-th argument had an illegal value
420
- *
421
-
422
- * =====================================================================
423
- *
424
-
425
-
426
- </PRE>
427
- <A HREF="#top">go to the page top</A>
428
-
429
- <A NAME="dtrsen"></A>
430
- <H2>dtrsen</H2>
431
- <PRE>
432
- USAGE:
433
- wr, wi, m, s, sep, work, info, t, q = NumRu::Lapack.dtrsen( job, compq, select, t, q, liwork, [:lwork => lwork, :usage => usage, :help => help])
434
-
435
-
436
- FORTRAN MANUAL
437
- SUBROUTINE DTRSEN( JOB, COMPQ, SELECT, N, T, LDT, Q, LDQ, WR, WI, M, S, SEP, WORK, LWORK, IWORK, LIWORK, INFO )
438
-
439
- * Purpose
440
- * =======
441
- *
442
- * DTRSEN reorders the real Schur factorization of a real matrix
443
- * A = Q*T*Q**T, so that a selected cluster of eigenvalues appears in
444
- * the leading diagonal blocks of the upper quasi-triangular matrix T,
445
- * and the leading columns of Q form an orthonormal basis of the
446
- * corresponding right invariant subspace.
447
- *
448
- * Optionally the routine computes the reciprocal condition numbers of
449
- * the cluster of eigenvalues and/or the invariant subspace.
450
- *
451
- * T must be in Schur canonical form (as returned by DHSEQR), that is,
452
- * block upper triangular with 1-by-1 and 2-by-2 diagonal blocks; each
453
- * 2-by-2 diagonal block has its diagonal elemnts equal and its
454
- * off-diagonal elements of opposite sign.
455
- *
456
-
457
- * Arguments
458
- * =========
459
- *
460
- * JOB (input) CHARACTER*1
461
- * Specifies whether condition numbers are required for the
462
- * cluster of eigenvalues (S) or the invariant subspace (SEP):
463
- * = 'N': none;
464
- * = 'E': for eigenvalues only (S);
465
- * = 'V': for invariant subspace only (SEP);
466
- * = 'B': for both eigenvalues and invariant subspace (S and
467
- * SEP).
468
- *
469
- * COMPQ (input) CHARACTER*1
470
- * = 'V': update the matrix Q of Schur vectors;
471
- * = 'N': do not update Q.
472
- *
473
- * SELECT (input) LOGICAL array, dimension (N)
474
- * SELECT specifies the eigenvalues in the selected cluster. To
475
- * select a real eigenvalue w(j), SELECT(j) must be set to
476
- * .TRUE.. To select a complex conjugate pair of eigenvalues
477
- * w(j) and w(j+1), corresponding to a 2-by-2 diagonal block,
478
- * either SELECT(j) or SELECT(j+1) or both must be set to
479
- * .TRUE.; a complex conjugate pair of eigenvalues must be
480
- * either both included in the cluster or both excluded.
481
- *
482
- * N (input) INTEGER
483
- * The order of the matrix T. N >= 0.
484
- *
485
- * T (input/output) DOUBLE PRECISION array, dimension (LDT,N)
486
- * On entry, the upper quasi-triangular matrix T, in Schur
487
- * canonical form.
488
- * On exit, T is overwritten by the reordered matrix T, again in
489
- * Schur canonical form, with the selected eigenvalues in the
490
- * leading diagonal blocks.
491
- *
492
- * LDT (input) INTEGER
493
- * The leading dimension of the array T. LDT >= max(1,N).
494
- *
495
- * Q (input/output) DOUBLE PRECISION array, dimension (LDQ,N)
496
- * On entry, if COMPQ = 'V', the matrix Q of Schur vectors.
497
- * On exit, if COMPQ = 'V', Q has been postmultiplied by the
498
- * orthogonal transformation matrix which reorders T; the
499
- * leading M columns of Q form an orthonormal basis for the
500
- * specified invariant subspace.
501
- * If COMPQ = 'N', Q is not referenced.
502
- *
503
- * LDQ (input) INTEGER
504
- * The leading dimension of the array Q.
505
- * LDQ >= 1; and if COMPQ = 'V', LDQ >= N.
506
- *
507
- * WR (output) DOUBLE PRECISION array, dimension (N)
508
- * WI (output) DOUBLE PRECISION array, dimension (N)
509
- * The real and imaginary parts, respectively, of the reordered
510
- * eigenvalues of T. The eigenvalues are stored in the same
511
- * order as on the diagonal of T, with WR(i) = T(i,i) and, if
512
- * T(i:i+1,i:i+1) is a 2-by-2 diagonal block, WI(i) > 0 and
513
- * WI(i+1) = -WI(i). Note that if a complex eigenvalue is
514
- * sufficiently ill-conditioned, then its value may differ
515
- * significantly from its value before reordering.
516
- *
517
- * M (output) INTEGER
518
- * The dimension of the specified invariant subspace.
519
- * 0 < = M <= N.
520
- *
521
- * S (output) DOUBLE PRECISION
522
- * If JOB = 'E' or 'B', S is a lower bound on the reciprocal
523
- * condition number for the selected cluster of eigenvalues.
524
- * S cannot underestimate the true reciprocal condition number
525
- * by more than a factor of sqrt(N). If M = 0 or N, S = 1.
526
- * If JOB = 'N' or 'V', S is not referenced.
527
- *
528
- * SEP (output) DOUBLE PRECISION
529
- * If JOB = 'V' or 'B', SEP is the estimated reciprocal
530
- * condition number of the specified invariant subspace. If
531
- * M = 0 or N, SEP = norm(T).
532
- * If JOB = 'N' or 'E', SEP is not referenced.
533
- *
534
- * WORK (workspace/output) DOUBLE PRECISION array, dimension (MAX(1,LWORK))
535
- * On exit, if INFO = 0, WORK(1) returns the optimal LWORK.
536
- *
537
- * LWORK (input) INTEGER
538
- * The dimension of the array WORK.
539
- * If JOB = 'N', LWORK >= max(1,N);
540
- * if JOB = 'E', LWORK >= max(1,M*(N-M));
541
- * if JOB = 'V' or 'B', LWORK >= max(1,2*M*(N-M)).
542
- *
543
- * If LWORK = -1, then a workspace query is assumed; the routine
544
- * only calculates the optimal size of the WORK array, returns
545
- * this value as the first entry of the WORK array, and no error
546
- * message related to LWORK is issued by XERBLA.
547
- *
548
- * IWORK (workspace) INTEGER array, dimension (MAX(1,LIWORK))
549
- * On exit, if INFO = 0, IWORK(1) returns the optimal LIWORK.
550
- *
551
- * LIWORK (input) INTEGER
552
- * The dimension of the array IWORK.
553
- * If JOB = 'N' or 'E', LIWORK >= 1;
554
- * if JOB = 'V' or 'B', LIWORK >= max(1,M*(N-M)).
555
- *
556
- * If LIWORK = -1, then a workspace query is assumed; the
557
- * routine only calculates the optimal size of the IWORK array,
558
- * returns this value as the first entry of the IWORK array, and
559
- * no error message related to LIWORK is issued by XERBLA.
560
- *
561
- * INFO (output) INTEGER
562
- * = 0: successful exit
563
- * < 0: if INFO = -i, the i-th argument had an illegal value
564
- * = 1: reordering of T failed because some eigenvalues are too
565
- * close to separate (the problem is very ill-conditioned);
566
- * T may have been partially reordered, and WR and WI
567
- * contain the eigenvalues in the same order as in T; S and
568
- * SEP (if requested) are set to zero.
569
- *
570
-
571
- * Further Details
572
- * ===============
573
- *
574
- * DTRSEN first collects the selected eigenvalues by computing an
575
- * orthogonal transformation Z to move them to the top left corner of T.
576
- * In other words, the selected eigenvalues are the eigenvalues of T11
577
- * in:
578
- *
579
- * Z'*T*Z = ( T11 T12 ) n1
580
- * ( 0 T22 ) n2
581
- * n1 n2
582
- *
583
- * where N = n1+n2 and Z' means the transpose of Z. The first n1 columns
584
- * of Z span the specified invariant subspace of T.
585
- *
586
- * If T has been obtained from the real Schur factorization of a matrix
587
- * A = Q*T*Q', then the reordered real Schur factorization of A is given
588
- * by A = (Q*Z)*(Z'*T*Z)*(Q*Z)', and the first n1 columns of Q*Z span
589
- * the corresponding invariant subspace of A.
590
- *
591
- * The reciprocal condition number of the average of the eigenvalues of
592
- * T11 may be returned in S. S lies between 0 (very badly conditioned)
593
- * and 1 (very well conditioned). It is computed as follows. First we
594
- * compute R so that
595
- *
596
- * P = ( I R ) n1
597
- * ( 0 0 ) n2
598
- * n1 n2
599
- *
600
- * is the projector on the invariant subspace associated with T11.
601
- * R is the solution of the Sylvester equation:
602
- *
603
- * T11*R - R*T22 = T12.
604
- *
605
- * Let F-norm(M) denote the Frobenius-norm of M and 2-norm(M) denote
606
- * the two-norm of M. Then S is computed as the lower bound
607
- *
608
- * (1 + F-norm(R)**2)**(-1/2)
609
- *
610
- * on the reciprocal of 2-norm(P), the true reciprocal condition number.
611
- * S cannot underestimate 1 / 2-norm(P) by more than a factor of
612
- * sqrt(N).
613
- *
614
- * An approximate error bound for the computed average of the
615
- * eigenvalues of T11 is
616
- *
617
- * EPS * norm(T) / S
618
- *
619
- * where EPS is the machine precision.
620
- *
621
- * The reciprocal condition number of the right invariant subspace
622
- * spanned by the first n1 columns of Z (or of Q*Z) is returned in SEP.
623
- * SEP is defined as the separation of T11 and T22:
624
- *
625
- * sep( T11, T22 ) = sigma-min( C )
626
- *
627
- * where sigma-min(C) is the smallest singular value of the
628
- * n1*n2-by-n1*n2 matrix
629
- *
630
- * C = kprod( I(n2), T11 ) - kprod( transpose(T22), I(n1) )
631
- *
632
- * I(m) is an m by m identity matrix, and kprod denotes the Kronecker
633
- * product. We estimate sigma-min(C) by the reciprocal of an estimate of
634
- * the 1-norm of inverse(C). The true reciprocal 1-norm of inverse(C)
635
- * cannot differ from sigma-min(C) by more than a factor of sqrt(n1*n2).
636
- *
637
- * When SEP is small, small changes in T can cause large changes in
638
- * the invariant subspace. An approximate bound on the maximum angular
639
- * error in the computed right invariant subspace is
640
- *
641
- * EPS * norm(T) / SEP
642
- *
643
- * =====================================================================
644
- *
645
-
646
-
647
- </PRE>
648
- <A HREF="#top">go to the page top</A>
649
-
650
- <A NAME="dtrsna"></A>
651
- <H2>dtrsna</H2>
652
- <PRE>
653
- USAGE:
654
- s, sep, m, info = NumRu::Lapack.dtrsna( job, howmny, select, t, vl, vr, [:usage => usage, :help => help])
655
-
656
-
657
- FORTRAN MANUAL
658
- SUBROUTINE DTRSNA( JOB, HOWMNY, SELECT, N, T, LDT, VL, LDVL, VR, LDVR, S, SEP, MM, M, WORK, LDWORK, IWORK, INFO )
659
-
660
- * Purpose
661
- * =======
662
- *
663
- * DTRSNA estimates reciprocal condition numbers for specified
664
- * eigenvalues and/or right eigenvectors of a real upper
665
- * quasi-triangular matrix T (or of any matrix Q*T*Q**T with Q
666
- * orthogonal).
667
- *
668
- * T must be in Schur canonical form (as returned by DHSEQR), that is,
669
- * block upper triangular with 1-by-1 and 2-by-2 diagonal blocks; each
670
- * 2-by-2 diagonal block has its diagonal elements equal and its
671
- * off-diagonal elements of opposite sign.
672
- *
673
-
674
- * Arguments
675
- * =========
676
- *
677
- * JOB (input) CHARACTER*1
678
- * Specifies whether condition numbers are required for
679
- * eigenvalues (S) or eigenvectors (SEP):
680
- * = 'E': for eigenvalues only (S);
681
- * = 'V': for eigenvectors only (SEP);
682
- * = 'B': for both eigenvalues and eigenvectors (S and SEP).
683
- *
684
- * HOWMNY (input) CHARACTER*1
685
- * = 'A': compute condition numbers for all eigenpairs;
686
- * = 'S': compute condition numbers for selected eigenpairs
687
- * specified by the array SELECT.
688
- *
689
- * SELECT (input) LOGICAL array, dimension (N)
690
- * If HOWMNY = 'S', SELECT specifies the eigenpairs for which
691
- * condition numbers are required. To select condition numbers
692
- * for the eigenpair corresponding to a real eigenvalue w(j),
693
- * SELECT(j) must be set to .TRUE.. To select condition numbers
694
- * corresponding to a complex conjugate pair of eigenvalues w(j)
695
- * and w(j+1), either SELECT(j) or SELECT(j+1) or both, must be
696
- * set to .TRUE..
697
- * If HOWMNY = 'A', SELECT is not referenced.
698
- *
699
- * N (input) INTEGER
700
- * The order of the matrix T. N >= 0.
701
- *
702
- * T (input) DOUBLE PRECISION array, dimension (LDT,N)
703
- * The upper quasi-triangular matrix T, in Schur canonical form.
704
- *
705
- * LDT (input) INTEGER
706
- * The leading dimension of the array T. LDT >= max(1,N).
707
- *
708
- * VL (input) DOUBLE PRECISION array, dimension (LDVL,M)
709
- * If JOB = 'E' or 'B', VL must contain left eigenvectors of T
710
- * (or of any Q*T*Q**T with Q orthogonal), corresponding to the
711
- * eigenpairs specified by HOWMNY and SELECT. The eigenvectors
712
- * must be stored in consecutive columns of VL, as returned by
713
- * DHSEIN or DTREVC.
714
- * If JOB = 'V', VL is not referenced.
715
- *
716
- * LDVL (input) INTEGER
717
- * The leading dimension of the array VL.
718
- * LDVL >= 1; and if JOB = 'E' or 'B', LDVL >= N.
719
- *
720
- * VR (input) DOUBLE PRECISION array, dimension (LDVR,M)
721
- * If JOB = 'E' or 'B', VR must contain right eigenvectors of T
722
- * (or of any Q*T*Q**T with Q orthogonal), corresponding to the
723
- * eigenpairs specified by HOWMNY and SELECT. The eigenvectors
724
- * must be stored in consecutive columns of VR, as returned by
725
- * DHSEIN or DTREVC.
726
- * If JOB = 'V', VR is not referenced.
727
- *
728
- * LDVR (input) INTEGER
729
- * The leading dimension of the array VR.
730
- * LDVR >= 1; and if JOB = 'E' or 'B', LDVR >= N.
731
- *
732
- * S (output) DOUBLE PRECISION array, dimension (MM)
733
- * If JOB = 'E' or 'B', the reciprocal condition numbers of the
734
- * selected eigenvalues, stored in consecutive elements of the
735
- * array. For a complex conjugate pair of eigenvalues two
736
- * consecutive elements of S are set to the same value. Thus
737
- * S(j), SEP(j), and the j-th columns of VL and VR all
738
- * correspond to the same eigenpair (but not in general the
739
- * j-th eigenpair, unless all eigenpairs are selected).
740
- * If JOB = 'V', S is not referenced.
741
- *
742
- * SEP (output) DOUBLE PRECISION array, dimension (MM)
743
- * If JOB = 'V' or 'B', the estimated reciprocal condition
744
- * numbers of the selected eigenvectors, stored in consecutive
745
- * elements of the array. For a complex eigenvector two
746
- * consecutive elements of SEP are set to the same value. If
747
- * the eigenvalues cannot be reordered to compute SEP(j), SEP(j)
748
- * is set to 0; this can only occur when the true value would be
749
- * very small anyway.
750
- * If JOB = 'E', SEP is not referenced.
751
- *
752
- * MM (input) INTEGER
753
- * The number of elements in the arrays S (if JOB = 'E' or 'B')
754
- * and/or SEP (if JOB = 'V' or 'B'). MM >= M.
755
- *
756
- * M (output) INTEGER
757
- * The number of elements of the arrays S and/or SEP actually
758
- * used to store the estimated condition numbers.
759
- * If HOWMNY = 'A', M is set to N.
760
- *
761
- * WORK (workspace) DOUBLE PRECISION array, dimension (LDWORK,N+6)
762
- * If JOB = 'E', WORK is not referenced.
763
- *
764
- * LDWORK (input) INTEGER
765
- * The leading dimension of the array WORK.
766
- * LDWORK >= 1; and if JOB = 'V' or 'B', LDWORK >= N.
767
- *
768
- * IWORK (workspace) INTEGER array, dimension (2*(N-1))
769
- * If JOB = 'E', IWORK is not referenced.
770
- *
771
- * INFO (output) INTEGER
772
- * = 0: successful exit
773
- * < 0: if INFO = -i, the i-th argument had an illegal value
774
- *
775
-
776
- * Further Details
777
- * ===============
778
- *
779
- * The reciprocal of the condition number of an eigenvalue lambda is
780
- * defined as
781
- *
782
- * S(lambda) = |v'*u| / (norm(u)*norm(v))
783
- *
784
- * where u and v are the right and left eigenvectors of T corresponding
785
- * to lambda; v' denotes the conjugate-transpose of v, and norm(u)
786
- * denotes the Euclidean norm. These reciprocal condition numbers always
787
- * lie between zero (very badly conditioned) and one (very well
788
- * conditioned). If n = 1, S(lambda) is defined to be 1.
789
- *
790
- * An approximate error bound for a computed eigenvalue W(i) is given by
791
- *
792
- * EPS * norm(T) / S(i)
793
- *
794
- * where EPS is the machine precision.
795
- *
796
- * The reciprocal of the condition number of the right eigenvector u
797
- * corresponding to lambda is defined as follows. Suppose
798
- *
799
- * T = ( lambda c )
800
- * ( 0 T22 )
801
- *
802
- * Then the reciprocal condition number is
803
- *
804
- * SEP( lambda, T22 ) = sigma-min( T22 - lambda*I )
805
- *
806
- * where sigma-min denotes the smallest singular value. We approximate
807
- * the smallest singular value by the reciprocal of an estimate of the
808
- * one-norm of the inverse of T22 - lambda*I. If n = 1, SEP(1) is
809
- * defined to be abs(T(1,1)).
810
- *
811
- * An approximate error bound for a computed right eigenvector VR(i)
812
- * is given by
813
- *
814
- * EPS * norm(T) / SEP(i)
815
- *
816
- * =====================================================================
817
- *
818
-
819
-
820
- </PRE>
821
- <A HREF="#top">go to the page top</A>
822
-
823
- <A NAME="dtrsyl"></A>
824
- <H2>dtrsyl</H2>
825
- <PRE>
826
- USAGE:
827
- scale, info, c = NumRu::Lapack.dtrsyl( trana, tranb, isgn, a, b, c, [:usage => usage, :help => help])
828
-
829
-
830
- FORTRAN MANUAL
831
- SUBROUTINE DTRSYL( TRANA, TRANB, ISGN, M, N, A, LDA, B, LDB, C, LDC, SCALE, INFO )
832
-
833
- * Purpose
834
- * =======
835
- *
836
- * DTRSYL solves the real Sylvester matrix equation:
837
- *
838
- * op(A)*X + X*op(B) = scale*C or
839
- * op(A)*X - X*op(B) = scale*C,
840
- *
841
- * where op(A) = A or A**T, and A and B are both upper quasi-
842
- * triangular. A is M-by-M and B is N-by-N; the right hand side C and
843
- * the solution X are M-by-N; and scale is an output scale factor, set
844
- * <= 1 to avoid overflow in X.
845
- *
846
- * A and B must be in Schur canonical form (as returned by DHSEQR), that
847
- * is, block upper triangular with 1-by-1 and 2-by-2 diagonal blocks;
848
- * each 2-by-2 diagonal block has its diagonal elements equal and its
849
- * off-diagonal elements of opposite sign.
850
- *
851
-
852
- * Arguments
853
- * =========
854
- *
855
- * TRANA (input) CHARACTER*1
856
- * Specifies the option op(A):
857
- * = 'N': op(A) = A (No transpose)
858
- * = 'T': op(A) = A**T (Transpose)
859
- * = 'C': op(A) = A**H (Conjugate transpose = Transpose)
860
- *
861
- * TRANB (input) CHARACTER*1
862
- * Specifies the option op(B):
863
- * = 'N': op(B) = B (No transpose)
864
- * = 'T': op(B) = B**T (Transpose)
865
- * = 'C': op(B) = B**H (Conjugate transpose = Transpose)
866
- *
867
- * ISGN (input) INTEGER
868
- * Specifies the sign in the equation:
869
- * = +1: solve op(A)*X + X*op(B) = scale*C
870
- * = -1: solve op(A)*X - X*op(B) = scale*C
871
- *
872
- * M (input) INTEGER
873
- * The order of the matrix A, and the number of rows in the
874
- * matrices X and C. M >= 0.
875
- *
876
- * N (input) INTEGER
877
- * The order of the matrix B, and the number of columns in the
878
- * matrices X and C. N >= 0.
879
- *
880
- * A (input) DOUBLE PRECISION array, dimension (LDA,M)
881
- * The upper quasi-triangular matrix A, in Schur canonical form.
882
- *
883
- * LDA (input) INTEGER
884
- * The leading dimension of the array A. LDA >= max(1,M).
885
- *
886
- * B (input) DOUBLE PRECISION array, dimension (LDB,N)
887
- * The upper quasi-triangular matrix B, in Schur canonical form.
888
- *
889
- * LDB (input) INTEGER
890
- * The leading dimension of the array B. LDB >= max(1,N).
891
- *
892
- * C (input/output) DOUBLE PRECISION array, dimension (LDC,N)
893
- * On entry, the M-by-N right hand side matrix C.
894
- * On exit, C is overwritten by the solution matrix X.
895
- *
896
- * LDC (input) INTEGER
897
- * The leading dimension of the array C. LDC >= max(1,M)
898
- *
899
- * SCALE (output) DOUBLE PRECISION
900
- * The scale factor, scale, set <= 1 to avoid overflow in X.
901
- *
902
- * INFO (output) INTEGER
903
- * = 0: successful exit
904
- * < 0: if INFO = -i, the i-th argument had an illegal value
905
- * = 1: A and B have common or very close eigenvalues; perturbed
906
- * values were used to solve the equation (but the matrices
907
- * A and B are unchanged).
908
- *
909
-
910
- * =====================================================================
911
- *
912
-
913
-
914
- </PRE>
915
- <A HREF="#top">go to the page top</A>
916
-
917
- <A NAME="dtrti2"></A>
918
- <H2>dtrti2</H2>
919
- <PRE>
920
- USAGE:
921
- info, a = NumRu::Lapack.dtrti2( uplo, diag, a, [:usage => usage, :help => help])
922
-
923
-
924
- FORTRAN MANUAL
925
- SUBROUTINE DTRTI2( UPLO, DIAG, N, A, LDA, INFO )
926
-
927
- * Purpose
928
- * =======
929
- *
930
- * DTRTI2 computes the inverse of a real upper or lower triangular
931
- * matrix.
932
- *
933
- * This is the Level 2 BLAS version of the algorithm.
934
- *
935
-
936
- * Arguments
937
- * =========
938
- *
939
- * UPLO (input) CHARACTER*1
940
- * Specifies whether the matrix A is upper or lower triangular.
941
- * = 'U': Upper triangular
942
- * = 'L': Lower triangular
943
- *
944
- * DIAG (input) CHARACTER*1
945
- * Specifies whether or not the matrix A is unit triangular.
946
- * = 'N': Non-unit triangular
947
- * = 'U': Unit triangular
948
- *
949
- * N (input) INTEGER
950
- * The order of the matrix A. N >= 0.
951
- *
952
- * A (input/output) DOUBLE PRECISION array, dimension (LDA,N)
953
- * On entry, the triangular matrix A. If UPLO = 'U', the
954
- * leading n by n upper triangular part of the array A contains
955
- * the upper triangular matrix, and the strictly lower
956
- * triangular part of A is not referenced. If UPLO = 'L', the
957
- * leading n by n lower triangular part of the array A contains
958
- * the lower triangular matrix, and the strictly upper
959
- * triangular part of A is not referenced. If DIAG = 'U', the
960
- * diagonal elements of A are also not referenced and are
961
- * assumed to be 1.
962
- *
963
- * On exit, the (triangular) inverse of the original matrix, in
964
- * the same storage format.
965
- *
966
- * LDA (input) INTEGER
967
- * The leading dimension of the array A. LDA >= max(1,N).
968
- *
969
- * INFO (output) INTEGER
970
- * = 0: successful exit
971
- * < 0: if INFO = -k, the k-th argument had an illegal value
972
- *
973
-
974
- * =====================================================================
975
- *
976
-
977
-
978
- </PRE>
979
- <A HREF="#top">go to the page top</A>
980
-
981
- <A NAME="dtrtri"></A>
982
- <H2>dtrtri</H2>
983
- <PRE>
984
- USAGE:
985
- info, a = NumRu::Lapack.dtrtri( uplo, diag, a, [:usage => usage, :help => help])
986
-
987
-
988
- FORTRAN MANUAL
989
- SUBROUTINE DTRTRI( UPLO, DIAG, N, A, LDA, INFO )
990
-
991
- * Purpose
992
- * =======
993
- *
994
- * DTRTRI computes the inverse of a real upper or lower triangular
995
- * matrix A.
996
- *
997
- * This is the Level 3 BLAS version of the algorithm.
998
- *
999
-
1000
- * Arguments
1001
- * =========
1002
- *
1003
- * UPLO (input) CHARACTER*1
1004
- * = 'U': A is upper triangular;
1005
- * = 'L': A is lower triangular.
1006
- *
1007
- * DIAG (input) CHARACTER*1
1008
- * = 'N': A is non-unit triangular;
1009
- * = 'U': A is unit triangular.
1010
- *
1011
- * N (input) INTEGER
1012
- * The order of the matrix A. N >= 0.
1013
- *
1014
- * A (input/output) DOUBLE PRECISION array, dimension (LDA,N)
1015
- * On entry, the triangular matrix A. If UPLO = 'U', the
1016
- * leading N-by-N upper triangular part of the array A contains
1017
- * the upper triangular matrix, and the strictly lower
1018
- * triangular part of A is not referenced. If UPLO = 'L', the
1019
- * leading N-by-N lower triangular part of the array A contains
1020
- * the lower triangular matrix, and the strictly upper
1021
- * triangular part of A is not referenced. If DIAG = 'U', the
1022
- * diagonal elements of A are also not referenced and are
1023
- * assumed to be 1.
1024
- * On exit, the (triangular) inverse of the original matrix, in
1025
- * the same storage format.
1026
- *
1027
- * LDA (input) INTEGER
1028
- * The leading dimension of the array A. LDA >= max(1,N).
1029
- *
1030
- * INFO (output) INTEGER
1031
- * = 0: successful exit
1032
- * < 0: if INFO = -i, the i-th argument had an illegal value
1033
- * > 0: if INFO = i, A(i,i) is exactly zero. The triangular
1034
- * matrix is singular and its inverse can not be computed.
1035
- *
1036
-
1037
- * =====================================================================
1038
- *
1039
-
1040
-
1041
- </PRE>
1042
- <A HREF="#top">go to the page top</A>
1043
-
1044
- <A NAME="dtrtrs"></A>
1045
- <H2>dtrtrs</H2>
1046
- <PRE>
1047
- USAGE:
1048
- info, b = NumRu::Lapack.dtrtrs( uplo, trans, diag, a, b, [:usage => usage, :help => help])
1049
-
1050
-
1051
- FORTRAN MANUAL
1052
- SUBROUTINE DTRTRS( UPLO, TRANS, DIAG, N, NRHS, A, LDA, B, LDB, INFO )
1053
-
1054
- * Purpose
1055
- * =======
1056
- *
1057
- * DTRTRS solves a triangular system of the form
1058
- *
1059
- * A * X = B or A**T * X = B,
1060
- *
1061
- * where A is a triangular matrix of order N, and B is an N-by-NRHS
1062
- * matrix. A check is made to verify that A is nonsingular.
1063
- *
1064
-
1065
- * Arguments
1066
- * =========
1067
- *
1068
- * UPLO (input) CHARACTER*1
1069
- * = 'U': A is upper triangular;
1070
- * = 'L': A is lower triangular.
1071
- *
1072
- * TRANS (input) CHARACTER*1
1073
- * Specifies the form of the system of equations:
1074
- * = 'N': A * X = B (No transpose)
1075
- * = 'T': A**T * X = B (Transpose)
1076
- * = 'C': A**H * X = B (Conjugate transpose = Transpose)
1077
- *
1078
- * DIAG (input) CHARACTER*1
1079
- * = 'N': A is non-unit triangular;
1080
- * = 'U': A is unit triangular.
1081
- *
1082
- * N (input) INTEGER
1083
- * The order of the matrix A. N >= 0.
1084
- *
1085
- * NRHS (input) INTEGER
1086
- * The number of right hand sides, i.e., the number of columns
1087
- * of the matrix B. NRHS >= 0.
1088
- *
1089
- * A (input) DOUBLE PRECISION array, dimension (LDA,N)
1090
- * The triangular matrix A. If UPLO = 'U', the leading N-by-N
1091
- * upper triangular part of the array A contains the upper
1092
- * triangular matrix, and the strictly lower triangular part of
1093
- * A is not referenced. If UPLO = 'L', the leading N-by-N lower
1094
- * triangular part of the array A contains the lower triangular
1095
- * matrix, and the strictly upper triangular part of A is not
1096
- * referenced. If DIAG = 'U', the diagonal elements of A are
1097
- * also not referenced and are assumed to be 1.
1098
- *
1099
- * LDA (input) INTEGER
1100
- * The leading dimension of the array A. LDA >= max(1,N).
1101
- *
1102
- * B (input/output) DOUBLE PRECISION array, dimension (LDB,NRHS)
1103
- * On entry, the right hand side matrix B.
1104
- * On exit, if INFO = 0, the solution matrix X.
1105
- *
1106
- * LDB (input) INTEGER
1107
- * The leading dimension of the array B. LDB >= max(1,N).
1108
- *
1109
- * INFO (output) INTEGER
1110
- * = 0: successful exit
1111
- * < 0: if INFO = -i, the i-th argument had an illegal value
1112
- * > 0: if INFO = i, the i-th diagonal element of A is zero,
1113
- * indicating that the matrix is singular and the solutions
1114
- * X have not been computed.
1115
- *
1116
-
1117
- * =====================================================================
1118
- *
1119
-
1120
-
1121
- </PRE>
1122
- <A HREF="#top">go to the page top</A>
1123
-
1124
- <A NAME="dtrttf"></A>
1125
- <H2>dtrttf</H2>
1126
- <PRE>
1127
- USAGE:
1128
- arf, info = NumRu::Lapack.dtrttf( transr, uplo, a, [:usage => usage, :help => help])
1129
-
1130
-
1131
- FORTRAN MANUAL
1132
- SUBROUTINE DTRTTF( TRANSR, UPLO, N, A, LDA, ARF, INFO )
1133
-
1134
- * Purpose
1135
- * =======
1136
- *
1137
- * DTRTTF copies a triangular matrix A from standard full format (TR)
1138
- * to rectangular full packed format (TF) .
1139
- *
1140
-
1141
- * Arguments
1142
- * =========
1143
- *
1144
- * TRANSR (input) CHARACTER*1
1145
- * = 'N': ARF in Normal form is wanted;
1146
- * = 'T': ARF in Transpose form is wanted.
1147
- *
1148
- * UPLO (input) CHARACTER*1
1149
- * = 'U': Upper triangle of A is stored;
1150
- * = 'L': Lower triangle of A is stored.
1151
- *
1152
- * N (input) INTEGER
1153
- * The order of the matrix A. N >= 0.
1154
- *
1155
- * A (input) DOUBLE PRECISION array, dimension (LDA,N).
1156
- * On entry, the triangular matrix A. If UPLO = 'U', the
1157
- * leading N-by-N upper triangular part of the array A contains
1158
- * the upper triangular matrix, and the strictly lower
1159
- * triangular part of A is not referenced. If UPLO = 'L', the
1160
- * leading N-by-N lower triangular part of the array A contains
1161
- * the lower triangular matrix, and the strictly upper
1162
- * triangular part of A is not referenced.
1163
- *
1164
- * LDA (input) INTEGER
1165
- * The leading dimension of the matrix A. LDA >= max(1,N).
1166
- *
1167
- * ARF (output) DOUBLE PRECISION array, dimension (NT).
1168
- * NT=N*(N+1)/2. On exit, the triangular matrix A in RFP format.
1169
- *
1170
- * INFO (output) INTEGER
1171
- * = 0: successful exit
1172
- * < 0: if INFO = -i, the i-th argument had an illegal value
1173
- *
1174
-
1175
- * Further Details
1176
- * ===============
1177
- *
1178
- * We first consider Rectangular Full Packed (RFP) Format when N is
1179
- * even. We give an example where N = 6.
1180
- *
1181
- * AP is Upper AP is Lower
1182
- *
1183
- * 00 01 02 03 04 05 00
1184
- * 11 12 13 14 15 10 11
1185
- * 22 23 24 25 20 21 22
1186
- * 33 34 35 30 31 32 33
1187
- * 44 45 40 41 42 43 44
1188
- * 55 50 51 52 53 54 55
1189
- *
1190
- *
1191
- * Let TRANSR = 'N'. RFP holds AP as follows:
1192
- * For UPLO = 'U' the upper trapezoid A(0:5,0:2) consists of the last
1193
- * three columns of AP upper. The lower triangle A(4:6,0:2) consists of
1194
- * the transpose of the first three columns of AP upper.
1195
- * For UPLO = 'L' the lower trapezoid A(1:6,0:2) consists of the first
1196
- * three columns of AP lower. The upper triangle A(0:2,0:2) consists of
1197
- * the transpose of the last three columns of AP lower.
1198
- * This covers the case N even and TRANSR = 'N'.
1199
- *
1200
- * RFP A RFP A
1201
- *
1202
- * 03 04 05 33 43 53
1203
- * 13 14 15 00 44 54
1204
- * 23 24 25 10 11 55
1205
- * 33 34 35 20 21 22
1206
- * 00 44 45 30 31 32
1207
- * 01 11 55 40 41 42
1208
- * 02 12 22 50 51 52
1209
- *
1210
- * Now let TRANSR = 'T'. RFP A in both UPLO cases is just the
1211
- * transpose of RFP A above. One therefore gets:
1212
- *
1213
- *
1214
- * RFP A RFP A
1215
- *
1216
- * 03 13 23 33 00 01 02 33 00 10 20 30 40 50
1217
- * 04 14 24 34 44 11 12 43 44 11 21 31 41 51
1218
- * 05 15 25 35 45 55 22 53 54 55 22 32 42 52
1219
- *
1220
- *
1221
- * We then consider Rectangular Full Packed (RFP) Format when N is
1222
- * odd. We give an example where N = 5.
1223
- *
1224
- * AP is Upper AP is Lower
1225
- *
1226
- * 00 01 02 03 04 00
1227
- * 11 12 13 14 10 11
1228
- * 22 23 24 20 21 22
1229
- * 33 34 30 31 32 33
1230
- * 44 40 41 42 43 44
1231
- *
1232
- *
1233
- * Let TRANSR = 'N'. RFP holds AP as follows:
1234
- * For UPLO = 'U' the upper trapezoid A(0:4,0:2) consists of the last
1235
- * three columns of AP upper. The lower triangle A(3:4,0:1) consists of
1236
- * the transpose of the first two columns of AP upper.
1237
- * For UPLO = 'L' the lower trapezoid A(0:4,0:2) consists of the first
1238
- * three columns of AP lower. The upper triangle A(0:1,1:2) consists of
1239
- * the transpose of the last two columns of AP lower.
1240
- * This covers the case N odd and TRANSR = 'N'.
1241
- *
1242
- * RFP A RFP A
1243
- *
1244
- * 02 03 04 00 33 43
1245
- * 12 13 14 10 11 44
1246
- * 22 23 24 20 21 22
1247
- * 00 33 34 30 31 32
1248
- * 01 11 44 40 41 42
1249
- *
1250
- * Now let TRANSR = 'T'. RFP A in both UPLO cases is just the
1251
- * transpose of RFP A above. One therefore gets:
1252
- *
1253
- * RFP A RFP A
1254
- *
1255
- * 02 12 22 00 01 00 10 20 30 40 50
1256
- * 03 13 23 33 11 33 11 21 31 41 51
1257
- * 04 14 24 34 44 43 44 22 32 42 52
1258
- *
1259
- * Reference
1260
- * =========
1261
- *
1262
- * =====================================================================
1263
- *
1264
- * ..
1265
- * .. Local Scalars ..
1266
- LOGICAL LOWER, NISODD, NORMALTRANSR
1267
- INTEGER I, IJ, J, K, L, N1, N2, NT, NX2, NP1X2
1268
- * ..
1269
- * .. External Functions ..
1270
- LOGICAL LSAME
1271
- EXTERNAL LSAME
1272
- * ..
1273
- * .. External Subroutines ..
1274
- EXTERNAL XERBLA
1275
- * ..
1276
- * .. Intrinsic Functions ..
1277
- INTRINSIC MAX, MOD
1278
- * ..
1279
-
1280
-
1281
- </PRE>
1282
- <A HREF="#top">go to the page top</A>
1283
-
1284
- <A NAME="dtrttp"></A>
1285
- <H2>dtrttp</H2>
1286
- <PRE>
1287
- USAGE:
1288
- ap, info = NumRu::Lapack.dtrttp( uplo, a, [:usage => usage, :help => help])
1289
-
1290
-
1291
- FORTRAN MANUAL
1292
- SUBROUTINE DTRTTP( UPLO, N, A, LDA, AP, INFO )
1293
-
1294
- * Purpose
1295
- * =======
1296
- *
1297
- * DTRTTP copies a triangular matrix A from full format (TR) to standard
1298
- * packed format (TP).
1299
- *
1300
-
1301
- * Arguments
1302
- * =========
1303
- *
1304
- * UPLO (input) CHARACTER*1
1305
- * = 'U': A is upper triangular.
1306
- * = 'L': A is lower triangular.
1307
- *
1308
- * N (input) INTEGER
1309
- * The order of the matrices AP and A. N >= 0.
1310
- *
1311
- * A (input) DOUBLE PRECISION array, dimension (LDA,N)
1312
- * On exit, the triangular matrix A. If UPLO = 'U', the leading
1313
- * N-by-N upper triangular part of A contains the upper
1314
- * triangular part of the matrix A, and the strictly lower
1315
- * triangular part of A is not referenced. If UPLO = 'L', the
1316
- * leading N-by-N lower triangular part of A contains the lower
1317
- * triangular part of the matrix A, and the strictly upper
1318
- * triangular part of A is not referenced.
1319
- *
1320
- * LDA (input) INTEGER
1321
- * The leading dimension of the array A. LDA >= max(1,N).
1322
- *
1323
- * AP (output) DOUBLE PRECISION array, dimension (N*(N+1)/2
1324
- * On exit, the upper or lower triangular matrix A, packed
1325
- * columnwise in a linear array. The j-th column of A is stored
1326
- * in the array AP as follows:
1327
- * if UPLO = 'U', AP(i + (j-1)*j/2) = A(i,j) for 1<=i<=j;
1328
- * if UPLO = 'L', AP(i + (j-1)*(2n-j)/2) = A(i,j) for j<=i<=n.
1329
- *
1330
- * INFO (output) INTEGER
1331
- * = 0: successful exit
1332
- * < 0: if INFO = -i, the i-th argument had an illegal value
1333
- *
1334
-
1335
- * =====================================================================
1336
- *
1337
-
1338
-
1339
- </PRE>
1340
- <A HREF="#top">go to the page top</A>
1341
-
1342
- <HR />
1343
- <A HREF="d.html">back to matrix types</A><BR>
1344
- <A HREF="d.html">back to data types</A>
1345
- </BODY>
1346
- </HTML>