Path-Following Method to Determine the Field of Values of a Matrix with High Accuracy

DOI10.1137/17M1148608zbMath1453.65082OpenAlexW2903483291WikidataQ128844279 ScholiaQ128844279MaRDI QIDQ4644412

Peter Maxwell, Sébastien Loisel

Publication date: 7 January 2019

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/17m1148608

zbMATH Keywords

numerical rangefield of valuesRunge-Kutta methodseigenvalue crossingeigenvalue perturbationJohnson's algorithmDormand-Princeparametrized eigenvalue problem

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Hermitian, skew-Hermitian, and related matrices (15B57) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items

Zhang Neural Networks for fast and accurate computations of the field of values, Path-following methods for calculating linear surface wave dispersion relations on vertical shear flows, Coalescing Eigenvalues and Crossing Eigencurves of 1-Parameter Matrix Flows, Time-varying matrix eigenanalyses via Zhang neural networks and look-ahead finite difference equations, On the unitary block-decomposability of 1-parameter matrix flows and static matrices

Uses Software

• Eigtool
• BRENT
• PSAPSR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Continuation of eigenvalues and invariant pairs for parameterized nonlinear eigenvalue problems
• On the numerical range of a bounded operator
• Numerical range and functional calculus in Hilbert space
• A family of embedded Runge-Kutta formulae
• Normality and the numerical range
• On geometric properties of the numerical range
• Computing the field of values and pseudospectra using the Lanczos method with continuation
• Subspace Acceleration for Large-Scale Parameter-Dependent Hermitian Eigenproblems
• Subspace Methods for Computing the Pseudospectral Abscissa and the Stability Radius
• Erratum/Addendum: Differential Equations for Roaming Pseudospectra: Paths to Extremal Points and Boundary Tracking
• Computer generated numerical ranges and some resulting theorems
• Differential Equations for Roaming Pseudospectra: Paths to Extremal Points and Boundary Tracking
• Solving Ordinary Differential Equations I
• Fast Algorithms for the Approximation of the Pseudospectral Abscissa and Pseudospectral Radius of a Matrix
• Field Convexity of a Square Matrix
• Continuation of Invariant Subspaces for Parameterized Quadratic Eigenvalue Problems
• Some Practical Runge-Kutta Formulas
• Numerical Determination of the Field of Values of a General Complex Matrix
• On the Field of Values of a Square Matrix
• Computation of Pseudospectra by Continuation
• Homotopy Method for the Large, Sparse, Real Nonsymmetric Eigenvalue Problem
• A simple proof of the elliptical range theorem
• Flat portions on the boundary of the numerical ranges of certain Toeplitz matrices
• On the numerical range of a matrix
• Faster and more accurate computation of the field of values boundary fornbynmatrices
• Shorter Notes: Toeplitz-Hausdorff Theorem on Numerical Ranges
• Shorter Notes: The Toeplitz-Hausdorff Theorem for Linear Operators
• The Toeplitz-Hausdorff Theorem Explained
• Über den Wertevorrat einer Matrix