Search Results for ""

A root-finding algorithm which converges to a complex root from any starting position. To motivate the formula, consider an nth order polynomial and its derivatives, P_n(x) = ...

Given a 111×111 (0,1)-matrix, fill 11 spaces in each row in such a way that all columns also have 11 spaces filled. Furthermore, each pair of rows must have exactly one ...

A second-order ordinary differential equation arising in the study of stellar interiors, also called the polytropic differential equations. It is given by ...

Using the notation of Byerly (1959, pp. 252-253), Laplace's equation can be reduced to (1) where alpha = cint_c^lambda(dlambda)/(sqrt((lambda^2-b^2)(lambda^2-c^2))) (2) = ...

In spherical coordinates, the scale factors are h_r=1, h_theta=rsinphi, h_phi=r, and the separation functions are f_1(r)=r^2, f_2(theta)=1, f_3(phi)=sinphi, giving a Stäckel ...

A lattice-ordered set is a poset (L,<=) in which each two-element subset {a,b} has an infimum, denoted inf{a,b}, and a supremum, denoted sup{a,b}. There is a natural ...

An algebra <L; ^ , v > is called a lattice if L is a nonempty set, ^ and v are binary operations on L, both ^ and v are idempotent, commutative, and associative, and they ...

In functional analysis, the Lax-Milgram theorem is a sort of representation theorem for bounded linear functionals on a Hilbert space H. The result is of tantamount ...

The term "(a,b)-leaper" (sometimes explicitly called a "single-pattern leaper") describes a fairy chess piece such as a knight that may make moves which simultaneously change ...

The second solution Q_l(x) to the Legendre differential equation. The Legendre functions of the second kind satisfy the same recurrence relation as the Legendre polynomials. ...