TOPICS
Search

Search Results for ""


151 - 160 of 279 for Hessenberg DecompositionSearch Results
The inverse of a square matrix A, sometimes called a reciprocal matrix, is a matrix A^(-1) such that AA^(-1)=I, (1) where I is the identity matrix. Courant and Hilbert (1989, ...
In algebraic topology, the Reidemeister torsion is a notion originally introduced as a topological invariant of 3-manifolds which has now been widely adapted to a variety of ...
The treewidth is a measure of the count of original graph vertices mapped onto any tree vertex in an optimal tree decomposition. Determining the treewidth of an arbitrary ...
Given a Taylor series f(z)=sum_(n=0)^inftyC_nz^n=sum_(n=0)^inftyC_nr^ne^(intheta), (1) where the complex number z has been written in the polar form z=re^(itheta), examine ...
A measure lambda is absolutely continuous with respect to another measure mu if lambda(E)=0 for every set with mu(E)=0. This makes sense as long as mu is a positive measure, ...
A number n is called a barrier of a number-theoretic function f(m) if, for all m<n, m+f(m)<=n. Neither the totient function phi(n) nor the divisor function sigma(n) has a ...
A CW-complex is a homotopy-theoretic generalization of the notion of a simplicial complex. A CW-complex is any space X which can be built by starting off with a discrete ...
A composite knot is a knot that is not a prime knot. Schubert (1949) showed that every knot can be uniquely decomposed (up to the order in which the decomposition is ...
The ratio C of the largest to smallest singular value in the singular value decomposition of a matrix. The base-b logarithm of C is an estimate of how many base-b digits are ...
A cryptographic hash function is most commonly one of the following: a one-way hash function, a collision-free hash function, a trapdoor one-way hash function, or a function ...
1 ... 13|14|15|16|17|18|19 ... 28 Previous Next

...