build based on f977ff3

previews/PR312/.documenter-siteinfo.json

@@ -1 +1 @@
-{"documenter":{"julia_version":"1.10.1","generation_timestamp":"2024-02-20T22:49:08","documenter_version":"1.2.1"}}
+{"documenter":{"julia_version":"1.10.1","generation_timestamp":"2024-02-20T22:49:10","documenter_version":"1.2.1"}}

previews/PR312/index.html

@@ -4,8 +4,8 @@
 A = rand(5,5)
 opA = LinearOperator(A)
 A[:,1] * 3 isa Vector</code></pre><pre class="documenter-example-output"><code class="nohighlight hljs ansi">true</code></pre><pre><code class="language-julia hljs">opA[:,1] * 3 isa LinearOperator</code></pre><pre class="documenter-example-output"><code class="nohighlight hljs ansi">true</code></pre><pre><code class="language-julia hljs">opA[:,1] * [3] isa Vector</code></pre><pre class="documenter-example-output"><code class="nohighlight hljs ansi">true</code></pre><p>However, the following returns an error</p><pre><code class="language-julia hljs">A[:,1] * [3]</code></pre><p>This is also true for <code>A[i,:]</code>, which would return a vector and for the scalar <code>A[i,j]</code>. Similarly, <code>opA[1,1]</code> is an operator of size (1,1):&quot;</p><pre><code class="language-julia hljs">(opA[1,1] * [3])[1] - A[1,1] * 3</code></pre><pre class="documenter-example-output"><code class="nohighlight hljs ansi">0.0</code></pre><p>In the same spirit, the operator <code>Matrix</code> always returns a matrix.</p><pre><code class="language-julia hljs">Matrix(opA[:,1])</code></pre><pre class="documenter-example-output"><code class="nohighlight hljs ansi">5×1 Matrix{Float64}:
