๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An optimization method for solving some differential algebraic equations

โœ Scribed by M.A. El-Khateb; H.S. Hussien


Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
199 KB
Volume
14
Category
Article
ISSN
1007-5704

No coin nor oath required. For personal study only.

โœฆ Synopsis


a b s t r a c t

In this paper, the problem of differential algebraic equations has been solved via Chebyshev integral method combined with an optimization method. Two approaches are used based on the index of the problem: in the first, the proposed method is applied on the original problem and in the second, the index of the problem is decreased and the modified problem is solved. An optimization technique is proposed to solve the resulting algebraic equations. Numerical results are included to confirm the efficiency and accuracy of the method.


๐Ÿ“œ SIMILAR VOLUMES


An iterative method for solving nonlinea
โœ J.W Neuberger ๐Ÿ“‚ Article ๐Ÿ“… 1976 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 904 KB

TO THE MEMORY OF PASQUALE PORCELLI A successive approximation process for a class of nth order nonlinear partial differential equations on EV,, is given. Analytic solutions are found by iteration. The pairing between initial estimates and limiting functions forms a basis for the study of boundary co

An AN-stable Rosenbrock-type method for
โœ H. Zedan ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 202 KB

## Communicated by E. Y. Rodin AImraet--A study of Rosenbrock-Wanner (ROW) methods showed that they are not AN-stable. A second-order improved ROW-method, which is AN-stable and with local error estimate is presented with some numerical results.

An efficient method for solving implicit
โœ H. Pasic ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 195 KB ๐Ÿ‘ 2 views

When the s-stage fully implicit Runge}Kutta (RK) method is used to solve a system of n ordinary di!erential equations (ODE) the resulting algebraic system has a dimension ns. Its solution by Gauss elimination is expensive and requires 2sn/3 operations. In this paper we present an e$cient algorithm,