About the Project

Gram%E2%80%93Schmidt%20procedure

AdvancedHelp

(0.003 seconds)

1—10 of 139 matching pages

1: 3.11 Approximation Techniques
A more efficient procedure is as follows. … A general procedure is to approximate F by a rational function R (vanishing at infinity) and then approximate f by r = 1 R . … A set of functions ϕ 0 ( x ) , ϕ 1 ( x ) , , ϕ n ( x ) that is linearly independent on the set x 1 , x 2 , , x J (compare (3.11.36)) can always be orthogonalized in the sense given in the preceding paragraph by the GramSchmidt procedure; see Gautschi (1997a). …
2: 27.2 Functions
Euclid’s Elements (Euclid (1908, Book IX, Proposition 20)) gives an elegant proof that there are infinitely many primes. …
Table 27.2.1: Primes.
n p n p n + 10 p n + 20 p n + 30 p n + 40 p n + 50 p n + 60 p n + 70 p n + 80 p n + 90
Table 27.2.2: Functions related to division.
n ϕ ( n ) d ( n ) σ ( n ) n ϕ ( n ) d ( n ) σ ( n ) n ϕ ( n ) d ( n ) σ ( n ) n ϕ ( n ) d ( n ) σ ( n )
5 4 2 6 18 6 6 39 31 30 2 32 44 20 6 84
7 6 2 8 20 8 6 42 33 20 4 48 46 22 4 72
11 10 2 12 24 8 8 60 37 36 2 38 50 20 6 93
3: Bibliography H
  • P. I. Hadži (1973) The Laplace transform for expressions that contain a probability function. Bul. Akad. Štiince RSS Moldoven. 1973 (2), pp. 78–80, 93 (Russian).
  • P. I. Hadži (1976a) Expansions for the probability function in series of Čebyšev polynomials and Bessel functions. Bul. Akad. Štiince RSS Moldoven. 1976 (1), pp. 77–80, 96 (Russian).
  • P. I. Hadži (1976b) Integrals that contain a probability function of complicated arguments. Bul. Akad. Štiince RSS Moldoven. 1976 (1), pp. 80–84, 96 (Russian).
  • P. I. Hadži (1978) Sums with cylindrical functions that reduce to the probability function and to related functions. Bul. Akad. Shtiintse RSS Moldoven. 1978 (3), pp. 80–84, 95 (Russian).
  • D. R. Hartree (1936) Some properties and applications of the repeated integrals of the error function. Proc. Manchester Lit. Philos. Soc. 80, pp. 85–102.
  • 4: Bibliography K
  • K. W. J. Kadell (1994) A proof of the q -Macdonald-Morris conjecture for B C n . Mem. Amer. Math. Soc. 108 (516), pp. vi+80.
  • E. H. Kaufman and T. D. Lenker (1986) Linear convergence and the bisection algorithm. Amer. Math. Monthly 93 (1), pp. 48–51.
  • R. B. Kearfott, M. Dawande, K. Du, and C. Hu (1994) Algorithm 737: INTLIB: A portable Fortran 77 interval standard-function library. ACM Trans. Math. Software 20 (4), pp. 447–459.
  • M. K. Kerimov (1980) Methods of computing the Riemann zeta-function and some generalizations of it. USSR Comput. Math. and Math. Phys. 20 (6), pp. 212–230.
  • Koornwinder (website) Tom Koornwinder’s Personal Collection of Maple Procedures
  • 5: Bibliography
  • M. J. Ablowitz and H. Segur (1977) Exact linearization of a Painlevé transcendent. Phys. Rev. Lett. 38 (20), pp. 1103–1106.
  • D. E. Amos, S. L. Daniel, and M. K. Weston (1977) Algorithm 511: CDC 6600 subroutines IBESS and JBESS for Bessel functions I ν ( x ) and J ν ( x ) , x 0 , ν 0 . ACM Trans. Math. Software 3 (1), pp. 93–95.
  • D. E. Amos (1990) Algorithm 683: A portable FORTRAN subroutine for exponential integrals of a complex argument. ACM Trans. Math. Software 16 (2), pp. 178–182.
  • G. E. Andrews, R. Askey, and R. Roy (1999) Special Functions. Encyclopedia of Mathematics and its Applications, Vol. 71, Cambridge University Press, Cambridge.
  • M. J. Atia, A. Martínez-Finkelshtein, P. Martínez-González, and F. Thabet (2014) Quadratic differentials and asymptotics of Laguerre polynomials with varying complex parameters. J. Math. Anal. Appl. 416 (1), pp. 52–80.
  • 6: Bibliography D
  • K. Dilcher (1987b) Irreducibility of certain generalized Bernoulli polynomials belonging to quadratic residue class characters. J. Number Theory 25 (1), pp. 72–80.
  • B. Döring (1966) Complex zeros of cylinder functions. Math. Comp. 20 (94), pp. 215–222.
  • B. A. Dubrovin (1981) Theta functions and non-linear equations. Uspekhi Mat. Nauk 36 (2(218)), pp. 11–80 (Russian).
  • T. M. Dunster (1997) Error analysis in a uniform asymptotic expansion for the generalised exponential integral. J. Comput. Appl. Math. 80 (1), pp. 127–161.
  • T. M. Dunster (2001b) Uniform asymptotic expansions for Charlier polynomials. J. Approx. Theory 112 (1), pp. 93–133.
  • 7: 8.23 Statistical Applications
    In queueing theory the Erlang loss function is used, which can be expressed in terms of the reciprocal of Q ( a , x ) ; see Jagerman (1974) and Cooper (1981, pp. 80, 316–319). …
    8: 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 ,
    9: 26.13 Permutations: Cycle Notation
    10: 26.6 Other Lattice Path Numbers
    Table 26.6.1: Delannoy numbers D ( m , n ) .
    m n
    10 1 21 221 1561 8361 36365 1 34245 4 33905 12 56465 33 17445 80 97453
    Table 26.6.3: Narayana numbers N ( n , k ) .
    n k
    5 0 1 10 20 10 1