Suboptimal solutions to the time-varying model matching problem

Avraham Feintuch

doi:10.1016/0167-6911(94)00076-8

Suboptimal solutions to the time-varying model matching problem

Avraham Feintuch

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

Abstract

Two approaches to the characterization of suboptimal solutions are given. The first, via Parrot's theorem, gives all solutions. The second uses J-spectral factorizations and gives a particularly simple parametrization of all solutions. Unlike the time-invariant case, however, J-spectral factorizations do not always exist.

Original language	English
Pages (from-to)	299-306
Number of pages	8
Journal	Systems and Control Letters
Volume	25
Issue number	4
DOIs	https://doi.org/10.1016/0167-6911(94)00076-8
State	Published - 1 Jul 1995

Keywords

Model matching, Lower triangular operators, Distance formula
Time-varying systems

ASJC Scopus subject areas

Control and Systems Engineering
General Computer Science
Mechanical Engineering
Electrical and Electronic Engineering

Access to Document

10.1016/0167-6911(94)00076-8

Cite this

@article{554c378c717144dea73ccbb36905b81f,

title = "Suboptimal solutions to the time-varying model matching problem",

abstract = "Two approaches to the characterization of suboptimal solutions are given. The first, via Parrot's theorem, gives all solutions. The second uses J-spectral factorizations and gives a particularly simple parametrization of all solutions. Unlike the time-invariant case, however, J-spectral factorizations do not always exist.",

keywords = "Model matching, Lower triangular operators, Distance formula, Time-varying systems",

author = "Avraham Feintuch",

year = "1995",

month = jul,

day = "1",

doi = "10.1016/0167-6911(94)00076-8",

language = "English",

volume = "25",

pages = "299--306",

journal = "Systems and Control Letters",

issn = "0167-6911",

publisher = "Elsevier B.V.",

number = "4",

}

TY - JOUR

T1 - Suboptimal solutions to the time-varying model matching problem

AU - Feintuch, Avraham

PY - 1995/7/1

Y1 - 1995/7/1

N2 - Two approaches to the characterization of suboptimal solutions are given. The first, via Parrot's theorem, gives all solutions. The second uses J-spectral factorizations and gives a particularly simple parametrization of all solutions. Unlike the time-invariant case, however, J-spectral factorizations do not always exist.

AB - Two approaches to the characterization of suboptimal solutions are given. The first, via Parrot's theorem, gives all solutions. The second uses J-spectral factorizations and gives a particularly simple parametrization of all solutions. Unlike the time-invariant case, however, J-spectral factorizations do not always exist.

KW - Model matching, Lower triangular operators, Distance formula

KW - Time-varying systems

UR - https://www.scopus.com/pages/publications/0029341717

U2 - 10.1016/0167-6911(94)00076-8

DO - 10.1016/0167-6911(94)00076-8

M3 - Article

AN - SCOPUS:0029341717

SN - 0167-6911

VL - 25

SP - 299

EP - 306

JO - Systems and Control Letters

JF - Systems and Control Letters

IS - 4

ER -

Suboptimal solutions to the time-varying model matching problem

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this