Computing tall skinny solutions of \(AX-XB=C\)

DOI10.1016/S0378-4754(02)00091-5zbMath1013.65035MaRDI QIDQ1861358

Jan H. Brandts

Publication date: 16 March 2003

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

zbMATH Keywords

Rayleigh quotientinvariant subspacesSylvester equationJacobi-Davidson methodsskinny matricessubspace projection methods

Mathematics Subject Classification ID

Related Items (1)

Two-sided Grassmann-Rayleigh quotient iteration

Uses Software

• mctoolbox

Cites Work

• Three methods for refining estimates of invariant subspaces
• The block conjugate gradient algorithm and related methods
• Controllability, observability and the solution of AX-XB=C
• SOR for \(AX-XB=C\)
• The Riccati equation
• Krylov-subspace methods for the Sylvester equation
• The effects of inexact solvers in algorithms for symmetric eigenvalue problems
• On the numerical solution of \(AX-XB=C\)
• A Hessenberg-Schur method for the problem AX + XB= C
• On the Distribution of a Scaled Condition Number
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• A Stabilized QMR Version of Block BiCG
• Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing tall skinny solutions of \(AX-XB=C\)