Representation of Solutions to a Two-Sided Matrix Delay Differential Equations

In this paper, we investigate the representation of solution for the following linear matrix delayed differential equation Y˙(t)=A1Y(t)+Y(t)A2+BY(t−τ)+Y(t−τ)C+F(t),t∈[0,∞) where t is an independent variable, Y(t) is an n×n unknown variable matrix, τ>0 is a delay, A1,A2,B, and C are given n×n constant matrices, and F(t) is a given n×n variable matrix. Without requiring any commutativity condition between the coefficient matrices and Φ and F, we establish a formula for the initial problem Y(t)=Φ(t), t∈[−τ,0], where Φ(t) is an n×n variable matrix. The proof uses the vectorization technique and the method of steps. Our result settles Open Problems 1 and 2 posed by Diblík.

Authors

Institutions

Publication Details

Journal
Axioms
Published
2026-01-30
DOI
https://doi.org/10.3390/axioms15020099
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Representation of Solutions to a Two-Sided Matrix Delay Differential Equations

Zhenyu Bai, Chuanzhi Bai
Axioms
Matrix Theory and Algorithms
article

Representation of Solutions to a Two-Sided Matrix Delay Differential Equations

Zhenyu Bai, Chuanzhi Bai
article en

Abstract

In this paper, we investigate the representation of solution for the following linear matrix delayed differential equation Y˙(t)=A1Y(t)+Y(t)A2+BY(t−τ)+Y(t−τ)C+F(t),t∈[0,∞) where t is an independent variable, Y(t) is an n×n unknown variable matrix, τ>0 is a delay, A1,A2,B, and C are given n×n constant matrices, and F(t) is a given n×n variable matrix. Without requiring any commutativity condition between the coefficient matrices and Φ and F, we establish a formula for the initial problem Y(t)=Φ(t), t∈[−τ,0], where Φ(t) is an n×n variable matrix. The proof uses the vectorization technique and the method of steps. Our result settles Open Problems 1 and 2 posed by Diblík.

AxiomsVol. 15(2)
Guizhou University (CN), Huaiyin Normal University (CN)
Openalex Percentile: Top 70%
Matrix Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.