Dr. Erik Postma: New Applications
http://www.maplesoft.com/applications/author.aspx?mid=94808
en-us2015 Maplesoft, A Division of Waterloo Maple Inc.Maplesoft Document SystemFri, 09 Oct 2015 17:49:04 GMTFri, 09 Oct 2015 17:49:04 GMTNew applications published by Dr. Erik Postmahttp://www.mapleprimes.com/images/mapleapps.gifDr. Erik Postma: New Applications
http://www.maplesoft.com/applications/author.aspx?mid=94808
Generating random numbers efficiently
http://www.maplesoft.com/applications/view.aspx?SID=153662&ref=Feed
Generating (pseudo-)random values is a frequent task in simulations and other programs. For some situations, you want to generate some combinatorial or algebraic values, such as a list or a polynomial; in other situations, you need random numbers, from a distribution that is uniform or more complicated. In this article I'll talk about all of these situations.<img src="/view.aspx?si=153662/thumb.jpg" alt="Generating random numbers efficiently" align="left"/>Generating (pseudo-)random values is a frequent task in simulations and other programs. For some situations, you want to generate some combinatorial or algebraic values, such as a list or a polynomial; in other situations, you need random numbers, from a distribution that is uniform or more complicated. In this article I'll talk about all of these situations.153662Mon, 18 Aug 2014 04:00:00 ZDr. Erik PostmaDr. Erik PostmaBeauty Clinic
http://www.maplesoft.com/applications/view.aspx?SID=97879&ref=Feed
<div>
<p>This is the implementation of an algorithm described in a paper by Rob Corless, Erik Postma and David Stoutemyer, entitled <em>Rounding coefficients and artificially underflowing terms in non-numeric</em> <em>expressions</em> and currently submitted for publication.</p>
<p>The algorithm takes a uni- or multivariate polynomial <em>p</em>(<em>z</em>), typically with approximate coefficients, and returns a polynomial <em>q</em>(<em>z</em>) such that |<em>p</em>(<em>z</em>) - <em>q</em>(<em>z</em>)|/|<em>p</em>(<em>z</em>)| is very small for all complex <em>z</em>, yet <em>q</em> may have fewer digits in its coefficients than <em>p</em> and even fewer terms overall. This makes the polynomial easier to deal with and to gain insight into for humans, while not affecting the polynomial as a complex function.</p>
</div><img src="/view.aspx?si=97879/maple_icon.jpg" alt="Beauty Clinic" align="left"/><div>
<p>This is the implementation of an algorithm described in a paper by Rob Corless, Erik Postma and David Stoutemyer, entitled <em>Rounding coefficients and artificially underflowing terms in non-numeric</em> <em>expressions</em> and currently submitted for publication.</p>
<p>The algorithm takes a uni- or multivariate polynomial <em>p</em>(<em>z</em>), typically with approximate coefficients, and returns a polynomial <em>q</em>(<em>z</em>) such that |<em>p</em>(<em>z</em>) - <em>q</em>(<em>z</em>)|/|<em>p</em>(<em>z</em>)| is very small for all complex <em>z</em>, yet <em>q</em> may have fewer digits in its coefficients than <em>p</em> and even fewer terms overall. This makes the polynomial easier to deal with and to gain insight into for humans, while not affecting the polynomial as a complex function.</p>
</div>97879Sat, 16 Oct 2010 04:00:00 ZRob Corless, David StoutemyerRob Corless, David Stoutemyer