Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Čiegis, Raimondas | Suboč, Olga | Čiegis, Remigijus
Affiliations: Vilnius Gediminas Technical University, Saulėtekio 11, 2054 Vilnius, Lithuania. E-mail: [email protected] | Kaunas Faculty of Humanities Vilnius University, Muitinės 8, 3000 Kaunas, Lithuania. E-mail: [email protected]
Abstract: The accuracy of adaptive integration algorithms for solving stiff ODE is investigated. The analysis is done by comparing the discrete and exact amplification factors of the equations. It is proved that the usage of stiffness number of the Jacobian matrix is sufficient in order to estimate the complexity of solving ODE problems by explicit integration algorithms. The complexity of implicit integration algorithms depends on the distribution of eigenvalues of the Jacobian. Results of numerical experiments are presented.
Keywords: stiff ODE, adaptive integration, explicit and implicit algorithms
DOI: 10.3233/INF-2000-11402
Journal: Informatica, vol. 11, no. 4, pp. 371-380, 2000
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]