论文信息 - Experience with a Matrix Norm Estimator

Experience with a Matrix Norm Estimator

Fortran 77 codes for estimating the 1-norm of a real or complex matrix were presented by Higham in [ACM Trans. Math. Software, 14 (1988), pp. 381–396]. The codes have found use in various applications and have been adopted by two program libraries. Further observations about the norm estimation algorithm and experience in using it are reported here. In particular, an example is given where the algorithm requires nearly the maximum possible number of iterations.

Nicholas J. Higham | N. Higham

[1] Nicholas J. Higham,et al. Fast Polar Decomposition of an Arbitrary Matrix , 1990, SIAM J. Sci. Comput..

[2] N. Higham. A Collection of Test Matrices in MATLAB , 1989 .

[3] Nicholas J. Higham,et al. FORTRAN codes for estimating the one-norm of a real or complex matrix, with applications to condition estimation , 1988, TOMS.

[4] N. Higham. Computing error bounds for regression problems , 1990 .

[5] P. D. Tao. Convergence of a subgradient method for computing the bound norm of matrices , 1984 .

[6] I. Duff,et al. On the augmented system approach to sparse least-squares problems , 1989 .

[7] Laurie A. Hulbert,et al. A direct active set algorithm for large sparse quadratic programs with simple bounds , 1989, Math. Program..

[8] Ian Gladwell,et al. Codes for almost block diagonal systems , 1990 .

[9] Nicholas J. Highham. A survey of condition number estimation for triangular matrices , 1987 .

[10] Pham Dinh Tao. Algorithmes de calcul du maximum des formes quadratiques sur la boule unité de la norme du maximum , 1984 .