Search Results for ""

The Delannoy numbers D(a,b) are the number of lattice paths from (0,0) to (b,a) in which only east (1, 0), north (0, 1), and northeast (1, 1) steps are allowed (i.e., ->, ^, ...

Orthogonal polynomials are classes of polynomials {p_n(x)} defined over a range [a,b] that obey an orthogonality relation int_a^bw(x)p_m(x)p_n(x)dx=delta_(mn)c_n, (1) where ...

The biconjugate gradient stabilized (BCGSTAB) method was developed to solve nonsymmetric linear systems while avoiding the often irregular convergence patterns of the ...

A chordal graph is a simple graph in which every graph cycle of length four and greater has a cycle chord. In other words, a chordal graph is a graph possessing no chordless ...

There are several definitions of the strength of a graph. Harary and Palmer (1959) and Harary and Palmer (1973, p. 66) define the strength of a tree as the maximum number of ...

The word quadrature has (at least) three incompatible meanings. Integration by quadrature either means solving an integral analytically (i.e., symbolically in terms of known ...

The Roman surface, also called the Steiner surface (not to be confused with the class of Steiner surfaces of which the Roman surface is a particular case), is a quartic ...

The tangential triangle is the triangle DeltaT_AT_BT_C formed by the lines tangent to the circumcircle of a given triangle DeltaABC at its vertices. It is therefore antipedal ...

A polynomial form which is the sum of two polynomial forms involving separate sets of variables.

Ruffini's rule a shortcut method for dividing a polynomial by a linear factor of the form x-a which can be used in place of the standard long division algorithm. This method ...