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
  • Mathematics Subject Classification (1991):65F15  (1)
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 72 (1996), S. 391-417 
    ISSN: 0945-3245
    Keywords: Mathematics Subject Classification (1991):65F15
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary. We present a numerical algorithm for computing a few extreme generalized singular values and corresponding vectors of a sparse or structured matrix pair $\{A,B\}$ . The algorithm is based on the CS decomposition and the Lanczos bidiagonalization process. At each iteration step of the Lanczos process, the solution to a linear least squares problem with $(A^{\rm T},B^{\rm T})^{\rm T}$ as the coefficient matrix is approximately computed, and this consists the only interface of the algorithm with the matrix pair $\{A,B\}$ . Numerical results are also given to demonstrate the feasibility and efficiency of the algorithm.
    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...