Convergence Rate Analysis and Improved Iterations for Numerical Radius Computation
From MaRDI portal
Publication:6039244
DOI10.1137/21m1455826zbMath1512.65063arXiv2002.00080OpenAlexW3003740802MaRDI QIDQ6039244
Publication date: 4 May 2023
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.00080
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Numerical range, numerical radius (47A12) Complexity and performance of numerical algorithms (65Y20)
Related Items (3)
Fast computation of \(\mathrm{sep}_\lambda\) via interpolation-based globality certificates ⋮ Variational Characterization of Monotone Nonlinear Eigenvector Problems and Geometry of Self-Consistent Field Iteration ⋮ An experimental comparison of methods for computing the numerical radius
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A fast algorithm to compute the \(H_{\infty}\)-norm of a transfer function matrix
- A regularity result for the singular values of a transfer matrix and a quadratically convergent algorithm for computing its \(L_{\infty}\)-norm
- Geometric computation of the numerical radius of a matrix
- Geometry of the numerical range of matrices
- Computing the numerical radius
- On matrices whose numerical ranges have circular or weak circular symmetry
- Numerical investigation of Crouzeix's conjecture
- On properties of univariate max functions at local maximizers
- On eigenvalues of matrices dependent on a parameter
- An elementary proof of the power inequality for the numerical radius
- A Bisection Method for Measuring the Distance of a Stable Matrix to the Unstable Matrices
- Über Die Stabilitätsdefinition Für Differenzengleichungen Die Partielle Differentialgleichungen Approximieren
- Matrix Completions, Norms, and Hadamard Products
- Numerical Determination of the Field of Values of a General Complex Matrix
- Numerical Optimization
- An algorithm for computing the numerical radius
- Robust stability and a criss-cross algorithm for pseudospectra
- Faster and More Accurate Computation of the $\mathcal{H}_\infty$ Norm via Optimization
- Subspace Acceleration for the Crawford Number and Related Eigenvalue Optimization Problems
- Numerical Computation of Deflating Subspaces of Skew-Hamiltonian/Hamiltonian Pencils
- Fast Interpolation-Based Globality Certificates for Computing Kreiss Constants and the Distance to Uncontrollability
- Partial Smoothness of the Numerical Radius at Matrices Whose Fields of Values are Disks
- Extended and Improved Criss-Cross Algorithms for Computing the Spectral Value Set Abscissa and Radius
- Algorithms for the computation of the pseudospectral radius and the numerical radius of a matrix
- Über den Wertevorrat einer Matrix
- Computing the Kreiss Constant of a Matrix
This page was built for publication: Convergence Rate Analysis and Improved Iterations for Numerical Radius Computation
