An interval-matrix branch-and-bound algorithm for bounding eigenvalues

DOI10.1080/10556788.2016.1184663MaRDI QIDQ4594837zbMATH OpenOpenAlexFDO

Authors Dimitrios Nerantzis, Claire S. Adjiman

Publication date 24 November 2017

Published in Optimization Methods \& Software (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1080/10556788.2016.1184663

zbMATH Keywords

branch and boundeigenvalue boundsglobal optimizationinterval matrix

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Interval and finite arithmetic (65G30) Numerical computation of solutions to systems of equations (65H10) Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Computing bounds to real eigenvalues of real-interval matrices
• scientific article; zbMATH DE number 1419237
• Bounding the Eigenvectors for Symmetric Interval Matrices
• Bounds on real eigenvalues and singular values of interval matrices
• Analysis of eigenvalue bounds for real symmetric interval matrices

Cited in

(3)

• Computing bounds to real eigenvalues of real-interval matrices
• scientific article; zbMATH DE number 1419237 (Why is no real title available?)
• Bounds on Eigenvalues of Matrices Arising from Interior-Point Methods

This page was built for publication: An interval-matrix branch-and-bound algorithm for bounding eigenvalues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4594837)