About the Project

least%20squares

AdvancedHelp

(0.002 seconds)

11—20 of 205 matching pages

11: 26.13 Permutations: Cycle Notation
Given a permutation σ 𝔖 n , the inversion number of σ , denoted inv ( σ ) , is the least number of adjacent transpositions required to represent σ . …
12: 20 Theta Functions
Chapter 20 Theta Functions
13: 10.75 Tables
  • Achenbach (1986) tabulates J 0 ( x ) , J 1 ( x ) , Y 0 ( x ) , Y 1 ( x ) , x = 0 ( .1 ) 8 , 20D or 18–20S.

  • Makinouchi (1966) tabulates all values of j ν , m and y ν , m in the interval ( 0 , 100 ) , with at least 29S. These are for ν = 0 ( 1 ) 5 , 10, 20; ν = 3 2 , 5 2 ; ν = m / n with m = 1 ( 1 ) n 1 and n = 3 ( 1 ) 8 , except for ν = 1 2 .

  • Bickley et al. (1952) tabulates x n I n ( x ) or e x I n ( x ) , x n K n ( x ) or e x K n ( x ) , n = 2 ( 1 ) 20 , x = 0 (.01 or .1) 10(.1) 20, 8S; I n ( x ) , K n ( x ) , n = 0 ( 1 ) 20 , x = 0 or 0.1 ( .1 ) 20 , 10S.

  • Kerimov and Skorokhodov (1984b) tabulates all zeros of the principal values of K n ( z ) and K n ( z ) , for n = 2 ( 1 ) 20 , 9S.

  • Zhang and Jin (1996, p. 322) tabulates ber x , ber x , bei x , bei x , ker x , ker x , kei x , kei x , x = 0 ( 1 ) 20 , 7S.

  • 14: 36.5 Stokes Sets
    In the following subsections, only Stokes sets involving at least one real saddle are included unless stated otherwise. …
    36.5.4 80 x 5 40 x 4 55 x 3 + 5 x 2 + 20 x 1 = 0 ,
    36.5.7 X = 9 20 + 20 u 4 Y 2 20 u 2 + 6 u 2 sign ( z ) ,
    15: 3.8 Nonlinear Equations
    Bisection of this interval is used to decide where at least one zero is located. …
    3.8.15 p ( x ) = ( x 1 ) ( x 2 ) ( x 20 )
    Consider x = 20 and j = 19 . We have p ( 20 ) = 19 ! and a 19 = 1 + 2 + + 20 = 210 . …
    3.8.16 d x d a 19 = 20 19 19 ! = ( 4.30 ) × 10 7 .
    16: 4.48 Software
    All scientific programming languages, libraries, and systems support computation of at least some of the elementary functions in standard floating-point arithmetic (§3.1(i)). …
    17: 32.8 Rational Solutions
    32.8.3 w ( z ; 3 ) = 3 z 2 z 3 + 4 6 z 2 ( z 3 + 10 ) z 6 + 20 z 3 80 ,
    32.8.4 w ( z ; 4 ) = 1 z + 6 z 2 ( z 3 + 10 ) z 6 + 20 z 3 80 9 z 5 ( z 3 + 40 ) z 9 + 60 z 6 + 11200 .
    Q 3 ( z ) = z 6 + 20 z 3 80 ,
    where n , a = ε 1 2 α , b = ε 2 2 β , c = ε 3 2 γ , and d = ε 4 1 2 δ , with ε j = ± 1 , j = 1 , 2 , 3 , 4 , independently, and at least one of a , b , c or d is an integer. …
    18: 11.13 Methods of Computation
    For numerical purposes the most convenient of the representations given in §11.5, at least for real variables, include the integrals (11.5.2)–(11.5.5) for 𝐊 ν ( z ) and 𝐌 ν ( z ) . … To insure stability the integration path must be chosen so that as we proceed along it the wanted solution grows in magnitude at least as rapidly as the complementary solutions. …
    19: 27.17 Other Applications
    Apostol and Zuckerman (1951) uses congruences to construct magic squares. …
    20: 27.13 Functions
    The basic problem is that of expressing a given positive integer n as a sum of integers from some prescribed set S whose members are primes, squares, cubes, or other special integers. …
    §27.13(iv) Representation by Squares
    For a given integer k 2 the function r k ( n ) is defined as the number of solutions of the equation … Jacobi (1829) notes that r 2 ( n ) is the coefficient of x n in the square of the theta function ϑ ( x ) : … For more than 8 squares, Milne’s identities are not the same as those obtained earlier by Mordell and others.