Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Inverse Problems in Analytic Interpolation for Robust Control and Spectral Estimation
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.ORCID iD: 0000-0001-5158-9255
2008 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

This thesis is divided into two parts. The first part deals with theNevanlinna-Pick interpolation problem, a problem which occursnaturally in several applications such as robust control, signalprocessing and circuit theory. We consider the problem of shaping andapproximating solutions to the Nevanlinna-Pick problem in a systematicway. In the second part, we study distance measures between powerspectra for spectral estimation. We postulate a situation where wewant to quantify robustness based on a finite set of covariances, andthis leads naturally to considering the weak*-topology. Severalweak*-continuous metrics are proposed and studied in this context.In the first paper we consider the correspondence between weighted entropyfunctionals and minimizing interpolants in order to find appropriateinterpolants for, e.g., control synthesis. There are two basic issues that weaddress: we first characterize admissible shapes of minimizers bystudying the corresponding inverse problem, and then we developeffective ways of shaping minimizers via suitable choices of weights.These results are used in order to systematize feedback controlsynthesis to obtain frequency dependent robustness bounds with aconstraint on the controller degree.The second paper studies contractive interpolants obtained as minimizersof a weighted entropy functional and analyzes the role of weights andinterpolation conditions as design parameters for shaping theinterpolants. We first show that, if, for a sequence of interpolants,the values of the corresponding entropy gains converge to theoptimum, then the interpolants converge in H_2, but not necessarily inH-infinity. This result is then used to describe the asymptoticbehaviour of the interpolant as an interpolation point approaches theboundary of the domain of analyticity.A quite comprehensive theory of analytic interpolation with degreeconstraint, dealing with rational analytic interpolants with an apriori bound, has been developed in recent years. In the third paper,we consider the limit case when this bound is removed, and only stableinterpolants with a prescribed maximum degree are sought. This leadsto weighted H_2 minimization, where the interpolants areparameterized by the weights. The inverse problem of determining theweight given a desired interpolant profile is considered, and arational approximation procedure based on the theory is proposed. Thisprovides a tool for tuning the solution for attaining designspecifications. The purpose of the fourth paper is to study the topology and develop metricsthat allow for localization of power spectra, based on second-orderstatistics. We show that the appropriate topology is theweak*-topology and give several examples on how to construct suchmetrics. This allows us to quantify uncertainty of spectra in anatural way and to calculate a priori bounds on spectral uncertainty,based on second-order statistics. Finally, we study identification ofspectral densities and relate this to the trade-off between resolutionand variance of spectral estimates.In the fifth paper, we present an axiomatic framework for seekingdistances between power spectra. The axioms requirethat the sought metric respects the effects of additive andmultiplicative noise in reducing our ability to discriminate spectra.They also require continuity of statistical quantities withrespect to perturbations measured in the metric. We then present aparticular metric which abides by these requirements. The metric isbased on the Monge-Kantorovich transportation problem and iscontrasted to an earlier Riemannian metric based on theminimum-variance prediction geometry of the underlying time-series. Itis also being compared with the more traditional Itakura-Saitodistance measure, as well as the aforementioned prediction metric, ontwo representative examples.

Place, publisher, year, edition, pages
Stockholm: KTH , 2008. , xii, 22 p.
Series
Trita-MAT. OS, ISSN 1401-2294 ; 08:09
Keyword [en]
Nevanlinna-Pick Interpolation, Approximation, Model Reduction, Robust Control, Gap-robustness, Sensitivity Shaping, Entropy functional, Spectral Estimation, Weak*-topology, Monge-Kantorovic Transportation
National Category
Computational Mathematics
Identifiers
URN: urn:nbn:se:kth:diva-9248ISBN: 978-91-7415-125-1 (print)OAI: oai:DiVA.org:kth-9246DiVA: diva2:37749
Public defence
2008-10-31, F3, Lindstedtsvägen 26, KTH, Stockholm, 13:00 (English)
Opponent
Supervisors
Note
QC 20100817Available from: 2008-10-16 Created: 2008-10-13 Last updated: 2010-08-17Bibliographically approved
List of papers
1. The Inverse Problem of Analytic Interpolation With Degree Constraint and Weight Selection for Control Synthesis
Open this publication in new window or tab >>The Inverse Problem of Analytic Interpolation With Degree Constraint and Weight Selection for Control Synthesis
2010 (English)In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 55, no 2, 405-418 p.Article in journal (Refereed) Published
Abstract [en]

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.

Keyword
Analytic interpolation, controller synthesis, degree constraint, loop, shaping, model reduction, robust control, weight selection, nevanlinna-pick interpolation, convex-optimization approach, h-infinity, control design, approximation, sensitivity, continuity, feedback
National Category
Computational Mathematics
Identifiers
urn:nbn:se:kth:diva-19190 (URN)10.1109/tac.2009.2037280 (DOI)000274383400009 ()2-s2.0-76949096444 (Scopus ID)
Funder
Swedish Research Council
Note
QC 20100525 QC 20120118Available from: 2010-08-05 Created: 2010-08-05 Last updated: 2017-12-12Bibliographically approved
2. On Degree-Constrained Analytic Interpolation With Interpolation Points Close to the Boundary
Open this publication in new window or tab >>On Degree-Constrained Analytic Interpolation With Interpolation Points Close to the Boundary
2009 (English)In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 54, no 6, 1412-1418 p.Article in journal (Refereed) Published
Abstract [en]

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.

Keyword
Analytic interpolation, generalized entropy rate, sensitivity shaping, nevanlinna-pick interpolation, preserving model-reduction, complexity, constraint
National Category
Computational Mathematics
Identifiers
urn:nbn:se:kth:diva-18526 (URN)10.1109/TAC.2009.2017978 (DOI)000267064000033 ()2-s2.0-67649595784 (Scopus ID)
Note

QC 20100525 QC 20120118

Available from: 2010-08-05 Created: 2010-08-05 Last updated: 2017-06-07Bibliographically approved
3. Stability-preserving rational approximation subject to interpolation constraints
Open this publication in new window or tab >>Stability-preserving rational approximation subject to interpolation constraints
2008 (English)In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 53, no 7, 1724-1730 p.Article in journal (Refereed) Published
Abstract [en]

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.

Keyword
interpolation, model reduction, quasi-convex optimization, rational, approximation, stability, nevanlinna-pick interpolation, model-reduction, infinity, systems
National Category
Computational Mathematics
Identifiers
urn:nbn:se:kth:diva-17829 (URN)10.1109/tac.2008.929384 (DOI)000259263900018 ()2-s2.0-52249086276 (Scopus ID)
Note
QC 20100525 QC 20120118Available from: 2010-08-05 Created: 2010-08-05 Last updated: 2017-12-12Bibliographically approved
4. Localization of power spectra
Open this publication in new window or tab >>Localization of power spectra
(English)Article in journal (Other academic) Submitted
National Category
Computational Mathematics
Identifiers
urn:nbn:se:kth:diva-24139 (URN)
Note
QS 20120327Available from: 2010-08-17 Created: 2010-08-17 Last updated: 2012-03-27Bibliographically approved
5. Metrics for Power Spectra: An Axiomatic Approach
Open this publication in new window or tab >>Metrics for Power Spectra: An Axiomatic Approach
2009 (English)In: IEEE Transactions on Signal Processing, ISSN 1053-587X, E-ISSN 1941-0476, Vol. 57, no 3, 859-867 p.Article in journal (Refereed) Published
Abstract [en]

We present an axiomatic framework for seeking distances between power spectral density functions. The axioms require that the sought metric respects the effects of additive and multiplicative noise in reducing our ability to discriminate spectra, as well as they require continuity of statistical quantities with respect to perturbations measured in the metric. We then present a particular metric which abides by these requirements. The metric is based on the Monge-Kantorovich transportation problem and is contrasted with an earlier Riemannian metric based on the minimum-variance prediction geometry of the underlying time-series. It is also being compared with the more traditional Itakura-Saito distance measure, as well as the aforementioned prediction metric, on two representative examples.

Keyword
Geodesics, geometry of spectral measures, metrics, power spectra, spectral distances
National Category
Computational Mathematics
Identifiers
urn:nbn:se:kth:diva-24140 (URN)10.1109/TSP.2008.2010009 (DOI)000263431900004 ()2-s2.0-61549088710 (Scopus ID)
Note
QC 20100817Available from: 2010-08-17 Created: 2010-08-17 Last updated: 2017-12-12Bibliographically approved

Open Access in DiVA

fulltext(336 kB)569 downloads
File information
File name FULLTEXT02.pdfFile size 336 kBChecksum SHA-512
65e39053be51345d9c81327d85f77c8cee28c5a01a50278660808d04d0609fd6ae664b338166ec25140061c84bda2c982507f97c52573b41844ce47462014004
Type fulltextMimetype application/pdf

Authority records BETA

Karlsson, Johan

Search in DiVA

By author/editor
Karlsson, Johan
By organisation
Optimization and Systems Theory
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 570 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 308 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf