</code></pre><p>(Try to) create a subdivision of interval (a,b) stored in the returned array X such that </p><ul><li><code>X[1]==a, X[end]==b</code></li><li><code>(X[2]-X[1])<=ha+tol*(b-a)</code></li><li><code>(X[end]-X[end-1])<=hb+tol*(b-a)</code></li><li>There is a number q such that <code>X[i+1]-X[i] == q*(X[i]-X[i-1])</code></li><li>X is the array with the minimal possible number of points with the above property</li></ul><p>Caveat: the algorithm behind this is tested for many cases but unproven.</p><p>Returns an Array containing the points of the subdivision.</p></div><a class="docs-sourcelink" target="_blank" href="https://github.com/WIAS-PDELib/ExtendableGrids.jl">source</a></section></details></article><article><details class="docstring" open="true"><summary id="ExtendableGrids.glue-Tuple{AbstractVector, AbstractVector}"><a class="docstring-binding" href="#ExtendableGrids.glue-Tuple{AbstractVector, AbstractVector}"><code>ExtendableGrids.glue</code></a> — <span class="docstring-category">Method</span></summary><section><div><pre><code class="language-julia hljs">c=glue(a,b)</code></pre><p>Glue together two vectors <code>a</code> and b resulting in a vector c. They last element of <code>a</code> shall be equal (up to tol) to the first element of b. The result fulfills <code>length(c)=length(a)+length(b)-1</code></p></div><a class="docs-sourcelink" target="_blank" href="https://github.com/WIAS-PDELib/ExtendableGrids.jl">source</a></section></details></article><article><details class="docstring" open="true"><summary id="ExtendableGrids.linspace-Tuple{Any, Any, Any}"><a class="docstring-binding" href="#ExtendableGrids.linspace-Tuple{Any, Any, Any}"><code>ExtendableGrids.linspace</code></a> — <span class="docstring-category">Method</span></summary><section><div><pre><code class="language-julia hljs">linspace(a, b, n) -> Any
0 commit comments