Upper Bound of Spectral Radius of Iterative Matrices
Song Dai-cai
Abstract
Song Dai-cai
Abstract
According to several iteration methods for solving large linear system,when coefficient matrix is of α-diagonal strictly dominance,a new upper bound for the spectral radius of the iterative matrices was presented.Parameter estimation for JOR method was discussed.Results are applicable not only for α-diagonal strictly dominance,but also for generalized α-diagonal strictly dominant matrices.The known conclusion was improved.Finally,two numerical examples were given for illustrating advantage of results.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
According to several iteration methods for solving large linear system,when coefficient matrix is of α-diagonal strictly dominance,a new upper bound for the spectral radius of the iterative matrices was presented.Parameter estimation for JOR method was discussed.Results are applicable not only for α-diagonal strictly dominance,but also for generalized α-diagonal strictly dominant matrices.The known conclusion was improved.Finally,two numerical examples were given for illustrating advantage of results.
Key concepts: Spectral radius, Diagonally dominant matrix, Diagonal, Mathematics, Upper and lower bounds, Iterative method, Dominance (genetics), Applied mathematics