A numerical method for solving linear non-autonomous systems based on linear programming

DOI10.1016/j.amc.2005.11.046zbMath1104.65072OpenAlexW2068622442MaRDI QIDQ2507820

H. Hashemi Mehne

Publication date: 5 October 2006

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2005.11.046

zbMATH Keywords

discretizationlinear programmingnumerical examplesinitial value problemsnon-autonomous linear systems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Linear ordinary differential equations and systems (34A30) Numerical methods for initial value problems involving ordinary differential equations (65L05)

Related Items (1)

An approximation to solutions of linear ODE by cubic interpolation

Cites Work

• MILP modelling for time optimal guidance to a moving target
• Interior point methods of mathematical programming
• The best linear approximation for nonlinear systems
• On a Differential Equation for the Eigenvectors of a Real Symmetric Matrix
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A numerical method for solving linear non-autonomous systems based on linear programming