Mercurial > hg > octave-jordi
comparison doc/interpreter/diagperm.txi @ 14421:0ec73cf71556
doc: Source code is a mass noun (no "source codes")
author | Jordi Gutiérrez Hermoso <jordigh@octave.org> |
---|---|
date | Wed, 29 Feb 2012 15:39:05 -0500 |
parents | dfb33a5723d2 |
children | 62cb605af1af |
comparison
equal
deleted
inserted
replaced
14420:dfb33a5723d2 | 14421:0ec73cf71556 |
---|---|
21 | 21 |
22 @menu | 22 @menu |
23 * Basic Usage:: Creation and Manipulation of Diagonal and Permutation Matrices | 23 * Basic Usage:: Creation and Manipulation of Diagonal and Permutation Matrices |
24 * Matrix Algebra:: Linear Algebra with Diagonal and Permutation Matrices | 24 * Matrix Algebra:: Linear Algebra with Diagonal and Permutation Matrices |
25 * Function Support:: Functions That Are Aware of These Matrices | 25 * Function Support:: Functions That Are Aware of These Matrices |
26 * Example Codes:: Some Examples of Usage | 26 * Example Code:: Some Examples of Usage |
27 * Zeros Treatment:: The Differences in Treatment of Zero Elements | 27 * Zeros Treatment:: The Differences in Treatment of Zero Elements |
28 @end menu | 28 @end menu |
29 | 29 |
30 @node Basic Usage | 30 @node Basic Usage |
31 @section Creating and Manipulating Diagonal and Permutation Matrices | 31 @section Creating and Manipulating Diagonal and Permutation Matrices |
410 The @dfn{sparse} function will convert a permutation matrix efficiently to a | 410 The @dfn{sparse} function will convert a permutation matrix efficiently to a |
411 sparse matrix. | 411 sparse matrix. |
412 The @dfn{find} function will also work efficiently with a permutation matrix, | 412 The @dfn{find} function will also work efficiently with a permutation matrix, |
413 making it possible to conveniently obtain the permutation indices. | 413 making it possible to conveniently obtain the permutation indices. |
414 | 414 |
415 @node Example Codes | 415 @node Example Code |
416 @section Some Examples of Usage | 416 @section Some Examples of Usage |
417 | 417 |
418 The following can be used to solve a linear system @code{A*x = b} | 418 The following can be used to solve a linear system @code{A*x = b} |
419 using the pivoted LU@tie{}factorization: | 419 using the pivoted LU@tie{}factorization: |
420 | 420 |