Methods for the solution ofAXD−BXC=E and its application in the numerical solution of implicit ordinary differential equations

DOI10.1007/BF01932775zbMath0452.65015MaRDI QIDQ3899388

M. Epton

Publication date: 1980

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

matrix equationsimplicit differential equationsgeneralized eigenproblem

Mathematics Subject Classification ID

Matrix equations and identities (15A24) Eigenvalues, singular values, and eigenvectors (15A18) Numerical methods for initial value problems involving ordinary differential equations (65L05) Direct numerical methods for linear systems and matrix inversion (65F05)

Cites Work

• Unnamed Item
• The $LZ$-Algorithm to Solve the Generalized Eigenvalue Problem
• The Combination Shift $QZ$ Algorithm
• Improving the Efficiency of Matrix Operations in the Numerical Solution of Stiff Ordinary Differential Equations
• Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
• An Algorithm for Generalized Matrix Eigenvalue Problems
• High order stiffly stable composite multistep methods for numerical integration of stiff differential equations
• Implicit Runge-Kutta Processes

Related Items (33)

The polynomial solution to the Sylvester matrix equation ⋮ Least squares solution of the linear operator equation ⋮ The solution of the matrix equations \(AXB-CXD=E\) and \((YA-DZ,YC- BZ)=(E,F)\) ⋮ Symmetric solutions of the coupled generalized Sylvester matrix equations via BCR algorithm ⋮ Computational Methods for Linear Matrix Equations ⋮ Computing real low-rank solutions of Sylvester equations by the factored ADI method ⋮ Generalized solution sets of the interval generalized Sylvester matrix equation \(\sum_{i=1}^p\mathbf A_iX_i+\sum_{j=1}^qY_j\mathbf B_j=\mathbf C\) and some approaches for inner and outer estimations ⋮ An efficient algorithm for solving general coupled matrix equations and its application ⋮ On circulant and skew-circulant splitting algorithms for (continuous) Sylvester equations ⋮ Symmetric least squares solution of a class of Sylvester matrix equations via MINIRES algorithm ⋮ Convergence analysis of gradient-based iterative algorithms for a class of rectangular Sylvester matrix equations based on Banach contraction principle ⋮ Least-squares solutions of generalized Sylvester-type quaternion matrix equations ⋮ Efficient approaches for enclosing the united solution set of the interval generalized Sylvester matrix equations ⋮ Iterative and doubling algorithms for Riccati‐type matrix equations: A comparative introduction ⋮ Contour integral solutions of Sylvester-type matrix equations ⋮ Efficient computation of the spectral projections of regular matrix pairs ⋮ Unnamed Item ⋮ Convergence of pure and relaxed Newton methods for solving a matrix polynomial equation arising in stochastic models ⋮ Verified error bounds for solutions of Sylvester matrix equations ⋮ Convex constrained optimization for large-scale generalized Sylvester equations ⋮ Consistency for bi(skew)symmetric solutions to systems of generalized Sylvester equations over a finite central algebra ⋮ On equivalence and explicit solutions of a class of matrix equations ⋮ Direct methods and ADI‐preconditioned Krylov subspace methods for generalized Lyapunov equations ⋮ Low rank approximate solutions to large Sylvester matrix equations ⋮ Solving stable Sylvester equations via rational iterative schemes ⋮ Two-sided coupled generalized Sylvester matrix equations solving using a simultaneous decomposition for fifteen matrices ⋮ Structured perturbation analysis for an infinite size quasi-Toeplitz matrix equation with applications ⋮ On initial value problems in differential-algebraic equations and their numerical treatment ⋮ Explicit solution of the matrix equation \(AXB-CXD=E\) ⋮ The conjugate gradient methods for solving the generalized periodic Sylvester matrix equations ⋮ The generalised Sylvester matrix equations over the generalised bisymmetric and skew-symmetric matrices ⋮ Kronecker bases for linear matrix equations, with application to two-parameter eigenvalue problems ⋮ Enclosing the solution set of the parametric generalised Sylvester matrix equation A(p)XB(p) + C(p)XD(p) = F(p)

Uses Software

• Algorithm 432

This page was built for publication: Methods for the solution ofAXD−BXC=E and its application in the numerical solution of implicit ordinary differential equations