modify your search
 Results for DC.creator="P." AND DC.creator="T." AND DC.creator="Boggs" in section 8.1.5 of volume C
Conjugate-gradient methods
International Tables for Crystallography (2006). Vol. C, Section 8.1.5.2, pp. 686-687
... is (1) define ; (2) for k = 0, 1, 2, ..., p - 1, (a) ; (b) ; (c) ; (d) . This algorithm finds the ... exact solution for the quadratic function in not more than p steps. This algorithm cannot be used directly for the nonlinear ... an actual line search, and the termination after at most p steps is replaced by a convergence test. Thus, we ...

Methods for sparse matrices
International Tables for Crystallography (2006). Vol. C, Section 8.1.5.1, pp. 685-686
... Z = UA, so that the quadratic form becomes (y' - Zx)T(y' - Zx), and the minimum is the solution of the ... normal equations is then as follows: (1) determine a permutation, P (an orthogonal matrix with one and only one 1 in ... Givens rotations is as follows: (1) bring in the first p rows; (2) find the QR decomposition of this p × ...

Numerical methods for large-scale problems
International Tables for Crystallography (2006). Vol. C, Section 8.1.5, pp. 685-687
... Z = UA, so that the quadratic form becomes (y' - Zx)T(y' - Zx), and the minimum is the solution of the ... normal equations is then as follows: (1) determine a permutation, P (an orthogonal matrix with one and only one 1 in ... Givens rotations is as follows: (1) bring in the first p rows; (2) find the QR decomposition of this p × ...

 powered by