Search Results for ""
551 - 560 of 1837 for Klein Gordon EquationSearch Results
A polynomial equation whose roots all have negative real parts. For a real quadratic equation z^2+Bz+C=0, the stability conditions are B,C>0. For a real cubic equation ...
A barrel solid of revolution composed of parallel circular top and bottom with a common axis and a side formed by a smooth curve symmetrical about the midplane. The term also ...
A polynomial discriminant is the product of the squares of the differences of the polynomial roots r_i. The discriminant of a polynomial is defined only up to constant ...
Euler conjectured that at least n nth powers are required for n>2 to provide a sum that is itself an nth power. The conjecture was disproved by Lander and Parkin (1967) with ...
Gaussian elimination is a method for solving matrix equations of the form Ax=b. (1) To perform Gaussian elimination starting with the system of equations [a_(11) a_(12) ... ...
The Laplacian for a scalar function phi is a scalar differential operator defined by (1) where the h_i are the scale factors of the coordinate system (Weinberg 1972, p. 109; ...
The polar coordinates r (the radial coordinate) and theta (the angular coordinate, often called the polar angle) are defined in terms of Cartesian coordinates by x = ...
The modular equation of degree five can be written (u/v)^3+(v/u)^3=2(u^2v^2-1/(u^2v^2)).
A complete graph is a graph in which each pair of graph vertices is connected by an edge. The complete graph with n graph vertices is denoted K_n and has (n; 2)=n(n-1)/2 (the ...
The adjacency matrix, sometimes also called the connection matrix, of a simple labeled graph is a matrix with rows and columns labeled by graph vertices, with a 1 or 0 in ...
...
View search results from all Wolfram sites (23118 matches)

