![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Zhen-Chen Guo
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i7]Zhen-Chen Guo, Xin Liang:
ISC: an RADI-type method for stochastic continuous-time algebraic Riccati equations. CoRR abs/2403.02940 (2024) - 2023
- [j7]Zhen-Chen Guo, Xin Liang
:
The intrinsic Toeplitz structure and its applications in algebraic Riccati equations. Numer. Algorithms 93(1): 227-267 (2023) - [j6]Zhen-Chen Guo
, Xin Liang
:
Stochastic Algebraic Riccati Equations Are Almost as Easy as Deterministic Ones Theoretically. SIAM J. Matrix Anal. Appl. 44(4): 1749-1770 (2023) - 2022
- [i6]Zhen-Chen Guo, Xin Liang:
Stochastic algebraic Riccati equations are almost as easy as deterministic ones. CoRR abs/2207.11220 (2022) - 2021
- [i5]Zhen-Chen Guo, Xin Liang:
The intrinsic Toeplitz structure and its applications in algebra Riccati equations. CoRR abs/2111.13003 (2021) - 2020
- [i4]Zhen-Chen Guo, Eric King-Wah Chu, Xin Liang, Wen-Wei Lin:
A decoupled form of the structure-preserving doubling algorithm with low-rank structures. CoRR abs/2005.08288 (2020) - [i3]Zhen-Chen Guo, Eric King-Wah Chu, Xin Liang:
Highly accurate decoupled doubling algorithm for large-scale M-matrix algebraic Riccati equations. CoRR abs/2011.00471 (2020) - [i2]Zhen-Chen Guo, Eric King-Wah Chu, Xin Liang, Wen-Wei Lin:
Decoupled Structure-Preserving Doubling Algorithm with Truncation for Large-Scale Algebraic Riccati Equations. CoRR abs/2011.01494 (2020) - [i1]Xin Liang, Zhen-Chen Guo, Tsung-Ming Huang, Tiexiang Li, Wen-Wei Lin:
Bifurcation Analysis of the Eigenstructure of the Discrete Single-curl Operator in Three-dimensional Maxwell's Equations with Pasteur Media. CoRR abs/2012.00479 (2020)
2010 – 2019
- 2019
- [j5]Zhen-Chen Guo:
Schur method for robust pole assignment of descriptor systems via proportional plus derivative state feedback. Int. J. Control 92(10): 2312-2323 (2019) - [j4]Zhen-Chen Guo, Eric King-Wah Chu, Wen-Wei Lin:
Doubling algorithm for the discretized Bethe-Salpeter eigenvalue problem. Math. Comput. 88(319): 2325-2350 (2019) - 2018
- [j3]Zhen-Chen Guo, Tiexiang Li, Ying-Ying Zhou
:
Structure-preserving ΓQR and Γ-Lanczos algorithms for Bethe-Salpeter eigenvalue problems. J. Comput. Appl. Math. 341: 12-30 (2018) - 2016
- [j2]Zhen-Chen Guo, Jiang Qian, Yun-Feng Cai, Shu-Fang Xu:
Refined Schur Method for Robust Pole Assignment with Repeated Poles. IEEE Trans. Autom. Control. 61(9): 2370-2385 (2016) - 2015
- [j1]Zhen-Chen Guo, Yun-Feng Cai, Jiang Qian, Shu-Fang Xu:
A modified Schur method for robust pole assignment in state feedback control. Autom. 52: 334-339 (2015)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint