Dashboard

Featured nodes

Roots

  • Public root

Templates

  • Test template
  • iCorps template
  • Guanyu's Latex template
  • Ivar's latex template
  • Family Tree template
  • Latex template
  • Router template

Trees

  • Public trees

Orphans

  • Browse orphan nodes
Related nodes

Parents1

  • Basic terminology and notation

Siblings11
  • Sort by title
  • Sort by date

  • Definition of matrix
  • Notation for entry of matrix
  • Definition of size of a matrix
  • Definition of m by n matrix
  • Notation for the set of m by n matrices
  • Definition of square matrix
  • Definition of the (main) diagonal of a matrix
  • Definition of diagonal matrix
  • Definition of identity matrix
  • Definition of 0 matrix
  • Definition of equality of matrices
Knowenβ
  • Help
    • Welcome to Knowen!
    • Edit test node (no login required)
    • Create new test node (no login required)
  • Not logged in
    • Sign in
    • Sign up

History & Comments

Back

Fill content

Description:Added definition of diagonal matrix
# Definition of diagonal matrix

Put content here.**Definition:** A **diagonal matrix** is a square matrix in which all off-diagonal entries are zero. That is, $D = (d_{ij})$ is diagonal if $d_{ij} = 0$ whenever $i \neq j$.
⏎
$$D = \begin{pmatrix} d_1 & 0 & \cdots & 0 \\ 0 & d_2 & \cdots & 0 \\ \vdots & \vdots & \ddots & \vdots \\ 0 & 0 & \cdots & d_n \end{pmatrix}$$
⏎
**Example:**
$$D = \begin{pmatrix} 3 & 0 & 0 \\ 0 & -1 & 0 \\ 0 & 0 & 5 \end{pmatrix}$$
⏎
Diagonal matrices are particularly easy to work with:
- Matrix multiplication of diagonal matrices is commutative
- Powers: $D^k = \text{diag}(d_1^k, d_2^k, \ldots, d_n^k)$
- Inverse (when all $d_i \neq 0$): $D^{-1} = \text{diag}(1/d_1, 1/d_2, \ldots, 1/d_n)$
- Determinant: $\det(D) = d_1 \cdot d_2 \cdots d_n$

# Parents

* Basic terminology and notation
Sign in to add a new comment

Contact us or leave feedback

© KTree Inc. 2026