When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Clebsch–Gordan coefficients - Wikipedia

    en.wikipedia.org/wiki/Clebsch–Gordan_coefficients

    The lower sign in the recursion relation can be used to find all the Clebsch–Gordan coefficients with M = J − 1. Repeated use of that equation gives all coefficients. This procedure to find the Clebsch–Gordan coefficients shows that they are all real in the Condon–Shortley phase convention.

  3. Table of Clebsch–Gordan coefficients - Wikipedia

    en.wikipedia.org/wiki/Table_of_Clebsch–Gordan...

    This is a table of Clebsch–Gordan coefficients used for adding angular momentum values in quantum mechanics. The overall sign of the coefficients for each set of constant j 1 {\displaystyle j_{1}} , j 2 {\displaystyle j_{2}} , j {\displaystyle j} is arbitrary to some degree and has been fixed according to the Condon–Shortley and Wigner sign ...

  4. Legendre polynomials - Wikipedia

    en.wikipedia.org/wiki/Legendre_polynomials

    The Legendre polynomials were first introduced in 1782 by Adrien-Marie Legendre [3] as the coefficients in the expansion of the Newtonian potential | ′ | = + ′ ′ ⁡ = = ′ + (⁡), where r and r′ are the lengths of the vectors x and x′ respectively and γ is the angle between those two vectors.

  5. Spherical harmonics - Wikipedia

    en.wikipedia.org/wiki/Spherical_harmonics

    The expansion coefficients are the analogs of Fourier coefficients, and can be obtained by multiplying the above equation by the complex conjugate of a spherical harmonic, integrating over the solid angle Ω, and utilizing the above orthogonality relationships. This is justified rigorously by basic Hilbert space theory.

  6. Zernike polynomials - Wikipedia

    en.wikipedia.org/wiki/Zernike_polynomials

    Hence, coefficients can also be found by solving a linear system, for instance by matrix inversion. Fast algorithms to calculate the forward and inverse Zernike transform use symmetry properties of trigonometric functions, separability of radial and azimuthal parts of Zernike polynomials, and their rotational symmetries.

  7. Pauli matrices - Wikipedia

    en.wikipedia.org/wiki/Pauli_matrices

    All three of the Pauli matrices can be compacted into a single expression: = (+), where the solution to i 2 = −1 is the "imaginary unit", and δ jk is the Kronecker delta, which equals +1 if j = k and 0 otherwise.

  8. Orthogonal coordinates - Wikipedia

    en.wikipedia.org/wiki/Orthogonal_coordinates

    A conformal map acting on a rectangular grid. Note that the orthogonality of the curved grid is retained. While vector operations and physical laws are normally easiest to derive in Cartesian coordinates, non-Cartesian orthogonal coordinates are often used instead for the solution of various problems, especially boundary value problems, such as those arising in field theories of quantum ...

  9. Polynomial interpolation - Wikipedia

    en.wikipedia.org/wiki/Polynomial_interpolation

    For example, given a = f(x) = a 0 x 0 + a 1 x 1 + ··· and b = g(x) = b 0 x 0 + b 1 x 1 + ···, the product ab is a specific value of W(x) = f(x)g(x). One may easily find points along W(x) at small values of x, and interpolation based on those points will yield the terms of W(x) and the specific product ab. As fomulated in Karatsuba ...