Library

feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • Articles: DFG German National Licenses  (2)
  • 62P30  (1)
  • givens rotations  (1)
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Numerical algorithms 23 (2000), S. 371-392 
    ISSN: 1572-9265
    Keywords: Hankel/Toeplitz matrix ; Structured Total Least Squares ; displacement rank ; 15A03 ; 62P30 ; 65F10
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The Structured Total Least Squares (STLS) problem is a natural extension of the Total Least Squares (TLS) problem when constraints on the matrix structure need to be imposed. Similar to the ordinary TLS approach, the STLS approach can be used to determine the parameter vector of a linear model, given some noisy measurements. In many signal processing applications, the imposition of this matrix structure constraint is necessary for obtaining Maximum Likelihood (ML) estimates of the parameter vector. In this paper we consider the Toeplitz (Hankel) STLS problem (i.e., an STLS problem in which the Toeplitz (Hankel) structure needs to be preserved). A fast implementation of an algorithm for solving this frequently occurring STLS problem is proposed. The increased efficiency is obtained by exploiting the low displacement rank of the involved matrices and the sparsity of the associated generators. The fast implementation is compared to two other implementations of algorithms for solving the Toeplitz (Hankel) STLS problem. The comparison is carried out on a recently proposed speech compression scheme. The numerical results confirm the high efficiency of the newly proposed fast implementation: the straightforward implementations have a complexity of O((m+n)3) and O(m3) whereas the proposed implementation has a complexity of O(mn+n2).
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    New York, NY [u.a.] : Wiley-Blackwell
    Numerical Linear Algebra with Applications 2 (1995), S. 95-113 
    ISSN: 1070-5325
    Keywords: arrowhead matrix ; band matrix ; inverse eigenvalue problem ; givens rotations ; singular value decomposition ; updating ; Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics
    Notes: Various plane rotation patterns are presented, which provide stable algorithms for reducing a b-band matrix bordered by p rows and/or columns to (b + p)-band form. These schemes generalize previously presented O(N2) reduction algorithms for matrices of order N, b = 1, and p = 1 to the reduction of more general b-band, p-bordered matrices where b ≥ 1 and p ≥ 1. Moreover, by splitting the matrix into two similarly structured submatrices and chasing nonzeros to the corners in two directions, the newly proposed patterns reduce the number of required rotations and hence the computational cost by one half compared to the other existing one-way chasing algorithms. Symmetric, as well as more general matrices, are considered. An example of the first type is the symmetric arrowhead matrix that arises in solving inverse eigenvalue problems. Examples of the second type are found in updating the singular value decomposition (SVD) and the partial SVD.
    Additional Material: 7 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...