| J. L. Barlow, N. K. Nichols, and R. J. Plemmons. Iterative methods for equality-constrained least squares problems. SIAM J. Sci. Stat. Comput., 9 (5):892--906, 1988. |
....guarantees that there is a unique solution [7, Section 5.1] Note that the condition m n Gamma p ensures that the LSE problem is overdetermined and is more general than the common assumption m n. The LSE problem arises in various applications, including the analysis of largescale structures [4] and the solution of the inequality constrained least square problem [16, Chap. 23] coxtonyj ma.man.ac.uk, http: www.ma.man.ac.uk coxtonyj ) higham ma.man.ac.uk, http: www.ma.man.ac.uk higham ) A standard method for solving the LSE problem is the null space method, of which there are ....
J. L. Barlow, N. K. Nichols, and R. J. Plemmons. Iterative methods for equality-constrained least squares problems. SIAM J. Sci. Stat. Comput., 9 (5):892--906, 1988.
....a solution. The second condition in (4.13) which is equivalent to the condition that the matrix [A ; B ] has full rank n, then guarantees that there is a unique solution [8, Section 5. 1] The LSE problem arises in various applications, including the analysis of large scale structures [6] and the solution of the inequality constrained least squares problem [38, Chap. 23] There are two main classes of methods for solving the LSE problem: null space methods and elimination methods, with more than one variation of method within each class. A basic difference between the classes is ....
J. L. Barlow, N. K. Nichols, and R. J. Plemmons. Iterative methods for equalityconstrained least squares problems. SIAM J. Sci. Stat. Comput., 9(5):892--906, 1988.
....trivially: A) B) 0 rank A B = n: 6) These conditions ensure that the problem LSE has a unique solution which we denote by x e . Several methods for solving the problem LSE are discussed in Lawson and Hanson[8, Chaps.20 22] Van Loan[12] For large sparse matrices case, see Barlow et al. [1]. The QR style approach is one of the most common approach. Now this approach can be more easily presented in terms of the GQR factorization of A and B. The Generalized QR Decomposition 10 By the GQR factoization of B T and A T , we know that there are orthogonal matrices Q and Q T A T ....
J. L. Barlow, N. K. Nichols, and R. J. Plemmons, Iterative methods for equality constrained least squares problems, SIAM J. Sci. and Stat. Comp. 9, pp.892-906, 1988.
.... N (B) f0g ( rank A B # = n: 6) These conditions ensure that the problem LSE has a unique solution which we denote by x e . Several methods for solving the problem LSE are discussed in Lawson and Hanson[8, Chaps.20 22] Van Loan[12] For large sparse matrices case, see Barlow et al. [1]. The QR style approach is one of the most common approach. Now this approach can be more easily presented in terms of the GQR factorization of A and B. The Generalized QR Decomposition 10 By the GQR factoization of B T and A T , we know that there are orthogonal matrices Q and U Q T A ....
J. L. Barlow, N. K. Nichols, and R. J. Plemmons, Iterative methods for equality constrained least squares problems, SIAM J. Sci. and Stat. Comp. 9, pp.892-906, 1988.
....guarantees that there is a unique solution [7, Section 5.1] Note that the condition m n Gamma p ensures that the LSE problem is overdetermined and is more general than the common assumption m n. The LSE problem arises in various applications, including the analysis of largescale structures [4] and the solution of the inequality constrained least square problem [16, Chap. 23] Department of Mathematics, University of Manchester, Manchester, M13 9PL, England (coxtonyj ma.man.ac.uk, http: www.ma.man.ac.uk coxtonyj ) y Department of Mathematics, University of Manchester, ....
J. L. Barlow, N. K. Nichols, and R. J. Plemmons. Iterative methods for equality-constrained least squares problems. SIAM J. Sci. Stat. Comput., 9 (5):892--906, 1988.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC