[GiNaC-list] [patch] Add 'algo' parameter to matrix::rank()

Vitaly Magerya vmagerya at gmail.com
Tue Jun 12 17:36:01 CEST 2018


On 06/10/2018 02:01 PM, Richard B. Kreckel wrote:
> Could you, please, include an update of doc/tutorial/gianc.texi in your
> patch? Thanks in advance!

Sure. Something like this?

-------------- next part --------------
From dc60fa6291ba331259451cf2108bc3d7931e89f3 Mon Sep 17 00:00:00 2001
From: Vitaly Magerya <magv at tx97.net>
Date: Tue, 12 Jun 2018 17:34:13 +0200
Subject: [PATCH] Mention 'algo' parameter of rank() in the docs too

---
 doc/tutorial/ginac.texi | 14 +++++++-------
 1 file changed, 7 insertions(+), 7 deletions(-)

diff --git a/doc/tutorial/ginac.texi b/doc/tutorial/ginac.texi
index 710e06f8..561180d2 100644
--- a/doc/tutorial/ginac.texi
+++ b/doc/tutorial/ginac.texi
@@ -2172,15 +2172,15 @@ computing determinants, traces, characteristic polynomials and ranks:
 ex matrix::determinant(unsigned algo=determinant_algo::automatic) const;
 ex matrix::trace() const;
 ex matrix::charpoly(const ex & lambda) const;
-unsigned matrix::rank() const;
+unsigned matrix::rank(unsigned algo=solve_algo::automatic) const;
 @end example
 
-The optional @samp{algo} argument of @code{determinant()} allows to
-select between different algorithms for calculating the determinant.
-The asymptotic speed (as parametrized by the matrix size) can greatly
-differ between those algorithms, depending on the nature of the
-matrix' entries.  The possible values are defined in the
- at file{flags.h} header file.  By default, GiNaC uses a heuristic to
+The optional @samp{algo} argument of @code{determinant()} and @code{rank()}
+functions allows to select between different algorithms for calculating the
+determinant and rank respectively. The asymptotic speed (as parametrized
+by the matrix size) can greatly differ between those algorithms, depending
+on the nature of the matrix' entries. The possible values are defined in
+the @file{flags.h} header file. By default, GiNaC uses a heuristic to
 automatically select an algorithm that is likely (but not guaranteed)
 to give the result most quickly.
 
-- 
2.13.6



More information about the GiNaC-list mailing list