首页 > 最新文献

Axioms最新文献

英文 中文
Nonlinear 2D C1 Quadratic Spline Quasi-Interpolants on Triangulations for the Approximation of Piecewise Smooth Functions 用于分段光滑函数逼近的非线性二维C1二次样条拟插值
3区 数学 Q1 MATHEMATICS, APPLIED Pub Date : 2023-10-23 DOI: 10.3390/axioms12101002
Francesc Aràndiga, Sara Remogna
The aim of this paper is to present and study nonlinear bivariate C1 quadratic spline quasi-interpolants on uniform criss-cross triangulations for the approximation of piecewise smooth functions. Indeed, by using classical spline quasi-interpolants, the Gibbs phenomenon appears when approximating near discontinuities. Here, we use weighted essentially non-oscillatory techniques to modify classical quasi-interpolants in order to avoid oscillations near discontinuities and maintain high-order accuracy in smooth regions. We study the convergence properties of the proposed quasi-interpolants and we provide some numerical and graphical tests confirming the theoretical results.
本文的目的是在均匀交叉三角剖分上给出并研究用于分段光滑函数逼近的非线性二元C1二次样条拟插值。实际上,通过使用经典样条拟插值,在逼近近不连续点时出现了吉布斯现象。在这里,我们使用加权本质上的非振荡技术来修改经典的准插值,以避免在不连续区域附近的振荡,并保持光滑区域的高阶精度。我们研究了所提出的拟插值的收敛性,并给出了一些数值和图形测试来证实理论结果。
{"title":"Nonlinear 2D C1 Quadratic Spline Quasi-Interpolants on Triangulations for the Approximation of Piecewise Smooth Functions","authors":"Francesc Aràndiga, Sara Remogna","doi":"10.3390/axioms12101002","DOIUrl":"https://doi.org/10.3390/axioms12101002","url":null,"abstract":"The aim of this paper is to present and study nonlinear bivariate C1 quadratic spline quasi-interpolants on uniform criss-cross triangulations for the approximation of piecewise smooth functions. Indeed, by using classical spline quasi-interpolants, the Gibbs phenomenon appears when approximating near discontinuities. Here, we use weighted essentially non-oscillatory techniques to modify classical quasi-interpolants in order to avoid oscillations near discontinuities and maintain high-order accuracy in smooth regions. We study the convergence properties of the proposed quasi-interpolants and we provide some numerical and graphical tests confirming the theoretical results.","PeriodicalId":53148,"journal":{"name":"Axioms","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135366994","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Interpretable Model-Agnostic Explanations Based on Feature Relationships for High-Performance Computing 高性能计算中基于特征关系的可解释模型不可知解释
3区 数学 Q1 MATHEMATICS, APPLIED Pub Date : 2023-10-23 DOI: 10.3390/axioms12100997
Zhouyuan Chen, Zhichao Lian, Zhe Xu
In the explainable artificial intelligence (XAI) field, an algorithm or a tool can help people understand how a model makes a decision. And this can help to select important features to reduce computational costs to realize high-performance computing. But existing methods are usually used to visualize important features or highlight active neurons, and few of them show the importance of relationships between features. In recent years, some methods based on a white-box approach have taken relationships between features into account, but most of them can only work on some specific models. Although methods based on a black-box approach can solve the above problems, most of them can only be applied to tabular data or text data instead of image data. To solve these problems, we propose a local interpretable model-agnostic explanation approach based on feature relationships. This approach combines the relationships between features into the interpretation process and then visualizes the interpretation results. Finally, this paper conducts a lot of experiments to evaluate the correctness of relationships between features and evaluates this XAI method in terms of accuracy, fidelity, and consistency.
在可解释人工智能(XAI)领域,算法或工具可以帮助人们理解模型是如何做出决策的。这有助于选择重要的特征来降低计算成本,从而实现高性能计算。但现有的方法通常用于可视化重要特征或突出显示活动神经元,很少有方法显示特征之间关系的重要性。近年来,一些基于白盒方法的方法考虑了特征之间的关系,但大多数方法只能在某些特定的模型上工作。虽然基于黑盒方法的方法可以解决上述问题,但大多数方法只能应用于表格数据或文本数据,而不能应用于图像数据。为了解决这些问题,我们提出了一种基于特征关系的局部可解释模型不可知的解释方法。这种方法将特征之间的关系结合到解释过程中,然后将解释结果可视化。最后,本文进行了大量的实验来评估特征之间关系的正确性,并从准确性、保真度和一致性三个方面对这种XAI方法进行了评估。
{"title":"Interpretable Model-Agnostic Explanations Based on Feature Relationships for High-Performance Computing","authors":"Zhouyuan Chen, Zhichao Lian, Zhe Xu","doi":"10.3390/axioms12100997","DOIUrl":"https://doi.org/10.3390/axioms12100997","url":null,"abstract":"In the explainable artificial intelligence (XAI) field, an algorithm or a tool can help people understand how a model makes a decision. And this can help to select important features to reduce computational costs to realize high-performance computing. But existing methods are usually used to visualize important features or highlight active neurons, and few of them show the importance of relationships between features. In recent years, some methods based on a white-box approach have taken relationships between features into account, but most of them can only work on some specific models. Although methods based on a black-box approach can solve the above problems, most of them can only be applied to tabular data or text data instead of image data. To solve these problems, we propose a local interpretable model-agnostic explanation approach based on feature relationships. This approach combines the relationships between features into the interpretation process and then visualizes the interpretation results. Finally, this paper conducts a lot of experiments to evaluate the correctness of relationships between features and evaluates this XAI method in terms of accuracy, fidelity, and consistency.","PeriodicalId":53148,"journal":{"name":"Axioms","volume":"6 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135405302","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Optimality Conditions for Approximate Solutions of Set Optimization Problems with the Minkowski Difference 具有Minkowski差分的集优化问题近似解的最优性条件
3区 数学 Q1 MATHEMATICS, APPLIED Pub Date : 2023-10-23 DOI: 10.3390/axioms12101001
Yuhe Zhang, Qilin Wang
In this paper, we study the optimality conditions for set optimization problems with set criterion. Firstly, we establish a few important properties of the Minkowski difference for sets. Then, we introduce the generalized second-order lower radial epiderivative for a set-valued maps by Minkowski difference, and discuss some of its properties. Finally, by virtue of the generalized second-order lower radial epiderivatives and the generalized second-order radial epiderivatives, we establish the necessary optimality conditions and sufficient optimality conditions of approximate Benson proper efficient solutions and approximate weakly minimal solutions of unconstrained set optimization problems without convexity conditions, respectively. Some examples are provided to illustrate the main results obtained.
本文研究了具有集准则的集优化问题的最优性条件。首先,我们建立了集的闵可夫斯基差分的几个重要性质。然后,利用Minkowski差分引入集值映射的广义二阶下径向表皮,并讨论了它的一些性质。最后,利用广义二阶下径向表皮子和广义二阶径向表皮子,分别建立了无凸条件下无约束集优化问题近似Benson固有有效解和近似弱极小解的必要最优性条件和充分最优性条件。给出了一些例子来说明所得到的主要结果。
{"title":"Optimality Conditions for Approximate Solutions of Set Optimization Problems with the Minkowski Difference","authors":"Yuhe Zhang, Qilin Wang","doi":"10.3390/axioms12101001","DOIUrl":"https://doi.org/10.3390/axioms12101001","url":null,"abstract":"In this paper, we study the optimality conditions for set optimization problems with set criterion. Firstly, we establish a few important properties of the Minkowski difference for sets. Then, we introduce the generalized second-order lower radial epiderivative for a set-valued maps by Minkowski difference, and discuss some of its properties. Finally, by virtue of the generalized second-order lower radial epiderivatives and the generalized second-order radial epiderivatives, we establish the necessary optimality conditions and sufficient optimality conditions of approximate Benson proper efficient solutions and approximate weakly minimal solutions of unconstrained set optimization problems without convexity conditions, respectively. Some examples are provided to illustrate the main results obtained.","PeriodicalId":53148,"journal":{"name":"Axioms","volume":"2005 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135366701","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Two Convergence Results for Inexact Orbits of Nonexpansive Operators in Metric Spaces with Graphs 带图度量空间中非膨胀算子非精确轨道的两个收敛结果
3区 数学 Q1 MATHEMATICS, APPLIED Pub Date : 2023-10-23 DOI: 10.3390/axioms12100999
Alexander J. Zaslavski
In this work we show that if iterates of a nonexpansive self-mapping of a complete metric with a graph converge uniformly on a subset of the space, then this convergence is stable under the presence of small computational errors.
在本文中,我们证明了如果具有图的完备度量的非扩张自映射的迭代在空间的子集上一致收敛,那么这种收敛在较小的计算误差下是稳定的。
{"title":"Two Convergence Results for Inexact Orbits of Nonexpansive Operators in Metric Spaces with Graphs","authors":"Alexander J. Zaslavski","doi":"10.3390/axioms12100999","DOIUrl":"https://doi.org/10.3390/axioms12100999","url":null,"abstract":"In this work we show that if iterates of a nonexpansive self-mapping of a complete metric with a graph converge uniformly on a subset of the space, then this convergence is stable under the presence of small computational errors.","PeriodicalId":53148,"journal":{"name":"Axioms","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135413233","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Lipschitz Continuity for Harmonic Functions and Solutions of the α¯-Poisson Equation 调和函数的Lipschitz连续性及α¯-Poisson方程的解
3区 数学 Q1 MATHEMATICS, APPLIED Pub Date : 2023-10-23 DOI: 10.3390/axioms12100998
Miodrag Mateljević, Nikola Mutavdžić, Adel Khalfallah
In this paper we investigate the solutions of the so-called α¯-Poisson equation in the complex plane. In particular, we will give sufficient conditions for Lipschitz continuity of such solutions. We also review some recently obtained results. As a corollary, we can restate results for harmonic and (p,q)-harmonic functions.
本文研究了复平面上α¯-泊松方程的解。特别地,我们将给出这类解的Lipschitz连续性的充分条件。我们还回顾了一些最近取得的成果。作为推论,我们可以重述调和函数和(p,q)-调和函数的结果。
{"title":"Lipschitz Continuity for Harmonic Functions and Solutions of the α¯-Poisson Equation","authors":"Miodrag Mateljević, Nikola Mutavdžić, Adel Khalfallah","doi":"10.3390/axioms12100998","DOIUrl":"https://doi.org/10.3390/axioms12100998","url":null,"abstract":"In this paper we investigate the solutions of the so-called α¯-Poisson equation in the complex plane. In particular, we will give sufficient conditions for Lipschitz continuity of such solutions. We also review some recently obtained results. As a corollary, we can restate results for harmonic and (p,q)-harmonic functions.","PeriodicalId":53148,"journal":{"name":"Axioms","volume":"40 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135413537","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Visualization in GeoGebra of Leibniz’s Argument on the Fundamental Theorem of Calculus 莱布尼茨关于微积分基本定理的论证在GeoGebra中的可视化
3区 数学 Q1 MATHEMATICS, APPLIED Pub Date : 2023-10-23 DOI: 10.3390/axioms12101000
Weimar Muñoz, Olga Lucía León, Vicenç Font
In the literature, it is usually assumed that Leibniz described proof for the Fundamental Theorem of Calculus (FTC) in 1693. However, did he really prove it? If the answer is no from today’s perspective, are there works in which Leibniz introduced arguments that can be understood as formulations and justifications of the FTC? In order to answer this question, we used a historiographic methodology with expert triangulation. From the study of Leibniz’s manuscripts describing the inverse problem of tangents and its relationship with the quadrature problem, we found evidence of a geometrical argument from which the FTC can be inferred. We present this argument using technological resources and modern notation. This result can be used to teach the FTC due to the existence of dynamic and geometrical software, which makes it suitable for the classroom. Moreover, it provides another interpretation of the FTC complementary to the interpretation using Riemann sums.
在文献中,通常假设莱布尼茨在1693年描述了微积分基本定理(FTC)的证明。然而,他真的证明了这一点吗?如果从今天的角度来看,答案是否定的,那么莱布尼茨在其中引入的论点是否可以被理解为联邦贸易委员会的表述和理由?为了回答这个问题,我们使用了史学方法和专家三角测量法。通过对莱布尼茨描述切线逆问题及其与正交问题关系的手稿的研究,我们发现了可以推断出FTC的几何论证的证据。我们使用技术资源和现代符号来提出这个论点。由于动态和几何软件的存在,这一结果可以用于FTC的教学,使其适合于课堂。此外,它还提供了对FTC的另一种解释,以补充使用黎曼和的解释。
{"title":"A Visualization in GeoGebra of Leibniz’s Argument on the Fundamental Theorem of Calculus","authors":"Weimar Muñoz, Olga Lucía León, Vicenç Font","doi":"10.3390/axioms12101000","DOIUrl":"https://doi.org/10.3390/axioms12101000","url":null,"abstract":"In the literature, it is usually assumed that Leibniz described proof for the Fundamental Theorem of Calculus (FTC) in 1693. However, did he really prove it? If the answer is no from today’s perspective, are there works in which Leibniz introduced arguments that can be understood as formulations and justifications of the FTC? In order to answer this question, we used a historiographic methodology with expert triangulation. From the study of Leibniz’s manuscripts describing the inverse problem of tangents and its relationship with the quadrature problem, we found evidence of a geometrical argument from which the FTC can be inferred. We present this argument using technological resources and modern notation. This result can be used to teach the FTC due to the existence of dynamic and geometrical software, which makes it suitable for the classroom. Moreover, it provides another interpretation of the FTC complementary to the interpretation using Riemann sums.","PeriodicalId":53148,"journal":{"name":"Axioms","volume":"53 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135366880","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Normed Space of Fuzzy Intervals and Its Topological Structure 模糊区间的赋范空间及其拓扑结构
3区 数学 Q1 MATHEMATICS, APPLIED Pub Date : 2023-10-22 DOI: 10.3390/axioms12100996
Hsien-Chung Wu
The space, Fcc(R), of all fuzzy intervals in R cannot form a vector space. However, the space Fcc(R) maintains a vector structure by treating the addition of fuzzy intervals as a vector addition and treating the scalar multiplication of fuzzy intervals as a scalar multiplication of vectors. The only difficulty in taking care of Fcc(R) is missing the additive inverse element. This means that each fuzzy interval that is subtracted from itself cannot be a zero element in Fcc(R). Although Fcc(R) cannot form a vector space, we still can endow a norm on the space Fcc(R) by following its vector structure. Under this setting, many different types of open sets can be proposed by using the different types of open balls. The purpose of this paper is to study the topologies generated by these different types of open sets.
R中所有模糊区间的空间Fcc(R)不能构成一个向量空间。然而,空间Fcc(R)通过将模糊区间的加法处理为向量加法,将模糊区间的标量乘法处理为向量的标量乘法来保持向量结构。计算Fcc(R)的唯一困难是缺少加性逆元。这意味着从自身减去的每个模糊区间不可能是Fcc(R)中的零元素。虽然Fcc(R)不能形成一个向量空间,但我们仍然可以按照Fcc(R)空间的向量结构赋予它一个范数。在此设置下,通过使用不同类型的开球,可以提出许多不同类型的开球。本文的目的是研究这些不同类型的开集所产生的拓扑结构。
{"title":"Normed Space of Fuzzy Intervals and Its Topological Structure","authors":"Hsien-Chung Wu","doi":"10.3390/axioms12100996","DOIUrl":"https://doi.org/10.3390/axioms12100996","url":null,"abstract":"The space, Fcc(R), of all fuzzy intervals in R cannot form a vector space. However, the space Fcc(R) maintains a vector structure by treating the addition of fuzzy intervals as a vector addition and treating the scalar multiplication of fuzzy intervals as a scalar multiplication of vectors. The only difficulty in taking care of Fcc(R) is missing the additive inverse element. This means that each fuzzy interval that is subtracted from itself cannot be a zero element in Fcc(R). Although Fcc(R) cannot form a vector space, we still can endow a norm on the space Fcc(R) by following its vector structure. Under this setting, many different types of open sets can be proposed by using the different types of open balls. The purpose of this paper is to study the topologies generated by these different types of open sets.","PeriodicalId":53148,"journal":{"name":"Axioms","volume":"44 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135461723","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Detection of Internal Wire Broken in Mining Wire Ropes Based on WOA–VMD and PSO–LSSVM Algorithms 基于WOA-VMD和PSO-LSSVM算法的矿用钢丝绳内部断丝检测
3区 数学 Q1 MATHEMATICS, APPLIED Pub Date : 2023-10-21 DOI: 10.3390/axioms12100995
Pengbo Li, Jie Tian, Zeyang Zhou, Wei Wang
To quantitatively identify internal wire breakage damage in mining wire ropes, a wire rope internal wire breakage signal identification method is proposed. First, the whale optimization algorithm is used to find the optimal value of the variational mode decomposition parameter [K, α] to obtain the optimal combination of the parameters, which reduces the signal noise with a signal-to-noise ratio of 29.29 dB. Second, the minimum envelope entropy of the noise reduction signal is extracted and combined with the time-domain features (maximum and minimum) and frequency-domain features (frequency–amplitude average, average frequency, average power) to form a fusion feature set. Finally, we use a particle swarm optimization–least squares support vector machine model to identify the internal wire breakage of wire ropes. The experimental results show that the method can effectively identify the internal wire rope breakage damage, and the average recognition rate is as high as 99.32%, so the algorithm can greatly reduce the system noise and effectively identify the internal damage signal of the wire rope, which is superior to a certain extent.
为了定量识别矿用钢丝绳断丝损伤,提出了一种钢丝绳断丝信号识别方法。首先,利用鲸鱼优化算法寻找变分模态分解参数[K, α]的最优值,得到参数的最优组合,降低了信号噪声,信噪比达到29.29 dB。其次,提取降噪信号的最小包络熵,并结合时域特征(最大值和最小值)和频域特征(频幅平均值、平均频率、平均功率)构成融合特征集;最后,采用粒子群优化-最小二乘支持向量机模型对钢丝绳内部断丝进行识别。实验结果表明,该方法可以有效识别钢丝绳内部断裂损伤,平均识别率高达99.32%,因此该算法可以大大降低系统噪声,有效识别钢丝绳内部损伤信号,在一定程度上具有优越性。
{"title":"Detection of Internal Wire Broken in Mining Wire Ropes Based on WOA–VMD and PSO–LSSVM Algorithms","authors":"Pengbo Li, Jie Tian, Zeyang Zhou, Wei Wang","doi":"10.3390/axioms12100995","DOIUrl":"https://doi.org/10.3390/axioms12100995","url":null,"abstract":"To quantitatively identify internal wire breakage damage in mining wire ropes, a wire rope internal wire breakage signal identification method is proposed. First, the whale optimization algorithm is used to find the optimal value of the variational mode decomposition parameter [K, α] to obtain the optimal combination of the parameters, which reduces the signal noise with a signal-to-noise ratio of 29.29 dB. Second, the minimum envelope entropy of the noise reduction signal is extracted and combined with the time-domain features (maximum and minimum) and frequency-domain features (frequency–amplitude average, average frequency, average power) to form a fusion feature set. Finally, we use a particle swarm optimization–least squares support vector machine model to identify the internal wire breakage of wire ropes. The experimental results show that the method can effectively identify the internal wire rope breakage damage, and the average recognition rate is as high as 99.32%, so the algorithm can greatly reduce the system noise and effectively identify the internal damage signal of the wire rope, which is superior to a certain extent.","PeriodicalId":53148,"journal":{"name":"Axioms","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135511411","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Exponential Stability and Relative Controllability of Nonsingular Conformable Delay Systems 非奇异相容时滞系统的指数稳定性和相对可控性
3区 数学 Q1 MATHEMATICS, APPLIED Pub Date : 2023-10-20 DOI: 10.3390/axioms12100994
Airen Zhou
In this paper, we investigate a delayed matrix exponential and utilize it to derive a representation of solutions to a linear nonsingular delay problem with permutable matrices. To begin with, we present a novel definition of α-exponential stability for these systems. Subsequently, we put forward several adequate conditions to ensure the α-exponential stability of solutions for such delay systems. Moreover, by constructing a Grammian matrix that accounts for delays, we provide a criterion to determine the relative controllability of a linear problem. Additionally, we extend our analysis to nonlinear problems. Lastly, we offer several examples to verify the effectiveness of our theoretical findings.
本文研究了一类时滞矩阵指数,并利用它导出了一类具有可变矩阵的线性非奇异时滞问题的解的表示。首先,我们给出了这些系统α-指数稳定性的一个新的定义。随后,我们给出了保证这类时滞系统解的α-指数稳定性的几个充分条件。此外,通过构造一个考虑延迟的Grammian矩阵,我们提供了一个标准来确定线性问题的相对可控性。此外,我们将我们的分析扩展到非线性问题。最后,我们提供了几个例子来验证我们的理论发现的有效性。
{"title":"Exponential Stability and Relative Controllability of Nonsingular Conformable Delay Systems","authors":"Airen Zhou","doi":"10.3390/axioms12100994","DOIUrl":"https://doi.org/10.3390/axioms12100994","url":null,"abstract":"In this paper, we investigate a delayed matrix exponential and utilize it to derive a representation of solutions to a linear nonsingular delay problem with permutable matrices. To begin with, we present a novel definition of α-exponential stability for these systems. Subsequently, we put forward several adequate conditions to ensure the α-exponential stability of solutions for such delay systems. Moreover, by constructing a Grammian matrix that accounts for delays, we provide a criterion to determine the relative controllability of a linear problem. Additionally, we extend our analysis to nonlinear problems. Lastly, we offer several examples to verify the effectiveness of our theoretical findings.","PeriodicalId":53148,"journal":{"name":"Axioms","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135569244","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Time-Fractional Differential Inequality of Sobolev Type on an Annulus 环上Sobolev型的时间分数阶微分不等式
3区 数学 Q1 MATHEMATICS, APPLIED Pub Date : 2023-10-20 DOI: 10.3390/axioms12100993
Amal Alshabanat, Eman Almoalim, Mohamed Jleli, Bessem Samet
Several phenomena from natural sciences can be described by partial differential equations of Sobolev-type. On the other hand, it was shown that in many cases, the use of fractional derivatives provides a more realistic model than the use of standard derivatives. The goal of this paper is to study the nonexistence of weak solutions to a time-fractional differential inequality of Sobolev-type. Namely, we give sufficient conditions for the nonexistence or equivalently necessary conditions for the existence. Our method makes use of the nonlinear capacity method, which consists in making an appropriate choice of test functions in the weak formulation of the problem. This technique has been employed in previous papers for some classes of time-fractional differential inequalities of Sobolev-type posed on the whole space RN. The originality of this work is that the considered problem is posed on an annulus domain, which leads to some difficulties concerning the choice of adequate test functions.
自然科学中的一些现象可以用sobolev型偏微分方程来描述。另一方面,研究表明,在许多情况下,使用分数阶导数比使用标准阶导数提供了一个更现实的模型。本文的目的是研究一类sobolev型时间分数阶微分不等式弱解的不存在性。也就是说,我们给出不存在的充分条件或存在的等价必要条件。我们的方法利用了非线性容量法,即在问题的弱形式中适当地选择测试函数。这一方法已在前人的研究中用于求解若干类全空间RN上的sobolev型时间分数阶微分不等式。这项工作的独创性在于所考虑的问题是在环域上提出的,这导致了一些关于选择适当的测试函数的困难。
{"title":"A Time-Fractional Differential Inequality of Sobolev Type on an Annulus","authors":"Amal Alshabanat, Eman Almoalim, Mohamed Jleli, Bessem Samet","doi":"10.3390/axioms12100993","DOIUrl":"https://doi.org/10.3390/axioms12100993","url":null,"abstract":"Several phenomena from natural sciences can be described by partial differential equations of Sobolev-type. On the other hand, it was shown that in many cases, the use of fractional derivatives provides a more realistic model than the use of standard derivatives. The goal of this paper is to study the nonexistence of weak solutions to a time-fractional differential inequality of Sobolev-type. Namely, we give sufficient conditions for the nonexistence or equivalently necessary conditions for the existence. Our method makes use of the nonlinear capacity method, which consists in making an appropriate choice of test functions in the weak formulation of the problem. This technique has been employed in previous papers for some classes of time-fractional differential inequalities of Sobolev-type posed on the whole space RN. The originality of this work is that the considered problem is posed on an annulus domain, which leads to some difficulties concerning the choice of adequate test functions.","PeriodicalId":53148,"journal":{"name":"Axioms","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135569389","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Axioms
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1