Extension of Picard’s Iteration Method to a Class of nth-Order Initial Value Problems
| dc.contributor.author | Jervin Zen Lobo | |
| dc.contributor.author | Sanket Tikare | |
| dc.date.accessioned | 2026-03-31T09:17:16Z | |
| dc.date.issued | 2025-01-01 | |
| dc.description.abstract | This paper extends the method of successive approximations to an nth-order initial value problem without converting it to a first-order system. We obtain a bound in a closed form for the difference between two successive iterates. Finally, an error estimate for the solutions has been calculated and it is shown to be increasingly accurate as n increases. Suitable illustrations to support the result are provided. | |
| dc.identifier.uri | https://sxcgoa.ndl.gov.in/handle/123456789/48 | |
| dc.language.iso | en | |
| dc.publisher | Southeast Asian Bulletin of Mathematics | |
| dc.subject | Gronwall’s inequality | |
| dc.subject | Initial value problem | |
| dc.subject | Integral equation | |
| dc.subject | Lipschitz condition | |
| dc.subject | Weierstrauss’ M-test. | |
| dc.title | Extension of Picard’s Iteration Method to a Class of nth-Order Initial Value Problems | |
| dc.type | Article |