An inverse eigenvalue problem: Computing \(B\)-stable Runge-Kutta methods having real poles

DOI10.1007/BF01994850zbMath0761.65027MaRDI QIDQ1195921

Michael Müller

Publication date: 26 January 1993

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

inverse eigenvalue problemJordan decomposition\(B\)- stabilitysingly-implicit Runge-Kutta method

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10) Stability and convergence of numerical methods for ordinary differential equations (65L20) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06)

Related Items

Two-step Ulm–Chebyshev-like Cayley transform method for inverse eigenvalue problems, Approximate Cayley transform methods for inverse eigenvalue problems and convergence analysis, Highly stable parallel Runge-Kutta methods, A Ulm-like method for inverse eigenvalue problems, A generalized inexact Newton method for inverse eigenvalue problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On eigenvalue and canonical form assignments
• Algebraic characterization of I-stable Runge-Kutta methods
• The pseudosymmetric tridiagonalization of an arbitrary real matrix
• The equivalence of B-stability and A-stability
• Computing a nearest symmetric positive semidefinite matrix
• Algebraic characterization of \(A\)-stable Runge-Kutta methods
• On implicity Runge-Kutta methods with a stability function having distinct real poles
• The real-pole sandwich for rational approximations and oscillation equations
• Algebraically Stable and Implementable Runge-Kutta Methods of High Order
• An algorithm to assign eigenvalues in a Hessenberg matrix: Single input case
• Order stars and stability theorems
• A special family of Runge-Kutta methods for solving stiff differential equations