Find link

language:

Find link is a tool written by Edward Betts.

searching for Q-matrix 48 found (52 total)

alternate case: q-matrix

Neighbor joining (2,881 words) [view diff] no match in snippet view article find links to article

step one has to build and search a Q {\displaystyle Q} matrix. Initially the Q {\displaystyle Q} matrix is size n × n {\displaystyle n\times n} , then the

Berlekamp's algorithm (1,759 words) [view diff] no match in snippet view article find links to article

In mathematics, particularly computational algebra, Berlekamp's algorithm is a well-known method for factoring polynomials over finite fields (also known

Schur complement (2,895 words) [view diff] no match in snippet view article find links to article

M={\begin{bmatrix}A&B\\C&D\end{bmatrix}}} so that M is a (p + q) × (p + q) matrix. If D is invertible, then the Schur complement of the block D of the matrix

Q-guidance (1,099 words) [view diff] no match in snippet view article find links to article

{\frac {dV_{\text{TBG}}}{dt}}=-a_{\text{T}}-QV_{\text{TBG}},} where the Q matrix is defined by Q = ∂ V c ∂ r | r T , t f , {\displaystyle Q=\left.{\frac

Cross-covariance (1,365 words) [view diff] no match in snippet view article find links to article

{T}}} , the cross-covariance would be a p × q {\displaystyle p\times q} matrix K X Y {\displaystyle \operatorname {K} _{XY}} (often denoted cov ⁡ ( X

Continuous-time Markov chain (4,241 words) [view diff] exact match in snippet view article find links to article

for i ≠ j {\displaystyle i\neq j} where the parameters are given by the Q-matrix Q = ( q i , j ) {\displaystyle Q=(q_{i,j})} [ − 6 3 3 4 − 12 8 15 3 − 18

Substitution model (8,834 words) [view diff] no match in snippet view article find links to article

i ≠ j is the rate at which base i goes to base j. The diagonals of the Q matrix are chosen so that the rows sum to zero: Q i i = − ∑ { j ∣ j ≠ i } Q i

Kronecker product (6,085 words) [view diff] no match in snippet view article find links to article

Zehfuss was due to Kurt Hensel. If A is an m × n matrix and B is a p × q matrix, then the Kronecker product A ⊗ B is the pm × qn block matrix: A ⊗ B =

Fischer's inequality (957 words) [view diff] no match in snippet view article find links to article

M:=\left[{\begin{matrix}A&B\\B^{*}&C\end{matrix}}\right]} so that M is a (p+q)×(p+q) matrix. Then Fischer's inequality states that det ( M ) ≤ det ( A ) det ( C )

Incidence matrix (1,287 words) [view diff] no match in snippet view article find links to article

hypergraph. The incidence matrix of an incidence structure C is a p × q matrix B (or its transpose), where p and q are the number of points and lines

Correlation function (913 words) [view diff] no match in snippet view article find links to article

vector with n elements and Y(t) is a vector with q elements, then an n×q matrix of correlation functions is defined with i , j {\displaystyle i,j} element

QR decomposition (4,727 words) [view diff] no match in snippet view article find links to article

decomposition at each node in the forward pass, and re-constitute the Q matrix in the backward pass. The binary tree structure aims at decreasing the

Birth process (1,329 words) [view diff] exact match in snippet view article find links to article

(CTMC) ( X t , t ≥ 0 ) {\displaystyle (X_{t},t\geq 0)} with the non-zero Q-matrix entries q n , n + 1 = λ n = − q n , n {\displaystyle q_{n,n+1}=\lambda

Commutation matrix (1,541 words) [view diff] no match in snippet view article find links to article

commute the Kronecker product: for every m × n matrix A and every r × q matrix B, K ( r , m ) ( A ⊗ B ) K ( n , q ) = B ⊗ A . {\displaystyle \mathbf {K}

Transition-rate matrix (536 words) [view diff] exact match in snippet view article find links to article

In probability theory, a transition-rate matrix (also known as a Q-matrix, intensity matrix, or infinitesimal generator matrix) is an array of numbers

Ordinary least squares (9,129 words) [view diff] no match in snippet view article find links to article

{\displaystyle A\colon \quad Q^{\operatorname {T} }\beta =c,\,} where Q is a p×q matrix of full rank, and c is a q×1 vector of known constants, where q < p. In

Models of DNA evolution (6,331 words) [view diff] no match in snippet view article find links to article

we are given a starting (ancestral) state at one position, the model's Q matrix and a branch length expressing the expected number of changes to have occurred

Quadrupole (2,470 words) [view diff] no match in snippet view article find links to article

}\right)} relative to the coordinate system origin, the components of the Q matrix are defined by: Q i j = ∑ ℓ q ℓ ( 3 r i ℓ r j ℓ − ‖ r ℓ ‖ 2 δ i j ) . {\displaystyle

Conference matrix (1,931 words) [view diff] no match in snippet view article find links to article

matrix of order n = q + 1. The matrix is obtained by taking for S the q × q matrix that has a +1 in position (i, j ) and −1 in position (j, i) if there is

RV coefficient (816 words) [view diff] no match in snippet view article find links to article

corner and Π {\displaystyle \Pi } is the p × q {\displaystyle p\times q} matrix ( I p 0 p × ( q − p ) ) {\displaystyle (I_{p}\ 0_{p\times (q-p)})}

Guidance system (1,923 words) [view diff] no match in snippet view article find links to article

missile guidance (and associated equations of motion) in the matrix Q. The Q matrix represents the partial derivatives of the velocity with respect to the

Bayesian multivariate linear regression (2,737 words) [view diff] no match in snippet view article find links to article

n {\displaystyle m\times n} matrix by a p × q {\displaystyle p\times q} matrix to generate an m p × n q {\displaystyle mp\times nq} matrix, consisting

Dilution of precision (navigation) (2,224 words) [view diff] no match in snippet view article

Q}}\\\end{aligned}}} Notice GDOP is the square root of the trace of the Q {\displaystyle Q} matrix. The horizontal and vertical dilution of precision, HDOP = σ n 2 + σ e

