Please wait ... |

Refine search result

CiteExportLink to result list
http://kth.diva-portal.org/smash/resultList.jsf?query=&language=en&searchType=SIMPLE&noOfRows=50&sortOrder=author_sort_asc&sortOrder2=title_sort_asc&onlyFullText=false&sf=all&aq=%5B%5B%7B%22personId%22%3A%22authority-person%3A31396+OR+0000-0002-2681-8383%22%7D%5D%5D&aqe=%5B%5D&aq2=%5B%5B%5D%5D&af=%5B%5D $(function(){PrimeFaces.cw("InputTextarea","widget_formSmash_upper_j_idt482_recordPermLink",{id:"formSmash:upper:j_idt482:recordPermLink",widgetVar:"widget_formSmash_upper_j_idt482_recordPermLink",autoResize:true});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_upper_j_idt482_j_idt484",{id:"formSmash:upper:j_idt482:j_idt484",widgetVar:"widget_formSmash_upper_j_idt482_j_idt484",target:"formSmash:upper:j_idt482:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});

Permanent link

Cite

Citation styleapa harvard1 ieee modern-language-association-8th-edition vancouver Other style $(function(){PrimeFaces.cw("SelectOneMenu","widget_formSmash_upper_j_idt500",{id:"formSmash:upper:j_idt500",widgetVar:"widget_formSmash_upper_j_idt500",behaviors:{change:function(ext) {PrimeFaces.ab({s:"formSmash:upper:j_idt500",e:"change",f:"formSmash",p:"formSmash:upper:j_idt500",u:"formSmash:upper:otherStyle"},ext);}}});});

- apa
- harvard1
- ieee
- modern-language-association-8th-edition
- vancouver
- Other style

Languagede-DE en-GB en-US fi-FI nn-NO nn-NB sv-SE Other locale $(function(){PrimeFaces.cw("SelectOneMenu","widget_formSmash_upper_j_idt511",{id:"formSmash:upper:j_idt511",widgetVar:"widget_formSmash_upper_j_idt511",behaviors:{change:function(ext) {PrimeFaces.ab({s:"formSmash:upper:j_idt511",e:"change",f:"formSmash",p:"formSmash:upper:j_idt511",u:"formSmash:upper:otherLanguage"},ext);}}});});

- de-DE
- en-GB
- en-US
- fi-FI
- nn-NO
- nn-NB
- sv-SE
- Other locale

Output formathtml text asciidoc rtf $(function(){PrimeFaces.cw("SelectOneMenu","widget_formSmash_upper_j_idt521",{id:"formSmash:upper:j_idt521",widgetVar:"widget_formSmash_upper_j_idt521"});});

- html
- text
- asciidoc
- rtf

Rows per page

- 5
- 10
- 20
- 50
- 100
- 250

Sort

- Standard (Relevance)
- Author A-Ö
- Author Ö-A
- Title A-Ö
- Title Ö-A
- Publication type A-Ö
- Publication type Ö-A
- Issued (Oldest first)
- Issued (Newest first)
- Created (Oldest first)
- Created (Newest first)
- Last updated (Oldest first)
- Last updated (Newest first)
- Disputation date (earliest first)
- Disputation date (latest first)

- Standard (Relevance)
- Author A-Ö
- Author Ö-A
- Title A-Ö
- Title Ö-A
- Publication type A-Ö
- Publication type Ö-A
- Issued (Oldest first)
- Issued (Newest first)
- Created (Oldest first)
- Created (Newest first)
- Last updated (Oldest first)
- Last updated (Newest first)
- Disputation date (earliest first)
- Disputation date (latest first)

Select

The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.

1. Avventi, Enrico PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_0_j_idt584",{id:"formSmash:items:resultList:0:j_idt584",widgetVar:"widget_formSmash_items_resultList_0_j_idt584",onLabel:"Avventi, Enrico ",offLabel:"Avventi, Enrico ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_0_j_idt587",{id:"formSmash:items:resultList:0:j_idt587",widgetVar:"widget_formSmash_items_resultList_0_j_idt587",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:0:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Lindquist, AndersKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.Wahlberg, BoKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:0:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); ARMA Identification of Graphical Models2013In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 58, no 5, p. 1167-1178Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_0_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:0:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_0_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Consider a Gaussian stationary stochastic vector process with the property that designated pairs of components are conditionally independent given the rest of the components. Such processes can be represented on a graph where the components are nodes and the lack of a connecting link between two nodes signifies conditional independence. This leads to a sparsity pattern in the inverse of the matrix-valued spectral density. Such graphical models find applications in speech, bioinformatics, image processing, econometrics and many other fields, where the problem to fit an autoregressive (AR) model to such a process has been considered. In this paper we take this problem one step further, namely to fit an autoregressive moving-average (ARMA) model to the same data. We develop a theoretical framework and an optimization procedure which also spreads further light on previous approaches and results. This procedure is then applied to the identification problem of estimating the ARMA parameters as well as the topology of the graph from statistical data.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:0:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 2. Avventi, Enrico PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_1_j_idt584",{id:"formSmash:items:resultList:1:j_idt584",widgetVar:"widget_formSmash_items_resultList_1_j_idt584",onLabel:"Avventi, Enrico ",offLabel:"Avventi, Enrico ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_1_j_idt587",{id:"formSmash:items:resultList:1:j_idt587",widgetVar:"widget_formSmash_items_resultList_1_j_idt587",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:1:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Lindquist, AndersKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.Wahlberg, BoKTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:1:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Graphical Models of Autoregressive Moving-Average Processes2010In: The 19th International Symposium on Mathematical Theory of Networks and Systems (MTNS 2010), 2010Conference paper (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_1_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:1:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_1_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Consider a Gaussian stationary stochastic vector process with the property that designated pairs of components are conditionally independent given the rest of the components. Such processes can be represented on a graph where the components are nodes and the lack of a connecting link between two nodes signifies conditional independence. This leads to a sparsity pattern in the inverse of the matrix-valued spectral density. Such graphical models find applications in speech, bioinformatics, image processing, econometrics and many other fields, where the problem to fit an autoregressive (AR) model to such a process has been considered. In this paper we take this problem one step further, namely to fit an autoregressive moving-average (ARMA) model to the same data. We develop a theoretical framework which also spreads further light on previous approaches and results.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:1:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 3. Byrnes, C. I. et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_2_j_idt587",{id:"formSmash:items:resultList:2:j_idt587",widgetVar:"widget_formSmash_items_resultList_2_j_idt587",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:2:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Fanizza, GiovannaKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.Lindquist, AndersKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:2:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); The covariance extension equation revisited2005In: Proceedings of the 44th IEEE Conference on Decision and Control, and the European Control Conference, CDC-ECC '05, 2005, p. 7924-7930Conference paper (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_2_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:2:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_2_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); In this paper we study the steady state form of a discrete-time matrix Riccati-type equation, connected to the rational covariance extension problem and to the partial stochastic realization problem. This equation, however, is non-standard in that it lacks the usual kind of definiteness properties which underlie the solvability of the standard Riccati equation. Nonetheless, we prove the existence and uniqueness of a positive semidefinite solution. We also show that this equation has the proper geometric attributes to be solvable by homotopy continuation methods, which we illustrate in several examples.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:2:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 4. Byrnes, Christopher PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_3_j_idt584",{id:"formSmash:items:resultList:3:j_idt584",widgetVar:"widget_formSmash_items_resultList_3_j_idt584",onLabel:"Byrnes, Christopher ",offLabel:"Byrnes, Christopher ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_3_j_idt587",{id:"formSmash:items:resultList:3:j_idt587",widgetVar:"widget_formSmash_items_resultList_3_j_idt587",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, Superseded Departments, Mathematics.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:3:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Enqvist, PerKTH, Superseded Departments, Mathematics.Lindquist, AndersKTH, Superseded Departments, Mathematics.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:3:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Cepstral coefficients, covariance lags, and pole-zero models for finite data strings2001In: IEEE Transactions on Signal Processing, ISSN 1053-587X, E-ISSN 1941-0476, Vol. 49, no 4, p. 677-693Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_3_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:3:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_3_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); One of the most widely used methods of spectral estimation in signal and speech processing is linear predictive coding (LPC). LPC has some attractive features, which account for its popularity, including the properties that the resulting modeling filter i) matches a finite window of n + 1 covariance lags, ii) is rational of degree at most n, and iii) has stable zeros and poles. The only limiting factor of this methodology is that the modeling filter is "all-pole," i.e., an autoregressive (AR) model. In this paper, we present a systematic description of all autoregressive moving-average (ARMA) models of processes that have properties i)-iii) in the context of cepstral analysis and homomorphic filtering. Indeed, we show that each such ARMA model determines and is completely determined by its finite windows of cepstral coefficients and covariance lags. This characterization has an intuitively appealing interpretation of a characterization by using measures of the transient and the steady-state behaviors of the signal, respectively. More precisely, we show that these nth-order windows form local coordinates for all ARMA models of degree n and that the pole-zero model can be determined from the windows as the unique minimum of a convex objective function. We refine this optimization method by first noting that the maximum entropy design of an LPC filter is obtained by maximizing the zeroth cepstral coefficient, subject to the constraint i). More generally, we modify this scheme to a more well-posed optimization problem where the covariance data enters as a constraint and the linear weights of the cepstral coefficients are "positive"-in a sense that a certain pseudo-polynomial is positive-rather succinctly generalizing the maximum entropy method. This new problem is a homomorphic filter generalization of the maximum entropy method, providing a procedure for the design of any stable, minimum-phase modeling filter of degree less or equal to n that interpolates the given covariance window We conclude the paper by presenting an algorithm for realizing these biters in a lattice-ladder form, given the covariance window and the moving average part of the model. While we also show how to determine the moving average part using cepstral smoothing, one can make use of any good a priori estimate for the system zeros to initialize the algorithm. Indeed, we conclude the paper with an example of this method, incorporating an example from the literature on ARMA modeling.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:3:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 5. Byrnes, Christopher PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_4_j_idt584",{id:"formSmash:items:resultList:4:j_idt584",widgetVar:"widget_formSmash_items_resultList_4_j_idt584",onLabel:"Byrnes, Christopher ",offLabel:"Byrnes, Christopher ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_4_j_idt587",{id:"formSmash:items:resultList:4:j_idt587",widgetVar:"widget_formSmash_items_resultList_4_j_idt587",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, Superseded Departments, Mathematics.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:4:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Enqvist, PerKTH, Superseded Departments, Mathematics.Lindquist, AndersKTH, Superseded Departments, Mathematics.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:4:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Identifiability and well-posedness of shaping-filter parameterizations: A global analysis approach2002In: SIAM Journal of Control and Optimization, ISSN 0363-0129, E-ISSN 1095-7138, Vol. 41, no 1, p. 23-59Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_4_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:4:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_4_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); In this paper, we study the well-posedness of the problems of determining shaping filters from combinations of finite windows of cepstral coefficients, covariance lags, or Markov parameters. For example, we determine whether there exists a shaping filter with a prescribed window of Markov parameters and a prescribed window of covariance lags. We show that several such problems are well-posed in the sense of Hadamard; that is, one can prove existence, uniqueness (identifiability), and continuous dependence of the model on the measurements. Our starting point is the global analysis of linear systems, where one studies an entire class of systems or models as a whole, and where one views measurements, such as covariance lags and cepstral coefficients or Markov parameters, from data as functions on the entire class. This enables one to pose such problems in a way that tools from calculus, optimization, geometry, and modern nonlinear analysis can be used to give a rigorous answer to such problems in an algorithm-independent fashion. In this language, we prove that a window of cepstral coefficients and a window of covariance coefficients yield a bona de coordinate system on the space of shaping filters, thereby establishing existence, uniqueness, and smooth dependence of the model parameters on the measurements from data.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:4:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 6. Byrnes, Christopher PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_5_j_idt584",{id:"formSmash:items:resultList:5:j_idt584",widgetVar:"widget_formSmash_items_resultList_5_j_idt584",onLabel:"Byrnes, Christopher ",offLabel:"Byrnes, Christopher ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_5_j_idt587",{id:"formSmash:items:resultList:5:j_idt587",widgetVar:"widget_formSmash_items_resultList_5_j_idt587",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, School of Engineering Sciences (SCI), Centres, Center for Industrial and Applied Mathematics, CIAM. KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:5:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Georgiou, T. T.Lindquist, AndersKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. KTH, School of Engineering Sciences (SCI), Centres, Center for Industrial and Applied Mathematics, CIAM. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.Megretski, A.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:5:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Generalized interpolation in H-infinity with a complexity constraint2006In: Transactions of the American Mathematical Society, ISSN 0002-9947, E-ISSN 1088-6850, Vol. 358, no 3, p. 965-987Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_5_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:5:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_5_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); In a seminal paper, Sarason generalized some classical interpolation problems for H-infinity functions on the unit disc to problems concerning lifting onto H-2 of an operator T that is defined on K=H-2 circle minus phi H-2 (phi is an inner function) and commutes with the (compressed) shift S. In particular, he showed that interpolants (i.e., f is an element of H-infinity such that f(S)=T) having norm equal to parallel to T parallel to exist, and that in certain cases such an f is unique and can be expressed as a fraction f=b/a with a, b is an element of K. In this paper, we study interpolants that are such fractions of K functions and are bounded in norm by 1 (assuming that parallel to T parallel to<1, in which case they always exist). We parameterize the collection of all such pairs (a, b)is an element of K x K and show that each interpolant of this type can be determined as the unique minimum of a convex functional. Our motivation stems from the relevance of classical interpolation to circuit theory, systems theory, and signal processing, where phi is typically a finite Blaschke product, and where the quotient representation is a physically meaningful complexity constraint.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:5:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 7. Byrnes, Christopher I. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_6_j_idt584",{id:"formSmash:items:resultList:6:j_idt584",widgetVar:"widget_formSmash_items_resultList_6_j_idt584",onLabel:"Byrnes, Christopher I. ",offLabel:"Byrnes, Christopher I. ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_6_j_idt587",{id:"formSmash:items:resultList:6:j_idt587",widgetVar:"widget_formSmash_items_resultList_6_j_idt587",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Washington Univ, St Louis.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:6:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Fanizza, GiovannaKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.Lindquist, AndersKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:6:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); A homotopy continuation solution of the covariance extension equation2005In: Lecture notes in control and information sciences, ISSN 0170-8643, E-ISSN 1610-7411, Vol. 321, p. 27-42Article in journal (Refereed)8. Byrnes, Christopher I. et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_7_j_idt587",{id:"formSmash:items:resultList:7:j_idt587",widgetVar:"widget_formSmash_items_resultList_7_j_idt587",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:7:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Lindquist, AndersKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:7:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); A note on the Jacobian conjecture2008In: Proceedings of the American Mathematical Society, ISSN 0002-9939, E-ISSN 1088-6826, Vol. 136, no 9, p. 3007-3011Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_7_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:7:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_7_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); In this paper we consider the Jacobian conjecture for a map f of complex a. ne spaces of dimension n. It is well known that if f is proper, then the conjecture will hold. Using topological arguments, specifically Smith theory, we show that the conjecture holds if and only if f is proper onto its image.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:7:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 9. Byrnes, Christopher I. et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_8_j_idt587",{id:"formSmash:items:resultList:8:j_idt587",widgetVar:"widget_formSmash_items_resultList_8_j_idt587",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:8:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Lindquist, AndersKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:8:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); IMPORTANT MOMENTS IN SYSTEMS AND CONTROL2008In: SIAM Journal of Control and Optimization, ISSN 0363-0129, E-ISSN 1095-7138, Vol. 47, no 5, p. 2458-2469Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_8_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:8:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_8_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); The moment problem matured from its various special forms in the late 19th and early 20th centuries to a general class of problems that continues to exert profound influence on the development of analysis and its applications to a wide variety of fields. In particular, the theory of systems and control is no exception, where the applications have historically been to circuit theory, optimal control, robust control, signal processing, spectral estimation, stochastic realization theory, and the use of the moments of a probability density. Many of these applications are also still works in progress. In this paper, we consider the generalized moment problem, expressed in terms of a basis of a finite-dimensional subspace P of the Banach space C[a, b] and a "positive" sequence c, but with a new wrinkle inspired by the applications to systems and control. We seek to parameterize solutions which are positive "rational" measures in a suitably generalized sense. Our parameterization is given in terms of smooth objects. In particular, the desired solution space arises naturally as a manifold which can be shown to be diffeomorphic to a Euclidean space and which is the domain of some canonically defined functions. The analysis of these functions, and related maps, yields interesting corollaries for the moment problem and its applications, which we compare to those in the recent literature and which play a crucial role in part of our proof.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:8:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 10. Byrnes, Christopher I. et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_9_j_idt587",{id:"formSmash:items:resultList:9:j_idt587",widgetVar:"widget_formSmash_items_resultList_9_j_idt587",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:9:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Lindquist, AndersKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:9:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Interior point solutions of variational problems and global inverse function theorems2007In: International Journal of Robust and Nonlinear Control, ISSN 1049-8923, E-ISSN 1099-1239, Vol. 17, no 5-6, p. 463-481Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_9_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:9:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_9_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Variational problems and the solvability of certain nonlinear equations have a long and rich history beginning with calculus and extending through the calculus of variations. In this paper, we are interested in 'well-connected' pairs of such problems which are not necessarily related by critical point considerations. We also study constrained problems of the kind which arise in mathematical programming. We are also interested in interior minimizing points for the variational problem and in the well-posedness (in the sense of Hadamard) of solvability of the related systems of equations. We first prove a general result which implies the existence of interior points and which also leads to the development of certain generalization of the Hadamard-type global inverse function theorem, along the theme that uniqueness quite often implies existence. This result is illustrated by proving the non-existence of shock waves for certain initial data for the vector Burgers' equation. The global inverse function theorem is also illustrated by a derivation of the existence of positive definite solutions of matrix Riccati equations without first analysing the nonlinear matrix Riccati differential equation. The main results on the existence of solutions to geometrically constrained well-connected pairs are then presented and illustrated by a geometric analysis of the existence of interior points for linear programming problems.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:9:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 11. Byrnes, Christopher I. et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_10_j_idt587",{id:"formSmash:items:resultList:10:j_idt587",widgetVar:"widget_formSmash_items_resultList_10_j_idt587",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:10:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Lindquist, AndersKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:10:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); The generalized moment problem with complexity constraint2006In: Integral equations and operator theory, ISSN 0378-620X, E-ISSN 1420-8989, Vol. 56, no 2, p. 163-180Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_10_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:10:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_10_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); In this paper, we present a synthesis of our differentiable approach to the generalized moment problem, an approach which begins with a reformulation in terms of differential forms and which ultimately ends up with a canonically derived, strictly convex optimization problem. Engineering applications typically demand a solution that is the ratio of functions in certain finite dimensional vector space of functions, usually the same vector space that is prescribed in the generalized moment problem. Solutions of this type are hinted at in the classical text by Krein and Nudelman and stated in the vast generalization of interpolation problems by Sarason. In this paper, formulated as generalized moment problems with complexity constraint, we give a complete parameterization of such solutions, in harmony with the above mentioned results and the engineering applications. While our previously announced results required some differentiability hypotheses, this paper uses a weak form involving integrability and measurability hypotheses that are more in the spirit of the classical treatment of the generalized moment problem. Because of this generality, we can extend the existence and well-posedness of solutions to this problem to nonnegative, rather than positive, initial data in the complexity constraint. This has nontrivial implications in the engineering applications of this theory. We also extend this more general result to the case where the numerator can be an arbitrary positive absolutely integrable function that determines a unique denominator in this finite-dimensional vector space. Finally, we conclude with four examples illustrating our results.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:10:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 12. Byrnes, Christopher I. et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_11_j_idt587",{id:"formSmash:items:resultList:11:j_idt587",widgetVar:"widget_formSmash_items_resultList_11_j_idt587",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:11:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Lindquist, AndersKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. KTH, School of Engineering Sciences (SCI), Centres, Center for Industrial and Applied Mathematics, CIAM. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:11:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); The moment problem for rational measures: convexity in the spirit of Krein2009In: MODERN ANALYSIS AND APPLICATIONS: MARK KREIN CENTENARY CONFERENCE / [ed] Adamyan, V; Berezansky, Y; Gohberg, I; Gorbachuk, M; Gorbachuk, V; Kochubei, A; Langer, H; Popov, G, Birkhäuser Verlag, 2009, Vol. 190, p. 157-169Conference paper (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_11_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:11:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_11_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); The moment problem as formulated by Krein and Nudel'man is a beautiful generalization of several important classical moment problems, including the power moment problem, the trigonometric moment problem and the moment problem arising in Nevanlinna-Pick interpolation. Motivated by classical applications and examples, in both finite and infinite dimensions, we recently formulated a new version of this problem that we call the moment problem for positive rational measures. The formulation reflects the importance of rational functions in signals, systems and control. While this version of the problem is decidedly nonlinear, the basic tools still rely on convexity. In particular, we present a solution to this problem in terms of a nonlinear convex optimization problem that generalizes the maximum entropy approach used in several classical special cases.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:11:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 13. Byrnes, Christopher PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_12_j_idt584",{id:"formSmash:items:resultList:12:j_idt584",widgetVar:"widget_formSmash_items_resultList_12_j_idt584",onLabel:"Byrnes, Christopher ",offLabel:"Byrnes, Christopher ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_12_j_idt587",{id:"formSmash:items:resultList:12:j_idt587",widgetVar:"widget_formSmash_items_resultList_12_j_idt587",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, School of Engineering Sciences (SCI), Mathematics (Dept.). KTH, School of Engineering Sciences (SCI), Centres, Center for Industrial and Applied Mathematics, CIAM.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:12:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Lindquist, AndersKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. KTH, School of Engineering Sciences (SCI), Centres, Center for Industrial and Applied Mathematics, CIAM. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:12:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Important moments in systems, control and optimizations2009In: Decision and Control, 2009 held jointly with the 2009 28th Chinese Control Conference. CDC/CCC 2009. Proceedings of the 48th IEEE Conference on, IEEE , 2009, p. 91-96Conference paper (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_12_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:12:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_12_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); The moment problem matured from its various special forms in the late 19th and early 20th Centuries to a general class of problems that continues to exert profound influence on the development of analysis and its applications to a wide variety of fields. In particular, the theory of systems and control is no exception, where the applications have historically been to circuit theory, optimal control, robust control, signal processing, spectral estimation, stochastic realization theory and the use of the moments of a probability density. Many of these applications are also still works in progress. In this paper, we consider the generalized moment problem, expressed in terms of a basis of a finite-dimensional subspace β of the Banach space C[a, b] and a "positive" sequences c, but with a new wrinkle inspired by the applications to systems and control. We seek to parameterize solutions which are positive "rational" measures, in a suitably generalized sense. Our parameterization is given in terms of smooth objects. In particular, the desired solution space arises naturally as a manifold which can be shown to be diffeomorphic to a Euclidean space and which is the domain of some canonically defined functions. Moreover, on these spaces one can derive natural convex optimization criteria which characterize solutions to this new class of moment problems.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:12:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 14. Byrnes, Christopher PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_13_j_idt584",{id:"formSmash:items:resultList:13:j_idt584",widgetVar:"widget_formSmash_items_resultList_13_j_idt584",onLabel:"Byrnes, Christopher ",offLabel:"Byrnes, Christopher ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_13_j_idt587",{id:"formSmash:items:resultList:13:j_idt587",widgetVar:"widget_formSmash_items_resultList_13_j_idt587",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. KTH, School of Engineering Sciences (SCI), Centres, Center for Industrial and Applied Mathematics, CIAM. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:13:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Lindquist, AndersKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. KTH, School of Engineering Sciences (SCI), Centres, Center for Industrial and Applied Mathematics, CIAM. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:13:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); On the Stability and Instability of Padé Approximants2010In: Lecture notes in control and information sciences, ISSN 0170-8643, E-ISSN 1610-7411, Vol. 398, p. 165-175Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_13_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:13:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_13_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Over the past three decades there has been interest in using Pade approximants K with n = deg(K) < deg(G) = N as "reduced-order models" for the transfer function G of a linear system The attractive feature of this approach is that by matching the moments of G we can reproduce the steady-state behavior of G by the steady-state behavior of K. for certain classes of Inputs Indeed, we illustrate this by finding a first-order model matching a fixed set of moments for G. the causal inverse of a heat equation A key feature of this example is that the heat equation is a minimum phase system, so that its inverse system has a stable transfer function G and that K can also be chosen to be stable On the other hand, elementary examples show that both stability and instability can occur in reduced order models of a stable system obtained by matching moments using Pade approximants and, in the absence of stability, it does not make much sense to talk about steady-state responses nor does it make sense to match moments In this paper, we review Pack approximains. and their intimate relationship to continued fractions and Riccati equations, in a historical context that underscores why Pade approximation, as useful as it is, is not an approximation in any sense that reflects stability. Our main results on stability and instability states that if N >= 2 and l, r >= 0 with 0<l+r=n<N there is a non-empty open set U-lr of stable transfer functions G, having infinite Lebesque measure, such that each degree n proper rational function K matching the moments of G has e poles lying in C- and r poles lying in C+ The proof is constructive.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:13:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 15. Fanizza, Giovanna PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_14_j_idt584",{id:"formSmash:items:resultList:14:j_idt584",widgetVar:"widget_formSmash_items_resultList_14_j_idt584",onLabel:"Fanizza, Giovanna ",offLabel:"Fanizza, Giovanna ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_14_j_idt587",{id:"formSmash:items:resultList:14:j_idt587",widgetVar:"widget_formSmash_items_resultList_14_j_idt587",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. KTH, School of Engineering Sciences (SCI), Centres, Center for Industrial and Applied Mathematics, CIAM. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:14:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Karlsson, JohanKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.Lindquist, AndersKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.Nagamune, RyozoPrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:14:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); A global analysis approach to passivity preserving model reduction2006In: Proceedings Of The 45th IEEE Conference On Decision And Control, Vols 1-14, 2006, p. 3399-3404Conference paper (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_14_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:14:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_14_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Passivity-preserving model reduction for linear time-invariant systems amounts to approximating a positive-real rational transfer function with one of lower degree. Recently Antoulas and Sorensen have proposed such a model-reduction method based on Krylov projections. The method is based on an observation by Antoulas (in the single-input/single-output case) that if the approximant is preserving a subset of the spectral zeros and takes the same values as the original transfer function in the mirror points of the preserved spectral zeros, then the approximant is also positive real. However, this turns out to be a special solution in the theory of analytic interpolation with degree constraint developed by Byrnes, Georgiou and Lindquist, namely the maximum-entropy (central) solution. By tuning the interpolation points and the spectral zeros, as prescribed by this theory, one is able to obtain considerably better reduced-order models.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:14:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 16. Fanizza, Giovanna PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_15_j_idt584",{id:"formSmash:items:resultList:15:j_idt584",widgetVar:"widget_formSmash_items_resultList_15_j_idt584",onLabel:"Fanizza, Giovanna ",offLabel:"Fanizza, Giovanna ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_15_j_idt587",{id:"formSmash:items:resultList:15:j_idt587",widgetVar:"widget_formSmash_items_resultList_15_j_idt587",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:15:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Karlsson, JohanKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.Lindquist, AndersKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.Nagamune, RyozoUniv British Columbia, Dept Mech Engn, Vancouver.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:15:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Passivity-preserving model reduction by analytic interpolation2007In: Linear Algebra and its Applications, ISSN 0024-3795, E-ISSN 1873-1856, Vol. 425, no 2-3, p. 608-633Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_15_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:15:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_15_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Antoulas and Sorensen have recently proposed a passivity-preserving model-reduction method of linear systems based on Krylov projections. The idea is to approximate a positive-real rational transfer function with one of lower degree. The method is based on an observation by Antoulas (in the single-input/single-output case) that if the approximant is preserving a subset of the spectral zeros and takes the same values as the original transfer function in the mirror points of the preserved spectral zeros, then the approximant is also positive real. However, this turns out to be a special solution in the theory of analytic interpolation with degree constraint developed by Byrnes, Georgiou and Lindquist, namely the maximum-entropy (central) solution. By tuning the interpolation points and the spectral zeros, as prescribed by this theory, one is able to obtain considerably better reduced-order models. We also show that, in the multi-input/multi-output case, Sorensen's algorithm actually amounts to tangential Nevanlinna-Pick interpolation.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:15:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 17. Georgiou, T. T. et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_16_j_idt587",{id:"formSmash:items:resultList:16:j_idt587",widgetVar:"widget_formSmash_items_resultList_16_j_idt587",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:16:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Lindquist, AndersKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. KTH, School of Engineering Sciences (SCI), Centres, Center for Industrial and Applied Mathematics, CIAM. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:16:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); On time-reversibility of linear stochastic models2014In: IFAC Proceedings Volumes (IFAC-PapersOnline), IFAC Papers Online, 2014, p. 10403-10408Conference paper (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_16_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:16:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_16_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Reversal of the time direction in stochastic systems driven by white noise has been of central importance throughout the development of stochastic realization theory, filtering and smoothing. Similarly, in connection with certain problems in the theory of moments, the duality induced by time reversal was the key to deriving a compact parametrization and an interpretation of solutions. By combining ideas from these two lines of development we present herein a general view and a simplified account of time-reversal in stochastic models.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:16:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 18. Georgiou, Tryphon PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_17_j_idt584",{id:"formSmash:items:resultList:17:j_idt584",widgetVar:"widget_formSmash_items_resultList_17_j_idt584",onLabel:"Georgiou, Tryphon ",offLabel:"Georgiou, Tryphon ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_17_j_idt587",{id:"formSmash:items:resultList:17:j_idt587",widgetVar:"widget_formSmash_items_resultList_17_j_idt587",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); University of Minnesota, United States.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:17:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Lindquist, AndersKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. KTH, School of Engineering Sciences (SCI), Centres, Center for Industrial and Applied Mathematics, CIAM. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:17:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); The separation principle in stochastic control, redux2013In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 58, no 10, p. 2481-2494Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_17_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:17:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_17_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Over the last 50 years, a steady stream of accounts have been written on the separation principle of stochastic control. Even in the context of the linear-quadratic regulator in continuous time with Gaussian white noise, subtle difficulties arise, unexpected by many, that are often overlooked. In this paper we propose a new framework for establishing the separation principle. This approach takes the viewpoint that stochastic systems are well-defined maps between sample paths rather than stochastic processes per se and allows us to extend the separation principle to systems driven by martingales with possible jumps. While the approach is more in line with "real-life" engineering thinking where signals travel around the feedback loop, it is unconventional from a probabilistic point of view in that control laws for which the feedback equations are satisfied almost surely, and not deterministically for every sample path, are excluded.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:17:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 19. Georgiou, Tryphon PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_18_j_idt584",{id:"formSmash:items:resultList:18:j_idt584",widgetVar:"widget_formSmash_items_resultList_18_j_idt584",onLabel:"Georgiou, Tryphon ",offLabel:"Georgiou, Tryphon ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_18_j_idt587",{id:"formSmash:items:resultList:18:j_idt587",widgetVar:"widget_formSmash_items_resultList_18_j_idt587",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); University of Minnesota.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:18:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Lindquist, AndersKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. KTH, School of Engineering Sciences (SCI), Centres, Center for Industrial and Applied Mathematics, CIAM. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:18:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Two alternative views on control design with degree constraint2005In: Proceedings of the 44th IEEE Conference on Decision and Control, and the European Control Conference, CDC-ECC '05, IEEE , 2005, p. 3645-3650Conference paper (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_18_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:18:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_18_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); The purpose of this note is to highlight similarities and differences between two alternative methodologies for feedback control design under constraints on the McMillan degree of the feedback system. Both sets of techniques focus on uniformly optimal designs. The first is based on the work of Gahinet and Apkarian, and Skelton, Iwasaki, Grigoriades and their co-workers, while the other is based on earlier joint work of the authors with C. I. Byrnes.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:18:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 20. Georgiou, Tryphon T. et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_19_j_idt587",{id:"formSmash:items:resultList:19:j_idt587",widgetVar:"widget_formSmash_items_resultList_19_j_idt587",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:19:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Lindquist, AndersKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:19:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); A convex optimization approach to ARMA modeling2008In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 53, no 5, p. 1108-1119Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_19_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:19:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_19_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); We formulate a convex optimization problem for approximating any given spectral density with a rational one having a prescribed number of poles and zeros (n poles and m zeros inside the unit disc and their conjugates). The approximation utilizes the Kullback-Leibler divergence as a distance measure. The stationarity condition for optimality requires that the approximant matches n + 1 covariance moments of the given power spectrum and m cepstral moments of the corresponding logarithm, although the latter with possible slack. The solution coincides with one derived by Byrnes, Enqvist, and Lindquist who addressed directly the question of covariance and cepstral matching. Thus, the present paper provides an approximation theoretic justification of such a problem. Since the approximation requires only moments of spectral densities and of their logarithms, it can also be used for system identification.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:19:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 21. Georgiou, Tryphon T. et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_20_j_idt587",{id:"formSmash:items:resultList:20:j_idt587",widgetVar:"widget_formSmash_items_resultList_20_j_idt587",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:20:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Lindquist, AndersKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:20:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Likelihood Analysis of Power Spectra and Generalized Moment Problems2017In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 62, no 9, p. 4580-4592Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_20_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:20:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_20_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); We develop an approach to the spectral estimation that has been advocated by [ A. Ferrante et al., "Time and spectral domain relative entropy: A new approach to multivariate spectral estimation,"IEEE Trans. Autom. Control, vol. 57, no. 10, pp. 2561-2575, Oct. 2012.] and, in the context of the scalar-valued covariance extension problem, by [P. Enqvist and J. Karlsson, "Minimal itakurasaito distance and covariance interpolation," in Proc. 47th IEEE Conf. Decision Control, 2008, pp. 137-142]. The aim is to determine the power spectrum that is consistent with given moments and minimizes the relative entropy between the probability law of the underlying Gaussian stochastic process to that of a prior. The approach is analogous to the framework of earlier work by Byrnes, Georgiou, and Lindquist and can also be viewed as a generalization of the classical work by Burg and Jaynes on the maximum entropy method. In this paper, we present a new fast algorithm in the general case (i.e., for general Gaussian priors) and show that for priors with a specific structure the solution can be given in closed form.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:20:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 22. Georgiou, Tryphon T. et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_21_j_idt587",{id:"formSmash:items:resultList:21:j_idt587",widgetVar:"widget_formSmash_items_resultList_21_j_idt587",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:21:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Lindquist, AndersKTH, School of Engineering Sciences (SCI), Centres, Center for Industrial and Applied Mathematics, CIAM. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. Shanghai Jiao Tong Univ, Peoples R China.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:21:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Optimal Estimation With Missing Observations via Balanced Time-Symmetric Stochastic Models2017In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 62, no 11, p. 5590-5603Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_21_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:21:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_21_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); We consider data fusion for the purpose of smoothing and interpolation based on observation records with missing data. Stochastic processes are generated by linear stochastic models. The paper begins by drawing a connection between time reversal in stochastic systems and all-pass extensions. A particular normalization (choice of basis) between the two time-directions allows the two to share the same orthonormalized state process and simplifies the mathematics of data fusion. In this framework, we derive symmetric and balanced Mayne-Fraser-like formulas that apply simultaneously to continuous-time smoothing and interpolation, providing a definitive unification of these concepts. The absence of data over subintervals requires in general a hybrid filtering approach involving both continuous-time and discrete-time filtering steps.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:21:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 23. Georgiou, Tryphon T. et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_22_j_idt587",{id:"formSmash:items:resultList:22:j_idt587",widgetVar:"widget_formSmash_items_resultList_22_j_idt587",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:22:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Lindquist, AndersKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:22:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Remarks on control design with degree constraint2006In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 51, no 7, p. 1150-1156Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_22_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:22:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_22_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); The purpose of this note is to highlight similarities and differences between two alternative methodologies for feedback control design under constraints on the McMillan degree of the feedback system. Both sets of techniques focus on uniformly optimal designs. The first is based on the work of Gahinet and Apkarian and that of Skelton et al., while the other is based on earlier joint work of the authors with C. I. Byrnes.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:22:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 24. Hanebeck, U. D. et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_23_j_idt587",{id:"formSmash:items:resultList:23:j_idt587",widgetVar:"widget_formSmash_items_resultList_23_j_idt587",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:23:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Lindquist, AndersKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. KTH, School of Engineering Sciences (SCI), Centres, Center for Industrial and Applied Mathematics, CIAM. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:23:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Moment-based dirac mixture approximation of circular densities2014In: IFAC Proceedings Volumes (IFAC-PapersOnline), 2014, p. 5040-5048Conference paper (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_23_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:23:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_23_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Given a circular probability density function, called the true probability density function, the goal is to find a Dirac mixture approximation based on some circular moments of the true density. When keeping the locations of the Dirac points fixed, but almost arbitrarily located, we are applying recent results on the circulant rational covariance extension problem to the problem of calculating the weights. For the case of simultaneously calculating optimal locations, additional constraints have to be deduced from the given density. For that purpose, a distance measure for the deviation of the Dirac mixture approximation from the true density is derived, which then is minimized while considering the moment conditions as constraints. The method is based on progressive numerical minimization, converges quickly and gives well-distributed Dirac mixtures that fulfill the constraints, i.e., have the desired circular moments.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:23:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 25. Karlsson, Johan PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_24_j_idt584",{id:"formSmash:items:resultList:24:j_idt584",widgetVar:"widget_formSmash_items_resultList_24_j_idt584",onLabel:"Karlsson, Johan ",offLabel:"Karlsson, Johan ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_24_j_idt587",{id:"formSmash:items:resultList:24:j_idt587",widgetVar:"widget_formSmash_items_resultList_24_j_idt587",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. KTH, School of Engineering Sciences (SCI), Centres, Center for Industrial and Applied Mathematics, CIAM.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:24:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Georgiou, TryphonLindquist, AndersKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. KTH, School of Engineering Sciences (SCI), Centres, Center for Industrial and Applied Mathematics, CIAM. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:24:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); The inverse problem of analytic interpolation with degree constraint2006In: Proceedings Of The 45th IEEE Conference On Decision And Control, Vols 1-14, 2006, p. 559-564Conference paper (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_24_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:24:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_24_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); In [7], (6] a theory for degree-constrained analytic interpolation was developed in terms of the minimizers of certain convex entropy functionals. In the present paper, we introduce and study relevant inverse problems. More specifically, we answer the following two questions. First, given a function f which satisfies specified interpolation conditions, when is it that f can be obtained as the minimizer of a suitably chosen entropy functional? Second, given a function g, when does there exist a suitably entropy functional so that the unique minitnizer f which is subject to interpolation constraints also satisfies vertical bar f vertical bar = vertical bar g vertical bar on the unit circle. The theory and answers to these questions suggest an approach to identifying interpolants of a given degree and of a given approximate shape.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:24:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 26. Karlsson, Johan PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_25_j_idt584",{id:"formSmash:items:resultList:25:j_idt584",widgetVar:"widget_formSmash_items_resultList_25_j_idt584",onLabel:"Karlsson, Johan ",offLabel:"Karlsson, Johan ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_25_j_idt587",{id:"formSmash:items:resultList:25:j_idt587",widgetVar:"widget_formSmash_items_resultList_25_j_idt587",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. KTH, School of Engineering Sciences (SCI), Centres, Center for Industrial and Applied Mathematics, CIAM. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:25:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Georgiou, Tryphon T.Department of Electrical Engineering, University of Minnesota.Lindquist, AndersKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:25:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); The Inverse Problem of Analytic Interpolation With Degree Constraint and Weight Selection for Control Synthesis2010In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 55, no 2, p. 405-418Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_25_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:25:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_25_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); The minimizers of certain weighted entropy functionals are the solutions to an analytic interpolation problem with a degree constraint, and all solutions to this interpolation problem arise in this way by a suitable choice of weights. Selecting appropriate weights is pertinent to feedback control synthesis, where interpolants represent closed-loop transfer functions. In this paper we consider the correspondence between weights and interpolants in order to systematize feedback control synthesis with a constraint on the degree. There are two basic issues that we address: we first characterize admissible shapes of minimizers by studying the corresponding inverse problem, and then we develop effective ways of shaping minimizers via suitable choices of weights. This leads to a new procedure for feedback control synthesis.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:25:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 27. Karlsson, Johan PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_26_j_idt584",{id:"formSmash:items:resultList:26:j_idt584",widgetVar:"widget_formSmash_items_resultList_26_j_idt584",onLabel:"Karlsson, Johan ",offLabel:"Karlsson, Johan ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_26_j_idt587",{id:"formSmash:items:resultList:26:j_idt587",widgetVar:"widget_formSmash_items_resultList_26_j_idt587",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:26:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Lindquist, AndersKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. KTH, School of Engineering Sciences (SCI), Centres, Center for Industrial and Applied Mathematics, CIAM. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:26:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); On Degree-Constrained Analytic Interpolation With Interpolation Points Close to the Boundary2009In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 54, no 6, p. 1412-1418Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_26_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:26:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_26_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); In the recent article [4], a theory for complexity-constrained interpolation of contractive functions is developed. In particular, it is shown that any such interpolant may be obtained as the unique minimizer of a (convex) weighted entropy gain. In this technical note we study this optimization problem in detail and describe how the minimizer depends on weight selection and on interpolation conditions. We first show that, if, for a sequence of interpolants, the values of the entropy gain of the interpolants converge to the optimum, then the interpolants converge in H-2, but not in H-infinity This result is then used to describe the asymptotic behavior of the interpolant as an interpolation point approaches the boundary of the domain of analyticity. For loop shaping to specifications in control design, it might at first seem natural to place strategically additional interpolation points close to the boundary. However, our results indicate that such a strategy will have little effect on the shape. Another consequence of our results relates to model reduction based on minimum-entropy principles, where one should avoid placing interpolation points too close to the boundary.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:26:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 28. Karlsson, Johan PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_27_j_idt584",{id:"formSmash:items:resultList:27:j_idt584",widgetVar:"widget_formSmash_items_resultList_27_j_idt584",onLabel:"Karlsson, Johan ",offLabel:"Karlsson, Johan ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_27_j_idt587",{id:"formSmash:items:resultList:27:j_idt587",widgetVar:"widget_formSmash_items_resultList_27_j_idt587",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:27:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Lindquist, AndersKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. KTH, School of Engineering Sciences (SCI), Centres, Center for Industrial and Applied Mathematics, CIAM. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:27:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Stability-preserving rational approximation subject to interpolation constraints2008In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 53, no 7, p. 1724-1730Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_27_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:27:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_27_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); A quite comprehensive theory of analytic interpolation with degree constraint, dealing with rational analytic interpolants with an a priori bound, has been developed in recent years. In this paper, we consider the limit case when this bound is removed, and only stable interpolants with a prescribed maximum degree are sought. This leads to weighted H-2 minimization, where the interpolants are parameterized by the weights. The inverse problem of determining the weight given a desired interpolant profile is considered, and a rational approximation procedure based on the theory is proposed. This provides a tool for tuning the solution to specifications. The basic idea could also be applied to the case with bounded analytic interpolants.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:27:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 29. Karlsson, Johan PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_28_j_idt584",{id:"formSmash:items:resultList:28:j_idt584",widgetVar:"widget_formSmash_items_resultList_28_j_idt584",onLabel:"Karlsson, Johan ",offLabel:"Karlsson, Johan ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_28_j_idt587",{id:"formSmash:items:resultList:28:j_idt587",widgetVar:"widget_formSmash_items_resultList_28_j_idt587",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:28:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Lindquist, AndersKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. KTH, School of Engineering Sciences (SCI), Centres, Center for Industrial and Applied Mathematics, CIAM. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:28:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Stable rational approximation in the context of interpolation and convex optimization2007In: Proceedings Of The 46th IEEE Conference On Decision And Control, Vols 1-14, 2007, p. 2214-2221Conference paper (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_28_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:28:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_28_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); A quite comprehensive theory of analytic interpolation with degree constraint, dealing with rational interpolants with an a priori bound, has been developed in recent years. In this paper we consider the limit case when this bound is removed, and only stable interpolants with a prescribed maximum degree are sought. This leads to weighted H-2 minimization, where the interpolants are parameterized by the weights. The inverse problem of determining the weight and the interpolation points given a desired interpolant profile is considered, and a rational approximation procedure based on the theory is proposed. This provides a tool for tuning the solution to specifications. The basic idea could also be applied to the case with bounded interpolants.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:28:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 30. Karlsson, Johan PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_29_j_idt584",{id:"formSmash:items:resultList:29:j_idt584",widgetVar:"widget_formSmash_items_resultList_29_j_idt584",onLabel:"Karlsson, Johan ",offLabel:"Karlsson, Johan ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_29_j_idt587",{id:"formSmash:items:resultList:29:j_idt587",widgetVar:"widget_formSmash_items_resultList_29_j_idt587",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:29:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Lindquist, AndersKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. Shanghai Jiao Tong University, China.Ringh, AxelKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:29:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); The Multidimensional Moment Problem with Complexity Constraint2016In: Integral equations and operator theory, ISSN 0378-620X, E-ISSN 1420-8989, Vol. 84, no 3, p. 395-418Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_29_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:29:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_29_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); A long series of previous papers have been devoted to the (one-dimensional) moment problem with nonnegative rational measure. The rationality assumption is a complexity constraint motivated by applications where a parameterization of the solution set in terms of a bounded finite number of parameters is required. In this paper we provide a complete solution of the multidimensional moment problem with a complexity constraint also allowing for solutions that require a singular measure added to the rational, absolutely continuous one. Such solutions occur on the boundary of a certain convex cone of solutions. In this paper we provide complete parameterizations of all such solutions. We also provide errata for a previous paper in this journal coauthored by one of the authors of the present paper.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:29:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 31. Kuroiwa, Yohei PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_30_j_idt584",{id:"formSmash:items:resultList:30:j_idt584",widgetVar:"widget_formSmash_items_resultList_30_j_idt584",onLabel:"Kuroiwa, Yohei ",offLabel:"Kuroiwa, Yohei ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_30_j_idt587",{id:"formSmash:items:resultList:30:j_idt587",widgetVar:"widget_formSmash_items_resultList_30_j_idt587",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:30:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Lindquist, AndersKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. KTH, School of Engineering Sciences (SCI), Centres, Center for Industrial and Applied Mathematics, CIAM. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:30:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); A benchmark problem in robust control with degree constraint: two-sided Nudelman interpolation with complexity constraint approachManuscript (preprint) (Other academic)32. Kuroiwa, Yohei PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_31_j_idt584",{id:"formSmash:items:resultList:31:j_idt584",widgetVar:"widget_formSmash_items_resultList_31_j_idt584",onLabel:"Kuroiwa, Yohei ",offLabel:"Kuroiwa, Yohei ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_31_j_idt587",{id:"formSmash:items:resultList:31:j_idt587",widgetVar:"widget_formSmash_items_resultList_31_j_idt587",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:31:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Lindquist, AndersKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:31:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Bi-tangential Nevanlinna-Pick interpolation with a complexity constraint2006In: Proceedings of the 17th International Symposium on the Mathematical Theory of Networks and Systems: Kyoto, 2006, 2006, p. 2541-2563Conference paper (Other academic)33. Lindquist, Anders PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_32_j_idt584",{id:"formSmash:items:resultList:32:j_idt584",widgetVar:"widget_formSmash_items_resultList_32_j_idt584",onLabel:"Lindquist, Anders ",offLabel:"Lindquist, Anders ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, Superseded Departments, Mathematics.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:32:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:32:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); A covariance extension approach to identification of time series2000In: Automatica, ISSN 0005-1098, E-ISSN 1873-2836, Vol. 36, no 3, p. 379-398Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_32_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:32:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_32_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); In this paper we consider a three-step procedure far identification of time series, based on covariance extension and model reduction, and we present a complete analysis of its statistical convergence properties. A partial covariance sequence is estimated from statistical data. Then a high-order maximum-entropy model is determined, which is finally approximated by a lower-order model by stochastically balanced model reduction. Such procedures have been studied before, in various combinations, but an overall convergence analysis comprising all three steps has been lacking. Supposing the data is generated from a true finite-dimensional system which is minimum phase, it is shown that the transfer function of the estimated system tends in H-infinity to the true transfer function as the data length tends to infinity, if the covariance extension and the model reduction is done properly. The proposed identification procedure, and some variations of it, are evaluated by simulations.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:32:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 34. Lindquist, Anders PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_33_j_idt584",{id:"formSmash:items:resultList:33:j_idt584",widgetVar:"widget_formSmash_items_resultList_33_j_idt584",onLabel:"Lindquist, Anders ",offLabel:"Lindquist, Anders ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, Superseded Departments, Mathematics.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:33:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:33:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); A new approach to spectral estimation: A tunable high-resolution spectral estimator2000In: IEEE Transactions on Signal Processing, ISSN 1053-587X, E-ISSN 1941-0476, Vol. 48, no 11, p. 3189-3205Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_33_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:33:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_33_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Traditional maximum entropy spectral estimation determines a power spectrum from covariance estimates. Here, we present a new approach to spectral estimation, which is based on the use of filter banks as a means of obtaining spectral interpolation data, Such data replaces standard covariance estimates, A computational procedure for obtaining suitable pole-zero (ARMA) models from such data is presented. The choice of the zeros (MA-part) of the model is completely arbitrary. By suitably choices of filterbank poles and spectral zeros, the estimator can be tuned to exhibit high resolution in targeted regions of the spectrum.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:33:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 35. Lindquist, Anders PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_34_j_idt584",{id:"formSmash:items:resultList:34:j_idt584",widgetVar:"widget_formSmash_items_resultList_34_j_idt584",onLabel:"Lindquist, Anders ",offLabel:"Lindquist, Anders ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, Superseded Departments, Mathematics.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:34:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:34:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Generalized entropy criterion for Nevanlinna-Pick interpolation with degree constraint2001In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 46, no 6, p. 822-839Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_34_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:34:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_34_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); In this paper, we present a generalized entropy criterion for solving the rational Nevanlinna-Pick problem for n + 1 interpolating conditions and the degree of interpolants bounded by n, The primal problem of maximizing this entropy gain has a very well-behaved dual problem. This dual is a convex optimization problem in a finite-dimensional space and gives rise to an algorithm for finding all interpolants which are positive real and rational of degree at most n, The criterion requires a selection of a monic Schur polynomial of degree n, It follows that this class of monic polynomials completely parameterizes all such rational interpolants, and it therefore provides a set of design parameters for specifying such interpolants. The algorithm is implemented in state-space form and applied to several illustrative problems in systems and control, namely sensitivity minimization, maximal power transfer and spectral estimation.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:34:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 36. Lindquist, Anders PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_35_j_idt584",{id:"formSmash:items:resultList:35:j_idt584",widgetVar:"widget_formSmash_items_resultList_35_j_idt584",onLabel:"Lindquist, Anders ",offLabel:"Lindquist, Anders ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:35:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:35:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Kalman's Influence on My Scientific Work: Some Recollections and Reflections2017In: IEEE CONTROL SYSTEMS MAGAZINE, ISSN 1066-033X, Vol. 37, no 2, p. 156-157Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_35_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:35:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_35_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); ^{I first met Rudolf Kalman in Vienna, Austria, in the spring of 1972. I had recently finished my Ph.D. at the Royal Institute of Technology, Stockholm, Sweden, and I was invited to give a talk on my recent results in stochastic control theory at a small workshop that Kalman also attended. Apparently, Kalman was favorably impressed with my talk because he took me out for dinner the same evening and immediately invited me to come to Florida for the coming academic year. Kalman had just moved from Stanford to the University of Florida, and this is how I became his first postdoctoral associate at his new Center for Mathematical Systems Theory in the fall of 1972.}PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:35:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 37. Lindquist, Anders PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_36_j_idt584",{id:"formSmash:items:resultList:36:j_idt584",widgetVar:"widget_formSmash_items_resultList_36_j_idt584",onLabel:"Lindquist, Anders ",offLabel:"Lindquist, Anders ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:36:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:36:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Kullback-Leibler approximation of spectral density functions2003In: IEEE Transactions on Information Theory, ISSN 0018-9448, E-ISSN 1557-9654, Vol. 49, no 11, p. 2910-2917Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_36_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:36:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_36_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); We introduce a Kullback-Leibler-type distance between spectral density functions of stationary stochastic processes and solve the problem of optimal approximation of a given spectral density P by one that is consistent with prescribed second-order statistics. In general, such statistics are expressed as the state covariance of a linear filter driven by a stochastic process whose spectral density is sought. In this context, we show i) that there is a unique spectral density P which minimizes this Kullback-Leibler distance, ii) that this optimal approximate is of the form psi/Q where the "correction term" Q is a rational spectral density function, and iii) that the coefficients of Q can be obtained numerically by solving a suitable convex optimization problem. In the special case where psi = 1, the convex functional becomes quadratic and the solution is then specified by linear equations.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:36:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 38. Lindquist, Anders PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_37_j_idt584",{id:"formSmash:items:resultList:37:j_idt584",widgetVar:"widget_formSmash_items_resultList_37_j_idt584",onLabel:"Lindquist, Anders ",offLabel:"Lindquist, Anders ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:37:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:37:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Matrix-valued Nevanlinna-pick interpolation with complexity constraint: An optimization approach2003In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 48, no 12, p. 2172-2190Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_37_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:37:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_37_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Over the last several years, a new theory of Nevanlinna-Pick interpolation with complexity constraint has been developed for scalar interpolants. In this paper we generalize this theory to the matrix-valued, case, also allowing for multiple interpolation points. We parameterize a class of interpolants consisting of "most interpotants" of no higher degree than the central solution in terms of spectral zeros. This is a complete parameterization, and for each choice of interpolant we provide a convex optimization problem for determining it. This is derived in the context of duality theory of mathematical programming. To solve the convex optimization problem, we employ a homotopy continuation technique previously developed for the scalar case. These results can be applied to many classes of engineering problems,and, to illustrate this, we provide some,examples. In particular, we apply our method to a benchmark problem in multivariate robust control. By constructing a controller satisfying all design specifications but having only half the McMillan degree of conventional H-infinity controllers, we demonstrate the advantage of the proposed method.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:37:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 39. Lindquist, Anders PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_38_j_idt584",{id:"formSmash:items:resultList:38:j_idt584",widgetVar:"widget_formSmash_items_resultList_38_j_idt584",onLabel:"Lindquist, Anders ",offLabel:"Lindquist, Anders ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:38:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:38:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); New Directions and Applications in Control Theory2005Collection (editor) (Refereed)40. Lindquist, Anders PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_39_j_idt584",{id:"formSmash:items:resultList:39:j_idt584",widgetVar:"widget_formSmash_items_resultList_39_j_idt584",onLabel:"Lindquist, Anders ",offLabel:"Lindquist, Anders ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, Superseded Departments, Mathematics.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:39:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:39:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); On the duality between filtering and Nevanlinna-Pick interpolation2000In: SIAM Journal of Control and Optimization, ISSN 0363-0129, E-ISSN 1095-7138, Vol. 39, no 3, p. 757-775Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_39_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:39:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_39_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Positive real rational functions play a central role in both deterministic and stochastic linear systems theory, as well as in circuit synthesis, spectral analysis, and speech processing. For this reason, results about positive real transfer functions and their realizations typically have many applications and manifestations. In this paper, we study certain manifolds and submanifolds of positive real transfer functions, describing a fundamental geometric duality between filtering and Nevanlinna Pick interpolation. Not surprisingly, then, this duality, while interesting in its own right, has several corollaries which provide solutions and insight into some very interesting and intensely researched problems. One of these is the problem of parameterizing all rational solutions of bounded degree of the Nevanlinna-Pick interpolation problem, which plays a central role in robust control, and for which the duality theorem yields a complete solution. In this paper, we shall describe the duality theorem, which we motivate in terms of both the interpolation problem and a fast algorithm for Kalman filtering, viewed as a nonlinear dynamical system on the space of positive real transfer functions. We also outline a new proof of the recent solution to the rational Nevanlinna Pick interpolation problem, using an algebraic topological generalization of Hadamard's global inverse function theorem.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:39:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 41. Lindquist, Anders PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_40_j_idt584",{id:"formSmash:items:resultList:40:j_idt584",widgetVar:"widget_formSmash_items_resultList_40_j_idt584",onLabel:"Lindquist, Anders ",offLabel:"Lindquist, Anders ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, School of Engineering Sciences (SCI), Mathematics (Dept.). Shanghai Jiao Tong Univ, Dept Automat, Shanghai, Peoples R China.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:40:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:40:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Partial Realization Theory and System Identification Redux2017In: 2017 11TH ASIAN CONTROL CONFERENCE (ASCC), IEEE , 2017, p. 1946-1950Conference paper (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_40_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:40:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_40_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Some twenty years ago we introduced a nonstandard matrix Riccati equation to solve the partial stochastic realization problem. In this paper we provide a new derivation of this equation in the context of system identification. This allows us to show that the nonstandard matrix Riccati equation is universal in the sense that it can be used to solve more general analytic interpolation problems by only changing certain parameters. Such interpolation problems are ubiquitous in systems and control. In this context we also discuss a question posed by R.E. Kalman in beginning of the 1970s.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:40:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 42. Lindquist, Anders PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_41_j_idt584",{id:"formSmash:items:resultList:41:j_idt584",widgetVar:"widget_formSmash_items_resultList_41_j_idt584",onLabel:"Lindquist, Anders ",offLabel:"Lindquist, Anders ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:41:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:41:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Prediction-error approximation by convex optimization2007In: Modeling, Estimation and Control:Festschrift in honor of Giorgio Picci on the occation of his sixty-fifth birthday, BERLIN: SPRINGER-VERLAG BERLIN , 2007, Vol. 364, p. 239-249Chapter in book (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_41_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:41:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_41_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); This paper is dedicated to Giorgio Picci on the occasion of his 65th birthday. I have come to appreciate Giorgio not only as a great friend but also as a great scholar. When we first met at Brown University in 1973, he introduced me to his seminal paper [29] on splitting subspaces, which became the impetus for our joint work on the geometric theory of linear stochastic systems [23,24,25,26]. This led to a life-long friendship and a book project that never seemed to converge, but now is close to being finished [27]. I have learned a lot from Giorgio. The present paper grew out of a discussion in our book project, when Giorgio taught me about the connections between prediction-error identification and the Kullback-Leibler criterion. These concepts led directly into the recent theory of analytic interpolation with complexity constraint, with which I have been deeply involved in recent times. I shall try to explain these connections in the following paper.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:41:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 43. Lindquist, Anders PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_42_j_idt584",{id:"formSmash:items:resultList:42:j_idt584",widgetVar:"widget_formSmash_items_resultList_42_j_idt584",onLabel:"Lindquist, Anders ",offLabel:"Lindquist, Anders ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_42_j_idt587",{id:"formSmash:items:resultList:42:j_idt587",widgetVar:"widget_formSmash_items_resultList_42_j_idt587",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:42:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Avventi, EnricoKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. KTH, School of Engineering Sciences (SCI), Centres, Center for Industrial and Applied Mathematics, CIAM.Wahlberg, BoKTH, School of Electrical Engineering (EES), Automatic Control.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:42:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Graphical Models of Autoregressive Moving-Average ProcessesIn: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523Article in journal (Other academic)44. Lindquist, Anders G. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_43_j_idt584",{id:"formSmash:items:resultList:43:j_idt584",widgetVar:"widget_formSmash_items_resultList_43_j_idt584",onLabel:"Lindquist, Anders G. ",offLabel:"Lindquist, Anders G. ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_43_j_idt587",{id:"formSmash:items:resultList:43:j_idt587",widgetVar:"widget_formSmash_items_resultList_43_j_idt587",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:43:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Picci, GiorgioPrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:43:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); The Circulant Rational Covariance Extension Problem: The Complete Solution2013In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 58, no 11, p. 2848-2861Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_43_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:43:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_43_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); The rational covariance extension problem to determine a rational spectral density given a finite number of covariance lags can be seen as a matrix completion problem to construct an infinite-dimensional positive-definite Toeplitz matrix the northwest corner of which is given. The circulant rational covariance extension problem considered in this paper is a modification of this problem to partial stochastic realization of periodic stationary process, which are better represented on the discrete unit circle Z(2N) rather than on the discrete real line Z. The corresponding matrix completion problem then amounts to completing a finite-dimensional Toeplitz matrix that is circulant. Another important motivation for this problem is that it provides a natural approximation, involving only computations based on the fast Fourier transform, for the ordinary rational covariance extension problem, potentially leading to an efficient numerical procedure for the latter. The circulant rational covariance extension problem is an inverse problem with infinitely many solutions in general, each corresponding to a bilateral ARMA representation of the underlying periodic process. In this paper, we present a complete smooth parameterization of all solutions and convex optimization procedures for determining them. A procedure to determine which solution that best matches additional data in the form of logarithmic moments is also presented.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:43:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 45. Lindquist, Anders PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_44_j_idt584",{id:"formSmash:items:resultList:44:j_idt584",widgetVar:"widget_formSmash_items_resultList_44_j_idt584",onLabel:"Lindquist, Anders ",offLabel:"Lindquist, Anders ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_44_j_idt587",{id:"formSmash:items:resultList:44:j_idt587",widgetVar:"widget_formSmash_items_resultList_44_j_idt587",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:44:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Karlsson, JohanKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. KTH, School of Engineering Sciences (SCI), Centres, Center for Industrial and Applied Mathematics, CIAM. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.Georgiou, TryphonPrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:44:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Weight selection for gap robustness with degree-constrained controllers2008In: Proc. 47th IEEE Conference on Decision and Control, 2008, p. 4127-4134Conference paper (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_44_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:44:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_44_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); In modern robust control, control synthesis may be cast as an interpolation problem where the interpolant relates to robustness and performance criteria. In particular,robustness in the gap fits into this framework and the magnitude of the corresponding interpolant dictate the robustness to perturbations of the plant as a function of frequency. In this paper we consider the correspondence between weighted entropy functionals and minimizing interpolants in order to find appropriate interpolants for e.g. control synthesis. There are two basic issues that we address: we first characterize admissible shapes of minimizers by studying the corresponding inverse problem, and then we develop effective ways of shaping minimizers via suitable choices of weights. These results are used in order to systematize feedback control synthesis to obtain frequency dependentrobustness bounds with a constraint on the controller degree.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:44:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 46. Lindquist, Anders PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_45_j_idt584",{id:"formSmash:items:resultList:45:j_idt584",widgetVar:"widget_formSmash_items_resultList_45_j_idt584",onLabel:"Lindquist, Anders ",offLabel:"Lindquist, Anders ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_45_j_idt587",{id:"formSmash:items:resultList:45:j_idt587",widgetVar:"widget_formSmash_items_resultList_45_j_idt587",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. KTH, School of Engineering Sciences (SCI), Centres, Center for Industrial and Applied Mathematics, CIAM. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. Shanghai Jiao Tong University, Shanghai, China .PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:45:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Masiero, C.Picci, G.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:45:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); On the multivariate circulant rational covariance extension problem2013In: 2013 IEEE 52nd Annual Conference on Decision and Control (CDC), IEEE conference proceedings, 2013, p. 7155-7161Conference paper (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_45_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:45:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_45_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Partial stochastic realization of periodic processes from finite covariance data leads to the circulant rational covariance extension problem and bilateral ARMA models. In this paper we present a convex optimization-based theory for this problem that extends and modifies previous results by Carli, Ferrante, Pavon and Picci on the AR solution, which have been successfully applied to image processing of textures. We expect that our present results will provide an enhancement of these procedures.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:45:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 47. Lindquist, Anders PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_46_j_idt584",{id:"formSmash:items:resultList:46:j_idt584",widgetVar:"widget_formSmash_items_resultList_46_j_idt584",onLabel:"Lindquist, Anders ",offLabel:"Lindquist, Anders ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_46_j_idt587",{id:"formSmash:items:resultList:46:j_idt587",widgetVar:"widget_formSmash_items_resultList_46_j_idt587",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:46:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Picci, GiorgioPrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:46:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Modeling of Periodic Time Series by Bilateral ARMA Representations2014In: INTERNATIONAL WORK-CONFERENCE ON TIME SERIES (ITISE 2014), 2014, p. 861-865Conference paper (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_46_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:46:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_46_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); In this extended abstract for an oral presentation we describe a moment-based approach to modeling of stationary, periodic time series from a finite sequence of covariance lags. We present a complete parameterization of a family of solutions and a convex optimization procedure to determine each solution, which is seen to be represented as a bilateral ARMA model.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:46:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 48. Ringh, Axel PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_47_j_idt584",{id:"formSmash:items:resultList:47:j_idt584",widgetVar:"widget_formSmash_items_resultList_47_j_idt584",onLabel:"Ringh, Axel ",offLabel:"Ringh, Axel ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_47_j_idt587",{id:"formSmash:items:resultList:47:j_idt587",widgetVar:"widget_formSmash_items_resultList_47_j_idt587",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:47:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Karlsson, JohanKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.Lindquist, AndersKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. Shanghai Jiao Tong Univ, Dept Automat, Shanghai, Peoples R China; Shanghai Jiao Tong Univ, Sch Math, Shanghai, Peoples R China.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:47:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Further results on multidimensional rational covariance extension with application to texture generation2017In: 2017 IEEE 56th Annual Conference on Decision and Control (CDC), IEEE , 2017Conference paper (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_47_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:47:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_47_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); The rational covariance extension problem is a moment problem with several important applications in systems and control as, for example, in identification, estimation, and signal analysis. Here we consider the multidimensional counterpart and present new results for the well-posedness of the problem. We apply the theory to texture generation by modeling the texture as the output of a Wiener system. The static nonlinearity in the Wiener system is assumed to be a thresholding function and we identify both the linear dynamical system and the thresholding parameter.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:47:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 49. Ringh, Axel PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_48_j_idt584",{id:"formSmash:items:resultList:48:j_idt584",widgetVar:"widget_formSmash_items_resultList_48_j_idt584",onLabel:"Ringh, Axel ",offLabel:"Ringh, Axel ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_48_j_idt587",{id:"formSmash:items:resultList:48:j_idt587",widgetVar:"widget_formSmash_items_resultList_48_j_idt587",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:48:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Karlsson, JohanKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. KTH, School of Engineering Sciences (SCI), Centres, Center for Industrial and Applied Mathematics, CIAM.Lindquist, AndersKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. KTH, School of Engineering Sciences (SCI), Centres, Center for Industrial and Applied Mathematics, CIAM. KTH, Superseded Departments (pre-2005), Mathematics. Shanghai Jiao Tong Univ, Dept Automat, Shanghai, Peoples R China; Shanghai Jiao Tong Univ, Sch Math, Shanghai, Peoples R China.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:48:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Lower bounds on the maximum delay margin by analytic interpolation2018In: 2018 IEEE 57th Annual Conference on Decision and Control (CDC), 2018Conference paper (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_48_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:48:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_48_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); We study the delay margin problem in the context of recent works by T. Qi, J. Zhu, and J. Chen, where a sufficient condition for the maximal delay margin is formulated in terms of an interpolation problem obtained after introducing a rational approximation. Instead we omit the approximation step and solve the same problem directly using techniques from function theory and analytic interpolation. Furthermore, we introduce a constant shift in the domain of the interpolation problem. In this way we are able to improve on their lower bound for the maximum delay margin.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:48:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 50. Ringh, Axel PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_49_j_idt584",{id:"formSmash:items:resultList:49:j_idt584",widgetVar:"widget_formSmash_items_resultList_49_j_idt584",onLabel:"Ringh, Axel ",offLabel:"Ringh, Axel ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_49_j_idt587",{id:"formSmash:items:resultList:49:j_idt587",widgetVar:"widget_formSmash_items_resultList_49_j_idt587",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:49:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Karlsson, JohanKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. KTH, School of Engineering Sciences (SCI), Centres, Center for Industrial and Applied Mathematics, CIAM.Lindquist, AndersKTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. KTH, School of Engineering Sciences (SCI), Centres, Center for Industrial and Applied Mathematics, CIAM. KTH, Superseded Departments (pre-2005), Mathematics. Department of Automation, Shanghai Jiao Tong University, Shanghai, China.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:49:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Multidimensional rational covariance extensionManuscript (preprint) (Other academic)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_49_j_idt622_0_j_idt623",{id:"formSmash:items:resultList:49:j_idt622:0:j_idt623",widgetVar:"widget_formSmash_items_resultList_49_j_idt622_0_j_idt623",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); The rational covariance extension problem (RCEP) is an important problem in systems and control occurring in such diverse fields as control, estimation, system identification, and signal and image processing, leading to many fundamental theoretical questions. In fact, this inverse problem is a key component in many identification and signal processing techniques and plays a fundamental role in prediction, analysis, and modeling of systems and signals. It is well-known that the RCEP can be reformulated as a (truncated) trigonometric moment problem subject to a rationality condition. In this paper we consider the more general multidimensional trigonometric moment problem with a similar rationality constraint. This generalization creates many interesting new mathematical questions and also provides new insights into the original one-dimensional problem. A key concept in this approach is the complete smooth parametrization of all solutions, allowing solutions to be tuned to satisfy additional design specifications without violating the complexity constraints. As an illustration of the potential of this approach we apply our results to multidimensional spectral estimation, Wiener system identification, and image compression.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:49:j_idt622:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500});

CiteExportLink to result list
http://kth.diva-portal.org/smash/resultList.jsf?query=&language=en&searchType=SIMPLE&noOfRows=50&sortOrder=author_sort_asc&sortOrder2=title_sort_asc&onlyFullText=false&sf=all&aq=%5B%5B%7B%22personId%22%3A%22authority-person%3A31396+OR+0000-0002-2681-8383%22%7D%5D%5D&aqe=%5B%5D&aq2=%5B%5B%5D%5D&af=%5B%5D $(function(){PrimeFaces.cw("InputTextarea","widget_formSmash_lower_j_idt902_recordPermLink",{id:"formSmash:lower:j_idt902:recordPermLink",widgetVar:"widget_formSmash_lower_j_idt902_recordPermLink",autoResize:true});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_lower_j_idt902_j_idt904",{id:"formSmash:lower:j_idt902:j_idt904",widgetVar:"widget_formSmash_lower_j_idt902_j_idt904",target:"formSmash:lower:j_idt902:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});

Permanent link

Cite

Citation styleapa harvard1 ieee modern-language-association-8th-edition vancouver Other style $(function(){PrimeFaces.cw("SelectOneMenu","widget_formSmash_lower_j_idt920",{id:"formSmash:lower:j_idt920",widgetVar:"widget_formSmash_lower_j_idt920",behaviors:{change:function(ext) {PrimeFaces.ab({s:"formSmash:lower:j_idt920",e:"change",f:"formSmash",p:"formSmash:lower:j_idt920",u:"formSmash:lower:otherStyle"},ext);}}});});

- apa
- harvard1
- ieee
- modern-language-association-8th-edition
- vancouver
- Other style

Languagede-DE en-GB en-US fi-FI nn-NO nn-NB sv-SE Other locale $(function(){PrimeFaces.cw("SelectOneMenu","widget_formSmash_lower_j_idt931",{id:"formSmash:lower:j_idt931",widgetVar:"widget_formSmash_lower_j_idt931",behaviors:{change:function(ext) {PrimeFaces.ab({s:"formSmash:lower:j_idt931",e:"change",f:"formSmash",p:"formSmash:lower:j_idt931",u:"formSmash:lower:otherLanguage"},ext);}}});});

- de-DE
- en-GB
- en-US
- fi-FI
- nn-NO
- nn-NB
- sv-SE
- Other locale

Output formathtml text asciidoc rtf $(function(){PrimeFaces.cw("SelectOneMenu","widget_formSmash_lower_j_idt941",{id:"formSmash:lower:j_idt941",widgetVar:"widget_formSmash_lower_j_idt941"});});

- html
- text
- asciidoc
- rtf