Bounds on the largest singular value of a matrix and the convergence of simultaneous and block‐iterative algorithms for sparse linear systems

DOI10.1111/j.1475-3995.2009.00692.xzbMath1191.65026OpenAlexW2155182203MaRDI QIDQ3563614

Charles L. Byrne

Publication date: 31 May 2010

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1475-3995.2009.00692.x

zbMATH Keywords

convergencesparse linear systemsblock-iterative algorithmssingular-value bounds

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Inequalities involving eigenvalues and eigenvectors (15A42) Iterative numerical methods for linear systems (65F10)

Related Items (max. 100)

Optimal selections of stepsizes and blocks for the block-iterative ART ⋮ Reducing spatially varying out-of-focus blur from natural image ⋮ Continuous-time method and its discretization to inverse problem of intensity-modulated radiation therapy treatment planning

Cites Work

• Unnamed Item
• SIRT- and CG-type methods for the iterative solution of sparse linear least-squares problems
• Condition numbers and equilibration of matrices
• On Diagonally Relaxed Orthogonal Projection Methods
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• Iterative oblique projection onto convex sets and the split feasibility problem
• Component-Averaged Row Projections: A Robust, Block-Parallel Scheme for Sparse Linear Systems
• An Iteration Formula for Fredholm Integral Equations of the First Kind

This page was built for publication: Bounds on the largest singular value of a matrix and the convergence of simultaneous and block‐iterative algorithms for sparse linear systems