Abstract
The total least squares problem with linear equality constraint is proved to be approximated by an unconstrained total least squares problem with a large weight on the constraint. A criterion for choosing the weighting factor is given, and a QR-based inverse (QR-INV) iteration method is presented. Numerical results show that the QR-INV method is more efficient than the standard QR-SVD procedure and Schaffrin's inverse iteration method, especially for large and sparse matrices.
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.
