Zobrazeno 1 - 10
of 43
pro vyhledávání: '"Shinya Miyajima"'
Autor:
Shinya Miyajima
Publikováno v:
Applied Mathematics and Computation. 453:128055
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f21ed1c0c78cce572361a67059556851
https://doi.org/10.1016/j.amc.2023.128055
https://doi.org/10.1016/j.amc.2023.128055
Autor:
Shinya Miyajima
Publikováno v:
Calcolo. 59
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b34a31fb6e0c14746d2367dc6d2c9538
https://doi.org/10.1007/s10092-022-00475-4
https://doi.org/10.1007/s10092-022-00475-4
Autor:
Shinya Miyajima
Publikováno v:
The Electronic Journal of Linear Algebra. 37:402-415
Fast algorithms are proposed for calculating error bounds for a numerically computed Perron root and vector of an irreducible nonnegative matrix. Emphasis is put on the computational efficiency of these algorithms. Error bounds for the root and vecto
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3816b0e5eeef1ac72e2f38373b66ea0d
https://doi.org/10.13001/ela.2021.5181
https://doi.org/10.13001/ela.2021.5181
Autor:
Shinya Miyajima
Publikováno v:
Japan Journal of Industrial and Applied Mathematics. 38:211-232
An algorithm for numerically computing an interval matrix containing the geometric mean of two Hermitian positive definite (HPD) matrices is proposed. We consider a special continuous-time algebraic Riccati equation (CARE) where the geometric mean is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e1bfc68ae038ed94b95d6e8c5de6f266
https://doi.org/10.1007/s13160-020-00448-6
https://doi.org/10.1007/s13160-020-00448-6
Robust verification algorithm for stabilizing solutions of discrete-time algebraic Riccati equations
Autor:
Shinya Miyajima
Publikováno v:
Japan Journal of Industrial and Applied Mathematics. 36:763-776
A robust algorithm is proposed for numerically computing an interval matrix containing the stabilizing solution of a discrete-time algebraic Riccati equation. This algorithm is based on estimating an upper bound for the spectral radius of a matrix po
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c5d4b64be43b6758480c66ac543dd755
https://doi.org/10.1007/s13160-019-00353-7
https://doi.org/10.1007/s13160-019-00353-7
Autor:
Shinya Miyajima
Publikováno v:
Linear Algebra and its Applications. 569:38-61
Two iterative algorithms are proposed for numerically computing an interval matrix containing the matrix principal logarithm. The first algorithm is based on a numerical spectral decomposition and requires only cubic complexity per iteration. The sec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f1f7c8bf9819dcecd70cfe8d5b61cb72
https://doi.org/10.1016/j.laa.2019.01.008
https://doi.org/10.1016/j.laa.2019.01.008
Autor:
Shinya Miyajima
Publikováno v:
Journal of Computational and Applied Mathematics. 350:80-86
A fast iterative algorithm is proposed for numerically computing an interval matrix containing the Hermitian positive definite solution to the conjugate discrete-time algebraic Riccati equation. This algorithm requires only cubic complexity per itera
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8323e25d39f17ada524549f365440486
https://doi.org/10.1016/j.cam.2018.10.008
https://doi.org/10.1016/j.cam.2018.10.008
Autor:
Shinya Miyajima
Publikováno v:
Journal of Scientific Computing. 87
We propose two algorithms for numerically calculating interval matrices including two-parameter matrix Mittag–Leffler (ML) functions. We first present an algorithm for computing enclosures for scalar ML functions. Then, the two proposed algorithms
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7ff0295d57b8453b8913ee5d341e728f
https://doi.org/10.1007/s10915-021-01447-6
https://doi.org/10.1007/s10915-021-01447-6
Autor:
Shinya Miyajima
Publikováno v:
Journal of Computational and Applied Mathematics. 406:113930
Two fast numerical algorithms are proposed for computing interval vectors containing positive solutions to M -tensor multi-linear systems. The first algorithm involves only two tensor-vector multiplications. The second algorithm is iterative one, and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::91ad3c9bfcb30724a6d126e91343e473
https://doi.org/10.1016/j.cam.2021.113930
https://doi.org/10.1016/j.cam.2021.113930
Autor:
Shinya Miyajima
Publikováno v:
Calcolo. 57
An algorithm is proposed for computing intervals containing the Moore–Penrose inverses. For developing this algorithm, we analyze the Ben-Israel iteration. We particularly emphasize that the algorithm is applicable even for rank deficient matrices.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::68438d22b724fdd07aca47cc2ae9105f
https://doi.org/10.1007/s10092-020-0357-9
https://doi.org/10.1007/s10092-020-0357-9