interesting links2009-03-26T18:31:24+01:00https://roland.iwasno.net/links/https://roland.iwasno.net/links/https://roland.iwasno.net/links/Polynomial Root Finders (Rice DSP)https://roland.iwasno.net/links/?Bw_YvA2009-03-26T18:31:24+01:00The algorithm of Lang and Frenzel Author: Markus Lang Polynomial Root Finder is a reliable and fast C program (+Matlab gateway) for finding all roots of a complex polynomial. The algorithms of Fox, Lindsey, Burrus, Sitton, and Treitel These algorithms are used to find the roots and unwrapped phase of real coefficient polynomials.<br>(<a href="https://roland.iwasno.net/links/?Bw_YvA">Permalink</a>)An introduction to Axiom (5): Graphics Alasdairs musingshttps://roland.iwasno.net/links/?AD3u4w2009-02-13T16:41:20+01:00Fifth in a series of blog articles describing the Computer Algebra System Axiom.<br>(<a href="https://roland.iwasno.net/links/?AD3u4w">Permalink</a>)Sage: Open Source Mathematics Softwarehttps://roland.iwasno.net/links/?J4Bj1w2008-09-02T10:59:16+02:00Sage is a free mathematics software system licensed under the GPL. It combines the power of many existing open-source packages into a common Python-based interface. Mission: Creating a viable free open source alternative to Magma, Maple, Mathematica and Matlab.<br>(<a href="https://roland.iwasno.net/links/?J4Bj1w">Permalink</a>)Sage DVD by William Stein, et al. (Software) in Educationalhttps://roland.iwasno.net/links/?rABY4g2008-09-02T10:53:19+02:00Sage is a viable free open source alternative to Magma, Maple, Mathematica, and Matlab. It is a computational environment for doing calculations will all kinds of Math, from elementary arithmetic to cutting-edge research. Full source code and binaries for all major systems, plus documentation. For more information, see <a href="http://sagemath.org" rel="nofollow">http://sagemath.org</a> Version 3.0.2, released May 24, 2008.<br>(<a href="https://roland.iwasno.net/links/?rABY4g">Permalink</a>)Down with Determinants!https://roland.iwasno.net/links/?Fl1sHA2008-04-25T19:16:28+02:00Abstract: This paper shows how linear algebra can be done better without determinants. The standard proof that a square matrix of complex numbers has an eigenvalue uses determinants. The simpler and clearer proof presented here provides more insight and avoids determinants. Without using determinants, this allows us to define the multiplicity of an eigenvalue and to prove that the number of eigenvalues, counting multiplicities, equals the dimension of the underlying space. Without using determinants, we can define the characteristic and minimal polynomials and then prove that they behave as expected. This leads to an easy proof that every matrix is similar to a nice upper-triangular one. Turning to inner product spaces, and still without mentioning determinants, this paper gives a simple proof of the finite-dimensional spectral theorem.<br />
<br />
This paper was published in the American Mathematical Monthly 102 (1995), 139-154.<br />
In 1996 this paper received the Lester R. Ford Award for expository writing from the Mathematical Association of America.<br>(<a href="https://roland.iwasno.net/links/?Fl1sHA">Permalink</a>)MathAction FrontPagehttps://roland.iwasno.net/links/?RWZKCg2008-01-20T14:13:01+01:00New Axiom home page.<br>(<a href="https://roland.iwasno.net/links/?RWZKCg">Permalink</a>)Maxima Manualhttps://roland.iwasno.net/links/?FLE9og2006-10-03T21:00:37+02:00On-line manual for the Maxima Computer Algebra System<br>(<a href="https://roland.iwasno.net/links/?FLE9og">Permalink</a>)A Computational Introduction to Number Theory and Algebrahttps://roland.iwasno.net/links/?3Ycjiw2006-09-25T16:15:06+02:00A book introducing basic concepts from computational number theory and algebra, including all the necessary mathematical background. Available as PDF under a creative commons license and as book from Cambridge University Press. (Recommended by Mark Wooding).<br>(<a href="https://roland.iwasno.net/links/?3Ycjiw">Permalink</a>)