Solving stable Sylvester equations via rational iterative schemes
From MaRDI portal
Publication:2503136
DOI10.1007/S10915-005-9007-2zbMATH Open1098.65041OpenAlexW2054390548MaRDI QIDQ2503136FDOQ2503136
Authors: P. Benner, Enrique S. Quintana-Ortí, Gregorio Quintana-Ortí 
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
Recommendations
- NUMERICAL SOLUTION OF DISCRETE STABLE LINEAR MATRIX EQUATIONS ON MULTICOMPUTERS
- Low rank solution of data-sparse Sylvester equations
- A parallel two-stage iteration method for solving continuous Sylvester equations
- scientific article; zbMATH DE number 1341938
- A new projection method for solving large Sylvester equations
convergencenumerical examplesimage restorationmodel reductionparallel algorithmsNewton iterationSylvester equationHalley's methodmatrix sign functionNewton-Schulz iteration
Cites Work
- LAPACK Users' Guide
- ScaLAPACK Users' Guide
- Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]
- Rang revealing QR factorizations
- Title not available (Why is that?)
- A Hessenberg-Schur method for the problem AX + XB= C
- Approximation of Large-Scale Dynamical Systems
- A high-performance, portable implementation of the MPI message passing interface standard
- Iterative solution of the Lyapunov matrix equation
- Computing the Polar Decomposition—with Applications
- A set of level 3 basic linear algebra subprograms
- Existence of a low rank or ℋ︁‐matrix approximant to the solution of a Sylvester equation
- Efficient matrix-valued algorithms for solving stiff Riccati differential equations
- A Riccati Transformation Method for Solving Linear BVP<scp>s</scp>. I: Theoretical Aspects
- Linear model reduction and solution of the algebraic Riccati equation by use of the sign function†
- Solution of the Sylvester matrix equation AXB T + CXD T = E
- Methods for the solution ofAXD−BXC=E and its application in the numerical solution of implicit ordinary differential equations
- Application of ADI Iterative Methods to the Restoration of Noisy Images
- Krylov-subspace methods for the Sylvester equation
- Improving the Efficiency of Matrix Operations in the Numerical Solution of Stiff Ordinary Differential Equations
- LAPACK-style algorithms and software for solving the generalized Sylvester equation and estimating the separation between regular matrix pairs
- Solving stable generalized Lyapunov equations with the matrix sign function
- On a fundamental property of the cross- Gramian matrix
- A Multigrid Method to Solve Large Scale Sylvester Equations
- Model order reduction via real Schur-form decomposition
- Evaluation of the linear matrix equation solvers in SLICOT
- Title not available (Why is that?)
- Rational Iterative Methods for the Matrix Sign Function
- The matrix sign function
- Title not available (Why is that?)
- Solving the algebraic Riccati equation with the matrix sign function
- The numerical solution of the matrix equationXA+AY=F
- A New Solution Method for the Lyapunov Matrix Equation
- NUMERICAL SOLUTION OF DISCRETE STABLE LINEAR MATRIX EQUATIONS ON MULTICOMPUTERS
- Parallel algorithms for algebraic Riccati equations
- A note on parallel matrix inversion
- Parallelizing the QR Algorithm for the Unsymmetric Algebraic Eigenvalue Problem: Myths and Reality
Cited In (15)
- A modified matrix sign function method for projected Lyapunov equations
- Low-rank Newton-ADI methods for large nonsymmetric algebraic Riccati equations
- Gradient based and least squares based iterative algorithms for matrix equations \(AXB + CX^{T}D = F\)
- Factorized solution of Lyapunov equations based on hierarchical matrix arithmetic
- Finite iterative \((\mathrm{R}, \mathrm{S})\)-conjugate solutions of the generalized complex coupled Sylvester-transpose equations
- Efficient algorithms for generalized algebraic Bernoulli equations based on the matrix sign function
- Numerical solution of singular Sylvester equations
- A direct method for solving projected generalized continuous-time Sylvester equations
- NUMERICAL SOLUTION OF DISCRETE STABLE LINEAR MATRIX EQUATIONS ON MULTICOMPUTERS
- On the ADI method for Sylvester equations
- On Hessenberg type methods for low-rank Lyapunov matrix equations
- Low rank solution of data-sparse Sylvester equations
- Computational Methods for Linear Matrix Equations
- Recursive reduced-order algorithm for singularly perturbed cross Grammian algebraic Sylvester equation
- Computing real low-rank solutions of Sylvester equations by the factored ADI method
Uses Software
This page was built for publication: Solving stable Sylvester equations via rational iterative schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2503136)
