ACM Home Page
Please provide us with feedback. Feedback
FORTRAN codes for estimating the one-norm of a real or complex matrix, with applications to condition estimation
Full text PdfPdf (1.10 MB)
Source ACM Transactions on Mathematical Software (TOMS) archive
Volume 14 ,  Issue 4  (December 1988) table of contents
Pages: 381 - 396  
Year of Publication: 1988
ISSN:0098-3500
Author
Nicholas J. Higham  Department of Mathematics, University of Manchester, Manchester, Ml3 9PL, England
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 105,   Citation Count: 15
Additional Information:

appendices and supplements   abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/50063.214386
What is a DOI?

APPENDICES and SUPPLEMENTS
gZip674.gz (18 KB)
one-norm of a real or complex matrix, condition estimation. Explicit matrix is not required; instead matrix-vector products are computed by the calling program via a reverse communications interface.
Gams: D1b2


ABSTRACT

FORTRAN 77 codes SONEST and CONEST are presented for estimating the 1-norm ( or the infinity-norm) of a real or complex matrix, respectively. The codes are of wide applicability in condition estimation since explicit access to the matrix, A, is not required; instead, matrix-vector products Ax and ATx are computed by the calling program via a reverse communication interface. The algorithms are based on a convex optimization method for estimating the 1-norm of a real matrix devised by Hager. We derive new results concerning the behavior of Hager's method, extend it to complex matrices, and make several algorithmic modifications in order to improve the reliability and efficiency.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
BYERS, R. A LINPACK-style condition estimator for the equation AX - XBr = C. IEEE Trans. Automat. Control AC-29 (1984), 926-928.
2
 
3
CLINE, A. K., AND REW, R.K. A set of counter-examples to three condition number estimators. SIAM J. Sci. Stat. Comput. 4, 4 (1983), 602-611.
4
 
5
 
6
 
7
EDLEFSEN, L. E., AND JONES, S.D. GAUSS programming language manual. Aptech Systems, Kent, Wash., 1986.
 
8
 
9
GOLUB, G. H., NASH, S., AND VAN LOAN, C.F. A Hessenberg-Schur method for the problem AX + XB - C. IEEE Trans. Automat. Control AC-24 (1979), 909-913.
 
10
GRIMES, R. G., AND LEWIS, J.G. Condition number estimation for sparse matrices. SIAM J. Sci. Stat. Comput. 2, 4 (1981), 384-388.
 
11
HAGER, W.W. Condition estimates. SIAM J. Sci. Star. Comput. 5, 2 (1984), 311-316.
 
12
HAGER, W.W. Applied Numerical Linear Algebra. Prentice-Hall, Englewood Cliffs, N.J., 1988.
 
13
HAMMARLING, S.J. Numerical solution of the stable, non-negative definite Lyapunov equation. IMA J. Numer. Anal. 2 (1982), 303-323.
 
14
 
15
HOFFMAN, W., AND LIOEN, W.M. NUMVEC Fortran library manual, Chapter: Simultaneous equations. Rep. NM-R8614, Centre for Mathematics and Computer Science, Amsterdam, 1986.
 
16
HOSKINS, W. D., MEEK, D. S., AND WALTON, D.J. The numerical solution of the matrix equation XA + A Y = F. BIT 17 (1977), 184-190.
 
17
K/~GSTROM, B., AND WESTIN, L. Generalized Schur methods with condition estimators for solving the generalized Sylvester equation. Rep. UMINF-130.86, Institute of Information Processing, Univ. of Umea, Umea, Sweden, 1986; revised July 1987.
18
 
19
MOLER, C. B., LITTLE, J. N., AND BANGERT, S. PC-Matlab User's Guide. The MathWorks, Sherborn, Mass., 1987.
 
20
O'LEAR~, D.P. Estimating matrix condition numbers. SIAM J. Sci. Stat. Cornput. 1, 2 (1980), 205-209.
21
 
22

CITED BY  15
 
 
 
 
 
 


Peer to Peer - Readers of this Article have also read: