#### Filter Results:

#### Publication Year

2008

2011

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

- Mary E Broadbent, Martin Brown, Kevin Penner, Ilse Ipsen, Rizwana Rehman
- 2010

Subset selection is a method for selecting a subset of columns from a real matrix, so that the subset represents the entire matrix well and is far from being rank deficient. We begin by extending a deterministic subset selection algorithm to matrices that have more columns than rows. Then we investigate a two-stage subset selection algorithm that utilizes a… (More)

We derive absolute perturbation bounds for the coefficients of the characteristic polynomial of a n × n complex matrix. The bounds consist of elementary symmetric functions of singular values, and suggest that coefficients of normal matrices are better conditioned with regard to absolute perturbations than those of general matrices. When the matrix is… (More)

This paper concerns the computation of the coefficients c k of the characteristic polynomial of a real or complex matrix A. We analyze the forward error in the coefficients c k when they are computed from the eigenvalues of A, as is done by MATLAB's poly function. In particular, we derive absolute and relative perturbation bounds for elementary symmetric… (More)

- Rizwana Rehman, Ilse C F Ipsen
- 2010

La Budde's method computes the characteristic polynomial of a real matrix A in two stages: first it applies orthogonal similarity transformations to reduce A to upper Hessenberg form H, and second it computes the characteristic polynomial of H from characteristic polynomials of leading principal submatrices of H. If A is symmetric, then H is symmetric… (More)

- ‹
- 1
- ›