منابع مشابه
Least-squares approximation by a tree distance
Let T be a tree with vertex set V (T ) = {1, . . . , n} and with a positive weight associated with each edge. The tree distance between i and j is the weight of the ij-path. Given a symmetric, positive real valued function on V (T )×V (T ), we consider the problem of approximating it by a tree distance corresponding to T, by the least-squares method. The problem is solved explicitly when T is a...
متن کاملFast Nonnegative Least Squares Through Flexible Krylov Subspaces
Constrained least squares problems arise in a variety of applications, and many iterative methods are already available to compute their solutions. This paper proposes a new efficient approach to solve nonnegative linear least squares problems. The associated KKT conditions are leveraged to form an adaptively preconditioned linear system, which is then solved by a flexible Krylov subspace metho...
متن کاملBounds for the least squares distance using scaled total least squares
The standard approaches to solving overdetermined linear systems Bx ≈ c 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 c, while in scaled total least squares (STLS) [14, 12] corrections to both c and B are allowed, and their relative sizes are determined by a real positive para...
متن کاملDistance-Based Partial Least Squares Analysis
Distances matrices are traditionally analyzed with statistical methods that represent distances as maps such as Metric Multidimensional Scaling (MDS), Generalized Procrustes Analysis (GPA), Individual Differences Scaling (INDSCAL), and DISTATIS. MDS analyzes only one distance matrix at a time while GPA, INDSCAL and DISTATIS extract similarities between several distance matrices. However, none o...
متن کاملRNA structural motif recognition based on least-squares distance.
RNA structural motifs are recurrent structural elements occurring in RNA molecules. RNA structural motif recognition aims to find RNA substructures that are similar to a query motif, and it is important for RNA structure analysis and RNA function prediction. In view of this, we propose a new method known as RNA Structural Motif Recognition based on Least-Squares distance (LS-RSMR) to effectivel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1996
ISSN: 0024-3795
DOI: 10.1016/0024-3795(95)00648-6