La traduction de cette page n'est pas à jour. Cliquez ici pour voir la dernière version en anglais.

Matrices creuses

Matrices creuses élémentaires, algorithmes de réorganisation, méthodes itératives, algèbre linéaire creux

Les matrices creuses offrent un stockage efficace des données de type double ou logical comportant une forte proportion de zéros. Alors que les matrices pleines (ou denses) stockent chaque élément en mémoire quelle que soit sa valeur, les matrices creuses stockent uniquement les éléments non nuls et leurs indices de ligne. C’est pourquoi l’utilisation de matrices creuses peut considérablement réduire la quantité de mémoire nécessaire au stockage des données.

Toutes les opérations arithmétiques, logiques et d’indexation prédéfinies dans MATLAB^® sont applicables aux matrices creuses ou à une combinaison de matrices creuses et pleines. Les opérations sur des matrices creuses renvoient des matrices creuses. De même, les opérations sur des matrices pleines renvoient des matrices pleines. Pour plus d’informations, consultez Computational Advantages of Sparse Matrices et Constructing Sparse Matrices.

Fonctions

développer tout

Création

`spalloc`	Allocate space for sparse matrix
`spdiags`	Extract nonzero diagonals and create sparse band and diagonal matrices
`speye`	Sparse identity matrix
`sprand`	Sparse uniformly distributed random matrix
`sprandn`	Sparse normally distributed random matrix
`sprandsym`	Sparse symmetric random matrix
`sparse`	Create sparse matrix
`spconvert`	Import from sparse matrix external format

Manipulation

`issparse`	Determine whether input is sparse
`nnz`	Number of nonzero matrix elements
`nonzeros`	Nonzero matrix elements
`nzmax`	Amount of storage allocated for nonzero matrix elements
`spfun`	Apply function to nonzero sparse matrix elements
`spones`	Replace nonzero sparse matrix elements with ones
`spparms`	Set parameters for sparse matrix routines
`spy`	Visualize sparsity pattern of matrix
`find`	Rechercher des indices et des valeurs d’éléments non nuls
`full`	Convert sparse matrix to full storage

Algorithmes de permutation

`dissect`	Nested dissection permutation
`amd`	Approximate minimum degree permutation
`colamd`	Column approximate minimum degree permutation
`colperm`	Sparse column permutation based on nonzero count
`dmperm`	Dulmage-Mendelsohn decomposition
`randperm`	Random permutation of integers
`symamd`	Symmetric approximate minimum degree permutation
`symrcm`	Sparse reverse Cuthill-McKee ordering

Méthodes itératives et préconditionneurs

`pcg`	Solve system of linear equations — preconditioned conjugate gradients method
`lsqr`	Solve system of linear equations — least-squares method
`minres`	Solve system of linear equations — minimum residual method
`symmlq`	Solve system of linear equations — symmetric LQ method
`gmres`	Solve system of linear equations — generalized minimum residual method
`bicg`	Solve system of linear equations — biconjugate gradients method
`bicgstab`	Solve system of linear equations — stabilized biconjugate gradients method
`bicgstabl`	Solve system of linear equations — stabilized biconjugate gradients (l) method
`cgs`	Solve system of linear equations — conjugate gradients squared method
`qmr`	Solve system of linear equations — quasi-minimal residual method
`tfqmr`	Solve system of linear equations — transpose-free quasi-minimal residual method
`equilibrate`	Matrix scaling for improved conditioning
`ichol`	Incomplete Cholesky factorization
`ilu`	Incomplete LU factorization

Valeurs propres et singulières

`eigs`	Subset of eigenvalues and eigenvectors
`svds`	Subset of singular values and vectors
`normest`	2-norm estimate
`condest`	1-norm condition number estimate

Analyse structurelle

`sprank`	Structural rank
`etree`	Elimination tree
`symbfact`	Symbolic factorization analysis
`spaugment`	Form least-squares augmented system
`dmperm`	Dulmage-Mendelsohn decomposition
`etreeplot`	Plot elimination tree
`treelayout`	Lay out tree or forest
`treeplot`	Plot picture of tree
`gplot`	Plot nodes and edges in adjacency matrix
`unmesh`	Convert edge matrix to coordinate and Laplacian matrices

Rubriques

Constructing Sparse Matrices
Storing sparse data as a matrix.
Computational Advantages of Sparse Matrices
Advantages of sparse matrices over full matrices.
Accessing Sparse Matrices
Indexing and visualizing sparse data.
Sparse Matrix Operations
Reordering, factoring, and computing with sparse matrices.
Iterative Methods for Linear Systems
One of the most important and common applications of numerical linear algebra is the solution of linear systems that can be expressed in the form A*x = b.
Sparse Matrix Reordering
This example shows how reordering the rows and columns of a sparse matrix can influence the speed and storage requirements of a matrix operation.

Exemples présentés

Finite Difference Laplacian

Compute and represent the finite difference Laplacian on an L-shaped domain.

Ouvrir le live script

Graphical Representation of Sparse Matrices

The finite element mesh for a NASA airfoil, including two trailing flaps. More information about the history of airfoils is available at NACA Airfoils (nasa.gov).

Ouvrir le live script

Graphs and Matrices

An application of sparse matrices and explains the relationship between graphs and matrices.

Ouvrir le live script