A General Updating Algorithm for Constrained Linear Least Squares Problems
Linear least squares problems which are sparse except for a small subset of dense equations can be efficiently solved by an updating method. Often the least squares solution is also required to satisf...
Linear least squares problems which are sparse except for a small subset of dense equations can be efficiently solved by an updating method. Often the least squares solution is also required to satisf...
Open Boundary Conditions for Forced Waves in a Rotating Fluid
Previous studies on open boundary conditions in unbounded rotating fluid flows have concentrated on how to accurately simulate the outflow of free waves through an open boundary. In most limited area ...
Previous studies on open boundary conditions in unbounded rotating fluid flows have concentrated on how to accurately simulate the outflow of free waves through an open boundary. In most limited area ...
You are not logged in to this journal. Log in
Rank Degeneracy
SIAM J. Sci. and Stat. Comput. Volume 5, Issue 2, pp. 403-413 (June 1984)
Issue Date: June 1984
Connotea
CiteULike
del.icio.us
BibSonomy
At some point in many applications a decision must be made about the rank of a matrix. The decision is frequently complicated by the fact that the matrix in question is contaminated with errors. This paper surveys some of the more commonly used methods for approximating rank, with particular attention being paid to the effects of errors.
©1984 Society for Industrial and Applied Mathematics
| History: | Received 1982-06-04 |
| Permalink: | http://dx.doi.org/10.1137/0905030 |
KEYWORDS and AMS
PUBLICATION DATA
1064-8275 (print)
1095-7197 (online)
SIAM