A Piecewise Modified Matrix Padé-type Approximation of Hybrid Order in the Interval [0, 1]
Cited by
Export citation
- BibTex
- RIS
- TXT
@Article{JICS-5-314,
author = {Beibei Wu},
title = {A Piecewise Modified Matrix Padé-type Approximation of Hybrid Order in the Interval [0, 1]},
journal = {Journal of Information and Computing Science},
year = {2024},
volume = {5},
number = {4},
pages = {314--320},
abstract = { In this paper, we introduce a piecewise modified matrix Padé-type approximation of hybrid
order in the interval [0, 1]. It yields highly accurate results and exact values at some given points. The
accuracy of this approximation increases as the order or the node increases. This method can be applied to
approximate the exponential function. The explicit formula for computing the matrix exponential is presented.
A numerical example is given to illustrate the effectiveness of this method.
},
issn = {1746-7659},
doi = {https://doi.org/},
url = {http://global-sci.org/intro/article_detail/jics/22706.html}
}
TY - JOUR
T1 - A Piecewise Modified Matrix Padé-type Approximation of Hybrid Order in the Interval [0, 1]
AU - Beibei Wu
JO - Journal of Information and Computing Science
VL - 4
SP - 314
EP - 320
PY - 2024
DA - 2024/01
SN - 5
DO - http://doi.org/
UR - https://global-sci.org/intro/article_detail/jics/22706.html
KW - matrix Padé-type approximation, piecewise interpolation, matrix exponential.
AB - In this paper, we introduce a piecewise modified matrix Padé-type approximation of hybrid
order in the interval [0, 1]. It yields highly accurate results and exact values at some given points. The
accuracy of this approximation increases as the order or the node increases. This method can be applied to
approximate the exponential function. The explicit formula for computing the matrix exponential is presented.
A numerical example is given to illustrate the effectiveness of this method.
Beibei Wu. (2024). A Piecewise Modified Matrix Padé-type Approximation of Hybrid Order in the Interval [0, 1].
Journal of Information and Computing Science. 5 (4).
314-320.
doi:
Copy to clipboard