Abstract
Splitting methods are examined for the iterative solution of the classical linear least-squares problem in Hilbert space. Conditions for convergence of the class of iterations studied generalize existing conditions in the literature. Throughout, the emphasis is on an organization-theoretic interpretation of the algorithm, thereby clarifying certain questions of decentralization of information and computation. Two examples are discussed in some detail: a matrix example and a standard optimal control problem. When such problems involve very large, sparse matrices the analogy with the "invertible case" is a most compelling argument for further investigation of applicability.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
