Add to ORKGAbstract. The generalized linear least squares problem is treated here as a linear least squares problem with linear equality constraints. Advantage is taken of this formulation to produce a numerically stable algorithm based on plane rotations which is designed for fast computation, especially for large structured problems. The algorithm can be made to handle any rank deficiency in the matrices. A rounding error analysis and operation counts are given. The use of nonunitary transformations is considered
AbstractWe present algorithms which apply self-scaling fast plane rotations to the QR decomposition ...
This report describes the implementation of an algorithm of Stoer and Schittkowski for solving linea...
. Recently, Higham and Wald'en, Karlson, and Sun have provided formulas for computing the best ...
Abstract. We survey the numerical stability of some fast algorithms for solving systems of linear eq...
AbstractUsually generalized least squares problems are solved by transforming them into regular leas...
This paper analyzes linear least squares problems with absolute quadratic constraints. We develop a ...
We survey the numerical stability of some fast algorithms for solving systems of linear equations an...
The equality constrained indefinite least squares problem involves the minimization of an indefinite...
The paper describes a numerically stable algorithm to solve constrained linear least-squares problem...
In a recent paper [4], Li et al. gave a generalized successive overrelaxation (GSCR) method for the ...
AbstractWe describe a direct method for solving sparse linear least squares problems. The storage re...
AbstractA new algorithm is presented for the efficient solution of large least squares problems in w...
. The linear least squares problem arises in many areas of sciences and engineerings. When the coef...
Abstract In this article, we present a QR updating procedure as a solution approach for linear least...
Data like temperature or sales of seasonal products can be seen in periods fluctuating between highs...
AbstractWe present algorithms which apply self-scaling fast plane rotations to the QR decomposition ...
This report describes the implementation of an algorithm of Stoer and Schittkowski for solving linea...
. Recently, Higham and Wald'en, Karlson, and Sun have provided formulas for computing the best ...
Abstract. We survey the numerical stability of some fast algorithms for solving systems of linear eq...
AbstractUsually generalized least squares problems are solved by transforming them into regular leas...
This paper analyzes linear least squares problems with absolute quadratic constraints. We develop a ...
We survey the numerical stability of some fast algorithms for solving systems of linear equations an...
The equality constrained indefinite least squares problem involves the minimization of an indefinite...
The paper describes a numerically stable algorithm to solve constrained linear least-squares problem...
In a recent paper [4], Li et al. gave a generalized successive overrelaxation (GSCR) method for the ...
AbstractWe describe a direct method for solving sparse linear least squares problems. The storage re...
AbstractA new algorithm is presented for the efficient solution of large least squares problems in w...
. The linear least squares problem arises in many areas of sciences and engineerings. When the coef...
Abstract In this article, we present a QR updating procedure as a solution approach for linear least...
Data like temperature or sales of seasonal products can be seen in periods fluctuating between highs...
AbstractWe present algorithms which apply self-scaling fast plane rotations to the QR decomposition ...
This report describes the implementation of an algorithm of Stoer and Schittkowski for solving linea...
. Recently, Higham and Wald'en, Karlson, and Sun have provided formulas for computing the best ...