[genius] Wed Apr 24 15:54:44 2013 Jiri (George) Lebl <jirka 5z com>
- From: George Lebl <jirka src gnome org>
- To: commits-list gnome org
- Cc:
- Subject: [genius] Wed Apr 24 15:54:44 2013 Jiri (George) Lebl <jirka 5z com>
- Date: Wed, 24 Apr 2013 23:18:38 +0000 (UTC)
commit 33b2bcfee08b5da6d5576221e523ea6e2ba28ec6
Author: Jiri (George) Lebl <jirka 5z com>
Date: Wed Apr 24 15:55:04 2013 -0500
Wed Apr 24 15:54:44 2013 Jiri (George) Lebl <jirka 5z com>
* help/Makefile.am: fix compile
* help/C/genius.xml: fix some english issues
ChangeLog | 6 +++++
help/C/genius.xml | 10 ++++----
help/Makefile.am | 3 +-
help/genius.txt | 61 +++++++++++++++++++++++++++-------------------------
4 files changed, 44 insertions(+), 36 deletions(-)
---
diff --git a/ChangeLog b/ChangeLog
index 230258f..da3c603 100644
--- a/ChangeLog
+++ b/ChangeLog
@@ -1,3 +1,9 @@
+Wed Apr 24 15:54:44 2013 Jiri (George) Lebl <jirka 5z com>
+
+ * help/Makefile.am: fix compile
+
+ * help/C/genius.xml: fix some english issues
+
Wed Apr 24 15:36:52 2013 Jiri (George) Lebl <jirka 5z com>
* src/graphing.c: more sane precision computations especially when
diff --git a/help/C/genius.xml b/help/C/genius.xml
index ab104e9..0b1c3df 100644
--- a/help/C/genius.xml
+++ b/help/C/genius.xml
@@ -1604,7 +1604,7 @@ different from <literal>=</literal> because it never gets translated to a
<term><synopsis>a.'</synopsis></term>
<listitem>
<para>
- Matrix transpose, does not conjugate the entries. That is, the
+ Matrix transpose, does not conjugate the entries. That is,
the i,j element of <varname>a</varname> becomes the j,i element of <userinput>a.'</userinput>.
</para>
</listitem>
@@ -2482,7 +2482,7 @@ First the program looks for the installed library file (the compiled version <fi
<filename>~/.geniusinit</filename>.
</para>
<para>
-If you ever change the library its installed place, you’ll have to
+If you ever change the library in its installed place, you’ll have to
first compile it with <command>genius --compile loader.gel > lib.cgel</command>
</para>
</sect1>
@@ -5631,7 +5631,7 @@ number of columns times the number of rows.</para>
<term>AuxiliaryUnitMatrix</term>
<listitem>
<synopsis>AuxiliaryUnitMatrix (n)</synopsis>
- <para>Get the auxiliary unit matrix of size <varname>n</varname>. This is a square matrix matrix
with that is all zero except the
+ <para>Get the auxiliary unit matrix of size <varname>n</varname>. This is a square matrix with
that is all zero except the
superdiagonal being all ones. It is the Jordan block matrix of one zero eigenvalue.</para>
<para>
See
@@ -7014,7 +7014,7 @@ computed by numerical integration using
<term>NumericalFourierCosineSeriesCoefficients</term>
<listitem>
<synopsis>NumericalFourierCosineSeriesCoefficients (f,L,N)</synopsis>
- <para>Return a vector of coefficients of the
+ <para>Return a vector of coefficients of
the cosine Fourier series of
<function>f</function> with half-period <varname>L</varname>. That is,
we take <function>f</function> defined on <userinput>[0,L]</userinput>
@@ -7058,7 +7058,7 @@ computed by numerical integration using
<term>NumericalFourierSineSeriesCoefficients</term>
<listitem>
<synopsis>NumericalFourierSineSeriesCoefficients (f,L,N)</synopsis>
- <para>Return a vector of coefficients of the
+ <para>Return a vector of coefficients of
the sine Fourier series of
<function>f</function> with half-period <varname>L</varname>. That is,
we take <function>f</function> defined on <userinput>[0,L]</userinput>
diff --git a/help/Makefile.am b/help/Makefile.am
index a409c27..3eb356d 100644
--- a/help/Makefile.am
+++ b/help/Makefile.am
@@ -10,8 +10,7 @@ DOC_FIGURES = figures/parametric.png \
figures/parametric_graph.png \
figures/surface_graph.png
-DOC_ENTITIES = gel-function-list.xml \
- legal.xml
+DOC_ENTITIES = legal.xml
DOC_LINGUAS = cs de es fr ru
diff --git a/help/genius.txt b/help/genius.txt
index 282e4fc..1fc562e 100644
--- a/help/genius.txt
+++ b/help/genius.txt
@@ -1209,8 +1209,7 @@ a'
a.'
Matrix transpose, does not conjugate the entries. That
- is, the the i,j element of a becomes the j,i element of
- a.'.
+ is, the i,j element of a becomes the j,i element of a.'.
a@(b,c)
@@ -1884,7 +1883,7 @@ GEL Startup Procedure
looks into the current directory, and then it tries to load an
uncompiled file called ~/.geniusinit.
- If you ever change the the library its installed place, you’ll
+ If you ever change the library in its installed place, you’ll
have to first compile it with genius --compile loader.gel >
lib.cgel
__________________________________________________________
@@ -4280,7 +4279,7 @@ Linear Algebra
AuxiliaryUnitMatrix (n)
Get the auxiliary unit matrix of size n. This is a
- square matrix matrix with that is all zero except the
+ square matrix with that is all zero except the
superdiagonal being all ones. It is the Jordan block
matrix of one zero eigenvalue.
@@ -5344,9 +5343,9 @@ NumericalFourierSeriesFunction (f,L,N)
NumericalFourierCosineSeriesCoefficients (f,L,N)
- Return a vector of coefficients of the the cosine
- Fourier series of f with half-period L. That is, we take
- f defined on [0,L] take the even periodic extension and
+ Return a vector of coefficients of the cosine Fourier
+ series of f with half-period L. That is, we take f
+ defined on [0,L] take the even periodic extension and
compute the Fourier series, which only has cosine terms.
The series is computed up to the Nth harmonic. The
coefficients are computed by numerical integration using
@@ -5374,7 +5373,7 @@ NumericalFourierCosineSeriesFunction (f,L,N)
NumericalFourierSineSeriesCoefficients (f,L,N)
- Return a vector of coefficients of the the sine Fourier
+ Return a vector of coefficients of the sine Fourier
series of f with half-period L. That is, we take f
defined on [0,L] take the odd periodic extension and
compute the Fourier series, which only has sine terms.
@@ -5755,29 +5754,31 @@ EulersMethodFull (f,x0,y0,x1,n)
FindRootBisection (f,a,b,TOL,N)
- Find root of a function using the bisection method. TOL
- is the desired tolerance and N is the limit on the
- number of iterations to run, 0 means no limit. The
- function returns a vector [success,value,iteration],
- where success is a boolean indicating success, value is
- the last value computed, and iteration is the number of
- iterations done.
+ Find root of a function using the bisection method. a
+ and b are the initial guess interval, f(a) and f(b)
+ should have opposite signs. TOL is the desired tolerance
+ and N is the limit on the number of iterations to run, 0
+ means no limit. The function returns a vector
+ [success,value,iteration], where success is a boolean
+ indicating success, value is the last value computed,
+ and iteration is the number of iterations done.
FindRootFalsePosition
FindRootFalsePosition (f,a,b,TOL,N)
Find root of a function using the method of false
- position. TOL is the desired tolerance and N is the
- limit on the number of iterations to run, 0 means no
- limit. The function returns a vector
+ position. a and b are the initial guess interval, f(a)
+ and f(b) should have opposite signs. TOL is the desired
+ tolerance and N is the limit on the number of iterations
+ to run, 0 means no limit. The function returns a vector
[success,value,iteration], where success is a boolean
indicating success, value is the last value computed,
and iteration is the number of iterations done.
FindRootMullersMethod
-FindRootMullersMethod (f,x1,x2,x3,TOL,N)
+FindRootMullersMethod (f,x0,x1,x2,TOL,N)
Find root of a function using the Muller's method. TOL
is the desired tolerance and N is the limit on the
@@ -5791,13 +5792,14 @@ FindRootMullersMethod (f,x1,x2,x3,TOL,N)
FindRootSecant (f,a,b,TOL,N)
- Find root of a function using the secant method. TOL is
- the desired tolerance and N is the limit on the number
- of iterations to run, 0 means no limit. The function
- returns a vector [success,value,iteration], where
- success is a boolean indicating success, value is the
- last value computed, and iteration is the number of
- iterations done.
+ Find root of a function using the secant method. a and b
+ are the initial guess interval, f(a) and f(b) should
+ have opposite signs. TOL is the desired tolerance and N
+ is the limit on the number of iterations to run, 0 means
+ no limit. The function returns a vector
+ [success,value,iteration], where success is a boolean
+ indicating success, value is the last value computed,
+ and iteration is the number of iterations done.
PolynomialRoots
@@ -6736,11 +6738,12 @@ About Genius Mathematics Tool
visit the Genius Web page.
To report a bug or make a suggestion regarding this application
- or this manual, follow the directions in this document.
+ or this manual, send email to me (the author) or post to the
+ mailing list (see the web page).
This program is distributed under the terms of the GNU General
Public license as published by the Free Software Foundation;
- either version 2 of the License, or (at your option) any later
+ either version 3 of the License, or (at your option) any later
version. A copy of this license can be found at this link, or
in the file COPYING included with the source code of this
program.
@@ -6748,5 +6751,5 @@ About Genius Mathematics Tool
Jiří Lebl was during various parts of the development partially
supported for the work by NSF grant DMS 0900885, the University
of Illinois at Urbana-Champaign, the University of California
- at San Diego and the University of Wisconsin-Madison. The
+ at San Diego, and the University of Wisconsin-Madison. The
software has been used for both teaching and research.
[
Date Prev][
Date Next] [
Thread Prev][
Thread Next]
[
Thread Index]
[
Date Index]
[
Author Index]