Search Results for ""
1331 - 1340 of 2765 for Linear Recurrence EquationSearch Results
A conjugate matrix is a matrix A^_ obtained from a given matrix A by taking the complex conjugate of each element of A (Courant and Hilbert 1989, p. 9), i.e., ...
A useful determinant identity allows the following determinant to be expressed using vector operations, |x_1 y_1 z_1 1; x_2 y_2 z_2 1; x_3 y_3 z_3 1; x_4 y_4 z_4 ...
A square matrix A is called diagonally dominant if |A_(ii)|>=sum_(j!=i)|A_(ij)| for all i. A is called strictly diagonally dominant if |A_(ii)|>sum_(j!=i)|A_(ij)| for all i. ...
The Drazin inverse is a matrix inverse-like object derived from a given square matrix. In particular, let the index k of a square matrix be defined as the smallest ...
Let P be a matrix of eigenvectors of a given square matrix A and D be a diagonal matrix with the corresponding eigenvalues on the diagonal. Then, as long as P is a square ...
The Fibonacci Q-matrix is the matrix defined by Q=[F_2 F_1; F_1 F_0]=[1 1; 1 0], (1) where F_n is a Fibonacci number. Then Q^n=[F_(n+1) F_n; F_n F_(n-1)] (2) (Honsberger ...
The n×n square matrix F_n with entries given by F_(jk)=e^(2piijk/n)=omega^(jk) (1) for j,k=0, 1, 2, ..., n-1, where i is the imaginary number i=sqrt(-1), and normalized by ...
The Frobenius norm, sometimes also called the Euclidean norm (a term unfortunately also used for the vector L^2-norm), is matrix norm of an m×n matrix A defined as the square ...
Let p and q be partitions of a positive integer, then there exists a (0,1)-matrix A such that c(A)=p, r(A)=q iff q is dominated by p^*.
The generalized minimal residual (GMRES) method (Saad and Schultz 1986) is an extension of the minimal residual method (MINRES), which is only applicable to symmetric ...
...
View search results from all Wolfram sites (38365 matches)

