ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Low-rank revealing QR factorizations (1994)
    New York, NY [u.a.] : Wiley-Blackwell
    Numerical Linear Algebra with Applications 1 (1994), S. 33-44 
    Details
    ISSN: 1070-5325
    Keywords: Rank revealing QR factorization ; Column pivoting ; Numerical rank ; Subset selection ; Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics
    Notes: Rank revealing factorizations are used extensively in signal processing in connection with, for example, linear prediction and signal subspace algorithms. We present an algorithm for computing rank revealing QR factorizations of low-rank matrices. The algorithm produces tight upper and lower bounds for all the largest singular values, thus making it particularly useful for treating rank deficient problems by means of subset selection, truncated QR, etc. The algorithm is similar in spirit to an algorithm suggested earlier by Chan for matrices with a small nullity, and it can also be considered as an extension of ordinary column pivoting.
    Additional Material: 1 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nla.1680010105
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Piecewise Polynomial Solutions Without a priori Break Points (1996)
    New York, NY [u.a.] : Wiley-Blackwell
    Numerical Linear Algebra with Applications 3 (1996), S. 513-524 
    Details
    ISSN: 1070-5325
    Keywords: regularization ; I-norm ; discontinuous solutions ; Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics
    Notes: In certain inverse problems it is useful to be able to compute solutions which are, in some sense, as simple as possible. For example,k one may wish to compute solutions which are piecewise constant and with as few discontinuities as possible. Such solutions are suited to describe models, e.g., geological layers, where the coarse structure is more important than the fine structure. A natural generalization of piecewise constant functions is piecewise polynomial solutions. In this paper we present a new algorithm which is capable of computing solutions that are piecewise polynomials, without having to specify a priori the positions of the break points between the polynomial pieces.
    Additional Material: 5 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...