Nonnegative rank (linear algebra) (741 words) [view diff] exact match in snippet view article

A is equal to the smallest number q such there exists a nonnegative m×q-matrix B and a nonnegative q×n-matrix C such that A = BC (the usual matrix product)

Inertial navigation system (5,954 words) [view diff] no match in snippet view article find links to article

missile guidance (and associated equations of motion) in the matrix Q. The Q matrix represents the partial derivatives of the velocity with respect to the

Paley construction (1,496 words) [view diff] no match in snippet view article find links to article

χ(3) = χ(5) = χ(6) = −1. The Jacobsthal matrix Q for GF(q) is the q × q matrix with rows and columns indexed by elements of GF(q) such that the entry

Arrangement of hyperplanes (1,806 words) [view diff] exact match in snippet view article find links to article

these variables are specialized to be all value q, then this is called the q-matrix (over the Euclidean domain Q [ q ] {\displaystyle \mathbb {Q} [q]} ) for

Matrix calculus (7,065 words) [view diff] no match in snippet view article find links to article

x}}\\\end{bmatrix}}.} The derivative of a scalar function y, with respect to a p×q matrix X of independent variables, is given (in numerator layout notation) by

Potts model (3,645 words) [view diff] no match in snippet view article find links to article

{\mbox{Fix}}\,\tau ^{n}=\{s\in Q^{\mathbf {Z} }:\tau ^{n}s=s\}} The q × q matrix A is the adjacency matrix specifying which neighboring spin values are

Attention (machine learning) (3,409 words) [view diff] no match in snippet view article

calculations matches all tokens of the K matrix with all tokens of the Q matrix; therefore the roles of these vectors are symmetric. Possibly because the

Category of matrices (865 words) [view diff] no match in snippet view article find links to article

