PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: Very high Entry average rating: No information on entry rating
[parent] fully indecomposable matrix (Definition)

An $ n\times n$ matrix $ A$ that contains an $ s \times (n-s)$ zero submatrix for some positive integer $ s$ is said to be partly decomposable. If no such submatrix exists then $ A$ is said to be it fully indecomposable. By convention, a $ 1 \times 1$ matrix is fully indecomposable if it is nonzero. $ A$ is nearly decomposable if it fully indecomposable but whenever a nonzero entry is changed to 0 the resulting matrix is partly decomposable.



"fully indecomposable matrix" is owned by Mathprof.
(view preamble | get metadata)

View style:

Also defines:  nearly decomposable, partly decomposable, fully indecomposable

This object's parent.
Log in to rate this entry.
(view current ratings)

Cross-references: integer, positive, submatrix, contains, matrix
There is 1 reference to this entry.

This is version 7 of fully indecomposable matrix, born on 2006-06-10, modified 2007-07-01.
Object id is 7999, canonical name is FullyIndecomposableMatrix.
Accessed 2137 times total.

Classification:
AMS MSC15A57 (Linear and multilinear algebra; matrix theory :: Other types of matrices )

Pending Errata and Addenda
None.
[ View all 3 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)