summaryrefslogtreecommitdiff
path: root/SRC
diff options
context:
space:
mode:
Diffstat (limited to 'SRC')
-rw-r--r--SRC/cgesv.f2
-rw-r--r--SRC/cgesvj.f2
-rw-r--r--SRC/chegv_2stage.f2
-rw-r--r--SRC/chetrd_he2hb.f4
-rw-r--r--SRC/cunbdb1.f2
-rw-r--r--SRC/cunbdb2.f2
-rw-r--r--SRC/cunbdb3.f2
-rw-r--r--SRC/cunbdb4.f2
-rw-r--r--SRC/cunbdb5.f2
-rw-r--r--SRC/cunbdb6.f2
-rw-r--r--SRC/cuncsd2by1.f2
-rw-r--r--SRC/dorbdb1.f2
-rw-r--r--SRC/dorbdb2.f2
-rw-r--r--SRC/dorbdb3.f2
-rw-r--r--SRC/dorbdb4.f2
-rw-r--r--SRC/dorbdb5.f2
-rw-r--r--SRC/dorbdb6.f2
-rw-r--r--SRC/dorcsd2by1.f2
-rw-r--r--SRC/dsygv_2stage.f2
-rw-r--r--SRC/dsytrd_sy2sb.f4
-rw-r--r--SRC/sgetrf2.f2
-rw-r--r--SRC/sorbdb1.f2
-rw-r--r--SRC/sorbdb2.f2
-rw-r--r--SRC/sorbdb3.f2
-rw-r--r--SRC/sorbdb4.f2
-rw-r--r--SRC/sorbdb5.f2
-rw-r--r--SRC/sorbdb6.f2
-rw-r--r--SRC/sorcsd2by1.f2
-rw-r--r--SRC/ssygv_2stage.f2
-rw-r--r--SRC/ssytrd_sy2sb.f4
-rw-r--r--SRC/zgesv.f2
-rw-r--r--SRC/zgesvj.f2
-rw-r--r--SRC/zhegv_2stage.f2
-rw-r--r--SRC/zhetrd_he2hb.f4
-rw-r--r--SRC/zunbdb1.f2
-rw-r--r--SRC/zunbdb2.f2
-rw-r--r--SRC/zunbdb3.f2
-rw-r--r--SRC/zunbdb4.f2
-rw-r--r--SRC/zunbdb5.f2
-rw-r--r--SRC/zunbdb6.f2
-rw-r--r--SRC/zuncsd2by1.f2
41 files changed, 47 insertions, 43 deletions
diff --git a/SRC/cgesv.f b/SRC/cgesv.f
index 7837e0fa..c98393ae 100644
--- a/SRC/cgesv.f
+++ b/SRC/cgesv.f
@@ -1,4 +1,4 @@
-*> \brief <b> CGESV computes the solution to system of linear equations A * X = B for GE matrices</b> (simple driver) </b>
+*> \brief <b> CGESV computes the solution to system of linear equations A * X = B for GE matrices (simple driver) </b>
*
* =========== DOCUMENTATION ===========
*
diff --git a/SRC/cgesvj.f b/SRC/cgesvj.f
index 8dc6280f..0168c5c3 100644
--- a/SRC/cgesvj.f
+++ b/SRC/cgesvj.f
@@ -318,6 +318,8 @@
*> \par References:
* ================
*>
+*> \verbatim
+*>
*> [1] P. P. M. De Rijk: A one-sided Jacobi algorithm for computing the
*> singular value decomposition on a vector computer.
*> SIAM J. Sci. Stat. Comp., Vol. 10 (1998), pp. 359-371.
diff --git a/SRC/chegv_2stage.f b/SRC/chegv_2stage.f
index 11956def..7cb8d8aa 100644
--- a/SRC/chegv_2stage.f
+++ b/SRC/chegv_2stage.f
@@ -47,7 +47,7 @@
*> positive definite.
*> This routine use the 2stage technique for the reduction to tridiagonal
*> which showed higher performance on recent architecture and for large
-* sizes N>2000.
+*> sizes N>2000.
*> \endverbatim
*
* Arguments:
diff --git a/SRC/chetrd_he2hb.f b/SRC/chetrd_he2hb.f
index 677f1828..f4f17a88 100644
--- a/SRC/chetrd_he2hb.f
+++ b/SRC/chetrd_he2hb.f
@@ -132,7 +132,7 @@
*> \verbatim
*> LWORK is INTEGER
*> The dimension of the array WORK which should be calculated
-* by a workspace query. LWORK = MAX(1, LWORK_QUERY)
+*> by a workspace query. LWORK = MAX(1, LWORK_QUERY)
*> If LWORK = -1, then a workspace query is assumed; the routine
*> only calculates the optimal size of the WORK array, returns
*> this value as the first entry of the WORK array, and no error
@@ -222,7 +222,7 @@
*>
*> where tau is a complex scalar, and v is a complex vector with
*> v(kd+1:i) = 0 and v(i+kd+1) = 1; v(i+kd+2:n) is stored on exit in
-* A(i+kd+2:n,i), and tau in TAU(i).
+*> A(i+kd+2:n,i), and tau in TAU(i).
*>
*> The contents of A on exit are illustrated by the following examples
*> with n = 5:
diff --git a/SRC/cunbdb1.f b/SRC/cunbdb1.f
index fdcc686d..e817b6f0 100644
--- a/SRC/cunbdb1.f
+++ b/SRC/cunbdb1.f
@@ -32,7 +32,7 @@
*
*
*> \par Purpose:
-*> =============
+* =============
*>
*>\verbatim
*>
diff --git a/SRC/cunbdb2.f b/SRC/cunbdb2.f
index d95276e5..5f051347 100644
--- a/SRC/cunbdb2.f
+++ b/SRC/cunbdb2.f
@@ -32,7 +32,7 @@
*
*
*> \par Purpose:
-*> =============
+* =============
*>
*>\verbatim
*>
diff --git a/SRC/cunbdb3.f b/SRC/cunbdb3.f
index a9d05c20..4841eadc 100644
--- a/SRC/cunbdb3.f
+++ b/SRC/cunbdb3.f
@@ -32,7 +32,7 @@
*
*
*> \par Purpose:
-*> =============
+* =============
*>
*>\verbatim
*>
diff --git a/SRC/cunbdb4.f b/SRC/cunbdb4.f
index 8388e4e8..a5c17fa4 100644
--- a/SRC/cunbdb4.f
+++ b/SRC/cunbdb4.f
@@ -33,7 +33,7 @@
*
*
*> \par Purpose:
-*> =============
+* =============
*>
*>\verbatim
*>
diff --git a/SRC/cunbdb5.f b/SRC/cunbdb5.f
index 006522d2..c568461a 100644
--- a/SRC/cunbdb5.f
+++ b/SRC/cunbdb5.f
@@ -31,7 +31,7 @@
*
*
*> \par Purpose:
-*> =============
+* =============
*>
*>\verbatim
*>
diff --git a/SRC/cunbdb6.f b/SRC/cunbdb6.f
index ab7fe8a4..7d398304 100644
--- a/SRC/cunbdb6.f
+++ b/SRC/cunbdb6.f
@@ -31,7 +31,7 @@
*
*
*> \par Purpose:
-*> =============
+* =============
*>
*>\verbatim
*>
diff --git a/SRC/cuncsd2by1.f b/SRC/cuncsd2by1.f
index 64070ca9..4f5eb5a2 100644
--- a/SRC/cuncsd2by1.f
+++ b/SRC/cuncsd2by1.f
@@ -39,7 +39,7 @@
*
*
*> \par Purpose:
-*> =============
+* =============
*>
*>\verbatim
*>
diff --git a/SRC/dorbdb1.f b/SRC/dorbdb1.f
index db3b14db..1e4e1aa3 100644
--- a/SRC/dorbdb1.f
+++ b/SRC/dorbdb1.f
@@ -32,7 +32,7 @@
*
*
*> \par Purpose:
-*> =============
+* =============
*>
*>\verbatim
*>
diff --git a/SRC/dorbdb2.f b/SRC/dorbdb2.f
index cec60da7..29c7ba9b 100644
--- a/SRC/dorbdb2.f
+++ b/SRC/dorbdb2.f
@@ -32,7 +32,7 @@
*
*
*> \par Purpose:
-*> =============
+* =============
*>
*>\verbatim
*>
diff --git a/SRC/dorbdb3.f b/SRC/dorbdb3.f
index 7149796c..a476b9d4 100644
--- a/SRC/dorbdb3.f
+++ b/SRC/dorbdb3.f
@@ -32,7 +32,7 @@
*
*
*> \par Purpose:
-*> =============
+* =============
*>
*>\verbatim
*>
diff --git a/SRC/dorbdb4.f b/SRC/dorbdb4.f
index 606d7083..5561b8c1 100644
--- a/SRC/dorbdb4.f
+++ b/SRC/dorbdb4.f
@@ -33,7 +33,7 @@
*
*
*> \par Purpose:
-*> =============
+* =============
*>
*>\verbatim
*>
diff --git a/SRC/dorbdb5.f b/SRC/dorbdb5.f
index de01f5a4..ce590116 100644
--- a/SRC/dorbdb5.f
+++ b/SRC/dorbdb5.f
@@ -31,7 +31,7 @@
*
*
*> \par Purpose:
-*> =============
+* =============
*>
*>\verbatim
*>
diff --git a/SRC/dorbdb6.f b/SRC/dorbdb6.f
index 6056d030..ab2d9976 100644
--- a/SRC/dorbdb6.f
+++ b/SRC/dorbdb6.f
@@ -31,7 +31,7 @@
*
*
*> \par Purpose:
-*> =============
+* =============
*>
*>\verbatim
*>
diff --git a/SRC/dorcsd2by1.f b/SRC/dorcsd2by1.f
index 8542a2ed..4f988001 100644
--- a/SRC/dorcsd2by1.f
+++ b/SRC/dorcsd2by1.f
@@ -36,7 +36,7 @@
*
*
*> \par Purpose:
-*> =============
+* =============
*>
*>\verbatim
*>
diff --git a/SRC/dsygv_2stage.f b/SRC/dsygv_2stage.f
index b7da00f5..31d613f0 100644
--- a/SRC/dsygv_2stage.f
+++ b/SRC/dsygv_2stage.f
@@ -46,7 +46,7 @@
*> positive definite.
*> This routine use the 2stage technique for the reduction to tridiagonal
*> which showed higher performance on recent architecture and for large
-* sizes N>2000.
+*> sizes N>2000.
*> \endverbatim
*
* Arguments:
diff --git a/SRC/dsytrd_sy2sb.f b/SRC/dsytrd_sy2sb.f
index a0e028a3..5842a6f5 100644
--- a/SRC/dsytrd_sy2sb.f
+++ b/SRC/dsytrd_sy2sb.f
@@ -132,7 +132,7 @@
*> \verbatim
*> LWORK is INTEGER
*> The dimension of the array WORK which should be calculated
-* by a workspace query. LWORK = MAX(1, LWORK_QUERY)
+*> by a workspace query. LWORK = MAX(1, LWORK_QUERY)
*> If LWORK = -1, then a workspace query is assumed; the routine
*> only calculates the optimal size of the WORK array, returns
*> this value as the first entry of the WORK array, and no error
@@ -222,7 +222,7 @@
*>
*> where tau is a real scalar, and v is a real vector with
*> v(kd+1:i) = 0 and v(i+kd+1) = 1; v(i+kd+2:n) is stored on exit in
-* A(i+kd+2:n,i), and tau in TAU(i).
+*> A(i+kd+2:n,i), and tau in TAU(i).
*>
*> The contents of A on exit are illustrated by the following examples
*> with n = 5:
diff --git a/SRC/sgetrf2.f b/SRC/sgetrf2.f
index a7e778b9..7d098806 100644
--- a/SRC/sgetrf2.f
+++ b/SRC/sgetrf2.f
@@ -38,7 +38,7 @@
*>
*> [ A11 | A12 ] where A11 is n1 by n1 and A22 is n2 by n2
*> A = [ -----|----- ] with n1 = min(m,n)/2
-* [ A21 | A22 ] n2 = n-n1
+*> [ A21 | A22 ] n2 = n-n1
*>
*> [ A11 ]
*> The subroutine calls itself to factor [ --- ],
diff --git a/SRC/sorbdb1.f b/SRC/sorbdb1.f
index 0e998269..055993b6 100644
--- a/SRC/sorbdb1.f
+++ b/SRC/sorbdb1.f
@@ -32,7 +32,7 @@
*
*
*> \par Purpose:
-*> =============
+* =============
*>
*>\verbatim
*>
diff --git a/SRC/sorbdb2.f b/SRC/sorbdb2.f
index dec4dbe1..3eed6148 100644
--- a/SRC/sorbdb2.f
+++ b/SRC/sorbdb2.f
@@ -32,7 +32,7 @@
*
*
*> \par Purpose:
-*> =============
+* =============
*>
*>\verbatim
*>
diff --git a/SRC/sorbdb3.f b/SRC/sorbdb3.f
index 5b6e946d..b679da3b 100644
--- a/SRC/sorbdb3.f
+++ b/SRC/sorbdb3.f
@@ -32,7 +32,7 @@
*
*
*> \par Purpose:
-*> =============
+* =============
*>
*>\verbatim
*>
diff --git a/SRC/sorbdb4.f b/SRC/sorbdb4.f
index 0b209b2d..e24609d0 100644
--- a/SRC/sorbdb4.f
+++ b/SRC/sorbdb4.f
@@ -33,7 +33,7 @@
*
*
*> \par Purpose:
-*> =============
+* =============
*>
*>\verbatim
*>
diff --git a/SRC/sorbdb5.f b/SRC/sorbdb5.f
index f037ba1d..b565e5aa 100644
--- a/SRC/sorbdb5.f
+++ b/SRC/sorbdb5.f
@@ -31,7 +31,7 @@
*
*
*> \par Purpose:
-*> =============
+* =============
*>
*>\verbatim
*>
diff --git a/SRC/sorbdb6.f b/SRC/sorbdb6.f
index 83d96612..1fc9f3d9 100644
--- a/SRC/sorbdb6.f
+++ b/SRC/sorbdb6.f
@@ -31,7 +31,7 @@
*
*
*> \par Purpose:
-*> =============
+* =============
*>
*>\verbatim
*>
diff --git a/SRC/sorcsd2by1.f b/SRC/sorcsd2by1.f
index 1ff4732c..a700c1b2 100644
--- a/SRC/sorcsd2by1.f
+++ b/SRC/sorcsd2by1.f
@@ -36,7 +36,7 @@
*
*
*> \par Purpose:
-*> =============
+* =============
*>
*>\verbatim
*>
diff --git a/SRC/ssygv_2stage.f b/SRC/ssygv_2stage.f
index 2a376ea3..0ba5799f 100644
--- a/SRC/ssygv_2stage.f
+++ b/SRC/ssygv_2stage.f
@@ -46,7 +46,7 @@
*> positive definite.
*> This routine use the 2stage technique for the reduction to tridiagonal
*> which showed higher performance on recent architecture and for large
-* sizes N>2000.
+*> sizes N>2000.
*> \endverbatim
*
* Arguments:
diff --git a/SRC/ssytrd_sy2sb.f b/SRC/ssytrd_sy2sb.f
index a37672ef..60e9faf8 100644
--- a/SRC/ssytrd_sy2sb.f
+++ b/SRC/ssytrd_sy2sb.f
@@ -132,7 +132,7 @@
*> \verbatim
*> LWORK is INTEGER
*> The dimension of the array WORK which should be calculated
-* by a workspace query. LWORK = MAX(1, LWORK_QUERY)
+*> by a workspace query. LWORK = MAX(1, LWORK_QUERY)
*> If LWORK = -1, then a workspace query is assumed; the routine
*> only calculates the optimal size of the WORK array, returns
*> this value as the first entry of the WORK array, and no error
@@ -222,7 +222,7 @@
*>
*> where tau is a real scalar, and v is a real vector with
*> v(kd+1:i) = 0 and v(i+kd+1) = 1; v(i+kd+2:n) is stored on exit in
-* A(i+kd+2:n,i), and tau in TAU(i).
+*> A(i+kd+2:n,i), and tau in TAU(i).
*>
*> The contents of A on exit are illustrated by the following examples
*> with n = 5:
diff --git a/SRC/zgesv.f b/SRC/zgesv.f
index 316965ac..e3ff3c45 100644
--- a/SRC/zgesv.f
+++ b/SRC/zgesv.f
@@ -1,4 +1,4 @@
-*> \brief <b> ZGESV computes the solution to system of linear equations A * X = B for GE matrices</b> (simple driver) </b>
+*> \brief <b> ZGESV computes the solution to system of linear equations A * X = B for GE matrices (simple driver) </b>
*
* =========== DOCUMENTATION ===========
*
diff --git a/SRC/zgesvj.f b/SRC/zgesvj.f
index d08cfa55..3670ec66 100644
--- a/SRC/zgesvj.f
+++ b/SRC/zgesvj.f
@@ -318,6 +318,8 @@
*> \par References:
* ================
*>
+*> \verbatim
+*>
*> [1] P. P. M. De Rijk: A one-sided Jacobi algorithm for computing the
*> singular value decomposition on a vector computer.
*> SIAM J. Sci. Stat. Comp., Vol. 10 (1998), pp. 359-371.
diff --git a/SRC/zhegv_2stage.f b/SRC/zhegv_2stage.f
index 1afd2e18..2976c9fb 100644
--- a/SRC/zhegv_2stage.f
+++ b/SRC/zhegv_2stage.f
@@ -47,7 +47,7 @@
*> positive definite.
*> This routine use the 2stage technique for the reduction to tridiagonal
*> which showed higher performance on recent architecture and for large
-* sizes N>2000.
+*> sizes N>2000.
*> \endverbatim
*
* Arguments:
diff --git a/SRC/zhetrd_he2hb.f b/SRC/zhetrd_he2hb.f
index 89fb1b8a..a2776499 100644
--- a/SRC/zhetrd_he2hb.f
+++ b/SRC/zhetrd_he2hb.f
@@ -132,7 +132,7 @@
*> \verbatim
*> LWORK is INTEGER
*> The dimension of the array WORK which should be calculated
-* by a workspace query. LWORK = MAX(1, LWORK_QUERY)
+*> by a workspace query. LWORK = MAX(1, LWORK_QUERY)
*> If LWORK = -1, then a workspace query is assumed; the routine
*> only calculates the optimal size of the WORK array, returns
*> this value as the first entry of the WORK array, and no error
@@ -222,7 +222,7 @@
*>
*> where tau is a complex scalar, and v is a complex vector with
*> v(kd+1:i) = 0 and v(i+kd+1) = 1; v(i+kd+2:n) is stored on exit in
-* A(i+kd+2:n,i), and tau in TAU(i).
+*> A(i+kd+2:n,i), and tau in TAU(i).
*>
*> The contents of A on exit are illustrated by the following examples
*> with n = 5:
diff --git a/SRC/zunbdb1.f b/SRC/zunbdb1.f
index 9ec09772..cab871b0 100644
--- a/SRC/zunbdb1.f
+++ b/SRC/zunbdb1.f
@@ -32,7 +32,7 @@
*
*
*> \par Purpose:
-*> =============
+* =============
*>
*>\verbatim
*>
diff --git a/SRC/zunbdb2.f b/SRC/zunbdb2.f
index 8fa73082..c10c4f65 100644
--- a/SRC/zunbdb2.f
+++ b/SRC/zunbdb2.f
@@ -32,7 +32,7 @@
*
*
*> \par Purpose:
-*> =============
+* =============
*>
*>\verbatim
*>
diff --git a/SRC/zunbdb3.f b/SRC/zunbdb3.f
index 737c9a76..4243fd37 100644
--- a/SRC/zunbdb3.f
+++ b/SRC/zunbdb3.f
@@ -32,7 +32,7 @@
*
*
*> \par Purpose:
-*> =============
+* =============
*>
*>\verbatim
*>
diff --git a/SRC/zunbdb4.f b/SRC/zunbdb4.f
index 9bb0c9bd..8c759d07 100644
--- a/SRC/zunbdb4.f
+++ b/SRC/zunbdb4.f
@@ -33,7 +33,7 @@
*
*
*> \par Purpose:
-*> =============
+* =============
*>
*>\verbatim
*>
diff --git a/SRC/zunbdb5.f b/SRC/zunbdb5.f
index 0e2678bf..d9c08012 100644
--- a/SRC/zunbdb5.f
+++ b/SRC/zunbdb5.f
@@ -31,7 +31,7 @@
*
*
*> \par Purpose:
-*> =============
+* =============
*>
*>\verbatim
*>
diff --git a/SRC/zunbdb6.f b/SRC/zunbdb6.f
index 42a3cf80..32b8e3e9 100644
--- a/SRC/zunbdb6.f
+++ b/SRC/zunbdb6.f
@@ -31,7 +31,7 @@
*
*
*> \par Purpose:
-*> =============
+* =============
*>
*>\verbatim
*>
diff --git a/SRC/zuncsd2by1.f b/SRC/zuncsd2by1.f
index 630a5938..5e899079 100644
--- a/SRC/zuncsd2by1.f
+++ b/SRC/zuncsd2by1.f
@@ -39,7 +39,7 @@
*
*
*> \par Purpose:
-*> =============
+* =============
*>
*>\verbatim
*>