Skip to content

Commit f9cf65f

Browse files
committed
deploy: 49e5b0b
1 parent 8f1e161 commit f9cf65f

5 files changed

Lines changed: 89 additions & 1 deletion

File tree

genindex.html

Lines changed: 4 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -110,7 +110,11 @@ <h2 id="L">L</h2>
110110
<table style="width: 100%" class="indextable genindextable"><tr>
111111
<td style="width: 33%; vertical-align: top;"><ul>
112112
<li><a href="pyclassify.html#pyclassify.Lanczos_PRO">Lanczos_PRO() (in module pyclassify)</a>
113+
114+
<ul>
115+
<li><a href="pyclassify.html#pyclassify.EigenSolver.Lanczos_PRO">(pyclassify.EigenSolver method)</a>
113116
</li>
117+
</ul></li>
114118
</ul></td>
115119
</tr></table>
116120

index.html

Lines changed: 42 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -90,6 +90,48 @@ <h1>Module Documentation<a class="headerlink" href="#module-documentation" title
9090
Eigen_value_calculator (if the user is only interested in the computation of the eigenvalues)
9191
or QR_algorithm, if eigenvectors are needed as well.</p>
9292
<p>We refer the interested reader to their implementation in C++ for further details.</p>
93+
<dl class="py method">
94+
<dt class="sig sig-object py">
95+
<span class="sig-name descname"><span class="pre">Lanczos_PRO</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">A</span></span><span class="o"><span class="pre">=</span></span><span class="default_value"><span class="pre">None</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">q</span></span><span class="o"><span class="pre">=</span></span><span class="default_value"><span class="pre">None</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">m</span></span><span class="o"><span class="pre">=</span></span><span class="default_value"><span class="pre">None</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">tol</span></span><span class="o"><span class="pre">=</span></span><span class="default_value"><span class="pre">np.float64(1.4901161193847656e-08)</span></span></em><span class="sig-paren">)</span></dt>
96+
<dd><p>Perform the Lanczos algorithm for symmetric matrices.</p>
97+
<p>This function computes an orthogonal matrix Q and tridiagonal matrix T such that
98+
.. math:: <cite>A approx Q T Q^T,</cite>
99+
where A is a symmetric matrix. The algorithm is useful for finding a few eigenvalues and eigenvectors
100+
of large symmetric matrices.</p>
101+
<dl class="field-list simple">
102+
<dt class="field-odd">Parameters<span class="colon">:</span></dt>
103+
<dd class="field-odd"><ul class="simple">
104+
<li><p><strong>A</strong> (<em>np.ndarray</em>) – A symmetric square matrix of size n x n.</p></li>
105+
<li><p><strong>q</strong> (<em>np.ndarray</em><em>, </em><em>optional</em>) – Initial vector of size n. Default value is None (a random one is created).</p></li>
106+
<li><p><strong>m</strong> (<em>int</em><em>, </em><em>optional</em>) – Number of eigenvalues to compute. Must be less than or equal to n.
107+
If None, defaults to the size of A.</p></li>
108+
<li><p><strong>tol</strong> (<em>float</em><em>, </em><em>optional</em>) – Tolerance for orthogonality checks (default is sqrt(machine epsilon)).</p></li>
109+
</ul>
110+
</dd>
111+
<dt class="field-even">Returns<span class="colon">:</span></dt>
112+
<dd class="field-even"><p><dl class="simple">
113+
<dt>A tuple (Q, alpha, beta) where:</dt><dd><ul class="simple">
114+
<li><p>Q (np.ndarray): Orthogonal matrix of size n x m.</p></li>
115+
<li><p>alpha (np.ndarray): Vector of size m containing the diagonal elements of the tridiagonal matrix.</p></li>
116+
<li><p>beta (np.ndarray): Vector of size m-1 containing the off-diagonal elements of the tridiagonal matrix.</p></li>
117+
</ul>
118+
</dd>
119+
</dl>
120+
</p>
121+
</dd>
122+
<dt class="field-odd">Return type<span class="colon">:</span></dt>
123+
<dd class="field-odd"><p>tuple</p>
124+
</dd>
125+
<dt class="field-even">Raises<span class="colon">:</span></dt>
126+
<dd class="field-even"><ul class="simple">
127+
<li><p><strong>TypeError</strong> – If the input is not a NumPy array or SciPy/CuPy sparse matrix.</p></li>
128+
<li><p><strong>ValueError</strong> – If number of rows != number of columns or the matrix is not symmetric or it m is
129+
greater than the size of A.</p></li>
130+
</ul>
131+
</dd>
132+
</dl>
133+
</dd></dl>
134+
93135
<dl class="py method">
94136
<dt class="sig sig-object py">
95137
<span class="sig-name descname"><span class="pre">compute_eigenval</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">diag</span></span><span class="o"><span class="pre">=</span></span><span class="default_value"><span class="pre">None</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">off_diag</span></span><span class="o"><span class="pre">=</span></span><span class="default_value"><span class="pre">None</span></span></em><span class="sig-paren">)</span></dt>

