Homotopy method for the eigenvalues of symmetric tridiagonal matrices (Q455904): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / author
 
Property / author: D. Rodríguez-Gómez / rank
 
Normal rank
Property / review text
 
The authors present a homotopy method for separately finding eigenvalues of symmetric, tridiagonal matrices. It is assumed that \(A\) has distinct diagonal elements and nonzero offdiagonal elements. Let \(D\) be the diagonal of \(A\) and \(E = A-D\). Define the matrix-valued function \(H(t) = D + t(A-D)\). Then \(H\) is a smooth function, \(H(0) = D\) and \(H(1) = A\). Theorems from perturbation theory tell us that there are curves in \(\mathbb R^2\) which give the eigenvalues of \(H(t)\) at any time. By assumption, \(H(t)\) is always symmetric and has \(n\) distinct eigenvalues. A bound on the timestep is shown to guarantee the convergence of Newton's method. This result takes the error in the approximation of the eigenpair into account. An improvement to the method is presented which involves using a different starting matrix.
Property / review text: The authors present a homotopy method for separately finding eigenvalues of symmetric, tridiagonal matrices. It is assumed that \(A\) has distinct diagonal elements and nonzero offdiagonal elements. Let \(D\) be the diagonal of \(A\) and \(E = A-D\). Define the matrix-valued function \(H(t) = D + t(A-D)\). Then \(H\) is a smooth function, \(H(0) = D\) and \(H(1) = A\). Theorems from perturbation theory tell us that there are curves in \(\mathbb R^2\) which give the eigenvalues of \(H(t)\) at any time. By assumption, \(H(t)\) is always symmetric and has \(n\) distinct eigenvalues. A bound on the timestep is shown to guarantee the convergence of Newton's method. This result takes the error in the approximation of the eigenpair into account. An improvement to the method is presented which involves using a different starting matrix. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Rémi Vaillancourt / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65F15 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6097334 / rank
 
Normal rank
Property / zbMATH Keywords
 
eigenvalue
Property / zbMATH Keywords: eigenvalue / rank
 
Normal rank
Property / zbMATH Keywords
 
Newton-Kantorovich theorem
Property / zbMATH Keywords: Newton-Kantorovich theorem / rank
 
Normal rank
Property / zbMATH Keywords
 
homotopy method
Property / zbMATH Keywords: homotopy method / rank
 
Normal rank
Property / zbMATH Keywords
 
symmetric, tridiagonal matrices
Property / zbMATH Keywords: symmetric, tridiagonal matrices / rank
 
Normal rank
Property / zbMATH Keywords
 
convergence
Property / zbMATH Keywords: convergence / rank
 
Normal rank
Property / zbMATH Keywords
 
Newton's method
Property / zbMATH Keywords: Newton's method / rank
 
Normal rank

Revision as of 11:35, 30 June 2023

scientific article
Language Label Description Also known as
English
Homotopy method for the eigenvalues of symmetric tridiagonal matrices
scientific article

    Statements

    Homotopy method for the eigenvalues of symmetric tridiagonal matrices (English)
    0 references
    0 references
    0 references
    22 October 2012
    0 references
    The authors present a homotopy method for separately finding eigenvalues of symmetric, tridiagonal matrices. It is assumed that \(A\) has distinct diagonal elements and nonzero offdiagonal elements. Let \(D\) be the diagonal of \(A\) and \(E = A-D\). Define the matrix-valued function \(H(t) = D + t(A-D)\). Then \(H\) is a smooth function, \(H(0) = D\) and \(H(1) = A\). Theorems from perturbation theory tell us that there are curves in \(\mathbb R^2\) which give the eigenvalues of \(H(t)\) at any time. By assumption, \(H(t)\) is always symmetric and has \(n\) distinct eigenvalues. A bound on the timestep is shown to guarantee the convergence of Newton's method. This result takes the error in the approximation of the eigenpair into account. An improvement to the method is presented which involves using a different starting matrix.
    0 references
    eigenvalue
    0 references
    Newton-Kantorovich theorem
    0 references
    homotopy method
    0 references
    symmetric, tridiagonal matrices
    0 references
    convergence
    0 references
    Newton's method
    0 references

    Identifiers