Pages that link to "Item:Q4344265"
From MaRDI portal
The following pages link to An algorithm for computing the numerical radius (Q4344265):
Displaying 14 items.
- Geometric computation of the numerical radius of a matrix (Q1039275) (← links)
- Matrix valued versions of a result of von Neumann with an application to time discretization (Q1062727) (← links)
- Computing the numerical radius (Q1908194) (← links)
- Computing the field of values and pseudospectra using the Lanczos method with continuation (Q1923867) (← links)
- The nearest definite pair for the Hermitian generalized eigenvalue problem (Q1970433) (← links)
- A Subspace Method for Large-Scale Eigenvalue Optimization (Q3130422) (← links)
- An algorithm to find the number of the digitizations of discs with a fixed radius (Q3439222) (← links)
- Numerical radius for the asymptotic stability of delay differential equations (Q4603758) (← links)
- Algorithms for the computation of the pseudospectral radius and the numerical radius of a matrix (Q5709021) (← links)
- Convergence Rate Analysis and Improved Iterations for Numerical Radius Computation (Q6039244) (← links)
- Fast computation of \(\mathrm{sep}_\lambda\) via interpolation-based globality certificates (Q6105419) (← links)
- Variational Characterization of Monotone Nonlinear Eigenvector Problems and Geometry of Self-Consistent Field Iteration (Q6139650) (← links)
- An experimental comparison of methods for computing the numerical radius (Q6197617) (← links)
- Eigenvalue characterization of some structured matrix pencils under linear perturbation (Q6198247) (← links)
