Faster and more accurate computation of the field of values boundary for \textit{n} by \textit{n} matrices

DOI10.1080/03081087.2013.779269MaRDI QIDQ5495741zbMATH OpenOpenAlexFDO

Authors Frank Uhlig

Publication date 7 August 2014

Published in Linear and Multilinear Algebra (Search for Journal in Brave)

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

zbMATH Keywords

algorithmellipseextreme eigenvaluesfield of valuesMATLAB codematrix compressionmatrix pencilnumerical algorithmnumerical range

Mathematics Subject Classification ID

Inequalities involving eigenvalues and eigenvectors (15A42) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Recommendations

• Path-Following Method to Determine the Field of Values of a Matrix with High Accuracy
• Revisiting the inverse field of values problem
• An inverse field of values problem
• A simple algorithm for the inverse field of values problem
• Some results on the field of values of matrix polynomials

Cites work

• Computer generated numerical ranges and some resulting theorems
• Geometry of the numerical range of matrices
• Numerical Determination of the Field of Values of a General Complex Matrix
• The Field of Values of a Complex Matrix, an Explicit Description in the 2 \times 2 Case

Cited in

(3)

• Computing the numerical range of Krein space operators
• Path-Following Method to Determine the Field of Values of a Matrix with High Accuracy
• Zhang Neural Networks for fast and accurate computations of the field of values

Describes a project that uses

Uses Software

• Matlab

This page was built for publication: Faster and more accurate computation of the field of values boundary for \textit{n} by \textit{n} matrices

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