The residual based interactive least squares algorithms and simulation studies

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fuzzy least-squares algorithms for interactive fuzzy linear regression models

Fuzzy regression analysis can be thought of as a fuzzy variation of classical regression analysis. It has been widely studied and applied in diverse areas. In general, the analysis of fuzzy regression models can be roughly divided into two categories. The 0rst is based on Tanaka’s linear-programming approach. The second category is based on the fuzzy least-squares approach. In this paper, new t...

متن کامل

​Rank based Least-squares Independent Component Analysis

  In this paper, we propose a nonparametric rank-based alternative to the least-squares independent component analysis algorithm developed. The basic idea is to estimate the squared-loss mutual information, which used as the objective function of the algorithm, based on its copula density version. Therefore, no marginal densities have to be estimated. We provide empirical evaluation of th...

متن کامل

Bounds for the Least Squares Residual Using Scaled Total Least Squares

The standard approaches to solving overdetermined linear systems Ax ≈ b construct minimal corrections to the data to make the corrected system compatible. In ordinary least squares (LS) the correction is restricted to the right hand side b, while in scaled total least squares (Scaled TLS) [10; 7] corrections to both b and A are allowed, and their relative sizes are determined by a real positive...

متن کامل

Unifying Least Squares, Total Least Squares and Data Least Squares

The standard approaches to solving overdetermined linear systems Ax ≈ b construct minimal corrections to the vector b and/or the matrix A such that the corrected system is compatible. In ordinary least squares (LS) the correction is restricted to b, while in data least squares (DLS) it is restricted to A. In scaled total least squares (Scaled TLS) [15], corrections to both b and A are allowed, ...

متن کامل

Approximate QR-Based Algorithms for Recursive Nonlinear Least Squares Estiamtion

This paper proposes new approximate QR-based algorithms for recursive nonlinear least squares (NLS) estimation. Two QR decomposition-based recursive algorithms are introduced based on the classical Gauss-Newton (GN) and Levenberg-Marquardt (LM) algorithms in nonlinear unconstrained optimization or least squares problems. Instead of using the matrix inversion formula, recursive QR decomposition ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Mathematics with Applications

سال: 2009

ISSN: 0898-1221

DOI: 10.1016/j.camwa.2009.02.037