From 2ce71407f5ff4091396fe75af8fce7e08965c765 Mon Sep 17 00:00:00 2001
From: conrad <conrad@localhost.localdomain>
Date: Sun, 1 Oct 2023 19:10:07 +1000
Subject: [PATCH] better wording

---
 docs.html | 6 ++++--
 1 file changed, 4 insertions(+), 2 deletions(-)

diff --git a/docs.html b/docs.html
index 2a6d0bb6..a60274e7 100644
--- a/docs.html
+++ b/docs.html
@@ -8779,11 +8779,13 @@ See also:
 <ul>
 <li>Return the condition number of matrix <i>A</i> (the ratio of the largest singular value to the smallest)</li>
 <br>
-<li>The ideal condition number is close to 1; large condition numbers suggest that matrix <i>A</i> is nearly singular</li>
+<li>Matrix <i>A</i> is well-conditioned when the condition number is close to 1</li>
+<br>
+<li>Matrix <i>A</i> is ill-conditioned (poorly conditioned) when the condition number is large</li>
 <br>
 <li>The computation is based on singular value decomposition</li>
 <br>
-<li><b>Caveat:</b> <a href="#rcond">rcond()</a> is considerably faster</li>
+<li><b>Caveat:</b> calculating the approximate reciprocal condition number via <a href="#rcond">rcond()</a> is considerably more efficient</li>
 <br>
 <li>
 Examples: