pith. sign in

arxiv: 1211.0535 · v1 · pith:FSN32OESnew · submitted 2012-11-02 · 🧮 math.NA · cs.NA

The calculation of the distance to a nearby defective matrix

classification 🧮 math.NA cs.NA
keywords matrixalgorithmdefectivedistancenearbyachievedalamalgebra
0
0 comments X
read the original abstract

In this paper a new fast algorithm for the computation of the distance of a matrix to a nearby defective matrix is presented. The problem is formulated following Alam & Bora (Linear Algebra Appl., 396 (2005), pp.~273--301) and reduces to finding when a parameter-dependent matrix is singular subject to a constraint. The solution is achieved by an extension of the Implicit Determinant Method introduced by Spence & Poulton (J. Comput. Phys., 204 (2005), pp.~65--81). Numerical results for several examples illustrate the performance of the algorithm.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.