arxiv: 2605.00456 · v1 · submitted 2026-05-01 · 🧮 math.NA · cs.NA· math.PR

Recognition: unknown

Deep-Picard Iteration for Space-time Fractional Diffusion PDEs

Zhijun Zeng , Zhitong Chen , Ling Qin , Yi Zhu

Authors on Pith no claims yet

Pith reviewed 2026-05-09 19:03 UTC · model grok-4.3

classification 🧮 math.NA cs.NAmath.PR

keywords space-time fractional diffusionPicard iterationMonte Carlo methodsneural network regressionhigh-dimensional PDEsFeynman-Kac representationstable Levy processes

0 comments

The pith

Deep-Picard iteration solves high-dimensional nonlinear space-time fractional diffusion equations by Monte Carlo simulation of fractional paths followed by neural network regression on each update.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes a framework that recasts the nonlinear fractional PDE as a fixed-point problem using a fractional Feynman-Kac representation. Each Picard step generates stochastic labels by simulating trajectories of a coupled beta-stable subordinator and alpha-stable Levy process, then fits a neural network to those labels instead of discretizing the Caputo or fractional Laplacian terms. The approach is tested on two- and high-dimensional examples, demonstrating stable iteration convergence and solution accuracy up to dimension 100. This targets problems where grid-based or direct residual-minimization methods become intractable due to nonlocality and dimensionality.

Core claim

The nonlinear space-time fractional diffusion equation admits a fixed-point formulation via the fractional Feynman-Kac representation. Picard iterates are realized by Monte Carlo generation of training labels from discretized beta-stable subordinators coupled to walk-on-spheres simulations of rotationally symmetric alpha-stable Levy processes, followed by supervised neural-network regression that produces the next approximant without explicit computation of fractional differential operators.

What carries the argument

The Deep-Picard iteration: a nonlinear fractional Feynman-Kac fixed-point map whose updates are realized by Monte Carlo label generation from coupled stable processes and supervised neural-network regression.

If this is right

The method extends solvable regimes for nonlinear fractional diffusion to dimensions where traditional discretizations of the fractional Laplacian become prohibitive.
Picard updates remain stable without requiring residual minimization that incorporates fractional operators.
Accurate solutions are obtained for example problems with reported tests reaching dimension 100.
The framework separates the simulation of fractional dynamics from the regression step, allowing independent refinement of either component.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

Adapting the underlying stable-process simulators could allow the same iteration structure to handle other nonlocal or memory-dependent PDEs.
Variance-reduction or importance-sampling techniques for the Monte Carlo trajectories would likely reduce the sample size needed for a given accuracy.
The separation of path simulation from network training suggests straightforward parallelization across independent trajectory batches.

Load-bearing premise

Monte Carlo simulation of the coupled beta-stable subordinator and alpha-stable Levy process produces unbiased labels that allow the neural network regression to converge to the true solution without systematic bias from sampling or discretization error.

What would settle it

On a low-dimensional test problem whose exact solution is known analytically, compute the sup-norm error of the Deep-Picard approximant as the number of Monte Carlo samples and network width both increase to large values; persistent growth or failure to stabilize would refute unbiased convergence.

Figures

Figures reproduced from arXiv: 2605.00456 by Ling Qin, Yi Zhu, Zhijun Zeng, Zhitong Chen.

**Figure 1.** Figure 1: Solution quality at 𝑡 = 𝑇 = 1.0 for the unit disk with 𝜂 = 0.6 view at source ↗

**Figure 2.** Figure 2: Convergence of the spacetime RMSE on the unit disk (Setting A, 𝜂 = 0.6). (a) Step-size convergence with 𝑀 = 16 fixed. (b) Monte Carlo path convergence with Δ𝑠 = 2 × 10−3 fixed. 4.3. Example 2: Unit square We next replace the disk by the unit square Ω = (−1, 1)2 , which probes the algorithm on a non-smooth boundary and on a profile whose fractional Laplacian no longer admits a closed form. The reference sol… view at source ↗

**Figure 3.** Figure 3: Spacetime RMSE versus Picard iteration for the unit square examples. (a) Setting A and (b) Setting B both exhibit monotone convergence under relaxation 𝜂 = 0.5 with 𝑀 = 16 paths. 4.4. Example 3: Unit disk with double-bump profile We next consider a more heterogeneous benchmark on the unit disk. Unlike the single-bump profile in Example 4.2, the reference solution here contains two localized components with… view at source ↗

**Figure 4.** Figure 4: Solution quality at 𝑡 = 𝑇 = 1.0 for the unit square domain. must capture not only the global decay induced by the fractional dynamics, but also the localized interaction between two separated spatial features. The results are shown in view at source ↗

**Figure 5.** Figure 5: Double-bump experiment on the unit disk, showing the learned solution, exact solution, pointwise error, and Monte Carlo path convergence. 4.5. High-dimensional examples We finally examine the scalability of the proposed method on unit-ball problems in dimensions 𝑑 = 20, 50, 100. The goal of this experiment is not only to test whether the neural approximation can handle high-dimensional inputs, but also to … view at source ↗

**Figure 6.** Figure 6: further shows that the relaxed Picard iteration stabilizes rapidly in all dimensions. The two-dimensional cross-sections in view at source ↗

**Figure 7.** Figure 7: Two-dimensional cross-sections of the predicted solution, exact solution, and pointwise error at 𝑡 = 𝑇 = 1.0 for Setting A. A key feature of the proposed framework is that it is naturally suited to nonlinear problems. The nonlinearity enters the stochastic representation through the fixed-point operator and is handled by successive Picard updates, rather than by differentiating a global residual involving … view at source ↗

read the original abstract

We propose a Deep-Picard iteration framework for high-dimensional nonlinear space-time fractional diffusion equations.The method is based on a nonlinear fractional Feynman--Kac fixed-point formulation, which replaces direct discretization of the Caputo memory term and the nonlocal fractional Laplacian by Monte Carlo simulation of the associated fractional dynamics. Each Picard update is approximated by stochastic label generation and realized through supervised neural-network regression, thereby avoiding residual minimization involving fractional differential operators. The fractional trajectories are generated by coupling a discretized beta-stable subordinator with a walk-on-spheres-type simulation of the rotationally symmetric alpha-stable L\'evy process. Numerical experiments on two-dimensional and high-dimensional test problems ddemonstrate stable Picard convergence and accurate approximation, with tests reported up to dimension d=100.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper combines Picard iteration with Monte Carlo labels from fractional processes and neural regression to reach high-dimensional fractional PDEs, but the validation leaves the accuracy of those labels unproven.

read the letter

The central contribution is a framework that reformulates the nonlinear space-time fractional diffusion equation as a fixed-point problem via the fractional Feynman-Kac formula. Instead of approximating the fractional operators on a grid, it generates stochastic trajectories using a beta-stable subordinator and an alpha-stable Levy process, then uses those to create training data for a neural network that approximates each Picard iterate. This combination lets them run tests up to dimension 100, which is the part that works well. Grid-based methods struggle badly in high dimensions with nonlocal terms, so replacing discretization with simulation and regression is a reasonable direction to explore. The soft spot is in the validation. The abstract reports stable convergence and accurate results, but supplies no specific error metrics, no comparison to other methods, and no discussion of how the discretization parameters for the stable processes influence the outcome. The walk-on-spheres and subordinator discretization both have approximation errors whose effect on the learned solution is not quantified. That raises the possibility that the neural net is learning a biased version of the dynamics rather than the true PDE. If the labels carry a fixed bias, the Picard loop could converge reliably but to the wrong limit. The paper would benefit from low-dimensional cases where exact solutions are known, to measure the actual discrepancy. Readers who work on numerical methods for fractional PDEs or on Monte Carlo methods for nonlocal problems would get the most out of this. It is not yet a finished tool, but the approach is different enough from standard deep learning PDE solvers that it merits a look. I recommend sending it for peer review. The high-dimensional reach is ambitious and the method avoids some common pitfalls of operator discretization, so referees can help sort out whether the numerical evidence supports the claims.

Referee Report

2 major / 1 minor

Summary. The manuscript proposes a Deep-Picard iteration framework for high-dimensional nonlinear space-time fractional diffusion PDEs. It reformulates the problem via a nonlinear fractional Feynman-Kac fixed-point equation, replaces direct discretization of the Caputo and fractional Laplacian terms by Monte Carlo simulation of coupled beta-stable subordinators and rotationally symmetric alpha-stable Lévy processes (via walk-on-spheres), and realizes each Picard update through supervised neural-network regression.

Significance. If the Monte Carlo labels remain unbiased at the reported scales, the method offers a scalable route to high-dimensional fractional PDEs (tested to d=100) where grid-based schemes are intractable. The combination of stochastic process simulation with deep learning for fixed-point iteration is a concrete contribution to numerical analysis of nonlocal problems.

major comments (2)

[Numerical Experiments] Numerical Experiments section: the abstract and reported tests claim 'stable Picard convergence and accurate approximation' up to d=100, yet no quantitative error tables (e.g., L² or max-norm errors versus sample size, network width, or time-step), convergence rates, or baseline comparisons appear. Without these metrics it is impossible to verify that the observed stability reflects convergence to the true PDE solution rather than to a biased surrogate.
[§3] §3 (Monte Carlo label generation): the discretization of the beta-stable subordinator and the walk-on-spheres truncation for the α-stable process are presented without error bounds or bias analysis. In high dimensions the variance of Lévy increments grows; residual truncation bias could systematically shift the regression target away from the true fractional Feynman-Kac fixed point, undermining the central claim that the procedure recovers the PDE solution.

minor comments (1)

[Abstract] Abstract: 'ddemonstrate' is a typographical error.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the thorough review and valuable suggestions. Below we respond to each major comment in detail.

read point-by-point responses

Referee: [Numerical Experiments] Numerical Experiments section: the abstract and reported tests claim 'stable Picard convergence and accurate approximation' up to d=100, yet no quantitative error tables (e.g., L² or max-norm errors versus sample size, network width, or time-step), convergence rates, or baseline comparisons appear. Without these metrics it is impossible to verify that the observed stability reflects convergence to the true PDE solution rather than to a biased surrogate.

Authors: We agree that the numerical experiments would benefit from more quantitative validation. In the revised version, we will incorporate tables with L² and max-norm errors as functions of sample size, network width, and time-step size. We will also report observed convergence rates for the Picard iteration and provide baseline comparisons for the 2D cases using alternative numerical methods. This will allow readers to assess that the approximations are converging to the true PDE solution. revision: yes
Referee: [§3] §3 (Monte Carlo label generation): the discretization of the beta-stable subordinator and the walk-on-spheres truncation for the α-stable process are presented without error bounds or bias analysis. In high dimensions the variance of Lévy increments grows; residual truncation bias could systematically shift the regression target away from the true fractional Feynman-Kac fixed point, undermining the central claim that the procedure recovers the PDE solution.

Authors: The discretization methods are based on established techniques for stable Lévy processes. Nevertheless, we recognize that explicit error bounds and bias analysis were not included. In the revision, we will add a dedicated paragraph or subsection providing error estimates for the beta-stable subordinator discretization and the truncation error in the walk-on-spheres algorithm, drawing on existing convergence theory for these processes. We will also analyze the impact of variance growth in high dimensions and demonstrate through additional experiments that the regression step keeps the overall bias small, preserving the recovery of the PDE solution. revision: yes

Circularity Check

0 steps flagged

No circularity: external Monte Carlo labels drive independent NN regression

full rationale

The derivation chain begins with the standard nonlinear fractional Feynman-Kac fixed-point representation of the space-time fractional PDE, then generates labels by Monte Carlo simulation of the coupled beta-stable subordinator and alpha-stable Levy process (via discretization and walk-on-spheres), and finally performs supervised neural-network regression on those externally generated labels for each Picard iterate. No equation or step equates a claimed prediction to a fitted parameter by construction, nor does any load-bearing premise reduce to a self-citation or self-defined ansatz. The numerical experiments up to d=100 serve as validation of the simulation-plus-regression procedure rather than tautological re-derivation of the inputs. The framework remains self-contained against external stochastic benchmarks.

Axiom & Free-Parameter Ledger

2 free parameters · 2 axioms · 0 invented entities

The approach rests on standard properties of stable Levy processes and neural network approximation power; no new entities are postulated.

free parameters (2)

time discretization step for beta-stable subordinator
Step size chosen for trajectory simulation; affects label accuracy.
neural network hyperparameters
Architecture depth, width, and training settings fitted during supervised regression.

axioms (2)

domain assumption The fractional Feynman-Kac formula holds for the space-time fractional diffusion operator
Invoked to obtain the fixed-point formulation that enables Monte Carlo sampling.
standard math Alpha-stable Levy processes and beta-stable subordinators correctly generate the required fractional dynamics
Standard result from stochastic processes used to simulate trajectories.

pith-pipeline@v0.9.0 · 5426 in / 1322 out tokens · 46648 ms · 2026-05-09T19:03:18.631923+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

38 extracted references · 29 canonical work pages

[1]

A fractional Laplace equation: Regularity of solutions and finite element approximations

Acosta, G., Borthagaray, J.P., 2017. A fractional Laplace equation: Regularity of solutions and finite element approximations. SIAM Journal on Numerical Analysis 55, 472–495. doi:10.1137/15M1033952

work page doi:10.1137/15m1033952 2017
[2]

Stochastic solutions for fractional Cauchy problems

Baeumer, B., Meerschaert, M.M., 2001. Stochastic solutions for fractional Cauchy problems. Fractional Calculus and Applied Analysis 4, 481–500

2001
[3]

and Wheatcraft, Stephen W

Benson, D.A., Wheatcraft, S.W., Meerschaert, M.M., 2000. Application of a fractional advection-dispersion equation. Water Resources Research 36, 1403–1412. doi:10.1029/2000WR900031

work page doi:10.1029/2000wr900031 2000
[4]

Sharp heat kernel estimates for relativistic stable processes in open sets

Chen, Z.Q., Kim, P., Song, R., 2012. Sharp heat kernel estimates for relativistic stable processes in open sets. Annals of Probability 40, 213–244

2012
[5]

Numerical method for space–time fractional diffusion: A stochastic approach

Cui, X., Sheng, C., Su, B., Zhou, T., 2025. Numerical method for space–time fractional diffusion: A stochastic approach. arXiv preprint arXiv:2508.20361

work page arXiv 2025
[6]

Fractional models for the migration of biological cells in complex spatial domains

Cusimano, N., Burrage, K., Burrage, P., 2013. Fractional models for the migration of biological cells in complex spatial domains. ANZIAM Journal 54, C250–C270. doi:10.21914/anziamj.v54i0.6283

work page doi:10.21914/anziamj.v54i0.6283 2013
[7]

Fractional diffusion in plasma turbulence

del-Castillo-Negrete, D., Carreras, B.A., Lynch, V.E., 2004. Fractional diffusion in plasma turbulence. Physics of Plasmas 11, 3854–3864. doi:10.1063/1.1767097

work page doi:10.1063/1.1767097 2004
[8]

ThefractionalLaplacianoperatoronboundeddomainsasaspecialcaseofthenonlocaldiffusionoperator

D’Elia,M.,Gunzburger,M.,2013. ThefractionalLaplacianoperatoronboundeddomainsasaspecialcaseofthenonlocaldiffusionoperator. Computers & Mathematics with Applications 66, 1245–1260. doi:10.1016/j.camwa.2013.07.022

work page doi:10.1016/j.camwa.2013.07.022 2013
[9]

Deep learning-based numerical methods for high-dimensional parabolic partial differential equations and backwardstochasticdifferentialequations

E, W., Han, J., Jentzen, A., 2017. Deep learning-based numerical methods for high-dimensional parabolic partial differential equations and backwardstochasticdifferentialequations. CommunicationsinMathematicsandStatistics5,349–380. doi:10.1007/s40304-017-0117-6

work page doi:10.1007/s40304-017-0117-6 2017
[10]

Multilevel picard iterations for solving smooth semilinear parabolic heat equations

E, W., Hutzenthaler, M., Jentzen, A., Kruse, T., 2021. Multilevel picard iterations for solving smooth semilinear parabolic heat equations. Partial Differential Equations and Applications 2, 1–40. doi:10.1007/s42985-021-00089-5

work page doi:10.1007/s42985-021-00089-5 2021
[11]

First passage times for symmetric stable processes in space

Getoor, R.K., 1961. First passage times for symmetric stable processes in space. Transactions of the American Mathematical Society 101, 75–90

1961
[12]

Multilevel monte carlo path simulation

Giles, M.B., 2008. Multilevel monte carlo path simulation. Operations Research 56, 607–617. doi:10.1287/opre.1070.0496

work page doi:10.1287/opre.1070.0496 2008
[13]

Some recent advances in theory and simulation of fractional diffusion processes

Gorenflo, R., Mainardi, F., Moretti, D., Pagnini, G., Paradisi, P., 2009. Some recent advances in theory and simulation of fractional diffusion processes. Journal of Computational and Applied Mathematics 229, 400–415. doi:10.1016/j.cam.2008.04.019

work page doi:10.1016/j.cam.2008.04.019 2009
[14]

Deep picard iteration for high-dimensional nonlinear PDEs

Han, J., Hu, W., Long, J., Zhao, Y., 2024. Deep picard iteration for high-dimensional nonlinear PDEs. arXiv preprintarXiv:2409.08526

work page arXiv 2024
[15]

Solving high-dimensional partial differential equations using deep learning

Han, J., Jentzen, A., E, W., 2018. Solving high-dimensional partial differential equations using deep learning. Proceedings of the National Academy of Sciences 115, 8505–8510. doi:10.1073/pnas.1718942115

work page doi:10.1073/pnas.1718942115 2018
[16]

Numerical methods for the fractional Laplacian: A finite difference–quadrature approach

Huang, Y., Oberman, A.M., 2014. Numerical methods for the fractional Laplacian: A finite difference–quadrature approach. SIAM Journal on Numerical Analysis 52, 3056–3084. doi:10.1137/140954040

work page doi:10.1137/140954040 2014
[17]

Numerical methods for time-fractional evolution equations with nonsmooth data: A concise overview

Jin, B., Lazarov, R., Zhou, Z., 2019. Numerical methods for time-fractional evolution equations with nonsmooth data: A concise overview. Computer Methods in Applied Mechanics and Engineering 346, 332–358. doi:10.1016/j.cma.2018.12.011

work page doi:10.1016/j.cma.2018.12.011 2019
[18]

Numerical treatment and analysis of time-fractional evolution equations

Jin, B., Zhou, Z., 2023. Numerical treatment and analysis of time-fractional evolution equations. volume 214. Springer

2023
[19]

Fractional differential equations

Jin, B., et al., 2021. Fractional differential equations. volume 206. Springer

2021
[20]

Decay estimates for time-fractional and other non-local in time subdiffusion equations inℝ𝑑

Kemppainen, J., Siljander, J., Vergara, V., Zacher, R., 2016. Decay estimates for time-fractional and other non-local in time subdiffusion equations inℝ𝑑. Mathematische Annalen 366, 941–979

2016
[21]

Ten equivalent definitions of the fractional laplace operator

Kwaśnicki, M., 2017. Ten equivalent definitions of the fractional laplace operator. Fractional Calculus and Applied Analysis 20, 7–51. doi:10.1515/fca-2017-0002

work page doi:10.1515/fca-2017-0002 2017
[22]

Unbiased‘walk-on-spheres’montecarlomethodsforthefractionalLaplacian

Kyprianou,A.E.,Osojnik,A.,Shardlow,T.,2018. Unbiased‘walk-on-spheres’montecarlomethodsforthefractionalLaplacian. IMAJournal of Numerical Analysis 38, 1550–1578. doi:10.1093/imanum/drx042

work page doi:10.1093/imanum/drx042 2018
[23]

Fractional Pearson diffusions

Leonenko, N.N., Meerschaert, M.M., Sikorskii, A., 2013. Fractional Pearson diffusions. Journal of Mathematical Analysis and Applications 403, 532–546

2013
[24]

What is the fractional Laplacian? a comparative review with new results

Lischke, A., Pang, G., Gulian, M., Song, F., Glusa, C., Zheng, X., Mao, Z., Cai, W., Meerschaert, M.M., Ainsworth, M., Karniadakis, G.E., 2020. What is the fractional Laplacian? a comparative review with new results. Journal of Computational Physics 404, 109009. doi:10.1016/j.jcp.2019.109009

work page doi:10.1016/j.jcp.2019.109009 2020
[25]

Discretized fractional calculus

Lubich, C., 1986. Discretized fractional calculus. SIAM Journal on Mathematical Analysis 17, 704–719. doi:10.1137/0517050. Zeng et al.:Preprint submitted to ElsevierPage 21 of 22 Deep-Picard Iteration for Space-time Fractional Diffusion PDEs

work page doi:10.1137/0517050 1986
[26]

doi:10.1103/PhysRevE.65.041103

Meerschaert,M.M.,Benson,D.A.,Scheffler,H.P.,Baeumer,B.,2002.Stochasticsolutionofspace-timefractionaldiffusionequations.Physical Review E 65, 041103. doi:10.1103/PhysRevE.65.041103

