{"title":"初值问题带配位的数值Picard迭代","authors":"E. Scheiber","doi":"10.33993/jnaat481-1146","DOIUrl":null,"url":null,"abstract":"Some variants of the numerical Picard iterations method are presented to solve an IVP for an ordinary differential system. The term \"numerical\" emphasizes that a numerical solution is computed. The method consists in replacing the right hand side of the differential system by Lagrange interpolation polynomials followed by successive approximations. In the case when the number of interpolation point is fixed a convergence result is given. Finally some numerical experiments are reported.","PeriodicalId":287022,"journal":{"name":"Journal of Numerical Analysis and Approximation Theory","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the numerical Picard iterations with collocations for the initial value problem\",\"authors\":\"E. Scheiber\",\"doi\":\"10.33993/jnaat481-1146\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Some variants of the numerical Picard iterations method are presented to solve an IVP for an ordinary differential system. The term \\\"numerical\\\" emphasizes that a numerical solution is computed. The method consists in replacing the right hand side of the differential system by Lagrange interpolation polynomials followed by successive approximations. In the case when the number of interpolation point is fixed a convergence result is given. Finally some numerical experiments are reported.\",\"PeriodicalId\":287022,\"journal\":{\"name\":\"Journal of Numerical Analysis and Approximation Theory\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-09-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Numerical Analysis and Approximation Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.33993/jnaat481-1146\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Numerical Analysis and Approximation Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.33993/jnaat481-1146","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the numerical Picard iterations with collocations for the initial value problem
Some variants of the numerical Picard iterations method are presented to solve an IVP for an ordinary differential system. The term "numerical" emphasizes that a numerical solution is computed. The method consists in replacing the right hand side of the differential system by Lagrange interpolation polynomials followed by successive approximations. In the case when the number of interpolation point is fixed a convergence result is given. Finally some numerical experiments are reported.