![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Carl N. Nett
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1996
- [j14]O. O. Badmus, S. Chowdhury, Carl N. Nett:
Nonlinear control of surge in axial compression systems. Autom. 32(1): 59-70 (1996) - [j13]Jie Chen
, Michael K. H. Fan, Carl N. Nett:
Structured singular values with nondiagonal structures. I. Characterizations. IEEE Trans. Autom. Control. 41(10): 1507-1511 (1996) - [j12]Jie Chen
, Michael K. H. Fan, Carl N. Nett:
Structured singular values with nondiagonal structures. II. Computation. IEEE Trans. Autom. Control. 41(10): 1511-1516 (1996) - [j11]Jie Chen, Jay A. Farrell
, Carl N. Nett, Kemin Zhou:
H∞ identification of multivariable systems by tangential interpolation methods. IEEE Trans. Autom. Control. 41(12): 1822-1828 (1996) - 1995
- [j10]Jie Chen, Carl N. Nett:
Sensitivity integrals for multivariable discrete-time systems. Autom. 31(8): 1113-1124 (1995) - [j9]Jie Chen, Carl N. Nett:
The Caratheodory-Fejer problem and H∞/l1 identification: a time domain approach. IEEE Trans. Autom. Control. 40(4): 729-735 (1995) - [j8]Jie Chen, Carl N. Nett, Michael K. H. Fan:
Optimal nonparametric identification from arbitrary corrupt finite time series. IEEE Trans. Autom. Control. 40(4): 769-776 (1995) - [j7]Jie Chen, Carl N. Nett, Michael K. H. Fan:
Worst case system identification in H∞: validation of a priori information, essentially optimal algorithms, and error bounds. IEEE Trans. Autom. Control. 40(7): 1260-1265 (1995) - 1994
- [j6]Jie Chen, James S. Freudenberg
, Carl N. Nett:
The role of the condition number and the relative gain array in robustness analysis. Autom. 30(6): 1029-1035 (1994) - [j5]Jie Chen, Guoxiang Gu, Carl N. Nett:
Worst case identification of continuous time systems via interpolation. Autom. 30(12): 1825-1837 (1994) - [j4]Mayuresh V. Kothare, Peter J. Campo, Manfred Morari, Carl N. Nett:
A unified framework for the study of anti-windup designs. Autom. 30(12): 1869-1883 (1994) - 1993
- [j3]Carl N. Nett, Wassim M. Haddad:
A system-theoretic appropriate realization of the empty matrix concept. IEEE Trans. Autom. Control. 38(5): 771-775 (1993) - [j2]Arthur J. Helmicki, Clas A. Jacobson, Carl N. Nett:
Least squares methods for H∞ control-oriented system identification. IEEE Trans. Autom. Control. 38(5): 819-826 (1993)
1980 – 1989
- 1988
- [j1]Carl N. Nett, James A. Uthgenannt:
An explicit formula and an optimal weight for the 2-block structured singular value interaction measure. Autom. 24(2): 261-265 (1988)
Coauthor Index
![](https://dblp1.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:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint