| ²é¿´: 2297 | »Ø¸´: 7 | ||||
yuanjian1987ľ³æ (ÕýʽдÊÖ)
|
[ÇóÖú]
·ÖÊý½×΢·Ö·½³ÌPredictor-corrector PECE£¬³ÌÐòÔõôÔËÐÐÄØ£¿
|
|
¸½¼þÊÇÀÏÍâ±àдµÄ³ÌÐò£¬µ«ÊÇÎÒ²»»áÔËÐУ¬ËÄܾٸöÀý×ÓÔËÐÐÒ»ÏÂÄØ£¿ ±ÈÈç D^q1=x^2+xy; D^q2=-x^2-2y; fdefunÐèÒªµ¥¶À±àÒ»¸ömÎļþÂ𣿠ÀïÃæÓкöàfunction£¬ÐèÒª½«ËüÃǵ¥¶À±àÒ»¸ömÎļþÂ𣿠Description of FDE12 FDE12 solves an initial value problem for a nonlinear differential equation of fractional order (FDE). The code implements the predictor-corrector PECE method of Adams-Bashforth-Moulton type described in [1]. [T,Y] = FDE12(ALPHA,FDEFUN,T0,TFINAL,Y0,h) integrates the initial value problem for the FDE, or the system of FDEs, of order ALPHA > 0 D^ALPHA Y(t) = FDEFUN(T,Y(T)) Y^(k)(T0) = Y0(:,k+1), k=0,...,m-1 where m is the smallest integer greater than ALPHA and D^ALPHA is the fractional derivative according to the Caputo's definition. FDEFUN is a function handle corresponding to the vector field of the FDE and for a scalar T and a vector Y, FDEFUN(T,Y) must return a column vector. The set of initial conditions Y0 is a matrix with a number of rows equal to the size of the problem (hence equal to the number of rows of the output of FDEFUN) and a number of columns depending on ALPHA and given by m. The step-size H>0 is assumed constant throughout the integration. [T,Y] = FDE12(ALPHA,FDEFUN,T0,TFINAL,Y0,H,PARAM) solves as above with the additional set of parameters for the FDEFUN as FDEFUN(T,Y,PARAM). [T,Y] = FDE12(ALPHA,FDEFUN,T0,TFINAL,Y0,H,PARAM,MU) solves the FDE with the selected number MU of multiple corrector iterations. The following values for MU are admissible: MU = 0 : the corrector is not evaluated and the solution is provided just by the predictor method (the first order rectangular rule); MU > 0 : the corrector is evaluated by the selected number MU of times; the classical PECE method is obtained for MU=1; MU = Inf : the corrector is evaluated for a certain number of times until convergence of the iterations is reached (for convergence the difference between two consecutive iterates is tested). The defalut value for MU is 1 [T,Y] = FDE12(ALPHA,FDEFUN,T0,TFINAL,Y0,H,PARAM,MU,MU_TOL) allows to specify the tolerance for testing convergence when MU = Inf. If not specified, the default value MU_TOL = 1.E-6 is used. FDE12 is an implementation of the predictor-corrector method of Adams-Bashforth -Moulton studied in [1]. Convergence and accuracy of the method are studied in [2]. The implementation with multiple corrector iterations has been proposed and discussed for multiterm FDEs in [3]. In this implementation the discrete convolutions are evaluated by means of the FFT algorithm described in [4] allowing to keep the computational cost proportional to N*log(N)^2 instead of N^2 as in the classical implementation; N is the number of time-point in which the solution is evaluated, i.e. N = (TFINAL-T)/H. The stability properties of the method implemented by FDE12 have been studied in [5]. [1] K. Diethelm, A.D. Freed, The Frac PECE subroutine for the numerical solution of differential equations of fractional order, in: S. Heinzel, T. Plesser (Eds.), Forschung und Wissenschaftliches Rechnen 1998, Gessellschaft fur Wissenschaftliche Datenverarbeitung, Gottingen, 1999, pp. 57-71. [2] K. Diethelm, N.J. Ford, A.D. Freed, Detailed error analysis for a fractional Adams method, Numer. Algorithms 36 (1) (2004) 31-52. [3] K. Diethelm, Efficient solution of multi-term fractional differential equations using P(EC)mE methods, Computing 71 (2003), pp. 305-319. [4] E. Hairer, C. Lubich, M. Schlichte, Fast numerical solution of nonlinear Volterra convolution equations, SIAM J. Sci. Statist. Comput. 6 (3) (1985) 532-541. [5] R. Garrappa, On linear stability of predictor-corrector algorithms for fractional differential equations, Internat. J. Comput. Math. 87 (10) (2010) 2281-2290. Copyright (c) 2011-2012, Roberto Garrappa, University of Bari, Italy garrappa at dm dot uniba dot it Revision: 1.2 - Date: July, 6 2012 |
» ±¾Ìû¸½¼þ×ÊÔ´Áбí
-
»¶Ó¼à¶½ºÍ·´À¡£ºÐ¡Ä¾³æ½öÌṩ½»Á÷ƽ̨£¬²»¶Ô¸ÃÄÚÈݸºÔð¡£
±¾ÄÚÈÝÓÉÓû§×ÔÖ÷·¢²¼£¬Èç¹ûÆäÄÚÈÝÉæ¼°µ½ÖªÊ¶²úȨÎÊÌ⣬ÆäÔðÈÎÔÚÓÚÓû§±¾ÈË£¬Èç¶Ô°æÈ¨ÓÐÒìÒ飬ÇëÁªÏµÓÊÏ䣺xiaomuchong@tal.com - ¸½¼þ 1 : fde12.m
2013-11-24 20:58:59, 9.11 K
» ²ÂÄãϲ»¶
288Çóµ÷¼Á
ÒѾÓÐ6È˻ظ´
¸´ÊÔµ÷¼Á
ÒѾÓÐ12È˻ظ´
¼ÆËã»ú11408£¬286·ÖÇóµ÷¼Á
ÒѾÓÐ3È˻ظ´
²ÄÁÏר˶322·Ö
ÒѾÓÐ8È˻ظ´
Ò»Ö¾Ô¸ÉϺ£º£Ñó´óѧ083200ʳƷѧ˶£¬Çóµ÷¼Á£¬½ÓÊÜÆäËûרҵ083200
ÒѾÓÐ5È˻ظ´
081200-11408-276ѧ˶Çóµ÷¼Á
ÒѾÓÐ5È˻ظ´
²ÄÁϵ÷¼Á
ÒѾÓÐ10È˻ظ´
313Çóµ÷¼Á
ÒѾÓÐ7È˻ظ´
304Çóµ÷¼Á£¨085602£¬¹ýËļ¶£¬Ò»Ö¾Ô¸985£©
ÒѾÓÐ14È˻ظ´
²ÄÁϹ¤³Ì302·ÖÇóµ÷¼Á
ÒѾÓÐ7È˻ظ´
» ±¾Ö÷ÌâÏà¹Ø¼ÛÖµÌùÍÆ¼ö£¬¶ÔÄúͬÑùÓаïÖú:
·ÖÊý½×΢·Ö·½³ÌµÄÇó½â£¨Óòî·Ö·¨£¬matlab±à³ÌÇó½â£©
ÒѾÓÐ9È˻ظ´
¡¾ÌÖÂÛ¡¿·ÖÊý½×΢·Ö·½³Ì
ÒѾÓÐ28È˻ظ´

feixiaolin
ÈÙÓþ°æÖ÷ (ÎÄ̳¾«Ó¢)
-

ר¼Ò¾Ñé: +518 - Ó¦Öú: 942 (²©ºó)
- ¹ó±ö: 1.275
- ½ð±Ò: 3880
- É¢½ð: 58785
- ºì»¨: 532
- ɳ·¢: 11
- Ìû×Ó: 24215
- ÔÚÏß: 2601.8Сʱ
- ³æºÅ: 2139575
- ×¢²á: 2012-11-21
- רҵ: ¹âѧÐÅÏ¢»ñÈ¡Óë´¦Àí
- ¹ÜϽ: Êýѧ
|
alpha£ºFDEµÄ½×´Î£¬±ØÐëΪÕý. fdefun ÊDZêÁ¿TºÍÏòÁ¿Y¶¨ÒåµÄÖ¸ÏòʸÁ¿³¡FDEµÄº¯Êýº¯Êý¾ä±ú£¬FDEFUN(T,Y) ±ØÐë·µ»ØÒ»¸öÁÐÏòÁ¿¡£. t0,tfinal: ²ÎÊýtµÄ³õʼֵ¡¢ÖÕÖµ. y0£ºÒ»¸ö¾ØÕ󣬯äÐеÈÓÚ¸ÃÎÊÌâµÄ´óС£¨Ò²µÈÓÚÐÐFDEFUNµÄÊä³öÊý£© param£º²ÎÊý¸öÊý. mu£ºÐ£Õýµü´ú²ÎÊýÑ¡Ôñ²ÎÊý. MU = 0 : the corrector is not evaluated and the solution is provided just by the predictor method (the first order rectangular rule); MU > 0 : the corrector is evaluated by the selected number MU of times; the classical PECE method is obtained for MU=1; MU = Inf : the corrector is evaluated for a certain number of times until convergence of the iterations is reached (for convergence the difference between two consecutive iterates is tested). The defalut value for MU is 1 mu_tol£º¿ØÖÆÎó²î. h:´ÓN = ceil((tfinal-t0)/h) ¿´£¬hÊÇʱ¼ä¿ç¾à£¬NÊÇÆÀ¹À½âµÄʱ¼äµãµÄÊýÄ¿¡£ FDE12Ïê¼û http://www.mathworks.cn/matlabce ... ferential-equations |
2Â¥2013-11-24 21:44:53
¸Ðл²ÎÓ룬ӦÖúÖ¸Êý +1
|
±¾ÌûÄÚÈݱ»ÆÁ±Î |
3Â¥2013-11-25 05:58:36
|
±¾ÌûÄÚÈݱ»ÆÁ±Î |
4Â¥2013-11-25 06:06:27
yuanjian1987
ľ³æ (ÕýʽдÊÖ)
- Ó¦Öú: 20 (СѧÉú)
- ½ð±Ò: 4246.9
- É¢½ð: 20
- ºì»¨: 6
- Ìû×Ó: 997
- ÔÚÏß: 118.7Сʱ
- ³æºÅ: 1921345
- ×¢²á: 2012-08-02
- ÐÔ±ð: GG
- רҵ: µçÄÜ´¢´æÓë½Úµç¼¼Êõ

