scientific article; zbMATH DE number 7373353
From MaRDI portal
Publication:5003340
Publication date: 21 July 2021
Full work available at URL: https://journals.uwyo.edu/index.php/ela/article/view/5181
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18) Algorithms with automatic result verification (65G20)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Numerical enclosure for multiple eigenvalues of an Hermitian matrix whose graph is a tree
- Numerical enclosure for each eigenvalue in generalized eigenvalue problem
- Fast enclosure for all eigenvalues in generalized eigenvalue problems
- The lower and upper bounds on Perron root of nonnegative irreducible matrices
- Iterative improvement of componentwise error bounds of invariant subspaces belonging to a double or nearly double eigenvalue
- Uncoupling the Perron eigenvector problem
- Guaranteed inclusions for the complex generalized eigenproblem
- Error bounds for computed eigenvalues and eigenvectors. II
- The calculation of guaranteed bounds for eigenvalues using complementary variational principles
- Error bounds for computed eigenvalues and eigenvectors
- On eigenvector bounds
- A simple derivation of the Hansen-Bliek-Rohn-Ning-Kearfott enclosure for linear interval equations
- Localization of Perron roots
- Accurate solution of dense linear systems. II: Algorithms using directed rounding
- An a posteriori verification method for generalized real-symmetric eigenvalue problems in large-scale electronic state calculations
- Verified partial eigenvalue computations using contour integrals for Hermitian generalized eigenproblems
- Unzerlegbare, nicht negative Matrizen
- Fast Enclosure for All Eigenvalues and Invariant Subspaces in Generalized Eigenvalue Problems
- A Unified Approach to Enclosure Methods for Eigenpairs
- Computer Algebra in Scientific Computing
- Risk-Sensitive Markov Decision Processes
- Depth-First Search and Linear Graph Algorithms
- Fast enclosure of matrix eigenvalues and singular values via rounding mode controlled computation
- Computational error bounds for multiple or nearly multiple eigenvalues
- A simple method for error bounds of eigenvalues of symmetric matrices
This page was built for publication:
