Applied Mathematics and Computation最新文献

英文中文

Computational aspects of hyperbolic curvature flow

IF 3.5 2区数学 Q1 MATHEMATICS, APPLIED

Applied Mathematics and Computation

Pub Date : 2025-01-23 DOI: 10.1016/j.amc.2025.129301

Monika Suchomelová, Michal Beneš, Miroslav Kolář

The article analyzes behavior of the solution of the hyperbolic curvature flow by means of a class of analytical solutions and by computational studies performed by a semi-discrete finite-volume scheme. A class of analytical solutions is derived and used for the verification of the computational algorithm by numerical convergence to it. An original tangential redistribution is proposed to stabilize the numerical scheme. Its derivation requires a four-dimensional transformation of the evolution law. The role of tangential redistribution is demonstrated on computational examples. Computational studies show evolution of the initially convex and non-convex curves, and include cases when singularities predicted by theory start to develop.

引用次数: 0

A note on block-transitive 2 − (v,k,1) designs

IF 3.5 2区数学 Q1 MATHEMATICS, APPLIED

Applied Mathematics and Computation

Pub Date : 2025-01-23 DOI: 10.1016/j.amc.2025.129314

Shangzhao Li , Xiran Zhang , Jing Chen , Shaojun Dai

Let G act block-transitively on a

2 - (v, 12, 1)

design. If G is solvable, then (1) if

3 | v

, then

v = 3^{n}

G \leq A Γ L (1, 3^{n})

, where

p^{n} \equiv 1 (\mod 44)

; (2) if

3 ∤ v

, then

v = p^{n}

G \leq A Γ L (1, p^{n})

, where

p \neq 2

and

p^{n} \equiv 1 (\mod 132)

引用次数: 0

Distinguishing infinite star-free graphs

IF 3.5 2区数学 Q1 MATHEMATICS, APPLIED

Applied Mathematics and Computation

Pub Date : 2025-01-23 DOI: 10.1016/j.amc.2025.129310

Marcin Stawiski

Call a vertex or an edge colouring of a graph distinguishing, if is not preserved by any non-identity automorphism. For a graph H, we say that a graph G is H-free if there is no induced subgraph of G, which is isomorphic to H. Gorzkowska, Kargul, Musiał and Pal proved that for every natural number n greater than 2 each finite connected

K_{1, n}

-free graph on at least six vertices has a distinguishing edge colouring using at most

n - 1

colours. We extend this result to all locally finite connected

K_{1, n}

-free graphs on at least six vertices.

引用次数: 0

An asymptotic preserving and energy stable scheme for the Euler system with congestion constraint

IF 3.5 2区数学 Q1 MATHEMATICS, APPLIED

Applied Mathematics and Computation

Pub Date : 2025-01-23 DOI: 10.1016/j.amc.2025.129306

K.R. Arun , A. Krishnamurthy, H. Maharna

In this work, we design and analyze an asymptotic preserving (AP), semi-implicit finite volume scheme for the scaled compressible isentropic Euler system with a singular pressure law known as the congestion pressure law. The congestion pressure law imposes a maximal density constraint of the form

0 \leq ϱ < 1

, and the scaling introduces a small parameter ε in order to control the stiffness of the density constraint. As

ε \to 0

, the solutions of the compressible system converge to solutions of the so-called free-congested Euler equations that couples compressible and incompressible dynamics. We show that the proposed scheme is positivity preserving and energy stable. In addition, we also show that the numerical densities satisfy a discrete variant of the constraint. By means of extensive numerical case studies, we verify the efficacy of the scheme and show that the scheme is able to capture the two dynamics in the limiting regime, thereby proving the AP property.

{"title":"An asymptotic preserving and energy stable scheme for the Euler system with congestion constraint","authors":"K.R. Arun , A. Krishnamurthy, H. Maharna","doi":"10.1016/j.amc.2025.129306","DOIUrl":"10.1016/j.amc.2025.129306","url":null,"abstract":"<div><div>In this work, we design and analyze an asymptotic preserving (AP), semi-implicit finite volume scheme for the scaled compressible isentropic Euler system with a singular pressure law known as the congestion pressure law. The congestion pressure law imposes a maximal density constraint of the form <span><math><mn>0</mn><mo>≤</mo><mi>ϱ</mi><mo><</mo><mn>1</mn></math></span>, and the scaling introduces a small parameter <em>ε</em> in order to control the stiffness of the density constraint. As <span><math><mi>ε</mi><mo>→</mo><mn>0</mn></math></span>, the solutions of the compressible system converge to solutions of the so-called free-congested Euler equations that couples compressible and incompressible dynamics. We show that the proposed scheme is positivity preserving and energy stable. In addition, we also show that the numerical densities satisfy a discrete variant of the constraint. By means of extensive numerical case studies, we verify the efficacy of the scheme and show that the scheme is able to capture the two dynamics in the limiting regime, thereby proving the AP property.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"495 ","pages":"Article 129306"},"PeriodicalIF":3.5,"publicationDate":"2025-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143035321","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Effects of an update mechanism based on combinatorial memory and high-reputation learning objects on the evolution of cooperation

IF 3.5 2区数学 Q1 MATHEMATICS, APPLIED

Applied Mathematics and Computation

Pub Date : 2025-01-23 DOI: 10.1016/j.amc.2025.129309

Qianxi Yang, Yanlong Yang

In human society, various factors influence decision-making, including memory, reputation, aspiration, etc. In recent years, research has increasingly focused on considering these factors and designing mechanisms to promote cooperation. However, few previous studies have simultaneously considered the effects of memory and reputation on cooperative evolution. Additionally, research on cooperation evolution based on memory mechanisms often focuses either on the strategy stability of the players themselves or on the strategy stability of the learning objects, but not both. Our study introduces an update mechanism based on combinatorial memory and high-reputation learning objects. This mechanism accounts for reputation and memory, where the memory effect includes the strategy stability of both the players and the learning objects. Specifically, at the stage of selecting learning objects, players prefer high-reputation individuals. We introduce a global selection weight, η, which allows players to select learning objects not only locally but also globally. At the stage of updating the strategy, each player simultaneously considers their own historical memory and the memory of their learning objects, with the parameter γ representing the memory weight of the learning objects. Monte Carlo simulations show that update rules that simultaneously consider both combinatorial memory and high-reputation learning objects are more effective in promoting cooperation than considering either factor alone. Furthermore, a small memory weight of the learning objects and a small global selection weight create an optimal environment for cooperation. Our study offers a novel approach to addressing social dilemmas and mitigating defection, emphasizing the critical roles of reputation and memory in the propagation of altruistic behavior.

{"title":"Effects of an update mechanism based on combinatorial memory and high-reputation learning objects on the evolution of cooperation","authors":"Qianxi Yang, Yanlong Yang","doi":"10.1016/j.amc.2025.129309","DOIUrl":"10.1016/j.amc.2025.129309","url":null,"abstract":"<div><div>In human society, various factors influence decision-making, including memory, reputation, aspiration, etc. In recent years, research has increasingly focused on considering these factors and designing mechanisms to promote cooperation. However, few previous studies have simultaneously considered the effects of memory and reputation on cooperative evolution. Additionally, research on cooperation evolution based on memory mechanisms often focuses either on the strategy stability of the players themselves or on the strategy stability of the learning objects, but not both. Our study introduces an update mechanism based on combinatorial memory and high-reputation learning objects. This mechanism accounts for reputation and memory, where the memory effect includes the strategy stability of both the players and the learning objects. Specifically, at the stage of selecting learning objects, players prefer high-reputation individuals. We introduce a global selection weight, <em>η</em>, which allows players to select learning objects not only locally but also globally. At the stage of updating the strategy, each player simultaneously considers their own historical memory and the memory of their learning objects, with the parameter <em>γ</em> representing the memory weight of the learning objects. Monte Carlo simulations show that update rules that simultaneously consider both combinatorial memory and high-reputation learning objects are more effective in promoting cooperation than considering either factor alone. Furthermore, a small memory weight of the learning objects and a small global selection weight create an optimal environment for cooperation. Our study offers a novel approach to addressing social dilemmas and mitigating defection, emphasizing the critical roles of reputation and memory in the propagation of altruistic behavior.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"495 ","pages":"Article 129309"},"PeriodicalIF":3.5,"publicationDate":"2025-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143035320","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Null controllability of an ODE-heat system with coupled boundary and internal terms

IF 3.5 2区数学 Q1 MATHEMATICS, APPLIED

Applied Mathematics and Computation

Pub Date : 2025-01-22 DOI: 10.1016/j.amc.2025.129303

Idriss Boutaayamou , Fouad Et-tahri , Lahcen Maniar

This paper is devoted to the theoretical and numerical analysis of the null controllability of a coupled ODE-heat system internally and at the boundary with Neumann boundary control. First, we establish the null controllability of the ODE-heat with distributed control using Carleman estimates. Then, we conclude by the strategy of space domain extension. Finally, we illustrate the analysis with some numerical experiments.

引用次数: 0

Observer-based non-fragile control for T-S fuzzy switched systems against cyber attacks: A double-layer PDT switching method

IF 3.5 2区数学 Q1 MATHEMATICS, APPLIED

Applied Mathematics and Computation

Pub Date : 2025-01-22 DOI: 10.1016/j.amc.2025.129308

Pengcheng Zhang , Yajuan Liu , Shiyu Jiao , Chen Yang

This paper mainly investigates the observer-based non-fragile control issue for a class of T-S fuzzy switched systems under cyber attacks. Firstly, the system under consideration comprises a finite number of subsystems governed by the switching logic subject to the persistent dwell-time constraints, with each local subsystem represented by a T-S fuzzy model. Secondly, the switching logic with persistent dwell-time constraints is also used to make assumptions about the frequency and duration of attacks, and the system under cyber attacks is constructed as a double-layer switched system that satisfies two independent rules simultaneously. In addition, a non-fragile control strategy relying on observed states is developed, and the criterion for the global exponential stability and the synthesis conditions for the observer/controller are established by constructing a Lyapunov function associated with two switching signals. Finally, an electric circuit model is simulated to demonstrate the feasibility of the method.

引用次数: 0

Decoupled bound-preserving algorithms for compressible Darcy-Brinkman flow with advection-diffusion transport problem in fractured media

IF 3.5 2区数学 Q1 MATHEMATICS, APPLIED

Applied Mathematics and Computation

Pub Date : 2025-01-21 DOI: 10.1016/j.amc.2025.129298

Wei Liu, Kai Li

A coupling of compressible Darcy-Brinkman flow and advection-diffusion transport problem is considered in fractured media. Treating the fracture as hyperplane, we obtain a two-layer reduced coupled model and the whole considered media is divided into low dimensional fracture-interfaces and surrounding high dimensional subdomains. To improve efficiency, two decoupled algorithms are constructed to solve the reduced coupled model. One decoupled algorithm is proposed based on interpolating vectors as inner boundaries and the other is constructed by interpolating scalars as iterative terms. By using both algorithms, the models in each subdomain are solved in parallel. The BDF2 formula and modified upwind scheme are employed to maintain the accuracy. For advection-diffusion model, we develop a novel bound-preserving scheme to keep the concentration within

[0, 1]

combined with finite volume method by the Lagrange multiplier approach. The accuracy and efficiency of the proposed algorithms are verified by numerical experiments including three-dimensional case and benchmark testing.

{"title":"Decoupled bound-preserving algorithms for compressible Darcy-Brinkman flow with advection-diffusion transport problem in fractured media","authors":"Wei Liu, Kai Li","doi":"10.1016/j.amc.2025.129298","DOIUrl":"10.1016/j.amc.2025.129298","url":null,"abstract":"<div><div>A coupling of compressible Darcy-Brinkman flow and advection-diffusion transport problem is considered in fractured media. Treating the fracture as hyperplane, we obtain a two-layer reduced coupled model and the whole considered media is divided into low dimensional fracture-interfaces and surrounding high dimensional subdomains. To improve efficiency, two decoupled algorithms are constructed to solve the reduced coupled model. One decoupled algorithm is proposed based on interpolating vectors as inner boundaries and the other is constructed by interpolating scalars as iterative terms. By using both algorithms, the models in each subdomain are solved in parallel. The BDF2 formula and modified upwind scheme are employed to maintain the accuracy. For advection-diffusion model, we develop a novel bound-preserving scheme to keep the concentration within <span><math><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>]</mo></math></span> combined with finite volume method by the Lagrange multiplier approach. The accuracy and efficiency of the proposed algorithms are verified by numerical experiments including three-dimensional case and benchmark testing.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"495 ","pages":"Article 129298"},"PeriodicalIF":3.5,"publicationDate":"2025-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143035328","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

k-path-edge-connectivity of the complete balanced bipartite graph

IF 3.5 2区数学 Q1 MATHEMATICS, APPLIED

Applied Mathematics and Computation

Pub Date : 2025-01-20 DOI: 10.1016/j.amc.2025.129295

Yaoping Wang, Shasha Li, Zeng Zhao

Given a graph

G = (V, E)

and a set

S \subseteq V (G)

with

| S | \geq 2

, an S-path in G is a path that connects all vertices of S. Let

ω_{G} (S)

represent the maximum number of edge-disjoint S-paths in G. The k-path-edge-connectivity

ω_{k} (G)

of G is then defined as min

{ω_{G} (S) : S \subseteq V (G) a n d | S | = k}

, where

2 \leq k \leq | V |

. Therefore,

ω_{2} (G)

is precisely the edge-connectivity

λ (G)

. In this paper, we focus on the k-path-edge-connectivity of the complete balanced bipartite graph

K_{n, n}

for all

3 \leq k \leq 2 n

. We show that if

k = n

k = n + 1

, and n is odd, then

ω_{k} (K_{n, n}) = ⌊ \frac{n k}{2 (k - 1)} ⌋ - 1

; otherwise,

ω_{k} (K_{n, n}) = ⌊ \frac{n k}{2 (k - 1)} ⌋

引用次数: 0

1-Planar graphs with no 5-cycles are 5-degenerate

IF 3.5 2区数学 Q1 MATHEMATICS, APPLIED

Applied Mathematics and Computation

Pub Date : 2025-01-20 DOI: 10.1016/j.amc.2025.129304

Qingqin Wu , Weifan Wang , Jiangxu Kong

A graph is 1-planar if it can be drawn in the plane so that each edge is crossed by at most one other edge. A graph is k-degenerate if each of its subgraphs contains a vertex of degree no greater than k. It was known that 1-planar graphs are 7-degenerate. In this paper, we show that every 1-planar graph without 5-cycles is 5-degenerate, which extends some known results on the 5-degeneracy of some 1-planar graphs.

引用次数: 0

首页上一页

下一页尾页

类型

全部化学•材料生命科学医学物理工程技术环境•农林材料科学地球科学法学管理学化学环境科学与生态学计算机科学教育学经济学农林科学人文科学生物学数学物理与天体物理心理学综合性期刊其他工业工程理学历史学农学文学信息工程

数据库

全部 ACS Publications Elsevier ieeexplore Springer The Royal Society of Chemistry Wiley

期刊

Applied Mathematics and Computation

全部 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.

﹀