TOPICS
Search

Search Results for ""


241 - 250 of 308 for Schur DecompositionSearch Results
A square matrix that does not have a matrix inverse. A matrix is singular iff its determinant is 0. For example, there are 10 singular 2×2 (0,1)-matrices: [0 0; 0 0],[0 0; 0 ...
The n-sunlet graph is the graph on 2n vertices obtained by attaching n pendant edges to a cycle graph C_n (ISGCI), i.e., the coronas C_n circledot K_1 (Frucht 1979). Sunlet ...
The thin plate spline is the two-dimensional analog of the cubic spline in one dimension. It is the fundamental solution to the biharmonic equation, and has the form ...
Underdamped simple harmonic motion is a special case of damped simple harmonic motion x^..+betax^.+omega_0^2x=0 (1) in which beta^2-4omega_0^2<0. (2) Since we have ...
A well-covered graph is a graph for which every minimal vertex cover has the same size, which is equivalent to every maximal independent vertex set being the same size. It is ...
The Ramsey number R(m,n) gives the solution to the party problem, which asks the minimum number of guests R(m,n) that must be invited so that at least m will know each other ...
The word "algebra" is a distortion of the Arabic title of a treatise by al-Khwārizmī about algebraic methods. In modern usage, algebra has several meanings. One use of the ...
Combinatorics is the branch of mathematics studying the enumeration, combination, and permutation of sets of elements and the mathematical relations that characterize their ...
If there is an integer 0<x<p such that x^2=q (mod p), (1) i.e., the congruence (1) has a solution, then q is said to be a quadratic residue (mod p). Note that the trivial ...
A complete graph is a graph in which each pair of graph vertices is connected by an edge. The complete graph with n graph vertices is denoted K_n and has (n; 2)=n(n-1)/2 (the ...
1 ... 22|23|24|25|26|27|28 ... 31 Previous Next

...