A Block Algorithm for Matrix 1-Norm Estimation, with an Application to 1-Norm Pseudospectra

Authors:
Nicholas J. Higham;Françoise Tisseur
Affiliations:
-;-
Venue:
SIAM Journal on Matrix Analysis and Applications
Year:
2000

Citing 0
Cited 16

Parallel Implementation of a Block Algorithm for Matrix 1-Norm Estimation

Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
The role of conditioning in mesh selection algorithms for first order systems of linear two point boundary value problems

Journal of Computational and Applied Mathematics - Special issue: International workshop on the technological aspects of mathematics
A new mesh selection algorithm, based on conditioning, for two-point boundary value codes

Journal of Computational and Applied Mathematics
Algorithm 894: On a block Schur--Parlett algorithm for ϕ-functions based on the sep-inverse estimate

ACM Transactions on Mathematical Software (TOMS)
A new mesh selection algorithm, based on conditioning, for two-point boundary value codes

Journal of Computational and Applied Mathematics
The role of conditioning in mesh selection algorithms for first order systems of linear two point boundary value problems

Journal of Computational and Applied Mathematics - Special issue: International workshop on the technological aspects of mathematics
Parallel Solvers for Sylvester-Type Matrix Equations with Applications in Condition Estimation, Part I: Theory and Algorithms

ACM Transactions on Mathematical Software (TOMS)
A New Scaling and Squaring Algorithm for the Matrix Exponential

SIAM Journal on Matrix Analysis and Applications
Computing the Action of the Matrix Exponential, with an Application to Exponential Integrators

SIAM Journal on Scientific Computing
An efficient class of direct search surrogate methods for solving expensive optimization problems with CPU-time-related functions

Structural and Multidisciplinary Optimization
Accurate matrix exponential computation to solve coupled differential models in engineering

Mathematical and Computer Modelling: An International Journal
Estimating conditioning of BVPs for ODEs

Mathematical and Computer Modelling: An International Journal
Approximate continuation of harmonic functions in geodesy: A spline based least squares approach with regularization

Journal of Computational and Applied Mathematics
Efficient Numerical Methods for Strongly Anisotropic Elliptic Equations

Journal of Scientific Computing
Algorithm 930: FACTORIZE: An object-oriented linear system solver for MATLAB

ACM Transactions on Mathematical Software (TOMS)
Detecting the causes of ill-conditioning in structural finite element models

Computers and Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

The matrix 1-norm estimation algorithm used in LAPACK and various other software libraries and packages has proved to be a valuable tool. However, it has the limitations that it offers the user no control over the accuracy and reliability of the estimate and that it is based on level 2 BLAS operations. A block generalization of the 1-norm power method underlying the estimator is derived here and developed into a practical algorithm applicable to both real and complex matrices. The algorithm works with n × t matrices, where t is a parameter. For t=1 the original algorithm is recovered, but with two improvements (one for real matrices and one for complex matrices). The accuracy and reliability of the estimates generally increase with t and the computational kernels are level 3 BLAS operations for t 1. The last t-1 columns of the starting matrix are randomly chosen, giving the algorithm a statistical flavor. As a by-product of our investigations we identify a matrix for which the 1-norm power method takes the maximum number of iterations. As an application of the new estimator we show how it can be used to efficiently approximate 1-norm pseudospectra.