On estimating the separation of two periodic matrix sequences (Q512846): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10543-016-0621-1 / rank
Normal rank
 
Property / review text
 
The separation of a matrix pair \((A,B)\) is \(\min_{\|X\|=1}\|AX-XB\|\) (Frobenius norms). In a previous paper [Numer. Math. 134, No. 2, 223--247 (2016; Zbl 1353.15018)] the author generalized this and considered estimating the separation of two pairs of matrices. In this paper, this is further extended to the estimation of lower and upper bounds for the separation of two periodic sequences of matrices with periods \(\{A_k\}_{k=1}^{K-1}\) and \(\{B_k\}_{k=1}^{K-1}\). To obtain these, the periodic Schur decomposition as in the paper by \textit{R. Granat} and \textit{B. Kågström} [SIAM J. Matrix Anal. Appl. 28, No. 1, 285--300 (2006; Zbl 1113.65039)] is used. The result is important to measure the sensitivity of the solution of a set of periodic Sylvester equations.
Property / review text: The separation of a matrix pair \((A,B)\) is \(\min_{\|X\|=1}\|AX-XB\|\) (Frobenius norms). In a previous paper [Numer. Math. 134, No. 2, 223--247 (2016; Zbl 1353.15018)] the author generalized this and considered estimating the separation of two pairs of matrices. In this paper, this is further extended to the estimation of lower and upper bounds for the separation of two periodic sequences of matrices with periods \(\{A_k\}_{k=1}^{K-1}\) and \(\{B_k\}_{k=1}^{K-1}\). To obtain these, the periodic Schur decomposition as in the paper by \textit{R. Granat} and \textit{B. Kågström} [SIAM J. Matrix Anal. Appl. 28, No. 1, 285--300 (2006; Zbl 1113.65039)] is used. The result is important to measure the sensitivity of the solution of a set of periodic Sylvester equations. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Adhemar Bultheel / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65F30 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65F15 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6690972 / rank
 
Normal rank
Property / zbMATH Keywords
 
separation
Property / zbMATH Keywords: separation / rank
 
Normal rank
Property / zbMATH Keywords
 
periodic Schur decomposition
Property / zbMATH Keywords: periodic Schur decomposition / rank
 
Normal rank
Property / zbMATH Keywords
 
periodic Sylvester equation
Property / zbMATH Keywords: periodic Sylvester equation / rank
 
Normal rank
Property / zbMATH Keywords
 
Frobenius norm
Property / zbMATH Keywords: Frobenius norm / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10543-016-0621-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2421844967 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bound estimation for the separation of two matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perturbation analysis for the eigenvalue problem of a formal product of matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On estimating the separation of two regular matrix pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perturbation bounds for the periodic Schur decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coupled Sylvester-type Matrix Equations and Block Diagonalization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5185900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Direct Eigenvalue Reordering in a Product of Matrices in Periodic Schur Form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Condition Estimates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: FORTRAN codes for estimating the one-norm of a real or complex matrix, with applications to condition estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed and Shared Memory Block Algorithms for the Triangular Sylvester Equation with $\operatorname{sep}^{ - 1} $ Estimators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing eigenspaces with specified eigenvalues of a regular matrix pair \((A,B)\) and condition estimation: Theory, algorithms and software / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5186633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5186634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Separation of Two Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4322666 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10543-016-0621-1 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:00, 9 December 2024

scientific article
Language Label Description Also known as
English
On estimating the separation of two periodic matrix sequences
scientific article

    Statements

    On estimating the separation of two periodic matrix sequences (English)
    0 references
    0 references
    0 references
    2 March 2017
    0 references
    The separation of a matrix pair \((A,B)\) is \(\min_{\|X\|=1}\|AX-XB\|\) (Frobenius norms). In a previous paper [Numer. Math. 134, No. 2, 223--247 (2016; Zbl 1353.15018)] the author generalized this and considered estimating the separation of two pairs of matrices. In this paper, this is further extended to the estimation of lower and upper bounds for the separation of two periodic sequences of matrices with periods \(\{A_k\}_{k=1}^{K-1}\) and \(\{B_k\}_{k=1}^{K-1}\). To obtain these, the periodic Schur decomposition as in the paper by \textit{R. Granat} and \textit{B. Kågström} [SIAM J. Matrix Anal. Appl. 28, No. 1, 285--300 (2006; Zbl 1113.65039)] is used. The result is important to measure the sensitivity of the solution of a set of periodic Sylvester equations.
    0 references
    separation
    0 references
    periodic Schur decomposition
    0 references
    periodic Sylvester equation
    0 references
    Frobenius norm
    0 references

    Identifiers