Solving stable Sylvester equations via rational iterative schemes
From MaRDI portal
Publication:2503136
DOI10.1007/s10915-005-9007-2zbMath1098.65041OpenAlexW2054390548MaRDI QIDQ2503136
Gregorio Quintana-Ortí, Enrique S. Quintana-Ortí, Peter Benner
Publication date: 14 September 2006
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-005-9007-2
convergencenumerical examplesHalley's methodNewton iterationmodel reductionparallel algorithmsSylvester equationimage restorationmatrix sign functionNewton-Schulz iteration
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (13)
Low-rank Newton-ADI methods for large nonsymmetric algebraic Riccati equations ⋮ A modified matrix sign function method for projected Lyapunov equations ⋮ Computational Methods for Linear Matrix Equations ⋮ Factorized solution of Lyapunov equations based on hierarchical matrix arithmetic ⋮ Computing real low-rank solutions of Sylvester equations by the factored ADI method ⋮ Gradient based and least squares based iterative algorithms for matrix equations \(AXB + CX^{T}D = F\) ⋮ Numerical solution of singular Sylvester equations ⋮ On Hessenberg type methods for low-rank Lyapunov matrix equations ⋮ Efficient algorithms for generalized algebraic Bernoulli equations based on the matrix sign function ⋮ A direct method for solving projected generalized continuous-time Sylvester equations ⋮ Low rank solution of data‐sparse Sylvester equations ⋮ Recursive reduced-order algorithm for singularly perturbed cross Grammian algebraic Sylvester equation ⋮ On the ADI method for Sylvester equations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rang revealing QR factorizations
- A high-performance, portable implementation of the MPI message passing interface standard
- Solving the algebraic Riccati equation with the matrix sign function
- Iterative solution of the Lyapunov matrix equation
- Krylov-subspace methods for the Sylvester equation
- Solving stable generalized Lyapunov equations with the matrix sign function
- A Note On Parallel Matrix Inversion
- NUMERICAL SOLUTION OF DISCRETE STABLE LINEAR MATRIX EQUATIONS ON MULTICOMPUTERS
- Efficient matrix-valued algorithms for solving stiff Riccati differential equations
- On a fundamental property of the cross- Gramian matrix
- A Multigrid Method to Solve Large Scale Sylvester Equations
- Computing the Polar Decomposition—with Applications
- A Riccati Transformation Method for Solving Linear BVP<scp>s</scp>. I: Theoretical Aspects
- LAPACK Users' Guide
- A Hessenberg-Schur method for the problem AX + XB= C
- Methods for the solution ofAXD−BXC=E and its application in the numerical solution of implicit ordinary differential equations
- Linear model reduction and solution of the algebraic Riccati equation by use of the sign function†
- Parallel algorithms for algebraic Riccati equations
- A New Solution Method for the Lyapunov Matrix Equation
- The numerical solution of the matrix equationXA+AY=F
- Improving the Efficiency of Matrix Operations in the Numerical Solution of Stiff Ordinary Differential Equations
- ScaLAPACK Users' Guide
- LAPACK-style algorithms and software for solving the generalized Sylvester equation and estimating the separation between regular matrix pairs
- A set of level 3 basic linear algebra subprograms
- Solution of the Sylvester matrix equation AXB T + CXD T = E
- The matrix sign function
- Application of ADI Iterative Methods to the Restoration of Noisy Images
- Parallelizing the QR Algorithm for the Unsymmetric Algebraic Eigenvalue Problem: Myths and Reality
- Model order reduction via real Schur-form decomposition
- Rational Iterative Methods for the Matrix Sign Function
- Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
- Existence of a low rank or ℋ︁‐matrix approximant to the solution of a Sylvester equation
- Approximation of Large-Scale Dynamical Systems
This page was built for publication: Solving stable Sylvester equations via rational iterative schemes
