期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
Suppress voltage decay of lithium-rich materials by coating layers with different crystalline states 被引量:4
1
作者 Zhiwei Zhou ziyan luo +4 位作者 Zhenjiang He Junchao Zheng Yunjiao Li Cheng Yan Jing Mao 《Journal of Energy Chemistry》 SCIE EI CAS CSCD 2021年第9期591-598,共8页
Li-rich oxides are considered as the most commercial potential cathode materials due to the high theoretical specific discharge capacity. Here, ZrO_(2) in different crystalline states are applied as the coating layers... Li-rich oxides are considered as the most commercial potential cathode materials due to the high theoretical specific discharge capacity. Here, ZrO_(2) in different crystalline states are applied as the coating layers to enhance the electrochemical performance of hollow Li[Li_(0.2)Mn_(0.54)Ni_(0.13)Co_(0.13)]O_(2) materials.Meanwhile, a series of characterizations(XRD, SEM, TEM, EDX etc.) are conducted to compare the effects of ZrO_(2) coating layer with different crystalline states on the host material. The results elucidate that the Li-rich Mn-based material with the polycrystal ZrO_(2) coating layer has a slight advantage in rate performance, while the host material with the single crystal ZrO_(2)-coating layer has a better cycling performance and effectively suppresses voltage decay with the effect of excellently inhibiting layered to spinel-like phase transition and metal dissolution during charging and discharging process. 展开更多
关键词 Lithium-ion battery Cathode material Surface modification Electrochemical performance Voltage decay
下载PDF
Lagrangian duality and saddle points for sparse linear programming 被引量:1
2
作者 Chen Zhao ziyan luo +2 位作者 Weiyue Li Houduo Qi Naihua Xiu 《Science China Mathematics》 SCIE CSCD 2019年第10期2015-2032,共18页
The sparse linear programming(SLP) is a linear programming problem equipped with a sparsity constraint, which is nonconvex, discontinuous and generally NP-hard due to the combinatorial property involved.In this paper,... The sparse linear programming(SLP) is a linear programming problem equipped with a sparsity constraint, which is nonconvex, discontinuous and generally NP-hard due to the combinatorial property involved.In this paper, by rewriting the sparsity constraint into a disjunctive form, we present an explicit formula of the Lagrangian dual problem for the SLP, in terms of an unconstrained piecewise-linear convex programming problem which admits a strong duality under bi-dual sparsity consistency. Furthermore, we show a saddle point theorem based on the strong duality and analyze two classes of stationary points for the saddle point problem. At last,we extend these results to SLP with the lower bound zero replaced by a certain negative constant. 展开更多
关键词 SPARSE linear programming LAGRANGIAN dual problem strong DUALITY SADDLE point THEOREM OPTIMALITY condition
原文传递
Tensor Bernstein concentration inequalities with an application to sample estimators for high-order moments 被引量:1
3
作者 ziyan luo Liqun QI Philippe LTOINT 《Frontiers of Mathematics in China》 SCIE CSCD 2020年第2期367-384,共18页
This paper develops the Bernstein tensor concentration inequality for random tensors of general order,based on the use of Einstein products for tensors.This establishes a strong link between these and matrices,which i... This paper develops the Bernstein tensor concentration inequality for random tensors of general order,based on the use of Einstein products for tensors.This establishes a strong link between these and matrices,which in turn allows exploitation of existing results for the latter.An interesting application to sample estimators of high-order moments is presented as an illustration. 展开更多
关键词 Random tensors concentration inequality Einstein products SUBSAMPLING computational statistics
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部