work page doi:10.1103/physreve.65.041103 2002
[27]

doi:10.1214/08-AOP426

Meerschaert,M.M.,Nane,E.,Vellaisamy,P.,2009.FractionalCauchyproblemsonboundeddomains.TheAnnalsofProbability37,979–1007. doi:10.1214/08-AOP426

work page doi:10.1214/08-aop426 2009
[28]

Minden and L

Minden, V., Ying, L., 2020. A simple solver for the fractional Laplacian in multiple dimensions. SIAM Journal on Scientific Computing 42, A878–A900. doi:10.1137/18M1170406

work page doi:10.1137/18m1170406 2020
[29]

fPINNs:Fractionalphysics-informedneuralnetworks

Pang,G.,Lu,L.,Karniadakis,G.E.,2019. fPINNs:Fractionalphysics-informedneuralnetworks. SIAMJournalonScientificComputing41, A2603–A2626. doi:10.1137/18M1229845

work page doi:10.1137/18m1229845 2019
[30]

Goal-oriented real-time Bayesian inference for linear autonomous dynamical systems with application to digital twins for tsunami early warning

Raissi, M., Perdikaris, P., Karniadakis, G.E., 2019. Physics-informed neural networks: A deep learning framework for solving forward and inverse problems involving nonlinear partial differential equations. Journal of Computational Physics 378, 686–707. doi:10.1016/j.jcp. 2018.10.045

work page doi:10.1016/j.jcp 2019
[31]

The Dirichlet problem for the fractional Laplacian: regularity up to the boundary

Ros-Oton, X., Serra, J., 2014. The Dirichlet problem for the fractional Laplacian: regularity up to the boundary. Journal de Mathématiques Pures et Appliquées 101, 275–302

2014
[32]

Fast and oblivious convolution quadrature

Schädle, A., López-Fernández, M., Lubich, C., 2006. Fast and oblivious convolution quadrature. SIAM Journal on Scientific Computing 28, 421–438. doi:10.1137/050623139

work page doi:10.1137/050623139 2006
[33]

A walk outside spheres for the fractional Laplacian: Fields and first eigenvalue

Shardlow, T., 2019. A walk outside spheres for the fractional Laplacian: Fields and first eigenvalue. Mathematics of Computation 88, 2767–2792. doi:10.1090/mcom/3422

work page doi:10.1090/mcom/3422 2019
[34]

Efficient monte carlo method for integral fractional Laplacian in multiple dimensions

Sheng, C., Su, B., Xu, C., 2023. Efficient monte carlo method for integral fractional Laplacian in multiple dimensions. SIAM Journal on Numerical Analysis 61, 1738–1763. doi:10.1137/22M1504706

work page doi:10.1137/22m1504706 2023
[35]

DGM: A deep learning algorithm for solving partial differential equations , volume=

Sirignano, J., Spiliopoulos, K., 2018. DGM: A deep learning algorithm for solving partial differential equations. Journal of Computational Physics 375, 1339–1364. doi:10.1016/j.jcp.2018.08.029

work page doi:10.1016/j.jcp.2018.08.029 2018
[36]

Error analysis of a finite difference method on graded meshes for a time-fractional diffusion equation

Stynes, M., O’Riordan, E., Gracia, J.L., 2017. Error analysis of a finite difference method on graded meshes for a time-fractional diffusion equation. SIAM Journal on Numerical Analysis 55, 1057–1079. doi:10.1137/16M1082329

work page doi:10.1137/16m1082329 2017
[37]

SIAM Journal on Scientific Computing 33, 1159–1180

Yang,Q.,Turner,I.,Liu,F.,Ilić,M.,2011.Novelnumericalmethodsforsolvingthetime-spacefractionaldiffusionequationintwodimensions. SIAM Journal on Scientific Computing 33, 1159–1180. doi:10.1137/100800634

work page doi:10.1137/100800634 2011
[38]

Weak solutions of abstract evolutionary integro-differential equations in Hilbert spaces

Zacher, R., 2009. Weak solutions of abstract evolutionary integro-differential equations in Hilbert spaces. Funkcialaj Ekvacioj 52, 1–18. Zeng et al.:Preprint submitted to ElsevierPage 22 of 22

2009