Band-restricted diagonally dominant matrices: computational complexity and application
DOI10.1016/j.jcss.2018.10.006zbMath1410.68176OpenAlexW2902722366WikidataQ128855667 ScholiaQ128855667MaRDI QIDQ1713483
Daiki Hirata, Hiroaki Yamamoto, Shuji Jimbo, Norikazu Takahashi
Publication date: 25 January 2019
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2018.10.006
computational complexityconvergenceneural networkdecision problemband-restricted diagonally dominant matrix
Analysis of algorithms and problem complexity (68Q25) Neural networks for/in biological studies, artificial life and related topics (92B20) Hermitian, skew-Hermitian, and related matrices (15B57) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Canonical forms, reductions, classification (15A21)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Self-corrective iterations (SCI) for generalized diagonally dominant matrices
- On bounds of extremal eigenvalues of irreducible and \(m\)-reducible matrices
- ``Neural computation of decisions in optimization problems
- Block diagonally dominant matrices and generalizations of the Gerschgorin circle theorem
- Criteria for generalized diagonally dominant matrices and \(M\)-matrices
- Neural theory of association and concept-formation
- A new criterion for the H-matrix property
- A note on generalized diagonally dominant matrices
- An incomplete factorization preconditioning method based on modification of element matrices
- Convergence of generalized AOR iterative method for linear systems with strictly diagonally dominant matrices
- On convergence of the generalized AOR method for linear systems with diagonally dominant coefficient matrices
- Stability of 1-D-CNN's with Dirichlet boundary conditions and global propagation dynamics
- Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems
- Cellular neural networks: theory
- On an Accelerated Overrelaxation Iterative Method for Linear Systems With Strictly Diagonally Dominant Matrix
- Semistrict Diagonal Dominance
- On the complete stability of nonsymmetric cellular neural networks
- Neural networks and physical systems with emergent collective computational abilities.
- Maximizing Algebraic Connectivity in the Space of Graphs With a Fixed Number of Vertices and Edges
- Nonlinear Generalizations of Matrix Diagonal Dominance with Application to Gauss–Seidel Iterations
- A Recurring Theorem on Determinants
This page was built for publication: Band-restricted diagonally dominant matrices: computational complexity and application
