Least squares modifications with inverse factorizations: Parallel implications
نویسندگان
چکیده
منابع مشابه
Recursive least squares with stabilized inverse factorization
Recently developed recursive least squares schemes, where the square root of both the covariance and the information matrix are stored and updated, are known to be particularly suited for parallel implementation. However, when finite precision arithmetic is used, round-off errors apparently accumulate unboundedly, so that after a number of updates the computed least squares solutions turn out t...
متن کاملUsing Perturbed QR Factorizations to Solve Linear Least-Squares Problems
We propose and analyze a new tool to help solve sparse linear least-squares problems minx ‖Ax − b‖2. Our method is based on a sparse QR factorization of a low-rank perturbation Ä of A. More precisely, we show that the R factor of Ä is an effective preconditioner for the least-squares problem minx ‖Ax−b‖2, when solved using LSQR. We propose applications for the new technique. When A is rank defi...
متن کاملSelectively Damped Least Squares for Inverse Kinematics
We introduce a method of selectively damped least squares (SDLS) for inverse kinematics, designed for multibodies with multiple end effectors. This method is compared with Jacobian transpose and damped least squares methods. SDLS has advantages in converging in fewer iterations, in not requiring ad hoc damping constants, and in converging quickly to reachable targets. Experiments show the impor...
متن کاملPEDOMODELS FITTING WITH FUZZY LEAST SQUARES REGRESSION
Pedomodels have become a popular topic in soil science and environmentalresearch. They are predictive functions of certain soil properties based on other easily orcheaply measured properties. The common method for fitting pedomodels is to use classicalregression analysis, based on the assumptions of data crispness and deterministic relationsamong variables. In modeling natural systems such as s...
متن کاملParallel variable distribution for total least squares
A novel parallel method for determining an approximate total least squares (TLS) solution is introduced. Based on domain distribution, the global TLS problem is partitioned into several dependent TLS subproblems. A convergent algorithm using the parallel variable distribution technique (Ferris and Mangasarian, 1994) is presented. Numerical results support the development and analysis of the alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1989
ISSN: 0377-0427
DOI: 10.1016/0377-0427(89)90363-4