Numerical performance of AOR methods in solving first order composite closed Newton-Cotes quadrature algebraic equations
View/
Access Status
Fulltext not available
Authors
Muthuvalu, M.
Aruchunan, Elayaraja
Koh, W.
Akhir, K.
Sulaiman, J.
Karim, S.
Date
2014Type
Conference Paper
Metadata
Show full item recordAbstract
In this paper, the application of the Accelerated Over-Relaxation (AOR) iterative method is extended to solve first order composite closed Newton-Cotes quadrature (1-CCNC) algebraic equations arising from second kind linear Fredholm integral equations. The formulation and implementation of the method are also discussed. In addition, numerical results by solving several test problems are included and compared with the conventional iterative methods.
Citation
Muthuvalu, M. and Aruchunan, E. and Koh, W. and Akhir, K. and Sulaiman, J. and Karim, S. 2014. Numerical performance of AOR methods in solving first order composite closed Newton-Cotes quadrature algebraic equations, in Mohd Tahir Ismail , Syakila Ahmad and Rosmanjawati Abdul Rahman (ed), 21st National Symposium on Mathematical Sciences (SKSM21): Germination of Mathematical Sciences Education and Research towards Global Sustainability, Aug 6 2013. Penang, Malaysia: AIP.
Source Title
AIP Conference Proceedings 1605
Department
Department of Mathematics and Statistics
Collections
Related items
Showing items related by title, author, creator and subject.
-
Chow, Chi Ngok (2010)The largest wool exporter in the world is Australia, where wool being a major export is worth over AUD $2 billion per year and constitutes about 17 per cent of all agricultural exports. Most Australian wool is sold by ...
-
Woloszynski, T.; Podsiadlo, P.; Stachowiak, Gwidon (2015)Efficient numerical methods are essential in the analysis of finite hydrodynamic bearings with surface texturing. This is especially evident in optimization and parametric studies where the discretization and integration ...
-
Grigoleit, Mark Ted (2008)The Constrained Shortest Path Problem (CSPP) consists of finding the shortest path in a graph or network that satisfies one or more resource constraints. Without these constraints, the shortest path problem can be solved ...