objects.inv

3 Bytes
Binary file not shown.

pyclassify.html

Lines changed: 42 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -50,6 +50,48 @@ <h1>PyClassify Module Documentation<a class="headerlink" href="#pyclassify-modul
5050
Eigen_value_calculator (if the user is only interested in the computation of the eigenvalues)
5151
or QR_algorithm, if eigenvectors are needed as well.</p>
5252
<p>We refer the interested reader to their implementation in C++ for further details.</p>
53+
<dl class="py method">
54+
<dt class="sig sig-object py" id="pyclassify.EigenSolver.Lanczos_PRO">
55+
<span class="sig-name descname"><span class="pre">Lanczos_PRO</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">A</span></span><span class="o"><span class="pre">=</span></span><span class="default_value"><span class="pre">None</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">q</span></span><span class="o"><span class="pre">=</span></span><span class="default_value"><span class="pre">None</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">m</span></span><span class="o"><span class="pre">=</span></span><span class="default_value"><span class="pre">None</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">tol</span></span><span class="o"><span class="pre">=</span></span><span class="default_value"><span class="pre">np.float64(1.4901161193847656e-08)</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#pyclassify.EigenSolver.Lanczos_PRO" title="Link to this definition"></a></dt>
56+
<dd><p>Perform the Lanczos algorithm for symmetric matrices.</p>
57+
<p>This function computes an orthogonal matrix Q and tridiagonal matrix T such that
58+
.. math:: <cite>A approx Q T Q^T,</cite>
59+
where A is a symmetric matrix. The algorithm is useful for finding a few eigenvalues and eigenvectors
60+
of large symmetric matrices.</p>
61+
<dl class="field-list simple">
62+
<dt class="field-odd">Parameters<span class="colon">:</span></dt>
63+
<dd class="field-odd"><ul class="simple">
64+
<li><p><strong>A</strong> (<em>np.ndarray</em>) – A symmetric square matrix of size n x n.</p></li>
65+
<li><p><strong>q</strong> (<em>np.ndarray</em><em>, </em><em>optional</em>) – Initial vector of size n. Default value is None (a random one is created).</p></li>
66+
<li><p><strong>m</strong> (<em>int</em><em>, </em><em>optional</em>) – Number of eigenvalues to compute. Must be less than or equal to n.
67+
If None, defaults to the size of A.</p></li>
68+
<li><p><strong>tol</strong> (<em>float</em><em>, </em><em>optional</em>) – Tolerance for orthogonality checks (default is sqrt(machine epsilon)).</p></li>
69+
</ul>
70+
</dd>
71+
<dt class="field-even">Returns<span class="colon">:</span></dt>
72+
<dd class="field-even"><p><dl class="simple">
73+
<dt>A tuple (Q, alpha, beta) where:</dt><dd><ul class="simple">
74+
<li><p>Q (np.ndarray): Orthogonal matrix of size n x m.</p></li>
75+
<li><p>alpha (np.ndarray): Vector of size m containing the diagonal elements of the tridiagonal matrix.</p></li>
76+
<li><p>beta (np.ndarray): Vector of size m-1 containing the off-diagonal elements of the tridiagonal matrix.</p></li>
77+
</ul>
78+
</dd>
79+
</dl>
80+
</p>
81+
</dd>
82+
<dt class="field-odd">Return type<span class="colon">:</span></dt>
83+
<dd class="field-odd"><p>tuple</p>
84+
</dd>
85+
<dt class="field-even">Raises<span class="colon">:</span></dt>
86+
<dd class="field-even"><ul class="simple">
87+
<li><p><strong>TypeError</strong> – If the input is not a NumPy array or SciPy/CuPy sparse matrix.</p></li>
88+
<li><p><strong>ValueError</strong> – If number of rows != number of columns or the matrix is not symmetric or it m is
89+
greater than the size of A.</p></li>
90+
</ul>
91+
</dd>
92+
</dl>
93+
</dd></dl>
94+
5395
<dl class="py method">
5496
<dt class="sig sig-object py" id="pyclassify.EigenSolver.compute_eigenval">
5597
<span class="sig-name descname"><span class="pre">compute_eigenval</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">diag</span></span><span class="o"><span class="pre">=</span></span><span class="default_value"><span class="pre">None</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">off_diag</span></span><span class="o"><span class="pre">=</span></span><span class="default_value"><span class="pre">None</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#pyclassify.EigenSolver.compute_eigenval" title="Link to this definition"></a></dt>

0 commit comments

Comments
 (0)