An innovative algorithm for estimating the minimum eigenvalue of M-matrices
From MaRDI portal
An innovative algorithm for estimating the minimum eigenvalue of \(M\)-matrices
Cites work
- A new Jacobi-type iteration method for solving M-matrix or nonnegative linear systems
- A new optimized iterative method for solving \(M\)-matrix linear systems.
- Bounds for the singular values of a matrix with nonnegative eigenvalues
- Comparison theorems for splittings of M-matrices in (block) Hessenberg form
- Exponential stability of a class of quaternion-valued memristor-based neural network with time-varying delay via M-matrix
- scientific article; zbMATH DE number 193132 (Why is no real title available?)
- scientific article; zbMATH DE number 635657 (Why is no real title available?)
- scientific article; zbMATH DE number 7640510 (Why is no real title available?)
- Inequalities for the minimum eigenvalue of M-matrices
- Lower bound estimation of the minimum eigenvalue of Hadamard product of an \(M\)-matrix and its inverse
- Lower bounds for the minimum eigenvalue of Hadamard product of \(M\)-matrices
- New inequalities for the minimum eigenvalue of M-matrices
- New inequalities on the Fan product of M-matrices
- On an analogue of a property of singular M -matrices for the Lyapunov and Stein operators
- On the Hadamard product A A, for a singular M-matrix A
- On Two-Sided Bounds Related to Weakly Diagonally Dominant M-Matrices with Application to Digital Circuit Dynamics
- Random walks associated with symmetric \(M\)-matrices
- Some lower bounds with a parameter for the minimum eigenvalue of Hadamard product of \(M\)-matrices and inverse \(M\)-matrices
- Über die Determinanten mit überwiegender Hauptdiagonale
This page was built for publication: An innovative algorithm for estimating the minimum eigenvalue of \(M\)-matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6886241)