5Â¥2013-12-04 10:26:46
wen728
гæ (³õÈëÎÄ̳)
- Ó¦Öú: 0 (Ó×¶ùÔ°)
- ½ð±Ò: 11
- Ìû×Ó: 5
- ÔÚÏß: 1.8Сʱ
- ³æºÅ: 3177874
- ×¢²á: 2014-05-03
- ÐÔ±ð: MM
- רҵ: Ó¦ÓÃÊýѧ·½·¨
6Â¥2016-01-11 20:24:28
Math¶Öé
ľ³æ (ÖªÃû×÷¼Ò)
- Ó¦Öú: 10 (Ó×¶ùÔ°)
- ½ð±Ò: 7841.6
- É¢½ð: 2548
- ºì»¨: 123
- ɳ·¢: 33
- Ìû×Ó: 8870
- ÔÚÏß: 885.7Сʱ
- ³æºÅ: 4010226
- ×¢²á: 2015-08-07
- רҵ: ³£Î¢·Ö·½³ÌÓ붯Á¦ÏµÍ³
|
ÄãºÃ£¬ÇëÎÊDiethelmµÄÊ飨Springer 2010£©È«ÃûÊÇThe analysis of fractional differential equations: An application-oriented expositionÂð?ûÓÐËѵ½£¬ÄÜ·ñ·ÖÏíһϣ¬Ð»Ð» ·¢×ÔСľ³æAndroid¿Í»§¶Ë |
7Â¥2017-10-21 00:50:32
Math¶Öé
ľ³æ (ÖªÃû×÷¼Ò)
- Ó¦Öú: 10 (Ó×¶ùÔ°)
- ½ð±Ò: 7841.6
- É¢½ð: 2548
- ºì»¨: 123
- ɳ·¢: 33
- Ìû×Ó: 8870
- ÔÚÏß: 885.7Сʱ
- ³æºÅ: 4010226
- ×¢²á: 2015-08-07
- רҵ: ³£Î¢·Ö·½³ÌÓ붯Á¦ÏµÍ³
8Â¥2017-10-21 01:01:34














»Ø¸´´ËÂ¥