Matrices of small Toeplitz rank, certain representations of the solution to an unstable system of linear equations with Toeplitz coefficient matrices, and related fast algorithms for solving such systems (Q889185): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
CorrectionBot (talk | contribs)
Changed label, description and/or aliases in en, and other parts
 
(One intermediate revision by one other user not shown)
description / endescription / en
scientific article
scientific article; zbMATH DE number 6505321
Property / cites work
 
Property / cites work: Q3706407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3776480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain decompositions of complex inverse Toeplitz matrices and related fast algorithms for solving linear systems with Toeplitz coefficient matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3700677 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3735040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shifted discrete Fourier transformations / rank
 
Normal rank

Latest revision as of 09:28, 10 July 2025

scientific article; zbMATH DE number 6505321
Language Label Description Also known as
English
Matrices of small Toeplitz rank, certain representations of the solution to an unstable system of linear equations with Toeplitz coefficient matrices, and related fast algorithms for solving such systems
scientific article; zbMATH DE number 6505321

    Statements

    Matrices of small Toeplitz rank, certain representations of the solution to an unstable system of linear equations with Toeplitz coefficient matrices, and related fast algorithms for solving such systems (English)
    0 references
    0 references
    6 November 2015
    0 references
    The Toeplitz (cs)- and (sc)-decompositions are introduced and analysed for an arbitary square complex matrix based on their connections with solutions of two implicit Sylvester equations. Then, formulas for the solution of Tikhonov regularization problems are derived. These formulas show that the number of arithmetic operations required for solving a sequence of unstable problems is twice as large as the corresponding number for stable problems.
    0 references
    Toeplitz matrix
    0 references
    Toeplitz system
    0 references
    unstable system
    0 references
    fast algorithm
    0 references
    0 references

    Identifiers