IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v174y2020icp153-174.html
   My bibliography  Save this article

A QSC method for fractional subdiffusion equations with fractional boundary conditions and its application in parameters identification

Author

Listed:
  • Liu, Jun
  • Fu, Hongfei
  • Zhang, Jiansong

Abstract

A quadratic spline collocation (QSC) method combined with L1 time discretization, named QSC-L1, is proposed to solve fractional subdiffusion equations with artificial boundary conditions. A novel norm-based stability and convergence analysis is carefully discussed, which shows that the QSC-L1 method is unconditionally stable in a discrete space–time norm, and has a convergence order O(τ2−α+h2), where τ and h are the temporal and spatial step sizes, respectively. Then, based on fast evaluation of the Caputo fractional derivative (see, Jiang et al., 2017), a fast version of QSC-L1 which is called QSC-FL1 is proposed to improve the computational efficiency. Two numerical examples are provided to support the theoretical results. Furthermore, an inverse problem is considered, in which some parameters of the fractional subdiffusion equations need to be identified. A Levenberg–Marquardt (L–M) method equipped with the QSC-FL1 method is developed for solving the inverse problem. Numerical tests show the effectiveness of the method even for the case that the observation data is contaminated by some levels of random noise.

Suggested Citation

  • Liu, Jun & Fu, Hongfei & Zhang, Jiansong, 2020. "A QSC method for fractional subdiffusion equations with fractional boundary conditions and its application in parameters identification," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 174(C), pages 153-174.
    • Handle: RePEc:eee:matcom:v:174:y:2020:i:c:p:153-174
    DOI: 10.1016/j.matcom.2020.02.019
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475420300586
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.matcom.2020.02.019?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Wenyu Sun & Ya-Xiang Yuan, 2006. "Optimization Theory and Methods," Springer Optimization and Its Applications, Springer, number 978-0-387-24976-6, June.
    2. Sayevand, K. & Arjang, F., 2016. "Finite volume element method and its stability analysis for analyzing the behavior of sub-diffusion problems," Applied Mathematics and Computation, Elsevier, vol. 290(C), pages 224-239.
    3. Liu, Jun & Fu, Hongfei & Chai, Xiaochao & Sun, Yanan & Guo, Hui, 2019. "Stability and convergence analysis of the quadratic spline collocation method for time-dependent fractional diffusion equations," Applied Mathematics and Computation, Elsevier, vol. 346(C), pages 633-648.
    4. Wei, T. & Li, Y.S., 2018. "Identifying a diffusion coefficient in a time-fractional diffusion equation," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 151(C), pages 77-95.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Xu, Da, 2023. "The long time error estimates for the second order backward difference approximation to sub-diffusion equations with boundary time delay and feedback gain," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 208(C), pages 186-206.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yasushi Narushima & Shummin Nakayama & Masashi Takemura & Hiroshi Yabe, 2023. "Memoryless Quasi-Newton Methods Based on the Spectral-Scaling Broyden Family for Riemannian Optimization," Journal of Optimization Theory and Applications, Springer, vol. 197(2), pages 639-664, May.
    2. Saha, Tanay & Rakshit, Suman & Khare, Swanand R., 2023. "Linearly structured quadratic model updating using partial incomplete eigendata," Applied Mathematics and Computation, Elsevier, vol. 446(C).
    3. Guang Li & Paat Rusmevichientong & Huseyin Topaloglu, 2015. "The d -Level Nested Logit Model: Assortment and Price Optimization Problems," Operations Research, INFORMS, vol. 63(2), pages 325-342, April.
    4. Zheng, Sanpeng & Feng, Renzhong, 2023. "A variable projection method for the general radial basis function neural network," Applied Mathematics and Computation, Elsevier, vol. 451(C).
    5. Jörg Fliege & Andrey Tin & Alain Zemkoho, 2021. "Gauss–Newton-type methods for bilevel optimization," Computational Optimization and Applications, Springer, vol. 78(3), pages 793-824, April.
    6. Hai-Jun Wang & Qin Ni, 2010. "A Convex Approximation Method For Large Scale Linear Inequality Constrained Minimization," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 27(01), pages 85-101.
    7. Chen, Liang, 2016. "A high-order modified Levenberg–Marquardt method for systems of nonlinear equations with fourth-order convergence," Applied Mathematics and Computation, Elsevier, vol. 285(C), pages 79-93.
    8. Ji, Li-Qun, 2015. "An assessment of agricultural residue resources for liquid biofuel production in China," Renewable and Sustainable Energy Reviews, Elsevier, vol. 44(C), pages 561-575.
    9. Babaie-Kafaki, Saman & Ghanbari, Reza, 2014. "The Dai–Liao nonlinear conjugate gradient method with optimal parameter choices," European Journal of Operational Research, Elsevier, vol. 234(3), pages 625-630.
    10. Marko Miladinović & Predrag Stanimirović & Sladjana Miljković, 2011. "Scalar Correction Method for Solving Large Scale Unconstrained Minimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 151(2), pages 304-320, November.
    11. Wei Bian & Xiaojun Chen, 2017. "Optimality and Complexity for Constrained Optimization Problems with Nonconvex Regularization," Mathematics of Operations Research, INFORMS, vol. 42(4), pages 1063-1084, November.
    12. Yutao Zheng & Bing Zheng, 2017. "Two New Dai–Liao-Type Conjugate Gradient Methods for Unconstrained Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 175(2), pages 502-509, November.
    13. Xiaojing Zhu & Hiroyuki Sato, 2020. "Riemannian conjugate gradient methods with inverse retraction," Computational Optimization and Applications, Springer, vol. 77(3), pages 779-810, December.
    14. Li, Jinqing & Ma, Jun, 2019. "Maximum penalized likelihood estimation of additive hazards models with partly interval censoring," Computational Statistics & Data Analysis, Elsevier, vol. 137(C), pages 170-180.
    15. Zohre Aminifard & Saman Babaie-Kafaki, 2019. "An optimal parameter choice for the Dai–Liao family of conjugate gradient methods by avoiding a direction of the maximum magnification by the search direction matrix," 4OR, Springer, vol. 17(3), pages 317-330, September.
    16. Jie Zhao & Zhichao Fang & Hong Li & Yang Liu, 2020. "A Crank–Nicolson Finite Volume Element Method for Time Fractional Sobolev Equations on Triangular Grids," Mathematics, MDPI, vol. 8(9), pages 1-17, September.
    17. Chen, Wang & Yang, Xinmin & Zhao, Yong, 2023. "Memory gradient method for multiobjective optimization," Applied Mathematics and Computation, Elsevier, vol. 443(C).
    18. Abolfazl Gharaei & Alireza Amjadian & Ali Shavandi & Amir Amjadian, 2023. "An augmented Lagrangian approach with general constraints to solve nonlinear models of the large-scale reliable inventory systems," Journal of Combinatorial Optimization, Springer, vol. 45(2), pages 1-37, March.
    19. Roozbeh, Mahdi, 2016. "Robust ridge estimator in restricted semiparametric regression models," Journal of Multivariate Analysis, Elsevier, vol. 147(C), pages 127-144.
    20. Chengjin Li, 2014. "A New Approximation of the Matrix Rank Function and Its Application to Matrix Rank Minimization," Journal of Optimization Theory and Applications, Springer, vol. 163(2), pages 569-594, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matcom:v:174:y:2020:i:c:p:153-174. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.