Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

CSC
2008

favoriteEmaildiscussreport

124views Applied Computing» more CSC 2008»

An Algorithm for Solving Scaled Total Least Squares Problems

13 years 6 months ago

An Algorithm for Solving Scaled Total Least Squares Problems

Download www.cas.mcmaster.ca

Abstract - In this paper, we present a rankrevealing two-sided orthogonal decomposition method for solving the STLS problem. An error analysis of the algorithm is given. Our numerical experiments show that this algorithm computes the STLS solution as accurate as the SVD method with less computation.

Sanzheng Qiao, Wei Xu, Yimin Wei

Real-time Traffic

Algorithm | Applied Computing | CSC 2008 | SVD Method | Two-sided Orthogonal Decomposition |

claim paper

Related Content

» Structured Total Maximum Likelihood An Alternative to Structured Total Least Squares

» On a quadratic eigenproblem occurring in regularized total least squares

» Solving BoxConstrained Integer Least Squares Problems

» On Weighted Structured Total Least Squares

» On a global optimization technique for solving a nonlinear hyperboloid least squares probl...

» An FPGA Implementation for Solving Least Square Problem

» Least Squares SVM for Least Squares TD Learning

» Least squares surface reconstruction from measured gradient fields

» Blendenpik Supercharging LAPACKs LeastSquares Solver

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2008
Where	CSC
Authors	Sanzheng Qiao, Wei Xu, Yimin Wei

Comments (0)