and Canada) or $18.00 (elsewhere). If the user sends a small tape (wt. less than 1 lb.) the algorithm will be copied on it and returned to him at a charge of $10.O0 (U.S. only). All orders are to beâ€¦ (More)

In many applications---latent semantic indexing, for example---it is required to obtain a reduced rank approximation to a sparse matrix <i>A</i>. Unfortunately, the approximations based onâ€¦ (More)

abstract The singular value decomposition has a number of applications in digital signal processing. However, the the decomposition must be computed from a matrix consisting of both signal and noise.â€¦ (More)

In this paper we introduce a new decomposition called the pivoted QLP decomposition. It is computed by applying pivoted orthogonal triangulariza-tion to the columns of the matrix X in question to getâ€¦ (More)

In this paper classical matrix perturbation theory is approached from a probabilistic point of view. The perturbed quantity is approximated by a rst-order perturbation expansion, in which theâ€¦ (More)

but about modeling. The style is not technical, but rather conversational. The book addresses a broad community of scientists and engineers. It serves as a field guide of modeling tools. These areâ€¦ (More)