Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Daeshik Choi"'
Autor:
Daeshik Choi
Publikováno v:
International Journal of Analysis and Applications, Vol 15, Iss 1, Pp 57-61 (2017)
We present some inequalities related to Heinz means. Among them, we will provide an inequality involving Heinz means and Heron means, which is reverse to the one found by Bhatia.
Externí odkaz:
https://doaj.org/article/a3654ddfba244e789c4bed246f79478c
Autor:
Daeshik Choi
Publikováno v:
Journal of Mathematics, Vol 2016 (2016)
Recently, a multiple-term refinement of Young’s inequality has been proved. In this paper, we show its reverse refinement. Moreover, we will present multiple-term refinements of Young’s inequality involving Kantorovich constants. Finally, we will
Externí odkaz:
https://doaj.org/article/2d0c6a8976f440e09233e16d57d3977f
Publikováno v:
Linear Algebra and its Applications. 569:311-322
Denote by B ( n 1 , … , n k ) the set of block matrices whose ( i , j ) -blocks are n i × n j complex matrices. Let A i ∈ B ( n 1 , … , n k ) be positive semidefinite and D i ∈ B ( n 1 , … , n k ) be block diagonal matrices for 1 ≤ i ≤
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f251efef89b1051376ce7790eac3c1ab
https://doi.org/10.1016/j.laa.2019.01.022
https://doi.org/10.1016/j.laa.2019.01.022
Autor:
Daeshik Choi
Publikováno v:
Studia Scientiarum Mathematicarum Hungarica. 55:213-230
We find upper and lower bounds for the probability of a union of events which generalize the well-known Chung-Erdős inequality. Moreover, we will show monotonicity of the bounds.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::55a94f534ecf8f1f415d65d10e2d891d
https://doi.org/10.1556/012.2018.55.2.1386
https://doi.org/10.1556/012.2018.55.2.1386
Autor:
Daeshik Choi
Publikováno v:
Linear Algebra and its Applications. 532:1-7
In this paper, we present inequalities related to trace and determinant of positive semidefinite matrices. We introduce partial determinants corresponding to partial traces and improve the inequalities shown by Fiedler and Markham [1] and Lin [3] . W
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3c80eb7e792ee18920fdf2d76049187b
https://doi.org/10.1016/j.laa.2017.06.026
https://doi.org/10.1016/j.laa.2017.06.026
Autor:
Daeshik Choi
Publikováno v:
Linear and Multilinear Algebra. 66:1619-1625
We present inequalities related to partial transpose and partial traces of a positive semidefinite matrix.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d50fb1745ee317bb21e26a948b6cb21d
https://doi.org/10.1080/03081087.2017.1364341
https://doi.org/10.1080/03081087.2017.1364341
Autor:
Daeshik Choi
Publikováno v:
Linear and Multilinear Algebra. 66:280-284
In this paper, we present inequalities related to partial trace and block Hadamard product for positive semidefinite matrices. Some interesting results involving block matrices will be also derived.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9ff05fd2179c37574d5d978cdf43d4b4
https://doi.org/10.1080/03081087.2017.1295916
https://doi.org/10.1080/03081087.2017.1295916
Autor:
Daeshik Choi
Publikováno v:
Linear Algebra and its Applications. 516:1-7
In this paper, we present inequalities related to partial transpose and partial trace for positive semidefinite matrices. Some interesting results involving traces and eigenvalues are also included.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::20dfd008df85120e33583636fed94d24
https://doi.org/10.1016/j.laa.2016.11.027
https://doi.org/10.1016/j.laa.2016.11.027
Autor:
Daeshik Choi, Anne Greenbaum
Publikováno v:
SIAM Journal on Matrix Analysis and Applications. 36:289-301
For any nonsingular matrix $A$ and any positive integer $m$, the $m$th root, $A^{1/m}$, can be defined using any branch cut of the $m$th root function that does not pass through an eigenvalue of $A$. Cleary, $A^{1/m}$ approaches the identity as $m \r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0e07acff52b19e47f02069289558e4bb
https://doi.org/10.1137/140961742
https://doi.org/10.1137/140961742
An Algorithm for Finding a 2-Similarity Transformation from a Numerical Contraction to a Contraction
Autor:
Daeshik Choi, Anne Greenbaum
Publikováno v:
SIAM Journal on Matrix Analysis and Applications. 36:1248-1262
It was shown in [T. Ando, Acta Sci. Mat. (Szeged), 34, pp. 11--15] that any matrix $A$ with numerical radius at most 1 is similar to a contraction (a matrix $T$ with spectral norm at most $1$) via a similarity transformation with condition number at
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::95f6a5749338e4309bbbe35852095396
https://doi.org/10.1137/140990395
https://doi.org/10.1137/140990395