Search Results for ""

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

The free module of rank n over a nonzero unit ring R, usually denoted R^n, is the set of all sequences {a_1,a_2,...,a_n} that can be formed by picking n (not necessarily ...

The Fuhrmann triangle of a reference triangle DeltaABC is the triangle DeltaF_CF_BF_A formed by reflecting the mid-arc points arcM_A, arcM_B, arcM_C about the lines AB, AC, ...

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) ... ...

Let kappa_1 and kappa_2 be the principal curvatures, then their mean H=1/2(kappa_1+kappa_2) (1) is called the mean curvature. Let R_1 and R_2 be the radii corresponding to ...

Given a function f(x) of a variable x tabulated at m values y_1=f(x_1), ..., y_m=f(x_m), assume the function is of known analytic form depending on n parameters ...

If all the diagonals--including those obtained by "wrapping around" the edges--of a magic square sum to the same magic constant, the square is said to be a panmagic square ...

Let k be a field of finite characteristic p. Then a polynomial P(x) in k[x] is said to be additive iff P(a)+P(b)=P(a+b) for {a,b,a+b} subset k. For example, P(x)=x^2+x+4 is ...

The word adjoint has a number of related meanings. In linear algebra, it refers to the conjugate transpose and is most commonly denoted A^(H). The analogous concept applied ...

The algebraic connectivity of a graph is the numerically second smallest eigenvalue (counting multiple eigenvalues separately) of the Laplacian matrix of a graph G. In other ...