Linearizations and Distance Problems Associated with Matrix Polynomials.

dc.contributor.authorDas, Biswajit
dc.date.accessioned2020-10-12T12:23:40Z
dc.date.accessioned2023-10-20T12:31:00Z
dc.date.available2020-10-12T12:23:40Z
dc.date.available2023-10-20T12:31:00Z
dc.date.issued2020
dc.descriptionSupervisor: Shreemayee Boraen_US
dc.description.abstractFour different aspects of the study of matrix polynomials are considered in this thesis. Firstly, the vector space based study of linearizations of square regular matrix polynomials undertaken by Mackey et al. (Vector spaces of linearizations for matrix polynomials, SIAM J. Matrix Anal. Appl., 28(4):971--1004, 2006) is extended to the case of the rectangular matrix polynomials. Secondly, it is established that there is a wide choice of linearizations of rectangular matrix polynomials arising from the proposed vector spaces that can be used to solve the associated complete eigenvalue problem for the matrix polynomial in a globally backward stable manner. Thirdly, the distance from a given square matrix polynomial to a nearest matrix polynomial with an elementary divisor of the form (λ - λ0)j, j ≥ r, for a given complex number λ0 and an integer r > 1, is considered. Fourthly, the distance from a given square matrix polynomial to a nearest normal rank deficient matrix polynomial with a given lower bound on the rank deficiency is considered. Special emphasis is on the distance to a nearest singular (or non-regular) matrix polynomial. Both the distance problems are considered in their most general forms and are long standing open questions. In each case, the matrix polynomials of interest are characterized in terms of the suitable rank deficiency of certain block Toeplitz matrices. Based on these characterizations, optimizations for computing the said distances are formulated and upper and lower bounds are derived in various norm settings. In particular, the distance to a nearest singular matrix polynomial is established as the reciprocal of certain μ-value problem and a numerical strategy to compute it based on the information about the minimal indices of a nearest singular matrix polynomial is proposed. The distances are computed via numerical software and compared with several upper and lower bounds in numerical experiments. Results are shown to compare favorably with those in the literature.en_US
dc.identifier.otherROLL NO.136123016
dc.identifier.urihttps://gyan.iitg.ac.in/handle/123456789/1715
dc.language.isoenen_US
dc.relation.ispartofseriesTH-2269;
dc.subjectMATHEMATICSen_US
dc.titleLinearizations and Distance Problems Associated with Matrix Polynomials.en_US
dc.typeThesisen_US
Files
Original bundle
Now showing 1 - 2 of 2
No Thumbnail Available
Name:
Abstract-TH-2269_136123016.pdf
Size:
292.32 KB
Format:
Adobe Portable Document Format
Description:
ABSTRACT
No Thumbnail Available
Name:
TH-2269_136123016.pdf
Size:
1.4 MB
Format:
Adobe Portable Document Format
Description:
THESIS
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Plain Text
Description: