About the Project

graphical method

AdvancedHelp

(0.001 seconds)

1—10 of 12 matching pages

1: 34.9 Graphical Method
§34.9 Graphical Method
The graphical method establishes a one-to-one correspondence between an analytic expression and a diagram by assigning a graphical symbol to each function and operation of the analytic expression. …For specific examples of the graphical method of representing sums involving the 3 j , 6 j , and 9 j symbols, see Varshalovich et al. (1988, Chapters 11, 12) and Lehman and O’Connell (1973, §3.3).
2: 10.74 Methods of Computation
Methods for obtaining initial approximations to the zeros include asymptotic expansions (§§10.21(vi)-10.21(ix)), graphical intersection of 2 D graphs in (e. …
3: 18.40 Methods of Computation
§18.40 Methods of Computation
Usually, however, other methods are more efficient, especially the numerical solution of difference equations (§3.6) and the application of uniform asymptotic expansions (when available) for OP’s of large degree. …
See accompanying text
Figure 18.40.1: Histogram approximations to the Repulsive Coulomb–Pollaczek, RCP, weight function integrated over [ 1 , x ) , see Figure 18.39.2 for an exact result, for Z = + 1 , shown for N = 12 and N = 120 . Magnify
Results similar to these appear in Langhoff et al. (1976) in methods developed for physics applications, and which includes treatments of systems with discontinuities in μ ( x ) , using what is referred to as the Stieltjes derivative which may be traced back to Stieltjes, as discussed by Deltour (1968, Eq. 12). … Further, exponential convergence in N , via the Derivative Rule, rather than the power-law convergence of the histogram methods, is found for the inversion of Gegenbauer, Attractive, as well as Repulsive, Coulomb–Pollaczek, and Hermite weights and zeros to approximate w ( x ) for these OP systems on x [ 1 , 1 ] and ( , ) respectively, Reinhardt (2018), and Reinhardt (2021b), Reinhardt (2021a). …
4: 27.17 Other Applications
Congruences are used in constructing perpetual calendars, splicing telephone cables, scheduling round-robin tournaments, devising systematic methods for storing computer files, and generating pseudorandom numbers. … Schroeder (2006) describes many of these applications, including the design of concert hall ceilings to scatter sound into broad lateral patterns for improved acoustic quality, precise measurements of delays of radar echoes from Venus and Mercury to confirm one of the relativistic effects predicted by Einstein’s theory of general relativity, and the use of primes in creating artistic graphical designs.
5: Philip J. Davis
Davis joined the Section as part of a distinguished group of researchers studying mathematical methods for exploiting the new computational power. … In 1961, Davis hired Frank W. J. Olver, a founding member of the Mathematics Division and Head of the Numerical Methods Section at the National Physical Laboratory, Teddington, U. … After receiving an overview of the project and watching a short demo that included a few preliminary colorful, but static, 3D graphs constructed for the first Chapter, “Airy and Related Functions”, written by Olver, Davis expressed the hope that designing a web-based resource would allow the team to incorporate interesting computer graphics, such as function surfaces that could be rotated and examined. This immediately led to discussions among some of the project members about what might be possible, and the discovery that some interactive graphics work had already been done for the NIST Matrix Market, a publicly available repository of test matrices for comparing the effectiveness of numerical linear algebra algorithms. Davis’s comments about our uninspired graphs sparked the research and design of techniques for creating interactive 3D visualizations of function surfaces, which grew in sophistication as our knowledge and the technology for developing 3D graphics on the web advanced over the years. …
6: Bibliography K
  • D. K. Kahaner, C. Moler, and S. Nash (1989) Numerical Methods and Software. Prentice Hall, Englewood Cliffs, N.J..
  • 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.
  • M. K. Kerimov (1999) The Rayleigh function: Theory and computational methods. Zh. Vychisl. Mat. Mat. Fiz. 39 (12), pp. 1962–2006.
  • A. D. Kerr (1978) An indirect method for evaluating certain infinite integrals. Z. Angew. Math. Phys. 29 (3), pp. 380–386.
  • V. B. Kuznetsov (1992) Equivalence of two graphical calculi. J. Phys. A 25 (22), pp. 6005–6026.
  • 7: Mathematical Introduction
    In addition, there is a comprehensive account of the great variety of analytical methods that are used for deriving and applying the extremely important asymptotic properties of the special functions, including double asymptotic properties (Chapter 2 and §§10.41(iv), 10.41(v)). …
    Graphics
    Special functions with one real variable are depicted graphically with conventional two-dimensional (2D) line graphs. … All of the special function chapters contain sections that describe available methods for computing the main functions in the chapter, and most also provide references to numerical tables of, and approximations for, these functions. …
    8: 9.19 Approximations
  • Martín et al. (1992) provides two simple formulas for approximating Ai ( x ) to graphical accuracy, one for < x 0 , the other for 0 x < .

  • Corless et al. (1992) describe a method of approximation based on subdividing into a triangular mesh, with values of Ai ( z ) , Ai ( z ) stored at the nodes. Ai ( z ) and Ai ( z ) are then computed from Taylor-series expansions centered at one of the nearest nodes. The Taylor coefficients are generated by recursion, starting from the stored values of Ai ( z ) , Ai ( z ) at the node. Similarly for Bi ( z ) , Bi ( z ) .

  • 9: 3.11 Approximation Techniques
    A method for obtaining a sufficiently accurate first approximation is described in the next subsection. … For details and examples of these methods, see Clenshaw (1957, 1962) and Miller (1966). … The method of the fast Fourier transform (FFT) exploits the structure of the matrix 𝛀 with elements ω n j k , j , k = 0 , 1 , , n 1 . … In computer graphics a special type of spline is used which produces a Bézier curve. …
    10: 18.39 Applications in the Physical Sciences
    §18.39(iii) Non Classical Weight Functions of Utility in DVR Method in the Physical Sciences
    Shizgal (2015) gives a broad overview of techniques and applications of spectral and pseudo-spectral methods to problems arising in theoretical chemistry, chemical kinetics, transport theory, and astrophysics. … Shizgal (2015, Chapter 2), contains a broad-ranged discussion of methods and applications for these, and other, non-classical weight functions. …
    §18.39(iv) Coulomb–Pollaczek Polynomials and J-Matrix Methods
    The technique to accomplish this follows the DVR idea, in which methods are based on finding tridiagonal representations of the co-ordinate, x . …