- 0.5871036808841209
- 0.8370852648712362
- 0.5437713880962812
- 0.9264414270520932
- 0.7367044488932396</code></pre><h2 id="Other-Operators"><a class="docs-heading-anchor" href="#Other-Operators">Other Operators</a><a id="Other-Operators-1"></a><a class="docs-heading-anchor-permalink" href="#Other-Operators" title="Permalink"></a></h2><ul><li><a href="https://github.com/optimizers/lldl">LLDL</a> features a limited-memory LDLᵀ factorization operator that may be used as preconditioner in iterative methods</li><li><a href="https://github.com/JuliaSmoothOptimizers/MUMPS.jl">MUMPS.jl</a> features a full distributed-memory factorization operator that may be used to represent the preconditioner in, e.g., constraint-preconditioned Krylov methods.</li></ul><h2 id="Testing"><a class="docs-heading-anchor" href="#Testing">Testing</a><a id="Testing-1"></a><a class="docs-heading-anchor-permalink" href="#Testing" title="Permalink"></a></h2><pre><code class="language-julia hljs">julia&gt; Pkg.test(&quot;LinearOperators&quot;)</code></pre><h2 id="Bug-reports-and-discussions"><a class="docs-heading-anchor" href="#Bug-reports-and-discussions">Bug reports and discussions</a><a id="Bug-reports-and-discussions-1"></a><a class="docs-heading-anchor-permalink" href="#Bug-reports-and-discussions" title="Permalink"></a></h2><p>If you think you found a bug, feel free to open an <a href="https://github.com/JuliaSmoothOptimizers/LinearOperators.jl/issues">issue</a>. Focused suggestions and requests can also be opened as issues. Before opening a pull request, start an issue or a discussion on the topic, please.</p><p>If you want to ask a question not suited for a bug report, feel free to start a discussion <a href="https://github.com/JuliaSmoothOptimizers/Organization/discussions">here</a>. This forum is for general discussion about this repository and the <a href="https://github.com/JuliaSmoothOptimizers">JuliaSmoothOptimizers</a> organization, so questions about any of our packages are welcome.</p></article><nav class="docs-footer"><a class="docs-footer-nextpage" href="tutorial/">Tutorial »</a><div class="flexbox-break"></div><p class="footer-message">Powered by <a href="https://github.com/JuliaDocs/Documenter.jl">Documenter.jl</a> and the <a href="https://julialang.org/">Julia Programming Language</a>.</p></nav></div><div class="modal" id="documenter-settings"><div class="modal-background"></div><div class="modal-card"><header class="modal-card-head"><p class="modal-card-title">Settings</p><button class="delete"></button></header><section class="modal-card-body"><p><label class="label">Theme</label><div class="select"><select id="documenter-themepicker"><option value="documenter-light">documenter-light</option><option value="documenter-dark">documenter-dark</option><option value="auto">Automatic (OS)</option></select></div></p><hr/><p>This document was generated with <a href="https://github.com/JuliaDocs/Documenter.jl">Documenter.jl</a> version 1.2.1 on <span class="colophon-date" title="Tuesday 20 February 2024 22:49">Tuesday 20 February 2024</span>. Using Julia version 1.10.1.</p></section><footer class="modal-card-foot"></footer></div></div></div></body></html>
+ 0.019206310982412322
+ 0.123224548296336
+ 0.9219293825404171
+ 0.4970386813359313
+ 0.8953482995204856</code></pre><h2 id="Other-Operators"><a class="docs-heading-anchor" href="#Other-Operators">Other Operators</a><a id="Other-Operators-1"></a><a class="docs-heading-anchor-permalink" href="#Other-Operators" title="Permalink"></a></h2><ul><li><a href="https://github.com/optimizers/lldl">LLDL</a> features a limited-memory LDLᵀ factorization operator that may be used as preconditioner in iterative methods</li><li><a href="https://github.com/JuliaSmoothOptimizers/MUMPS.jl">MUMPS.jl</a> features a full distributed-memory factorization operator that may be used to represent the preconditioner in, e.g., constraint-preconditioned Krylov methods.</li></ul><h2 id="Testing"><a class="docs-heading-anchor" href="#Testing">Testing</a><a id="Testing-1"></a><a class="docs-heading-anchor-permalink" href="#Testing" title="Permalink"></a></h2><pre><code class="language-julia hljs">julia&gt; Pkg.test(&quot;LinearOperators&quot;)</code></pre><h2 id="Bug-reports-and-discussions"><a class="docs-heading-anchor" href="#Bug-reports-and-discussions">Bug reports and discussions</a><a id="Bug-reports-and-discussions-1"></a><a class="docs-heading-anchor-permalink" href="#Bug-reports-and-discussions" title="Permalink"></a></h2><p>If you think you found a bug, feel free to open an <a href="https://github.com/JuliaSmoothOptimizers/LinearOperators.jl/issues">issue</a>. Focused suggestions and requests can also be opened as issues. Before opening a pull request, start an issue or a discussion on the topic, please.</p><p>If you want to ask a question not suited for a bug report, feel free to start a discussion <a href="https://github.com/JuliaSmoothOptimizers/Organization/discussions">here</a>. This forum is for general discussion about this repository and the <a href="https://github.com/JuliaSmoothOptimizers">JuliaSmoothOptimizers</a> organization, so questions about any of our packages are welcome.</p></article><nav class="docs-footer"><a class="docs-footer-nextpage" href="tutorial/">Tutorial »</a><div class="flexbox-break"></div><p class="footer-message">Powered by <a href="https://github.com/JuliaDocs/Documenter.jl">Documenter.jl</a> and the <a href="https://julialang.org/">Julia Programming Language</a>.</p></nav></div><div class="modal" id="documenter-settings"><div class="modal-background"></div><div class="modal-card"><header class="modal-card-head"><p class="modal-card-title">Settings</p><button class="delete"></button></header><section class="modal-card-body"><p><label class="label">Theme</label><div class="select"><select id="documenter-themepicker"><option value="documenter-light">documenter-light</option><option value="documenter-dark">documenter-dark</option><option value="auto">Automatic (OS)</option></select></div></p><hr/><p>This document was generated with <a href="https://github.com/JuliaDocs/Documenter.jl">Documenter.jl</a> version 1.2.1 on <span class="colophon-date" title="Tuesday 20 February 2024 22:49">Tuesday 20 February 2024</span>. Using Julia version 1.10.1.</p></section><footer class="modal-card-foot"></footer></div></div></div></body></html>