Главная Обзор Помощь
Вход
rparedis
/
pyCBD
Следить 1
В избранное 0
Ответвить 0
Файлы Обсуждения 27 Запросы на слияние 0 Вики
Дерево: 4ab638b5be
Ветки Метки
pyCBD
/
doc
/
_build
/
html
/
_modules
/
CBD
/
solver.html

solver.html 56 KB
История Исходник

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699 
  1. 

  2. 

  3. 

  4. <!DOCTYPE html>
    5. 

  5. <!--[if IE 8]><html class="no-js lt-ie9" lang="en" > <![endif]-->
    6. 

  6. <!--[if gt IE 8]><!--> <html class="no-js" lang="en" > <!--<![endif]-->
    7. 

  7. <head>
    8. 

  8.   <meta charset="utf-8">
    9. 

  9.   
    10. 

  10.   <meta name="viewport" content="width=device-width, initial-scale=1.0">
    11. 

  11.   
    12. 

  12.   <title>CBD.solver &mdash; CBD Simulation Development Kit  documentation</title>
    13. 

  13.   
    14. 

  14. 

  15.   
    16. 

  16.   
    17. 

  17.   
    18. 

  18.   
    19. 

  19. 

  20.   
    21. 

  21. 

  22.   
    23. 

  23.   
    24. 

  24.     
    25. 

  25. 

  26.   
    27. 

  27. 

  28.   <link rel="stylesheet" href="../../_static/css/theme.css" type="text/css" />
    29. 

  29.   <!-- <link rel="stylesheet" href="../../_static/pygments.css" type="text/css" /> -->
    30. 

  30.   <link rel="stylesheet" href="../../_static/style.css" type="text/css" />
    31. 

  31.     <link rel="index" title="Index" href="../../genindex.html" />
    32. 

  32.     <link rel="search" title="Search" href="../../search.html" /> 
    33. 

  33. 

  34.   
    35. 

  35.   <script async src="https://www.googletagmanager.com/gtag/js?id=UA-167094275-1"></script>
    36. 

  36.   <script src="../../_static/js/googleanalytics.min.js"></script>
    37. 

  37.   
    38. 

  38.   <script src="../../_static/js/modernizr.min.js"></script>
    39. 

  39. 

  40.   <!-- Preload the theme fonts -->
    41. 

  41. 

  42. <link rel="preload" href="../../_static/fonts/FreightSans/freight-sans-book.woff2" as="font" type="font/woff2" crossorigin="anonymous">
    43. 

  43. <link rel="preload" href="../../_static/fonts/FreightSans/freight-sans-medium.woff2" as="font" type="font/woff2" crossorigin="anonymous">
    44. 

  44. <link rel="preload" href="../../_static/fonts/IBMPlexMono/IBMPlexMono-Medium.woff2" as="font" type="font/woff2" crossorigin="anonymous">
    45. 

  45. <link rel="preload" href="../../_static/fonts/FreightSans/freight-sans-bold.woff2" as="font" type="font/woff2" crossorigin="anonymous">
    46. 

  46. <link rel="preload" href="../../_static/fonts/FreightSans/freight-sans-medium-italic.woff2" as="font" type="font/woff2" crossorigin="anonymous">
    47. 

  47. <link rel="preload" href="../../_static/fonts/IBMPlexMono/IBMPlexMono-SemiBold.woff2" as="font" type="font/woff2" crossorigin="anonymous">
    48. 

  48. 

  49. <!-- Preload the katex fonts -->
    50. 

  50. 

  51. <link rel="preload" href="https://cdn.jsdelivr.net/npm/katex@0.10.0/dist/fonts/KaTeX_Math-Italic.woff2" as="font" type="font/woff2" crossorigin="anonymous">
    52. 

  52. <link rel="preload" href="https://cdn.jsdelivr.net/npm/katex@0.10.0/dist/fonts/KaTeX_Main-Regular.woff2" as="font" type="font/woff2" crossorigin="anonymous">
    53. 

  53. <link rel="preload" href="https://cdn.jsdelivr.net/npm/katex@0.10.0/dist/fonts/KaTeX_Main-Bold.woff2" as="font" type="font/woff2" crossorigin="anonymous">
    54. 

  54. <link rel="preload" href="https://cdn.jsdelivr.net/npm/katex@0.10.0/dist/fonts/KaTeX_Size1-Regular.woff2" as="font" type="font/woff2" crossorigin="anonymous">
    55. 

  55. <link rel="preload" href="https://cdn.jsdelivr.net/npm/katex@0.10.0/dist/fonts/KaTeX_Size4-Regular.woff2" as="font" type="font/woff2" crossorigin="anonymous">
    56. 

  56. <link rel="preload" href="https://cdn.jsdelivr.net/npm/katex@0.10.0/dist/fonts/KaTeX_Size2-Regular.woff2" as="font" type="font/woff2" crossorigin="anonymous">
    57. 

  57. <link rel="preload" href="https://cdn.jsdelivr.net/npm/katex@0.10.0/dist/fonts/KaTeX_Size3-Regular.woff2" as="font" type="font/woff2" crossorigin="anonymous">
    58. 

  58. <link rel="preload" href="https://cdn.jsdelivr.net/npm/katex@0.10.0/dist/fonts/KaTeX_Caligraphic-Regular.woff2" as="font" type="font/woff2" crossorigin="anonymous">
    59. 

  59. </head>
    60. 

  60. 

  61. <div class="container-fluid header-holder tutorials-header" id="header-holder">
    62. 

  62.   <div class="container">
    63. 

  63.     <div class="header-container">
    64. 

  64.       <a class="header-logo" href="https://catalyst-team.com/" aria-label="Catalyst"></a>
    65. 

  65. 

  66.       <div class="main-menu">
    67. 

  67.         <ul>
    68. 

  68. 

  69.           <li>
    70. 

  70.             <div class="ecosystem-dropdown">
    71. 

  71.               <a id="dropdownMenuButtonEcosystem" data-toggle="ecosystem-dropdown">
    72. 

  72.                 Ecosystem
    73. 

  73.               </a>
    74. 

  74.               <div class="ecosystem-dropdown-menu">
    75. 

  75.                 <a class="nav-dropdown-item" href="https://alchemy.host">
    76. 

  76.                   <span class=dropdown-title>Alchemy</span>
    77. 

  77.                   <p>Experiments logging & visualization</p>
    78. 

  78.                 </a>
    79. 

  79.                 <a class="nav-dropdown-item" href="https://github.com/catalyst-team/catalyst">
    80. 

  80.                   <span class=dropdown-title>Catalyst</span>
    81. 

  81.                   <p>Accelerated deep learning R&D</p>
    82. 

  82.                 </a>
    83. 

  83.                 <a class="nav-dropdown-item" href="https://github.com/catalyst-team/reaction">
    84. 

  84.                   <span class=dropdown-title>Reaction</span>
    85. 

  85.                   <p>Convenient deep learning models serving</p>
    86. 

  86.                 </a>
    87. 

  87.               </div>
    88. 

  88.             </div>
    89. 

  89.           </li>
    90. 

  90. 

  91.           <li>
    92. 

  92.             <div class="projects-dropdown">
    93. 

  93.               <a id="dropdownMenuButtonProjects" data-toggle="projects-dropdown">
    94. 

  94.                 Projects
    95. 

  95.               </a>
    96. 

  96.               <div class="projects-dropdown-menu">
    97. 

  97.                 <a class="nav-dropdown-item" href="https://github.com/catalyst-team/codestyle">
    98. 

  98.                   <span class=dropdown-title>Codestyle</span>
    99. 

  99.                   <p>Joint R&D codestyle</p>
    100. 

  100.                 </a>
    101. 

  101.                 <a class="nav-dropdown-item" href="https://github.com/catalyst-team/neuro">
    102. 

  102.                   <span class=dropdown-title>Catalyst.Neuro</span>
    103. 

  103.                   <p>Catalyst.Team and TReNDS collaborative project</p>
    104. 

  104.                 </a>
    105. 

  105.                 <a class="nav-dropdown-item" href="https://github.com/catalyst-team/classification">
    106. 

  106.                   <span class=dropdown-title>Classification</span>
    107. 

  107.                   <p>Image classification pipeline with transfer learning</p>
    108. 

  108.                 </a>
    109. 

  109.                 <a class="nav-dropdown-item" href="https://github.com/catalyst-team/detection">
    110. 

  110.                   <span class=dropdown-title>Detection</span>
    111. 

  111.                   <p>Object detection pipeline</p>
    112. 

  112.                 </a>
    113. 

  113.                 <a class="nav-dropdown-item" href="https://github.com/catalyst-team/segmentation">
    114. 

  114.                   <span class=dropdown-title>Segmentation</span>
    115. 

  115.                   <p>Image semantic segmentation pipeline</p>
    116. 

  116.                 </a>
    117. 

  117.                 <a class="nav-dropdown-item" href="https://github.com/catalyst-team/gan">
    118. 

  118.                   <span class=dropdown-title>Catalyst.GAN</span>
    119. 

  119.                   <p>GAN pipelines</p>
    120. 

  120.                 </a>
    121. 

  121.               </div>
    122. 

  122.             </div>
    123. 

  123.           </li>
    124. 

  124. 

  125.           <li>
    126. 

  126.             <a href="https://github.com/catalyst-team/dl-course">Deep learning course</a>
    127. 

  127.           </li>
    128. 

  128.         </ul>
    129. 

  129.       </div>
    130. 

  130. 

  131.       <a class="main-menu-open-button" href="#" data-behavior="open-mobile-menu"></a>
    132. 

  132.     </div>
    133. 

  133. 

  134.   </div>
    135. 

  135. </div>
    136. 

  136. 

  137. 

  138. <body class="catalyst-body">
    139. 

  139. 

  140.    
    141. 

  141. 

  142.     
    143. 

  143. 

  144.     <div class="table-of-contents-link-wrapper">
    145. 

  145.       <span>Table of Contents</span>
    146. 

  146.       <a href="#" class="toggle-table-of-contents" data-behavior="toggle-table-of-contents"></a>
    147. 

  147.     </div>
    148. 

  148. 

  149.     <nav data-toggle="wy-nav-shift" class="catalyst-left-menu" id="catalyst-left-menu">
    150. 

  150.       <div class="catalyst-side-scroll">
    151. 

  151.         <div class="catalyst-menu catalyst-menu-vertical" data-spy="affix" role="navigation" aria-label="main navigation">
    152. 

  152.           <div class="catalyst-left-menu-search">
    153. 

  153.             
    154. 

  154. 

  155.             
    156. 

  156.               
    157. 

  157.               
    158. 

  158.             
    159. 

  159. 

  160.             
    161. 

  161. 

  162. 

  163.   
    164. 

  164. 

  165. 

  166. <div role="search">
    167. 

  167.   <form id="rtd-search-form" class="wy-form" action="../../search.html" method="get">
    168. 

  168.     <input type="text" name="q" placeholder="Search Docs" />
    169. 

  169.     <input type="hidden" name="check_keywords" value="yes" />
    170. 

  170.     <input type="hidden" name="area" value="default" />
    171. 

  171.   </form>
    172. 

  172. </div>
    173. 

  173. 

  174.             
    175. 

  175.           </div>
    176. 

  176. 

  177.           
    178. 

  178.             
    179. 

  179.             
    180. 

  180.               
    181. 

  181.             
    182. 

  182.             
    183. 

  183.               <p class="caption"><span class="caption-text">Setup</span></p>
    184. 

  184. <ul>
    185. 

  185. <li class="toctree-l1"><a class="reference internal" href="../../install.html">How to install the CBD framework?</a></li>
    186. 

  186. <li class="toctree-l1"><a class="reference internal" href="../../running.html">How to run a CBD simulation?</a></li>
    187. 

  187. <li class="toctree-l1"><a class="reference internal" href="../../changelog.html">Changelog</a></li>
    188. 

  188. </ul>
    189. 

  189. <p class="caption"><span class="caption-text">Simple Examples</span></p>
    190. 

  190. <ul>
    191. 

  191. <li class="toctree-l1"><a class="reference internal" href="../../examples/SinGen.html">Sine Generator</a></li>
    192. 

  192. <li class="toctree-l1"><a class="reference internal" href="../../examples/EvenNumberGen.html">Hierarchical Even Number Generator</a></li>
    193. 

  193. <li class="toctree-l1"><a class="reference internal" href="../../examples/Fibonacci.html">Fibonacci Sequence Generator</a></li>
    194. 

  194. <li class="toctree-l1"><a class="reference internal" href="../../examples/LCG.html">Linear Congruential Generator</a></li>
    195. 

  195. </ul>
    196. 

  196. <p class="caption"><span class="caption-text">Advanced Examples</span></p>
    197. 

  197. <ul>
    198. 

  198. <li class="toctree-l1"><a class="reference internal" href="../../examples/RealTime.html">Realtime Simulation</a></li>
    199. 

  199. <li class="toctree-l1"><a class="reference internal" href="../../examples/LivePlot.html">Live Plotting of Data During the Simulation</a></li>
    200. 

  200. <li class="toctree-l1"><a class="reference internal" href="../../examples/Dashboard.html">TkInter Dashboard with Editable Values</a></li>
    201. 

  201. </ul>
    202. 

  202. <p class="caption"><span class="caption-text">Internal Documentation</span></p>
    203. 

  203. <ul>
    204. 

  204. <li class="toctree-l1"><a class="reference internal" href="../../CBD.html">CBD package</a></li>
    205. 

  205. </ul>
    206. 

  206. 

  207.             
    208. 

  208.           
    209. 

  209.         </div>
    210. 

  210.       </div>
    211. 

  211.     </nav>
    212. 

  212. 

  213.     <div class="catalyst-container">
    214. 

  214.       <div class="catalyst-page-level-bar" id="catalyst-page-level-bar">
    215. 

  215.         <div class="catalyst-breadcrumbs-wrapper">
    216. 

  216.           
    217. 

  217. 

  218. 

  219. 

  220. 

  221. 

  222. 

  223. 

  224. 

  225. 

  226. 

  227. 

  228. 

  229. 

  230. 

  231. 

  232. <div role="navigation" aria-label="breadcrumbs navigation">
    233. 

  233. 

  234.   <ul class="catalyst-breadcrumbs">
    235. 

  235.     
    236. 

  236.       <li>
    237. 

  237.         <a href="../../index.html">
    238. 

  238.           
    239. 

  239.             Docs
    240. 

  240.           
    241. 

  241.         </a> &gt;
    242. 

  242.       </li>
    243. 

  243. 

  244.         
    245. 

  245.           <li><a href="../index.html">Module code</a> &gt;</li>
    246. 

  246.         
    247. 

  247.       <li>CBD.solver</li>
    248. 

  248.     
    249. 

  249.     
    250. 

  250.       <li class="catalyst-breadcrumbs-aside">
    251. 

  251.         
    252. 

  252.       </li>
    253. 

  253.     
    254. 

  254.   </ul>
    255. 

  255. 

  256.   
    257. 

  257. </div>
    258. 

  258.         </div>
    259. 

  259. 

  260.         <div class="catalyst-shortcuts-wrapper" id="catalyst-shortcuts-wrapper">
    261. 

  261.           Shortcuts
    262. 

  262.         </div>
    263. 

  263.       </div>
    264. 

  264. 

  265.       <section data-toggle="wy-nav-shift" id="catalyst-content-wrap" class="catalyst-content-wrap">
    266. 

  266.         <div class="catalyst-content-left">
    267. 

  267.           
    268. 

  268.           <div class="rst-content">
    269. 

  269.           
    270. 

  270.             <div role="main" class="main-content" itemscope="itemscope" itemtype="http://schema.org/Article">
    271. 

  271.              <article itemprop="articleBody" id="catalyst-article" class="catalyst-article">
    272. 

  272.               
    273. 

  273.   <h1>Source code for CBD.solver</h1><div class="highlight"><pre>
    274. 

  274. <span></span><span class="kn">import</span> <span class="nn">math</span>
    275. 

  275. <span class="kn">from</span> <span class="nn">.CBD</span> <span class="kn">import</span> <span class="n">CBD</span>
    276. 

  276. <span class="kn">from</span> <span class="nn">.util</span> <span class="kn">import</span> <span class="n">PYTHON_VERSION</span>
    277. 

  277. 

  278. <span class="k">if</span> <span class="n">PYTHON_VERSION</span> <span class="o">==</span> <span class="mi">3</span><span class="p">:</span>
    279. 

  279. 	<span class="c1"># Python 2 complient</span>
    280. 

  280. 	<span class="kn">from</span> <span class="nn">functools</span> <span class="kn">import</span> <span class="n">reduce</span>
    281. 

  281. 

  282. 

  283. <span class="c1"># Superclass for possible additional solvers</span>
    284. 

  284. <div class="viewcode-block" id="Solver"><a class="viewcode-back" href="../../CBD.solver.html#CBD.solver.Solver">[docs]</a><span class="k">class</span> <span class="nc">Solver</span><span class="p">:</span>
    285. 

  285. 	<span class="sd">&quot;&quot;&quot;</span>
    286. 

  286. <span class="sd">	Superclass that can solve algebraic loops.</span>
    287. 

  287. 

  288. <span class="sd">	Args:</span>
    289. 

  289. <span class="sd">		logger (Logger):    The logger to use.</span>
    290. 

  290. <span class="sd">	&quot;&quot;&quot;</span>
    291. 

  291. 	<span class="k">def</span> <span class="fm">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">logger</span><span class="p">):</span>
    292. 

  292. 		<span class="bp">self</span><span class="o">.</span><span class="n">_logger</span> <span class="o">=</span> <span class="n">logger</span>
    293. 

  293. 

  294. <div class="viewcode-block" id="Solver.checkValidity"><a class="viewcode-back" href="../../CBD.solver.html#CBD.solver.Solver.checkValidity">[docs]</a>	<span class="k">def</span> <span class="nf">checkValidity</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">path</span><span class="p">,</span> <span class="n">component</span><span class="p">):</span>
    295. 

  295. 		<span class="sd">&quot;&quot;&quot;</span>
    296. 

  296. <span class="sd">		Checks the validity of an algebraic loop.</span>
    297. 

  297. 

  298. <span class="sd">		Args:</span>
    299. 

  299. <span class="sd">			path (str):         The path of the top-level block.</span>
    300. 

  300. <span class="sd">			component (list):   The blocks in the algebraic loop.</span>
    301. 

  301. <span class="sd">		&quot;&quot;&quot;</span>
    302. 

  302. 		<span class="k">raise</span> <span class="ne">NotImplementedError</span><span class="p">()</span></div>
    303. 

  303. 

  304. <div class="viewcode-block" id="Solver.constructInput"><a class="viewcode-back" href="../../CBD.solver.html#CBD.solver.Solver.constructInput">[docs]</a>	<span class="k">def</span> <span class="nf">constructInput</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">component</span><span class="p">,</span> <span class="n">curIt</span><span class="p">):</span>
    305. 

  305. 		<span class="sd">&quot;&quot;&quot;</span>
    306. 

  306. <span class="sd">		Constructs input for the solver.</span>
    307. 

  307. 

  308. <span class="sd">		Args:</span>
    309. 

  309. <span class="sd">			component (list):   The blocks in the algebraic loop.</span>
    310. 

  310. <span class="sd">			curIt (int):        The current iteration of the simulation.</span>
    311. 

  311. 

  312. <span class="sd">		See Also:</span>
    313. 

  313. <span class="sd">			:func:`solve`</span>
    314. 

  314. <span class="sd">		&quot;&quot;&quot;</span>
    315. 

  315. 		<span class="k">raise</span> <span class="ne">NotImplementedError</span><span class="p">()</span></div>
    316. 

  316. 

  317. <div class="viewcode-block" id="Solver.solve"><a class="viewcode-back" href="../../CBD.solver.html#CBD.solver.Solver.solve">[docs]</a>	<span class="k">def</span> <span class="nf">solve</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">solverInput</span><span class="p">):</span>
    318. 

  318. 		<span class="sd">&quot;&quot;&quot;</span>
    319. 

  319. <span class="sd">		Solves the algebraic loop.</span>
    320. 

  320. 

  321. <span class="sd">		Args:</span>
    322. 

  322. <span class="sd">			solverInput:    The constructed input.</span>
    323. 

  323. 

  324. <span class="sd">		See Also:</span>
    325. 

  325. <span class="sd">			:func:`constructInput`</span>
    326. 

  326. <span class="sd">		&quot;&quot;&quot;</span>
    327. 

  327. 		<span class="k">raise</span> <span class="ne">NotImplementedError</span><span class="p">()</span></div></div>
    328. 

  328. 

  329. 

  330. <div class="viewcode-block" id="GaussianJordanLinearSolver"><a class="viewcode-back" href="../../CBD.solver.html#CBD.solver.GaussianJordanLinearSolver">[docs]</a><span class="k">class</span> <span class="nc">GaussianJordanLinearSolver</span><span class="p">(</span><span class="n">Solver</span><span class="p">):</span>
    331. 

  331. 	<span class="sd">&quot;&quot;&quot;</span>
    332. 

  332. <span class="sd">	Solves linear algebraic loops via Gaussian-Jordan Elimination.</span>
    333. 

  333. <span class="sd">	&quot;&quot;&quot;</span>
    334. 

  334. <div class="viewcode-block" id="GaussianJordanLinearSolver.checkValidity"><a class="viewcode-back" href="../../CBD.solver.html#CBD.solver.GaussianJordanLinearSolver.checkValidity">[docs]</a>	<span class="k">def</span> <span class="nf">checkValidity</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">path</span><span class="p">,</span> <span class="n">component</span><span class="p">):</span>
    335. 

  335. 		<span class="k">if</span> <span class="ow">not</span> <span class="bp">self</span><span class="o">.</span><span class="n">__isLinear</span><span class="p">(</span><span class="n">component</span><span class="p">):</span>
    336. 

  336. 			<span class="bp">self</span><span class="o">.</span><span class="n">_logger</span><span class="o">.</span><span class="n">fatal</span><span class="p">(</span><span class="s2">&quot;Cannot solve non-linear algebraic loop.</span><span class="se">\n</span><span class="s2">Self: </span><span class="si">{}</span><span class="se">\n</span><span class="s2">Components: </span><span class="si">{}</span><span class="s2">&quot;</span><span class="o">.</span><span class="n">format</span><span class="p">(</span><span class="n">path</span><span class="p">,</span> <span class="n">component</span><span class="p">))</span></div>
    337. 

  337. 

  338. 	<span class="k">def</span> <span class="nf">__isLinear</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">strongComponent</span><span class="p">):</span>
    339. 

  339. 		<span class="sd">&quot;&quot;&quot;Determines if an algebraic loop describes a linear equation or not</span>
    340. 

  340. 

  341. <span class="sd">        Args:</span>
    342. 

  342. <span class="sd">            strongComponent (list): The detected loop, in a list (of BaseBlock instances)</span>
    343. 

  343. 

  344. <span class="sd">        Returns:</span>
    345. 

  345. <span class="sd">            :class:`True` if the loop is linear, else :code:`False`.</span>
    346. 

  346. <span class="sd">        &quot;&quot;&quot;</span>
    347. 

  347. 		<span class="c1"># TO IMPLEMENT</span>
    348. 

  348. 

  349. 		<span class="sd">&quot;&quot;&quot;</span>
    350. 

  350. <span class="sd">		The strong component parameter is a list of blocks that comprise the strong component.</span>
    351. 

  351. <span class="sd">		For a block to comprise the strong component, at least one of its dependencies must be in the strong</span>
    352. 

  352. <span class="sd">		component as well.</span>
    353. 

  353. <span class="sd">		</span>
    354. 

  354. <span class="sd">		A non-linear equation is generated when the following conditions occur:</span>
    355. 

  355. <span class="sd">		 (1) there is a multiplication operation being performed between two unknowns.</span>
    356. 

  356. <span class="sd">		 (2) there is an invertion operation being performed in an unknown.</span>
    357. 

  357. <span class="sd">		 (3) some non-linear block belongs to the strong component</span>
    358. 

  358. <span class="sd">	</span>
    359. 

  359. <span class="sd">		The condition (1) can be operationalized by finding a product block that has two dependencies belonging to</span>
    360. 

  360. <span class="sd">		the strong component. This will immediatly tell us that it is a product between two unknowns.</span>
    361. 

  361. <span class="sd">		The condition (2) can be operationalized simply by finding an inverter block in the strong component. </span>
    362. 

  362. <span class="sd">		Because the inverter block only has one input, if it is in the strong component, it means that its only</span>
    363. 

  363. <span class="sd">		dependency is in the strong component.</span>
    364. 

  364. <span class="sd">		&quot;&quot;&quot;</span>
    365. 

  365. 

  366. 		<span class="c1"># WON&#39;T APPEAR: Constant, Sequence, Time, Logging</span>
    367. 

  367. 		<span class="c1"># LINEAR: Negator, Adder, Delay, Input, Output, Wire, TimedGate</span>
    368. 

  368. 		<span class="c1"># NON-LINEAR: Inverter, Modulo, Root, LT, EQ, LTE, Not, Or, And, MUX, Generic, ABS, Int</span>
    369. 

  369. 		<span class="c1"># SEMI-LINEAR: Product</span>
    370. 

  370. 

  371. 		<span class="k">for</span> <span class="n">block</span> <span class="ow">in</span> <span class="n">strongComponent</span><span class="p">:</span>
    372. 

  372. 			<span class="c1"># condition (1)</span>
    373. 

  373. 			<span class="k">if</span> <span class="n">block</span><span class="o">.</span><span class="n">getBlockType</span><span class="p">()</span> <span class="o">==</span> <span class="s2">&quot;ProductBlock&quot;</span><span class="p">:</span>
    374. 

  374. 				<span class="n">dependenciesUnknown</span> <span class="o">=</span> <span class="p">[</span><span class="n">x</span> <span class="k">for</span> <span class="n">x</span> <span class="ow">in</span> <span class="n">block</span><span class="o">.</span><span class="n">getDependencies</span><span class="p">(</span><span class="mi">0</span><span class="p">)</span> <span class="k">if</span> <span class="n">x</span> <span class="ow">in</span> <span class="n">strongComponent</span><span class="p">]</span>
    375. 

  375. 				<span class="k">if</span> <span class="nb">len</span><span class="p">(</span><span class="n">dependenciesUnknown</span><span class="p">)</span> <span class="o">==</span> <span class="mi">2</span><span class="p">:</span>
    376. 

  376. 					<span class="k">return</span> <span class="kc">False</span>
    377. 

  377. 

  378. 			<span class="c1"># condition (2) and (3)</span>
    379. 

  379. 			<span class="k">if</span> <span class="n">block</span><span class="o">.</span><span class="n">getBlockType</span><span class="p">()</span> <span class="ow">in</span> <span class="p">[</span><span class="s2">&quot;InverterBlock&quot;</span><span class="p">,</span> <span class="s2">&quot;ModuloBlock&quot;</span><span class="p">,</span> <span class="s2">&quot;RootBlock&quot;</span><span class="p">,</span> <span class="s2">&quot;LessThanBlock&quot;</span><span class="p">,</span> <span class="s2">&quot;EqualsBlock&quot;</span><span class="p">,</span>
    380. 

  380. 			                            <span class="s2">&quot;LessThanOrEqualsBlock&quot;</span><span class="p">,</span> <span class="s2">&quot;NotBlock&quot;</span><span class="p">,</span> <span class="s2">&quot;OrBlock&quot;</span><span class="p">,</span> <span class="s2">&quot;AndBlock&quot;</span><span class="p">,</span>
    381. 

  381. 			                            <span class="s2">&quot;MultiplexerBlock&quot;</span><span class="p">,</span> <span class="s2">&quot;GenericBlock&quot;</span><span class="p">,</span> <span class="s2">&quot;AbsBlock&quot;</span><span class="p">,</span> <span class="s2">&quot;IntBlock&quot;</span><span class="p">]:</span>
    382. 

  382. 				<span class="k">return</span> <span class="kc">False</span>
    383. 

  383. 

  384. 		<span class="k">return</span> <span class="kc">True</span>
    385. 

  385. 

  386. <div class="viewcode-block" id="GaussianJordanLinearSolver.constructInput"><a class="viewcode-back" href="../../CBD.solver.html#CBD.solver.GaussianJordanLinearSolver.constructInput">[docs]</a>	<span class="k">def</span> <span class="nf">constructInput</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">strongComponent</span><span class="p">,</span> <span class="n">curIteration</span><span class="p">):</span>
    387. 

  387. 		<span class="sd">&quot;&quot;&quot;</span>
    388. 

  388. <span class="sd">		Constructs input for a solver of systems of linear equations</span>
    389. 

  389. <span class="sd">		Input consists of two matrices:</span>
    390. 

  390. 

  391. <span class="sd">			- M1: coefficient matrix, where each row represents an equation of the system</span>
    392. 

  392. <span class="sd">			- M2: result matrix, where each element is the result for the corresponding equation in M1</span>
    393. 

  393. <span class="sd">		&quot;&quot;&quot;</span>
    394. 

  394. 		<span class="c1"># Initialize matrices with zeros</span>
    395. 

  395. 		<span class="n">size</span> <span class="o">=</span> <span class="nb">len</span><span class="p">(</span><span class="n">strongComponent</span><span class="p">)</span>
    396. 

  396. 		<span class="n">M1</span> <span class="o">=</span> <span class="n">Matrix</span><span class="p">(</span><span class="n">size</span><span class="p">,</span> <span class="n">size</span><span class="p">)</span>
    397. 

  397. 		<span class="n">M2</span> <span class="o">=</span> <span class="p">[</span><span class="mi">0</span><span class="p">]</span> <span class="o">*</span> <span class="n">size</span>
    398. 

  398. 

  399. 		<span class="c1"># block -&gt; index of block</span>
    400. 

  400. 		<span class="n">indexdict</span> <span class="o">=</span> <span class="nb">dict</span><span class="p">()</span>
    401. 

  401. 

  402. 		<span class="k">for</span> <span class="n">i</span><span class="p">,</span> <span class="n">block</span> <span class="ow">in</span> <span class="nb">enumerate</span><span class="p">(</span><span class="n">strongComponent</span><span class="p">):</span>
    403. 

  403. 			<span class="n">indexdict</span><span class="p">[</span><span class="n">block</span><span class="p">]</span> <span class="o">=</span> <span class="n">i</span>
    404. 

  404. 

  405. 		<span class="c1"># Get low-level dependency</span>
    406. 

  406. 		<span class="n">resolveBlock</span> <span class="o">=</span> <span class="k">lambda</span> <span class="n">possibleDep</span><span class="p">,</span> <span class="n">output_port</span><span class="p">:</span> <span class="n">possibleDep</span> <span class="k">if</span> <span class="ow">not</span> <span class="nb">isinstance</span><span class="p">(</span><span class="n">possibleDep</span><span class="p">,</span> <span class="n">CBD</span><span class="p">)</span> <span class="k">else</span> <span class="n">possibleDep</span><span class="o">.</span><span class="n">getBlockByName</span><span class="p">(</span><span class="n">output_port</span><span class="p">)</span>
    407. 

  407. 

  408. 		<span class="c1"># Get list of low-level dependencies from two inputs</span>
    409. 

  409. 		<span class="k">def</span> <span class="nf">getBlockDependencies2</span><span class="p">(</span><span class="n">block</span><span class="p">):</span>
    410. 

  410. 			<span class="k">return</span> <span class="p">(</span><span class="n">resolveBlock</span><span class="p">(</span><span class="n">b</span><span class="p">,</span> <span class="n">output_port</span><span class="p">)</span> <span class="k">for</span> <span class="p">(</span><span class="n">b</span><span class="p">,</span> <span class="n">output_port</span><span class="p">)</span> <span class="ow">in</span> <span class="p">[</span><span class="n">block</span><span class="o">.</span><span class="n">getBlockConnectedToInput</span><span class="p">(</span><span class="s2">&quot;IN1&quot;</span><span class="p">),</span> <span class="n">block</span><span class="o">.</span><span class="n">getBlockConnectedToInput</span><span class="p">(</span><span class="s2">&quot;IN2&quot;</span><span class="p">)])</span>
    411. 

  411. 

  412. 		<span class="k">for</span> <span class="n">i</span><span class="p">,</span> <span class="n">block</span> <span class="ow">in</span> <span class="nb">enumerate</span><span class="p">(</span><span class="n">strongComponent</span><span class="p">):</span>
    413. 

  413. 			<span class="k">if</span> <span class="n">block</span><span class="o">.</span><span class="n">getBlockType</span><span class="p">()</span> <span class="o">==</span> <span class="s2">&quot;AdderBlock&quot;</span><span class="p">:</span>
    414. 

  414. 				<span class="k">for</span> <span class="n">external</span> <span class="ow">in</span> <span class="p">[</span><span class="n">x</span> <span class="k">for</span> <span class="n">x</span> <span class="ow">in</span> <span class="n">getBlockDependencies2</span><span class="p">(</span><span class="n">block</span><span class="p">)</span> <span class="k">if</span> <span class="n">x</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">strongComponent</span><span class="p">]:</span>
    415. 

  415. 					<span class="n">M2</span><span class="p">[</span><span class="n">i</span><span class="p">]</span> <span class="o">-=</span> <span class="n">external</span><span class="o">.</span><span class="n">getSignal</span><span class="p">()[</span><span class="n">curIteration</span><span class="p">]</span><span class="o">.</span><span class="n">value</span>
    416. 

  416. 				<span class="n">M1</span><span class="p">[</span><span class="n">i</span><span class="p">,</span> <span class="n">i</span><span class="p">]</span> <span class="o">=</span> <span class="o">-</span><span class="mi">1</span>
    417. 

  417. 

  418. 				<span class="k">for</span> <span class="n">compInStrong</span> <span class="ow">in</span> <span class="p">[</span><span class="n">x</span> <span class="k">for</span> <span class="n">x</span> <span class="ow">in</span> <span class="n">getBlockDependencies2</span><span class="p">(</span><span class="n">block</span><span class="p">)</span> <span class="k">if</span> <span class="n">x</span> <span class="ow">in</span> <span class="n">strongComponent</span><span class="p">]:</span>
    419. 

  419. 					<span class="n">M1</span><span class="p">[</span><span class="n">i</span><span class="p">,</span> <span class="n">indexdict</span><span class="p">[</span><span class="n">compInStrong</span><span class="p">]]</span> <span class="o">=</span> <span class="mi">1</span>
    420. 

  420. 			<span class="k">elif</span> <span class="n">block</span><span class="o">.</span><span class="n">getBlockType</span><span class="p">()</span> <span class="o">==</span> <span class="s2">&quot;ProductBlock&quot;</span><span class="p">:</span>
    421. 

  421. 				<span class="c1"># M2 can stay 0</span>
    422. 

  422. 				<span class="n">M1</span><span class="p">[</span><span class="n">i</span><span class="p">,</span> <span class="n">i</span><span class="p">]</span> <span class="o">=</span> <span class="o">-</span><span class="mi">1</span>
    423. 

  423. 				<span class="n">M1</span><span class="p">[</span><span class="n">i</span><span class="p">,</span> <span class="n">indexdict</span><span class="p">[[</span><span class="n">x</span> <span class="k">for</span> <span class="n">x</span> <span class="ow">in</span> <span class="n">getBlockDependencies2</span><span class="p">(</span><span class="n">block</span><span class="p">)</span> <span class="k">if</span> <span class="n">x</span> <span class="ow">in</span> <span class="n">strongComponent</span><span class="p">][</span><span class="mi">0</span><span class="p">]]]</span> <span class="o">=</span> <span class="n">reduce</span><span class="p">(</span><span class="k">lambda</span> <span class="n">x</span><span class="p">,</span> <span class="n">y</span><span class="p">:</span> <span class="n">x</span> <span class="o">*</span> <span class="n">y</span><span class="p">,</span> <span class="p">[</span><span class="n">x</span><span class="o">.</span><span class="n">getSignal</span><span class="p">()[</span><span class="n">curIteration</span><span class="p">]</span><span class="o">.</span><span class="n">value</span> <span class="k">for</span> <span class="n">x</span> <span class="ow">in</span> <span class="n">getBlockDependencies2</span><span class="p">(</span><span class="n">block</span><span class="p">)</span> <span class="k">if</span> <span class="n">x</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">strongComponent</span><span class="p">])</span>
    424. 

  424. 			<span class="k">elif</span> <span class="n">block</span><span class="o">.</span><span class="n">getBlockType</span><span class="p">()</span> <span class="o">==</span> <span class="s2">&quot;NegatorBlock&quot;</span><span class="p">:</span>
    425. 

  425. 				<span class="c1"># M2 can stay 0</span>
    426. 

  426. 				<span class="n">M1</span><span class="p">[</span><span class="n">i</span><span class="p">,</span> <span class="n">i</span><span class="p">]</span> <span class="o">=</span> <span class="o">-</span><span class="mi">1</span>
    427. 

  427. 				<span class="n">possibleDep</span><span class="p">,</span> <span class="n">output_port</span> <span class="o">=</span> <span class="n">block</span><span class="o">.</span><span class="n">getBlockConnectedToInput</span><span class="p">(</span><span class="s2">&quot;IN1&quot;</span><span class="p">)</span>
    428. 

  428. 				<span class="n">M1</span><span class="p">[</span><span class="n">i</span><span class="p">,</span> <span class="n">indexdict</span><span class="p">[</span><span class="n">resolveBlock</span><span class="p">(</span><span class="n">possibleDep</span><span class="p">,</span> <span class="n">output_port</span><span class="p">)]]</span> <span class="o">=</span> <span class="o">-</span> <span class="mi">1</span>
    429. 

  429. 			<span class="k">elif</span> <span class="n">block</span><span class="o">.</span><span class="n">getBlockType</span><span class="p">()</span> <span class="o">==</span> <span class="s2">&quot;InputPortBlock&quot;</span><span class="p">:</span>
    430. 

  430. 				<span class="c1"># M2 can stay 0</span>
    431. 

  431. 				<span class="n">M1</span><span class="p">[</span><span class="n">i</span><span class="p">,</span> <span class="n">i</span><span class="p">]</span> <span class="o">=</span> <span class="mi">1</span>
    432. 

  432. 				<span class="n">possibleDep</span><span class="p">,</span> <span class="n">output_port</span> <span class="o">=</span> <span class="n">block</span><span class="o">.</span><span class="n">parent</span><span class="o">.</span><span class="n">getBlockConnectedToInput</span><span class="p">(</span><span class="n">block</span><span class="o">.</span><span class="n">getBlockName</span><span class="p">())</span>
    433. 

  433. 				<span class="n">M1</span><span class="p">[</span><span class="n">i</span><span class="p">,</span> <span class="n">indexdict</span><span class="p">[</span><span class="n">resolveBlock</span><span class="p">(</span><span class="n">possibleDep</span><span class="p">,</span> <span class="n">output_port</span><span class="p">)]]</span> <span class="o">=</span> <span class="o">-</span> <span class="mi">1</span>
    434. 

  434. 			<span class="k">elif</span> <span class="n">block</span><span class="o">.</span><span class="n">getBlockType</span><span class="p">()</span> <span class="o">==</span> <span class="s2">&quot;OutputPortBlock&quot;</span> <span class="ow">or</span> <span class="n">block</span><span class="o">.</span><span class="n">getBlockType</span><span class="p">()</span> <span class="o">==</span> <span class="s2">&quot;WireBlock&quot;</span><span class="p">:</span>
    435. 

  435. 				<span class="c1"># M2 can stay 0</span>
    436. 

  436. 				<span class="n">M1</span><span class="p">[</span><span class="n">i</span><span class="p">,</span> <span class="n">i</span><span class="p">]</span> <span class="o">=</span> <span class="mi">1</span>
    437. 

  437. 				<span class="n">M1</span><span class="p">[</span><span class="n">i</span><span class="p">,</span> <span class="n">indexdict</span><span class="p">[</span><span class="n">block</span><span class="o">.</span><span class="n">getDependencies</span><span class="p">(</span><span class="mi">0</span><span class="p">)[</span><span class="mi">0</span><span class="p">]]]</span> <span class="o">=</span> <span class="o">-</span> <span class="mi">1</span>
    438. 

  438. 			<span class="k">elif</span> <span class="n">block</span><span class="o">.</span><span class="n">getBlockType</span><span class="p">()</span> <span class="o">==</span> <span class="s2">&quot;DelayBlock&quot;</span><span class="p">:</span>
    439. 

  439. 				<span class="c1"># If a delay is in a strong component, this is the first iteration</span>
    440. 

  440. 				<span class="k">assert</span> <span class="n">curIteration</span> <span class="o">==</span> <span class="mi">0</span>
    441. 

  441. 				<span class="c1"># And so the dependency is the IC</span>
    442. 

  442. 				<span class="c1"># M2 can stay 0 because we have an equation of the type -x = -ic &lt;=&gt; -x + ic = 0</span>
    443. 

  443. 				<span class="n">M1</span><span class="p">[</span><span class="n">i</span><span class="p">,</span> <span class="n">i</span><span class="p">]</span> <span class="o">=</span> <span class="o">-</span><span class="mi">1</span>
    444. 

  444. 				<span class="n">possibleDep</span><span class="p">,</span> <span class="n">output_port</span> <span class="o">=</span> <span class="n">block</span><span class="o">.</span><span class="n">getBlockConnectedToInput</span><span class="p">(</span><span class="s2">&quot;IC&quot;</span><span class="p">)</span>
    445. 

  445. 				<span class="n">dependency</span> <span class="o">=</span> <span class="n">resolveBlock</span><span class="p">(</span><span class="n">possibleDep</span><span class="p">,</span> <span class="n">output_port</span><span class="p">)</span>
    446. 

  446. 				<span class="k">assert</span> <span class="n">dependency</span> <span class="ow">in</span> <span class="n">strongComponent</span>
    447. 

  447. 				<span class="n">M1</span><span class="p">[</span><span class="n">i</span><span class="p">,</span> <span class="n">indexdict</span><span class="p">[</span><span class="n">dependency</span><span class="p">]]</span> <span class="o">=</span> <span class="mi">1</span>
    448. 

  448. 			<span class="k">else</span><span class="p">:</span>
    449. 

  449. 				<span class="bp">self</span><span class="o">.</span><span class="n">_logger</span><span class="o">.</span><span class="n">fatal</span><span class="p">(</span><span class="s2">&quot;Unknown element &#39;</span><span class="si">{}</span><span class="s2">&#39;, please implement&quot;</span><span class="o">.</span><span class="n">format</span><span class="p">(</span><span class="n">block</span><span class="o">.</span><span class="n">getBlockType</span><span class="p">()))</span>
    450. 

  450. 		<span class="k">return</span> <span class="n">M1</span><span class="p">,</span> <span class="n">M2</span></div>
    451. 

  451. 

  452. <div class="viewcode-block" id="GaussianJordanLinearSolver.solve"><a class="viewcode-back" href="../../CBD.solver.html#CBD.solver.GaussianJordanLinearSolver.solve">[docs]</a>	<span class="k">def</span> <span class="nf">solve</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">solverInput</span><span class="p">):</span>
    453. 

  453. 		<span class="n">M1</span><span class="p">,</span> <span class="n">M2</span> <span class="o">=</span> <span class="n">solverInput</span>
    454. 

  454. 		<span class="n">n</span> <span class="o">=</span> <span class="n">M1</span><span class="o">.</span><span class="n">rows</span>
    455. 

  455. 		<span class="n">indxc</span> <span class="o">=</span> <span class="p">[</span><span class="mi">0</span><span class="p">]</span> <span class="o">*</span> <span class="n">n</span>
    456. 

  456. 		<span class="n">indxr</span> <span class="o">=</span> <span class="p">[</span><span class="mi">0</span><span class="p">]</span> <span class="o">*</span> <span class="n">n</span>
    457. 

  457. 		<span class="n">ipiv</span> <span class="o">=</span> <span class="p">[</span><span class="mi">0</span><span class="p">]</span> <span class="o">*</span> <span class="n">n</span>
    458. 

  458. 		<span class="n">icol</span> <span class="o">=</span> <span class="mi">0</span>
    459. 

  459. 		<span class="n">irow</span> <span class="o">=</span> <span class="mi">0</span>
    460. 

  460. 		<span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">n</span><span class="p">):</span>
    461. 

  461. 			<span class="n">big</span> <span class="o">=</span> <span class="mf">0.0</span>
    462. 

  462. 			<span class="k">for</span> <span class="n">j</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">n</span><span class="p">):</span>
    463. 

  463. 				<span class="k">if</span> <span class="n">ipiv</span><span class="p">[</span><span class="n">j</span><span class="p">]</span> <span class="o">!=</span> <span class="mi">1</span><span class="p">:</span>
    464. 

  464. 					<span class="k">for</span> <span class="n">k</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">n</span><span class="p">):</span>
    465. 

  465. 						<span class="k">if</span> <span class="n">ipiv</span><span class="p">[</span><span class="n">k</span><span class="p">]</span> <span class="o">==</span> <span class="mi">0</span><span class="p">:</span>
    466. 

  466. 							<span class="n">nb</span> <span class="o">=</span> <span class="n">math</span><span class="o">.</span><span class="n">fabs</span><span class="p">(</span><span class="n">M1</span><span class="p">[</span><span class="n">j</span><span class="p">,</span> <span class="n">k</span><span class="p">])</span>
    467. 

  467. 							<span class="k">if</span> <span class="n">nb</span> <span class="o">&gt;=</span> <span class="n">big</span><span class="p">:</span>
    468. 

  468. 								<span class="n">big</span> <span class="o">=</span> <span class="n">nb</span>
    469. 

  469. 								<span class="n">irow</span> <span class="o">=</span> <span class="n">j</span>
    470. 

  470. 								<span class="n">icol</span> <span class="o">=</span> <span class="n">k</span>
    471. 

  471. 						<span class="k">elif</span> <span class="n">ipiv</span><span class="p">[</span><span class="n">k</span><span class="p">]</span> <span class="o">&gt;</span> <span class="mi">1</span><span class="p">:</span>
    472. 

  472. 							<span class="k">raise</span> <span class="ne">ValueError</span><span class="p">(</span><span class="s2">&quot;GAUSSJ: Singular Matrix-1&quot;</span><span class="p">)</span>
    473. 

  473. 			<span class="n">ipiv</span><span class="p">[</span><span class="n">icol</span><span class="p">]</span> <span class="o">+=</span> <span class="mi">1</span>
    474. 

  474. 			<span class="k">if</span> <span class="n">irow</span> <span class="o">!=</span> <span class="n">icol</span><span class="p">:</span>
    475. 

  475. 				<span class="k">for</span> <span class="n">l</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">n</span><span class="p">):</span>
    476. 

  476. 					<span class="n">M1</span><span class="p">[</span><span class="n">irow</span><span class="p">,</span> <span class="n">l</span><span class="p">],</span> <span class="n">M1</span><span class="p">[</span><span class="n">icol</span><span class="p">,</span> <span class="n">l</span><span class="p">]</span> <span class="o">=</span> <span class="n">M1</span><span class="p">[</span><span class="n">icol</span><span class="p">,</span> <span class="n">l</span><span class="p">],</span> <span class="n">M1</span><span class="p">[</span><span class="n">irow</span><span class="p">,</span> <span class="n">l</span><span class="p">]</span>
    477. 

  477. 				<span class="n">M2</span><span class="p">[</span><span class="n">irow</span><span class="p">],</span> <span class="n">M2</span><span class="p">[</span><span class="n">icol</span><span class="p">]</span> <span class="o">=</span> <span class="n">M2</span><span class="p">[</span><span class="n">icol</span><span class="p">],</span> <span class="n">M2</span><span class="p">[</span><span class="n">irow</span><span class="p">]</span>
    478. 

  478. 			<span class="n">indxr</span><span class="p">[</span><span class="n">i</span><span class="p">]</span> <span class="o">=</span> <span class="n">irow</span>
    479. 

  479. 			<span class="n">indxc</span><span class="p">[</span><span class="n">i</span><span class="p">]</span> <span class="o">=</span> <span class="n">icol</span>
    480. 

  480. 			<span class="k">if</span> <span class="n">M1</span><span class="p">[</span><span class="n">icol</span><span class="p">,</span> <span class="n">icol</span><span class="p">]</span> <span class="o">==</span> <span class="mf">0.0</span><span class="p">:</span>
    481. 

  481. 				<span class="k">raise</span> <span class="ne">ValueError</span><span class="p">(</span><span class="s2">&quot;GAUSSJ: Singular Matrix-2&quot;</span><span class="p">)</span>
    482. 

  482. 			<span class="n">pivinv</span> <span class="o">=</span> <span class="mf">1.0</span> <span class="o">/</span> <span class="n">M1</span><span class="p">[</span><span class="n">icol</span><span class="p">,</span> <span class="n">icol</span><span class="p">]</span>
    483. 

  483. 			<span class="n">M1</span><span class="p">[</span><span class="n">icol</span><span class="p">,</span> <span class="n">icol</span><span class="p">]</span> <span class="o">=</span> <span class="mf">1.0</span>
    484. 

  484. 			<span class="k">for</span> <span class="n">l</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">n</span><span class="p">):</span>
    485. 

  485. 				<span class="n">M1</span><span class="p">[</span><span class="n">icol</span><span class="p">,</span> <span class="n">l</span><span class="p">]</span> <span class="o">*=</span> <span class="n">pivinv</span>
    486. 

  486. 			<span class="n">M2</span><span class="p">[</span><span class="n">icol</span><span class="p">]</span> <span class="o">*=</span> <span class="n">pivinv</span>
    487. 

  487. 			<span class="k">for</span> <span class="n">ll</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">n</span><span class="p">):</span>
    488. 

  488. 				<span class="k">if</span> <span class="n">ll</span> <span class="o">!=</span> <span class="n">icol</span><span class="p">:</span>
    489. 

  489. 					<span class="n">dum</span> <span class="o">=</span> <span class="n">M1</span><span class="p">[</span><span class="n">ll</span><span class="p">,</span> <span class="n">icol</span><span class="p">]</span>
    490. 

  490. 					<span class="n">M1</span><span class="p">[</span><span class="n">ll</span><span class="p">,</span> <span class="n">icol</span><span class="p">]</span> <span class="o">=</span> <span class="mf">0.0</span>
    491. 

  491. 					<span class="k">for</span> <span class="n">l</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">n</span><span class="p">):</span>
    492. 

  492. 						<span class="n">M1</span><span class="p">[</span><span class="n">ll</span><span class="p">,</span> <span class="n">l</span><span class="p">]</span> <span class="o">-=</span> <span class="n">M1</span><span class="p">[</span><span class="n">icol</span><span class="p">,</span> <span class="n">l</span><span class="p">]</span> <span class="o">*</span> <span class="n">dum</span>
    493. 

  493. 					<span class="n">M2</span><span class="p">[</span><span class="n">ll</span><span class="p">]</span> <span class="o">-=</span> <span class="n">M2</span><span class="p">[</span><span class="n">icol</span><span class="p">]</span> <span class="o">*</span> <span class="n">dum</span>
    494. 

  494. 

  495. 		<span class="k">for</span> <span class="n">l</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">n</span> <span class="o">-</span> <span class="mi">1</span><span class="p">,</span> <span class="mi">0</span><span class="p">,</span> <span class="o">-</span><span class="mi">1</span><span class="p">):</span>
    496. 

  496. 			<span class="k">if</span> <span class="n">indxr</span><span class="p">[</span><span class="n">l</span><span class="p">]</span> <span class="o">!=</span> <span class="n">indxc</span><span class="p">[</span><span class="n">l</span><span class="p">]:</span>
    497. 

  497. 				<span class="k">for</span> <span class="n">k</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">n</span><span class="p">):</span>
    498. 

  498. 					<span class="n">M1</span><span class="p">[</span><span class="n">k</span><span class="p">,</span> <span class="n">indxr</span><span class="p">[</span><span class="n">l</span><span class="p">]],</span> <span class="n">M1</span><span class="p">[</span><span class="n">k</span><span class="p">,</span> <span class="n">indxc</span><span class="p">[</span><span class="n">l</span><span class="p">]]</span> <span class="o">=</span> <span class="n">M1</span><span class="p">[</span><span class="n">k</span><span class="p">,</span> <span class="n">indxc</span><span class="p">[</span><span class="n">l</span><span class="p">]],</span> <span class="n">M1</span><span class="p">[</span><span class="n">k</span><span class="p">,</span> <span class="n">indxr</span><span class="p">[</span><span class="n">l</span><span class="p">]]</span></div></div>
    499. 

  499. 

  500. 

  501. <div class="viewcode-block" id="Matrix"><a class="viewcode-back" href="../../CBD.solver.html#CBD.solver.Matrix">[docs]</a><span class="k">class</span> <span class="nc">Matrix</span><span class="p">:</span>
    502. 

  502. 	<span class="sd">&quot;&quot;&quot;Custom, efficient matrix class. This class is used for efficiency purposes.</span>
    503. 

  503. 

  504. <span class="sd">		- Using a while/for loop is slow.</span>
    505. 

  505. <span class="sd">		- Using :class:`[[0] * n] * n` will have n references to the same list.</span>
    506. 

  506. <span class="sd">		- Using :class:`[[0] * size for _ in range(size)]` can be 5 times slower</span>
    507. 

  507. <span class="sd">		  than this class!</span>
    508. 

  508. 

  509. <span class="sd">	Numpy could be used to even further increase efficiency, but this increases the</span>
    510. 

  510. <span class="sd">	required dependencies for external hardware systems (that may not provide these options).</span>
    511. 

  511. 

  512. <span class="sd">	Note:</span>
    513. 

  513. <span class="sd">		Internally, the matrix is segmented into chunks of 500.000.000 items.</span>
    514. 

  514. <span class="sd">	&quot;&quot;&quot;</span>
    515. 

  515. 	<span class="k">def</span> <span class="fm">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">rows</span><span class="p">,</span> <span class="n">cols</span><span class="p">):</span>
    516. 

  516. 		<span class="bp">self</span><span class="o">.</span><span class="n">rows</span> <span class="o">=</span> <span class="n">rows</span>
    517. 

  517. 		<span class="bp">self</span><span class="o">.</span><span class="n">cols</span> <span class="o">=</span> <span class="n">cols</span>
    518. 

  518. 		<span class="bp">self</span><span class="o">.</span><span class="n">size</span> <span class="o">=</span> <span class="n">rows</span> <span class="o">*</span> <span class="n">cols</span>
    519. 

  519. 		<span class="bp">self</span><span class="o">.</span><span class="n">__max_list_size</span> <span class="o">=</span> <span class="mi">500</span> <span class="o">*</span> <span class="mi">1000</span> <span class="o">*</span> <span class="mi">1000</span>
    520. 

  520. 		<span class="bp">self</span><span class="o">.</span><span class="n">data</span> <span class="o">=</span> <span class="p">[[</span><span class="mi">0</span><span class="p">]</span> <span class="o">*</span> <span class="p">((</span><span class="n">rows</span> <span class="o">*</span> <span class="n">cols</span><span class="p">)</span> <span class="o">%</span> <span class="bp">self</span><span class="o">.</span><span class="n">__max_list_size</span><span class="p">)]</span>
    521. 

  521. 		<span class="k">for</span> <span class="n">r</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="bp">self</span><span class="o">.</span><span class="n">size</span> <span class="o">//</span> <span class="bp">self</span><span class="o">.</span><span class="n">__max_list_size</span><span class="p">):</span>
    522. 

  522. 			<span class="bp">self</span><span class="o">.</span><span class="n">data</span><span class="o">.</span><span class="n">append</span><span class="p">([</span><span class="mi">0</span><span class="p">]</span> <span class="o">*</span> <span class="bp">self</span><span class="o">.</span><span class="n">__max_list_size</span><span class="p">)</span>
    523. 

  523. 

  524. 	<span class="k">def</span> <span class="fm">__getitem__</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">idx</span><span class="p">):</span>
    525. 

  525. 		<span class="n">absolute</span> <span class="o">=</span> <span class="n">idx</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span> <span class="o">*</span> <span class="bp">self</span><span class="o">.</span><span class="n">cols</span> <span class="o">+</span> <span class="n">idx</span><span class="p">[</span><span class="mi">1</span><span class="p">]</span>
    526. 

  526. 		<span class="n">outer</span> <span class="o">=</span> <span class="n">absolute</span> <span class="o">//</span> <span class="bp">self</span><span class="o">.</span><span class="n">__max_list_size</span>
    527. 

  527. 		<span class="n">inner</span> <span class="o">=</span> <span class="n">absolute</span> <span class="o">%</span> <span class="bp">self</span><span class="o">.</span><span class="n">__max_list_size</span>
    528. 

  528. 		<span class="k">return</span> <span class="bp">self</span><span class="o">.</span><span class="n">data</span><span class="p">[</span><span class="n">outer</span><span class="p">][</span><span class="n">inner</span><span class="p">]</span>
    529. 

  529. 

  530. 	<span class="k">def</span> <span class="fm">__setitem__</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">idx</span><span class="p">,</span> <span class="n">value</span><span class="p">):</span>
    531. 

  531. 		<span class="n">absolute</span> <span class="o">=</span> <span class="n">idx</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span> <span class="o">*</span> <span class="bp">self</span><span class="o">.</span><span class="n">cols</span> <span class="o">+</span> <span class="n">idx</span><span class="p">[</span><span class="mi">1</span><span class="p">]</span>
    532. 

  532. 		<span class="n">outer</span> <span class="o">=</span> <span class="n">absolute</span> <span class="o">//</span> <span class="bp">self</span><span class="o">.</span><span class="n">__max_list_size</span>
    533. 

  533. 		<span class="n">inner</span> <span class="o">=</span> <span class="n">absolute</span> <span class="o">%</span> <span class="bp">self</span><span class="o">.</span><span class="n">__max_list_size</span>
    534. 

  534. 		<span class="bp">self</span><span class="o">.</span><span class="n">data</span><span class="p">[</span><span class="n">outer</span><span class="p">][</span><span class="n">inner</span><span class="p">]</span> <span class="o">=</span> <span class="n">value</span></div>
    535. 

  535. </pre></div>
    536. 

  536. 

  537.              </article>
    538. 

  538.              
    539. 

  539.             </div>
    540. 

  540.             <footer>
    541. 

  541.   
    542. 

  542. 

  543.   <hr>
    544. 

  544. 

  545.   <div role="contentinfo">
    546. 

  546.     <p>
    547. 

  547.         &copy; Copyright 2020, Randy Paredis.
    548. 

  548. 

  549.     </p>
    550. 

  550.   </div>
    551. 

  551.     
    552. 

  552.       <div>
    553. 

  553.         Built with <a href="http://sphinx-doc.org/">Sphinx</a> using a <a href="https://github.com/rtfd/sphinx_rtd_theme">theme</a> provided by <a href="https://readthedocs.org">Read the Docs</a>.
    554. 

  554.       </div>
    555. 

  555.      
    556. 

  556. 

  557. </footer>
    558. 

  558. 

  559.           </div>
    560. 

  560.         </div>
    561. 

  561. 

  562.         <div class="catalyst-content-right" id="catalyst-content-right">
    563. 

  563.           <div class="catalyst-right-menu" id="catalyst-right-menu">
    564. 

  564.             <div class="catalyst-side-scroll" id="catalyst-side-scroll-right">
    565. 

  565.               
    566. 

  566.             </div>
    567. 

  567.           </div>
    568. 

  568.         </div>
    569. 

  569.       </section>
    570. 

  570.     </div>
    571. 

  571. 

  572.   
    573. 

  573. 

  574. 

  575.   
    576. 

  576. 

  577.      
    578. 

  578.        <script type="text/javascript" id="documentation_options" data-url_root="../../" src="../../_static/documentation_options.js"></script>
    579. 

  579.          <script type="text/javascript" src="../../_static/jquery.js"></script>
    580. 

  580.          <script type="text/javascript" src="../../_static/underscore.js"></script>
    581. 

  581.          <script type="text/javascript" src="../../_static/doctools.js"></script>
    582. 

  582.          <script type="text/javascript" src="../../_static/language_data.js"></script>
    583. 

  583.          <script async="async" type="text/javascript" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.5/latest.js?config=TeX-AMS-MML_HTMLorMML"></script>
    584. 

  584.      
    585. 

  585. 

  586.   
    587. 

  587. 

  588.   <script type="text/javascript" src="../../_static/js/vendor/popper.min.js"></script>
    589. 

  589.   <script type="text/javascript" src="../../_static/js/vendor/bootstrap.min.js"></script>
    590. 

  590.   <script type="text/javascript" src="../../_static/js/theme.js"></script>
    591. 

  591. 

  592.   <script type="text/javascript">
    593. 

  593.       jQuery(function () {
    594. 

  594.           SphinxRtdTheme.Navigation.enable(true);
    595. 

  595.       });
    596. 

  596.   </script> 
    597. 

  597. 

  598.   <!-- Begin Footer -->
    599. 

  599. 

  600.   <footer class="site-footer" id="site-footer">
    601. 

  601.     <div class="container footer-container">
    602. 

  602.       <div class="footer-logo-wrapper">
    603. 

  603.         <a href="https://catalyst-team.com/" class="footer-logo"></a>
    604. 

  604.       </div>
    605. 

  605. 

  606.       <div class="footer-links-wrapper">
    607. 

  607.         <div class="footer-links-col">
    608. 

  608.           <ul>
    609. 

  609.             <li class="list-title"><a href="https://github.com/catalyst-team">Ecosystem</a></li>
    610. 

  610.             <li><a class="nav-dropdown-item" href="https://alchemy.host">Alchemy</a></li>
    611. 

  611.             <li><a class="nav-dropdown-item" href="https://github.com/catalyst-team/catalyst">Catalyst</a></li>
    612. 

  612.             <li><a class="nav-dropdown-item" href="https://github.com/catalyst-team/reaction">Reaction</a></li>
    613. 

  613.           </ul>
    614. 

  614.         </div>
    615. 

  615. 

  616.         <div class="footer-links-col">
    617. 

  617.           <ul>
    618. 

  618.             <li class="list-title"><a href="https://github.com/catalyst-team">Projects</a></li>
    619. 

  619.             <li><a class="nav-dropdown-item" href="https://github.com/catalyst-team/codestyle">Codestyle</a></li>
    620. 

  620.             <li><a class="nav-dropdown-item" href="https://github.com/catalyst-team/neuro">Catalyst.Neuro</a></li>
    621. 

  621.             <li><a class="nav-dropdown-item" href="https://github.com/catalyst-team/classification">Classification</a></li>
    622. 

  622.             <li><a class="nav-dropdown-item" href="https://github.com/catalyst-team/detection">Detection</a></li>
    623. 

  623.             <li><a class="nav-dropdown-item" href="https://github.com/catalyst-team/segmentation">Segmentation</a></li>
    624. 

  624.             <li><a class="nav-dropdown-item" href="https://github.com/catalyst-team/gan">Catalyst.GAN</a></li>
    625. 

  625.           </ul>
    626. 

  626.         </div>
    627. 

  627. 

  628.         <div class="footer-links-col">
    629. 

  629.           <ul>
    630. 

  630.             <li class="list-title"><a href="https://catalyst-team.com/">Support</a></li>
    631. 

  631.             <li><a href="https://github.com/catalyst-team/catalyst/issues" target="_blank">Github Issues</a></li>
    632. 

  632.             <li><a href="https://github.com/catalyst-team/catalyst/blob/master/CONTRIBUTING.md" target="_blank">Contributing</a></li>
    633. 

  633.             <li><a href="https://www.patreon.com/catalyst_team" target="_blank">Patreon</a></li>
    634. 

  634.           </ul>
    635. 

  635.         </div>
    636. 

  636. 

  637.         <div class="footer-links-col follow-us-col">
    638. 

  638.           <div class="footer-social-icons">
    639. 

  639.             <a href="https://t.me/catalyst_team" target="_blank" class="telegram"></a>
    640. 

  640.             <a href="https://twitter.com/catalyst_core" target="_blank" class="twitter"></a>
    641. 

  641.             <a href="https://join.slack.com/t/catalyst-team-core/shared_invite/zt-d9miirnn-z86oKDzFMKlMG4fgFdZafw" target="_blank" class="ods"></a>
    642. 

  642.           </div>
    643. 

  643.         </div>
    644. 

  644.       </div>
    645. 

  645.     </div>
    646. 

  646.   </footer>
    647. 

  647. 

  648. 

  649.   <!-- End Footer -->
    650. 

  650. 

  651.   <!-- Begin Mobile Menu -->
    652. 

  652. 

  653.   <div class="mobile-main-menu">
    654. 

  654.     <div class="container-fluid">
    655. 

  655.       <div class="container">
    656. 

  656.         <div class="mobile-main-menu-header-container">
    657. 

  657.           <a class="header-logo" href="https://catalyst-team.com/" aria-label="Catalyst"></a>
    658. 

  658.           <a class="main-menu-close-button" href="#" data-behavior="close-mobile-menu"></a>
    659. 

  659.         </div>
    660. 

  660.       </div>
    661. 

  661.     </div>
    662. 

  662. 

  663.     <div class="mobile-main-menu-links-container">
    664. 

  664.       <div class="main-menu">
    665. 

  665.         <ul>
    666. 

  666.           <li>
    667. 

  667.             <a href="">Get Started</a>
    668. 

  668.           </li>
    669. 

  669. 

  670.           <li>
    671. 

  671.             <a href="https://github.com/catalyst-team/catalyst">Github</a>
    672. 

  672.           </li>
    673. 

  673.         </ul>
    674. 

  674.       </div>
    675. 

  675.     </div>
    676. 

  676.   </div>
    677. 

  677. 

  678.   <!-- End Mobile Menu -->
    679. 

  679. 

  680.   <script type="text/javascript" src="../../_static/js/vendor/anchor.min.js"></script>
    681. 

  681. 

  682.   <script type="text/javascript">
    683. 

  683.     $(document).ready(function() {
    684. 

  684.       mobileMenu.bind();
    685. 

  685.       mobileTOC.bind();
    686. 

  686.       catalystAnchors.bind();
    687. 

  687.       sideMenus.bind();
    688. 

  688.       scrollToAnchor.bind();
    689. 

  689.       highlightNavigation.bind();
    690. 

  690.       mainMenuDropdown.bind();
    691. 

  691. 

  692.       // Add class to links that have code blocks, since we cannot create links in code blocks
    693. 

  693.       $("article.catalyst-article a span.pre").each(function(e) {
    694. 

  694.         $(this).closest("a").addClass("has-code");
    695. 

  695.       });
    696. 

  696.     })
    697. 

  697.   </script>
    698. 

  698. </body>
    699. 

  699. </html>
    700.