liu.seSearch for publications in DiVA

References$(function(){PrimeFaces.cw("TieredMenu","widget_formSmash_upper_j_idt145",{id:"formSmash:upper:j_idt145",widgetVar:"widget_formSmash_upper_j_idt145",autoDisplay:true,overlay:true,my:"left top",at:"left bottom",trigger:"formSmash:upper:referencesLink",triggerEvent:"click"});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_upper_j_idt146_j_idt148",{id:"formSmash:upper:j_idt146:j_idt148",widgetVar:"widget_formSmash_upper_j_idt146_j_idt148",target:"formSmash:upper:j_idt146:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});

Concepts and Algorithms for Non-Linear System IdentifiabilityPrimeFaces.cw("AccordionPanel","widget_formSmash_some",{id:"formSmash:some",widgetVar:"widget_formSmash_some",multiple:true}); PrimeFaces.cw("AccordionPanel","widget_formSmash_all",{id:"formSmash:all",widgetVar:"widget_formSmash_all",multiple:true});
function selectAll()
{
var panelSome = $(PrimeFaces.escapeClientId("formSmash:some"));
var panelAll = $(PrimeFaces.escapeClientId("formSmash:all"));
panelAll.toggle();
toggleList(panelSome.get(0).childNodes, panelAll);
toggleList(panelAll.get(0).childNodes, panelAll);
}
/*Toggling the list of authorPanel nodes according to the toggling of the closeable second panel */
function toggleList(childList, panel)
{
var panelWasOpen = (panel.get(0).style.display == 'none');
// console.log('panel was open ' + panelWasOpen);
for (var c = 0; c < childList.length; c++) {
if (childList[c].classList.contains('authorPanel')) {
clickNode(panelWasOpen, childList[c]);
}
}
}
/*nodes have styleClass ui-corner-top if they are expanded and ui-corner-all if they are collapsed */
function clickNode(collapse, child)
{
if (collapse && child.classList.contains('ui-corner-top')) {
// console.log('collapse');
child.click();
}
if (!collapse && child.classList.contains('ui-corner-all')) {
// console.log('expand');
child.click();
}
}
PrimeFaces.cw("AccordionPanel","widget_formSmash_responsibleOrgs",{id:"formSmash:responsibleOrgs",widgetVar:"widget_formSmash_responsibleOrgs",multiple:true}); 1994 (English)Licentiate thesis, monograph (Other academic)
##### Abstract [en]

##### Place, publisher, year, edition, pages

Linköping: Linköping University , 1994. , 123 p.
##### Series

Linköping Studies in Science and Technology. Thesis, ISSN 0280-7971 ; 448
##### National Category

Control Engineering
##### Identifiers

URN: urn:nbn:se:liu:diva-98091Local ID: LiU-Tek-Lic-1994:34ISBN: 91-7871-390-0OAI: oai:DiVA.org:liu-98091DiVA: diva2:652097
#####

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt375",{id:"formSmash:j_idt375",widgetVar:"widget_formSmash_j_idt375",multiple:true});
#####

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt381",{id:"formSmash:j_idt381",widgetVar:"widget_formSmash_j_idt381",multiple:true});
#####

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt387",{id:"formSmash:j_idt387",widgetVar:"widget_formSmash_j_idt387",multiple:true});
Available from: 2013-10-09 Created: 2013-09-29 Last updated: 2013-11-07Bibliographically approved

Recently, commutative algebra and differential algebra have come to use as mathematical tools for solving problems in automatic control. We will use these tools to answer questions regarding identifiability for models given as a set of differential polynomials. A constructive algorithm, Ritt's algorithm, has been modified for this specific situation. Furthermore, comparisons between Ritt's algorithm and Buchberger's algorithm, to answer the identifiability question when the model structures are given in state space form, are performed. The basic problem is that the computational complexity rapidly increases with the problem size. We examine various ways to simplify the computations in this respect, but it must also be stressed that the complexity increase is inherent in the problem.

In identification from a deterministic point of view an algorithm is said to be robustly convergent if the true system is regained when the noise level tends to zero. In this thesis we introduce a concept close to this performance measure; robust global identifiability. A model structure, i.e., a smoothly parameterized set of models, is said to be robustly globally identifiable if there exist an identification algorithm such that the true parameters are regained when the noise level tends to zero. In this thesis we show that global identifiability implies robust global identifiability when the considered model structure is a characteristic set of differential polynomials. This means that any model structure with parameters, that can be uniquely estimated from data has this robustness property.

Finally, a method for estirnation of residence time in continuous flow systems with varying dynamics is discussed. By resampling, i.e., choosing time instants different from the given sampling instants, and interpolation between measured data points, we obtain a continuous fl.ow system with constant residence time expressed in a new resampled time vector. We assume that the fiow patterns in the systems are invariant. The new data set is then used for identification of parameters in a chosen model structure. From the identified model, the residence time is readily calculated and a procedure for that is briefly described. The presented method is readily extended to enable use in recursive identification. In that case the modified recursive identification method is an improvement of the tracking ability compared to an ordinary recursive routine.

References$(function(){PrimeFaces.cw("TieredMenu","widget_formSmash_lower_j_idt1080",{id:"formSmash:lower:j_idt1080",widgetVar:"widget_formSmash_lower_j_idt1080",autoDisplay:true,overlay:true,my:"left top",at:"left bottom",trigger:"formSmash:lower:referencesLink",triggerEvent:"click"});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_lower_j_idt1081_j_idt1083",{id:"formSmash:lower:j_idt1081:j_idt1083",widgetVar:"widget_formSmash_lower_j_idt1081_j_idt1083",target:"formSmash:lower:j_idt1081:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});