Search Results for ""

A minimal surface given by the parametric equations x(u,v) = u-sinucoshv (1) y(u,v) = 1-cosucoshv (2) z(u,v) = 4sin(1/2u)sinh(1/2v) (3) (Gray 1997), or x(r,phi) = ...

A separable extension K of a field F is one in which every element's algebraic number minimal polynomial does not have multiple roots. In other words, the minimal polynomial ...

An equilibrium minimal surface for a crystal or drop which has the least anisotropic surface free energy for a given volume. It is the anisotropic analog of a sphere. In the ...

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

A (finite, circular) conical surface is a ruled surface created by fixing one end of a line segment at a point (known as the vertex or apex of the cone) and sweeping the ...

Chebyshev iteration is a method for solving nonsymmetric problems (Golub and van Loan 1996, §10.1.5; Varga, 1962, Ch. 5). Chebyshev iteration avoids the computation of inner ...

The conjugate gradient method can be applied on the normal equations. The CGNE and CGNR methods are variants of this approach that are the simplest methods for nonsymmetric ...

The conjugate gradient method can be viewed as a special variant of the Lanczos method for positive definite symmetric systems. The minimal residual method and symmetric LQ ...

A minimum dominating set is a dominating set of smallest size in a given graph. The size of a minimum dominating set is known as the domination number of the graph. A minimum ...

A branch of mathematics which attempts to formalize the nature of the set using a minimal collection of independent axioms. Unfortunately, as discovered by its earliest ...