On computing the best least squares solutions in Hilbert space

DOI10.1007/BF02849512MaRDI QIDQ1248897zbMATH OpenFDO

Authors Sanjo Zlobec

Publication date 1977

Published in Rendiconti del Circolo Matematico di Palermo (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02849512

Mathematics Subject Classification ID

Equations and inequalities involving linear operators, with vector unknowns (47A50) Numerical solutions to equations with linear operators (65J10)

Cites work

• A Note on an Iterative Method for Generalized Inversion of Matrices
• Asymptotic Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
• Extremal solutions of linear equations and generalized inversion between Hilbert spaces
• scientific article; zbMATH DE number 3122640 (Why is no real title available?)
• scientific article; zbMATH DE number 3133020 (Why is no real title available?)
• scientific article; zbMATH DE number 3142422 (Why is no real title available?)
• scientific article; zbMATH DE number 1024452 (Why is no real title available?)
• scientific article; zbMATH DE number 3206520 (Why is no real title available?)
• scientific article; zbMATH DE number 3215568 (Why is no real title available?)
• scientific article; zbMATH DE number 3290633 (Why is no real title available?)
• scientific article; zbMATH DE number 3297530 (Why is no real title available?)
• scientific article; zbMATH DE number 3321564 (Why is no real title available?)
• Numerical methods for solving linear least squares problems
• On generalized inverses and on the uniform convergence of \((I-\beta K)_ n\) with application to iterative methods
• On the Convergence of the Conjugate Gradient Method for Singular Linear Operator Equations
• On the Extrapolated Jacobi or Simultaneous Displacements Method in the Solution of Matrix and Operator Equations
• On Weakly Positive Matrices
• Steepest Descent for Singular Linear Operator Equations

Cited in

(2)

• Calculating the Best Approximate Solution of an Operator Equation
• Successive overrelaxation methods for solving the rank deficient linear least squares problem

This page was built for publication: On computing the best least squares solutions in Hilbert space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1248897)