Search Results for ""

The second-order ordinary differential equation (d^2y)/(dx^2)-2x(dy)/(dx)+lambday=0. (1) This differential equation has an irregular singularity at infty. It can be solved ...

The second-order ordinary differential equation (d^2y)/(dx^2)+[theta_0+2sum_(n=1)^inftytheta_ncos(2nx)]y=0, (1) where theta_n are fixed constants. A general solution can be ...

A clause (i.e., a disjunction of literals) is called a Horn clause if it contains at most one positive literal. Horn clauses are usually written as L_1,...,L_n=>L(=¬L_1 v ... ...

The identity function id(x) is the function id(x)=x which assigns every real number x to the same real number x. It is identical to the identity map. The identity function is ...

Consider a second-order ordinary differential equation y^('')+P(x)y^'+Q(x)y=0. If P(x) and Q(x) remain finite at x=x_0, then x_0 is called an ordinary point. If either P(x) ...

Jacobi-Gauss quadrature, also called Jacobi quadrature or Mehler quadrature, is a Gaussian quadrature over the interval [-1,1] with weighting function ...

The Jørgensen graph is a maximally linklessly embeddable graph on 8 vertices and 21 edges, where "maximal" means it is not a proper subgraph of another linklessly embeddable ...

The complex second-order ordinary differential equation x^2y^('')+xy^'-(ix^2+nu^2)y=0 (1) (Abramowitz and Stegun 1972, p. 379; Zwillinger 1997, p. 123), whose solutions can ...

An algorithm for finding a graph's spanning tree of minimum length. It sorts the edges of a graph in order of increasing cost and then repeatedly adds edges that bridge ...

The Laplacian spectral ratio R_L(G) of a connected graph G is defined as the ratio of its Laplacian spectral radius to its algebraic connectivity. If a connected graph of ...