and m {\displaystyle m} columns. Given a p × q {\displaystyle p\times q} matrix B {\displaystyle B} , we can form the matrix multiplication B A {\displaystyle

Thinking Schools Academy Trust (496 words) [view diff] exact match in snippet view article find links to article

Thinking Maps Thinking Hats Thinkers’ Keys Habits of Mind CoRT Thinking Tools Q-matrix SMART targeting Growth mindsets Philosophy for Children It is an objective

K q-flats (2,218 words) [view diff] no match in snippet view article find links to article

on R. Let B k {\displaystyle B_{k}} be a d × q {\displaystyle d\times q} matrix, where columns of B k {\displaystyle B_{k}} are basis of the k-th flat

Thinking School (441 words) [view diff] exact match in snippet view article find links to article

Thinking Maps Thinking Hats Thinkers’ Keys Habits of Mind CoRT Thinking Tools Q-matrix SMART targeting Growth mindsets Philosophy for Children They were worked

Inverse element (4,478 words) [view diff] no match in snippet view article find links to article

m×n matrix (that is, a matrix with m rows and n columns), and B is a p×q matrix, the product AB is defined if n = p, and only in this case. An identity

Cohen–Macaulay ring (3,118 words) [view diff] no match in snippet view article find links to article

local ring S by the ideal I generated by the r × r minors of some p × q matrix of elements of S. If the codimension (or height) of I is equal to the "expected"

Weingarten function (1,407 words) [view diff] no match in snippet view article find links to article

{\displaystyle i_{1}j_{1}\ldots i_{q}j_{q}j'_{1}i'_{1}\ldots j'_{q}i'_{q}} matrix element of U ⊗ ⋯ ⊗ U ⊗ U † ⊗ ⋯ ⊗ U † {\displaystyle U\otimes \cdots \otimes

Cross-covariance matrix (1,255 words) [view diff] no match in snippet view article find links to article

p × q {\displaystyle 0_{p\times q}} is a p × q {\displaystyle p\times q} matrix of zeroes. If Z {\displaystyle \mathbf {Z} } and W {\displaystyle \mathbf

Plane wave expansion method (1,297 words) [view diff] no match in snippet view article find links to article

% max F.S coefs for representing E field, and Eps(r), are Mmax = 50; % Q matrix is non-symmetric in this case, Qij != Qji % Qmn = (2*pi*n + Kz)^2*Km-n

Logarithm of a matrix (2,982 words) [view diff] no match in snippet view article find links to article

{\begin{pmatrix}0&a\\a&0\end{pmatrix}}} , where a = log(p + r) − log q. Matrix function Square root of a matrix Matrix exponential Baker–Campbell–Hausdorff

Direct linear transformation (2,152 words) [view diff] no match in snippet view article find links to article

\mathbf {a} =\mathbf {0} } for the known N × 2 q {\displaystyle N\times 2\,q} matrix B {\displaystyle \mathbf {B} } and unknown 2q-dimensional vector a . {\displaystyle

Haar wavelet (4,518 words) [view diff] no match in snippet view article find links to article

where A {\displaystyle A} is an m×n matrix and B {\displaystyle B} is a p×q matrix, is expressed as A ⊗ B = [ a 11 B … a 1 n B ⋮ ⋱ ⋮ a m 1 B … a m n B ]

Givens rotation (3,246 words) [view diff] no match in snippet view article find links to article

O(n^{3})} arithmetic operations. Likewise, storing the full Q {\displaystyle Q} matrix amounts to n 2 {\displaystyle n^{2}} elements, but each Givens matrix

Attribute hierarchy method (6,762 words) [view diff] no match in snippet view article find links to article

The potential pool of items is represented by the incidence matrix (Q) matrix of order (k, p), where k is the number of attributes and p is number of

Hermitian symmetric space (7,418 words) [view diff] no match in snippet view article find links to article

concrete form in the classical cases: Type Ipq (p ≤ q): for every p × q matrix M there are unitary matrices such that UMV is diagonal. In fact this follows

Regular complex polygon (1,846 words) [view diff] no match in snippet view article find links to article

Name R1 R2 Order p q Matrix [ e 2 π i / p 0 0 1 ] {\displaystyle \left[{\begin{smallmatrix}e^{2\pi i/p}&0\\0&1\\\end{smallmatrix}}\right]} [ 1 0 0 e 2

Direct coupling analysis (3,374 words) [view diff] no match in snippet view article find links to article

{\displaystyle J_{ij}} (which can be represented as a q × q {\displaystyle q\times q} matrix if there are q {\displaystyle q} possible symbols) as direct couplings

Complex polytope (6,983 words) [view diff] no match in snippet view article find links to article

Name R1 R2 Order p q Matrix [ e 2 π i / p 0 0 1 ] {\displaystyle \left[{\begin{smallmatrix}e^{2\pi i/p}&0\\0&1\\\end{smallmatrix}}\right]} [ 1 0 0 e 2