Zobrazeno 1 - 10
of 96
pro vyhledávání: '"Moody T. Chu"'
Autor:
Moody T. Chu, Zhenyue Zhang
Publikováno v:
Mathematics, Vol 11, Iss 15, p 3306 (2023)
This article reports an experimental work that unveils some interesting yet unknown phenomena underneath all smooth nonlinear maps. The findings are based on the fact that, generalizing the conventional gradient dynamics, the right singular vectors o
Externí odkaz:
https://doaj.org/article/cc81cc2298a94bec8b4ec4fa84a7528e
Autor:
Moody T Chu
Publikováno v:
IMA Journal of Numerical Analysis.
Simulating the time evolution of a Hamiltonian system on a classical computer is hard—The computational power required to even describe a quantum system scales exponentially with the number of its constituents, let alone integrate its equations of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fcd83fa5ad5bd8edf6fce521a3b9ae55
https://doi.org/10.1093/imanum/drad018
https://doi.org/10.1093/imanum/drad018
Autor:
Moody T. Chu, Matthew M. Lin
Publikováno v:
SIAM Journal on Scientific Computing. 43:S448-S474
Gauging the distance between a mixed state and the convex set of separable states in a bipartite quantum mechanical system over the complex field is an important but challenging task. As a first st...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::11545ff8bf3a4aeaefc9a65e111e3007
https://doi.org/10.1137/20m1336059
https://doi.org/10.1137/20m1336059
Publikováno v:
Numerische Mathematik. 144:729-749
Low rank tensor approximation is an important subject with a wide range of applications. Most prevailing techniques for computing the low rank approximation in the Tucker format often first assemble relevant factors into matrices and then update by t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7321978b815e0936fd9da20d43dee222
https://doi.org/10.1007/s00211-020-01100-8
https://doi.org/10.1007/s00211-020-01100-8
Autor:
Moody T. Chu, Matthew M. Lin
Publikováno v:
Computer Physics Communications. 271:108185
Entanglement of quantum states in a composite system is of profound importance in many applications. With respect to some suitably selected basis, the entanglement can be mathematically characterized via the Kronecker product of complex-valued densit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::28ea706172740d1f0fc44a0a0e0e318c
https://doi.org/10.1016/j.cpc.2021.108185
https://doi.org/10.1016/j.cpc.2021.108185
Publikováno v:
Linear Algebra and its Applications. 555:53-69
This paper revisits the classical problem of finding the best rank-1 approximation to a generic tensor. The main focus is on providing a mathematical proof for the convergence of the iterates of an SVD-based algorithm. In contrast to the conventional
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e9e188bf2df28a15e3bcfb5f06e0e8b3
https://doi.org/10.1016/j.laa.2018.06.006
https://doi.org/10.1016/j.laa.2018.06.006
Publikováno v:
SIAM Journal on Matrix Analysis and Applications. 39:1095-1115
This paper revisits the problem of finding the best rank-1 approximation to a symmetric tensor and makes three contributions. First, in contrast to the many long and lingering arguments in the lite...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::09c2ab1c7f538dd631e51ecf2fb61f63
https://doi.org/10.1137/17m1136699
https://doi.org/10.1137/17m1136699
Autor:
Moody T. Chu, Sheng-Jhih Wu
Publikováno v:
Applied Mathematics and Computation. 303:226-239
A Markov chain with memory is no different from the conventional Markov chain on the product state space. Such a Markovianization, however, increases the dimensionality exponentially. Instead, Markov chain with memory can naturally be represented as
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::68f9d6e9f0ebb465dbd96e801684dc50
https://doi.org/10.1016/j.amc.2017.01.030
https://doi.org/10.1016/j.amc.2017.01.030
Autor:
Moody T. Chu
Publikováno v:
Linear Algebra and its Applications. 489:123-143
Given a Laurent polynomial with matrix coefficients that is positive semi-definite over the unit circle in the complex plane, the Fejer–Riesz theorem asserts that it can always be factorized as the product of a polynomial with matrix coefficients a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6a7dcf7c4ddeb016c14af873206b02ae
https://doi.org/10.1016/j.laa.2015.09.051
https://doi.org/10.1016/j.laa.2015.09.051
Autor:
Moody T. Chu, Sheng-Jhih Wu
Publikováno v:
Linear Algebra and its Applications. 487:184-202
The notion of asymptotic variance has been used as a means for gauging the performance of Markov chain Monte Carlo (MCMC) methods. For an effective MCMC simulation, it is imperative to first construct a Markov model with minimal asymptotic variance.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ee5167425b80e09ee96de78c2eab28e3
https://doi.org/10.1016/j.laa.2015.09.016
https://doi.org/10.1016/j.laa.2015.09.016