From 116ba25595da32837620469e6fe37c219bfba61b Mon Sep 17 00:00:00 2001 From: Wolfgang Dautermann Date: Wed, 23 Mar 2022 23:44:41 +0100 Subject: [PATCH] Fix some typos. --- doc/info/Series.texi | 2 +- doc/info/Simplification.texi | 2 +- doc/info/quantum_computing.texi | 2 +- share/cobyla/cobyla-interface.lisp | 2 +- share/descriptive/descriptive.mac | 12 ++++++------ share/integequations/inteqn.mac | 2 +- share/misc/seqopt.dem | 2 +- share/pdiff/history.txt | 6 +++--- share/solve_rec/solve_rec.mac | 2 +- share/stats/stats.mac | 2 +- share/tensor/itensor.lisp | 2 +- tests/rtest_hypgeo.mac | 4 ++-- 12 files changed, 20 insertions(+), 20 deletions(-) diff --git a/doc/info/Series.texi b/doc/info/Series.texi index 201cf19c6..0c480ec49 100644 --- a/doc/info/Series.texi +++ b/doc/info/Series.texi @@ -1413,7 +1413,7 @@ on the interval @code{[-p, p]}. @closecatbox @end deffn -@c NEES EXPANSION. WHAT IS THE ARGUMENT l ?? +@c NEEDS EXPANSION. WHAT IS THE ARGUMENT l ?? @c ----------------------------------------------------------------------------- @anchor{foursimp} diff --git a/doc/info/Simplification.texi b/doc/info/Simplification.texi index 5a37e5ce9..82b6d0fb8 100644 --- a/doc/info/Simplification.texi +++ b/doc/info/Simplification.texi @@ -11,7 +11,7 @@ @c ----------------------------------------------------------------------------- Maxima interacts with the user through a cycle of actions called the read-eval-print loop (REPL). This consists of three steps: reading and parsing, evaluating and simplifying, -and outputing. Parsing converts a syntactically valid sequence of typed characters into +and outputting. Parsing converts a syntactically valid sequence of typed characters into a internal data structure. Evaluation replaces variable and function names with their values and simplification rewrites expressions to be easier for the user or other programs to understand. Output diff --git a/doc/info/quantum_computing.texi b/doc/info/quantum_computing.texi index aa7ee2783..3617870d2 100644 --- a/doc/info/quantum_computing.texi +++ b/doc/info/quantum_computing.texi @@ -101,7 +101,7 @@ shown in the output. @fname{gate} (@var{U}, @var{q}, @var{i1}, @dots{}, @var{im}) @var{U} must be a matrix acting on states of @var{m} qubits; @var{q} a -list correspondig to a state of @var{n} qubits (@var{n} >= @var{m}); +list corresponding to a state of @var{n} qubits (@var{n} >= @var{m}); @var{i} and the @var{m} numbers @var{i1}, @dots{}, @var{im} must be different integers between 1 and @var{n}. diff --git a/share/cobyla/cobyla-interface.lisp b/share/cobyla/cobyla-interface.lisp index 1cbec75ff..4cb4b9549 100644 --- a/share/cobyla/cobyla-interface.lisp +++ b/share/cobyla/cobyla-interface.lisp @@ -15,7 +15,7 @@ ;; COBYLA always calls CALCFC to compute the function value and the ;; constraint equations. But we want to be able to specify different ;; versions. So, COBYLA calls CALCFC, which then calls *CALCFC* to -;; do the real compuation. +;; do the real computation. (defun cobyla::calcfc (n m x f con) (declare (ignore f)) (funcall maxima::*calcfc* n m x con)) diff --git a/share/descriptive/descriptive.mac b/share/descriptive/descriptive.mac index 075ab938c..c7d12e27b 100644 --- a/share/descriptive/descriptive.mac +++ b/share/descriptive/descriptive.mac @@ -96,8 +96,8 @@ Multivariate descriptive statistics: mean variance generalized variance generalized standard deviation - efective variance - efective standard deviation + effective variance + effective standard deviation list_correlations: gives a list with precision matrix multiple correlation coefficients @@ -647,8 +647,8 @@ cov1(x):=block([n:length(x)], cov(x)*n/(n-1))$ /* 2) mean variance */ /* 3) generalized variance */ /* 4) generalized standard deviation */ -/* 5) efective variance */ -/* 6) efective standard deviation */ +/* 5) effective variance */ +/* 6) effective standard deviation */ /* Admits the following options: */ /* 'data='true: x stores sampled data and the covariance matrix 'cov1' */ /* must be computed; if false, x is the covariance matrix and 'cov1' */ @@ -680,8 +680,8 @@ global_variances(x,[select]):= out:endcons(aux,out), /* generalized variance */ out:endcons(sqrt(aux),out), /* generalized standard deviation */ aux:aux^(1/p), - out:endcons(aux,out), /* efective variance */ - out:endcons(sqrt(aux),out), /* efective standard deviation */ + out:endcons(aux,out), /* effective variance */ + out:endcons(sqrt(aux),out), /* effective standard deviation */ out ) else error("global_variances: the argument is not a matrix") )$ diff --git a/share/integequations/inteqn.mac b/share/integequations/inteqn.mac index 223d78040..06177bb6c 100644 --- a/share/integequations/inteqn.mac +++ b/share/integequations/inteqn.mac @@ -364,7 +364,7 @@ flfrnk2nd():=block([frlist, unklist, ueqnlist, eqno, %c], globals: eqno (current number of subscripted unknowns %c), ueqnlist (list of equations relating %c's) unklist (list of all %c unknowns to be solved for) - xvar (indepedent variable) */ + xvar (independent variable) */ fconvert(fun):= if mapatom(fun) then fun else if opr(fun)#'?%integrate then map('fconvert, fun) else diff --git a/share/misc/seqopt.dem b/share/misc/seqopt.dem index b5ee49c89..8e3b344f3 100644 --- a/share/misc/seqopt.dem +++ b/share/misc/seqopt.dem @@ -86,7 +86,7 @@ sequence_optim_prefix:'optim; sequence_optim_counter:1$ sequence_optimize(eqns3); /* Notice that SEQUENCE_OPTIMIZE was able to use the multi-level information - in OPTIM_EQUIVS("optb6(k)" at top level, with "optb1(k)", etc. imbedded one + in OPTIM_EQUIVS("optb6(k)" at top level, with "optb1(k)", etc. embedded one level). Note also the new value of OPTIM_EQUIVS: */ optim_equivs; /* Had it been useful to retain the previous value of OPTIM_EQUIVS, we diff --git a/share/pdiff/history.txt b/share/pdiff/history.txt index 75bd9f20a..b67587c70 100644 --- a/share/pdiff/history.txt +++ b/share/pdiff/history.txt @@ -76,10 +76,10 @@ loads mactex. 9 August 2002 -1. Started an experimental version of pdiff; serveral option +1. Started an experimental version of pdiff; several option variables control the way positional deriviates are converted to tex. Now, tex-mexpt also needs to be -modifed. When finished, this will be version 1.3. +modified. When finished, this will be version 1.3. 2. Added a new user-level function pderivop; this makes it possible to do several useful things. See the source @@ -117,4 +117,4 @@ Changed version to 1.2.1. 28 July 2002 -First announcement of pdiff of Maxima list, version 1.2. \ No newline at end of file +First announcement of pdiff of Maxima list, version 1.2. diff --git a/share/solve_rec/solve_rec.mac b/share/solve_rec/solve_rec.mac index 8979e3f1d..aa873cd42 100644 --- a/share/solve_rec/solve_rec.mac +++ b/share/solve_rec/solve_rec.mac @@ -1054,7 +1054,7 @@ simplify_product(prod) := block( /* Take care of fractions. */ else if part(term, 0)="/" then block( [nu : num(term), de : denom(term)], - /* Check for cancelations. */ + /* Check for cancellations. */ for %kk:-deg thru deg do block( [g], g : gcd(expand(subst(%n+%kk, %n, nu)), de), diff --git a/share/stats/stats.mac b/share/stats/stats.mac index 7ba12d1b6..0422012ae 100644 --- a/share/stats/stats.mac +++ b/share/stats/stats.mac @@ -1007,7 +1007,7 @@ block([numer:stats_numer, options, defaults, aux, phat, method, statistic, /* 'x1' and 'n1>=x1', are the number of successes and total number of trials in */ /* the first sample, respectively; and the third and fourth arguments, */ /* 'x2' and 'n2>=x2', are the corresponding numbers in the second sample. */ -/* This is an asymptotic test which requieres n1 and n2 to be both >= 10, */ +/* This is an asymptotic test which requires n1 and n2 to be both >= 10, */ /* and both samples are considered independent. */ /* It admits the following options: */ /* 'alternative='twosided: this is the alternative hypothesis H1; valid */ diff --git a/share/tensor/itensor.lisp b/share/tensor/itensor.lisp index 54701c073..649e5dfca 100644 --- a/share/tensor/itensor.lisp +++ b/share/tensor/itensor.lisp @@ -1476,7 +1476,7 @@ (set *linelabel* f))) (defun ishow (f) - ((lambda (foobar) ;FOOBAR intialized to NIL + ((lambda (foobar) ;FOOBAR initialized to NIL (cond ((atom f) f) ((rpobj f) ;If an indexed object ... (setq foobar diff --git a/tests/rtest_hypgeo.mac b/tests/rtest_hypgeo.mac index 0a86d4afe..05b055dcd 100644 --- a/tests/rtest_hypgeo.mac +++ b/tests/rtest_hypgeo.mac @@ -1297,7 +1297,7 @@ gamma_incomplete(nu+1,a*s)*s^(-nu-1)*%e^(a*s); With gamma_incomplete(-v,a*s) = gamma(-v,a*s) - gamma_incomplete_lower(-v,a*s) and gamma(v+1) = v * gamma(v) - the result of Maxima can be shown to be equivalent ot the + the result of Maxima can be shown to be equivalent of the tabulated result: a^nu*gamma(nu+1)*e^(a*s)*gamma_incomplete(-nu,a*s); */ @@ -1812,7 +1812,7 @@ radcan(specint(%e^(-s*t)*bessel_j(nu,a*t),t)); a^nu/(sqrt(s^2+a^2)*(sqrt(s^2+a^2)+s)^nu); /* Problem 232: No. 03 (OK) - Thats the same result as Problem 233, because Maxima don't distinguish + That's the same result as Problem 233, because Maxima don't distinguish real and integer order of the Bessel function. But we have a problem with a factor 1/2, see Problem 86. I think EqWorld is wrong. -- 2.11.4.GIT