Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > math > arXiv:2301.00238

Help | Advanced Search

Mathematics > Optimization and Control

arXiv:2301.00238 (math)
[Submitted on 31 Dec 2022 ]

Title: Regional Gradient Observability for Fractional Differential Equations with Caputo Time-Fractional Derivatives

Title: 区域梯度可观测性对于具有Caputo时间分数阶导数的分数阶微分方程

Authors:Khalid Zguaid, Fatima-Zahrae El Alaoui, Delfim F. M. Torres
Abstract: We investigate the regional gradient observability of fractional sub-diffusion equations involving the Caputo derivative. The problem consists of describing a method to find and recover the initial gradient vector in the desired region, which is contained in the spacial domain. After giving necessary notions and definitions, we prove some useful characterizations for exact and approximate regional gradient observability. An example of a fractional system that is not (globally) gradient observable but it is regionally gradient observable is given, showing the importance of regional analysis. Our characterization of the notion of regional gradient observability is given for two types of strategic sensors. The recovery of the initial gradient is carried out using an expansion of the Hilbert Uniqueness Method. Two illustrative examples are given to show the application of the developed approach. The numerical simulations confirm that the proposed algorithm is effective in terms of the reconstruction error.
Abstract: 我们研究涉及Caputo导数的分数次扩散方程的区域梯度可观测性。 该问题包括描述一种方法,以在包含在空间域中的目标区域内找到和恢复初始梯度向量。 在给出必要的概念和定义后,我们证明了精确和近似区域梯度可观测性的某些有用特征。 给出了一个分数系统示例,该系统不是(全局)梯度可观测的,但它却是区域梯度可观测的,这表明了区域分析的重要性。 我们为两种类型的策略传感器提供了区域梯度可观测性概念的特征。 初始梯度的恢复是通过Hilbert唯一性方法的展开来进行的。 给出了两个说明性例子,以展示所开发方法的应用。 数值模拟证实了所提出的算法在重建误差方面是有效的。
Comments: This is a 22 pages preprint of a paper whose final and definite form is published in 'Int. J. Dyn. Control' (ISSN 2195-268X). Submitted 11/July/2022; Revised 07/Nov/22; and Accepted 26/Dec/2022
Subjects: Optimization and Control (math.OC)
Cite as: arXiv:2301.00238 [math.OC]
  (or arXiv:2301.00238v1 [math.OC] for this version)
  https://doi.org/10.48550/arXiv.2301.00238
arXiv-issued DOI via DataCite
Journal reference: Int. J. Dyn. Control 11 (2023), no. 5, 2423--2437
Related DOI: https://doi.org/10.1007/s40435-022-01106-0
DOI(s) linking to related resources

Submission history

From: Delfim F. M. Torres [view email]
[v1] Sat, 31 Dec 2022 16:07:10 UTC (84 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
math.OC
< prev   |   next >
new | recent | 2023-01
Change to browse by:
math

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号