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});});

Updating parameters in linear modelsPrimeFaces.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}); 2001 (English)Independent thesis Advanced level (professional degree), 20 credits / 30 HE creditsStudent thesis
##### Abstract [en]

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

2001.
##### Keyword [en]

Technology, Least Squares Problems, Updating Problems, Modified Least, Squares, Recursive Least Squares, Constrained Recursive Least, Bayesian Inference
##### Keyword [sv]

Teknik
##### Identifiers

URN: urn:nbn:se:ltu:diva-51192ISRN: LTU-EX--01/241--SELocal ID: 866eef3a-b665-4857-90ff-17a6fccc9539OAI: oai:DiVA.org:ltu-51192DiVA: diva2:1024556
##### Subject / course

Student thesis, at least 30 credits
##### Educational program

Engineering Physics, master's level
#####

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});
##### Examiners

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt387",{id:"formSmash:j_idt387",widgetVar:"widget_formSmash_j_idt387",multiple:true});
##### Note

Validerat; 20101217 (root)Available from: 2016-10-04 Created: 2016-10-04Bibliographically approved

It is sometimes desired to update solutions to systems of equations or other problems as new information is to be appended. Also, a system that is too large to solve directly can often be managed by first solving a part of the system, and then updating the solution with the rest of the system. This updating procedure is often required to be both efficient and stable, and recomputing the solution from scratch may be too costly. Beside efficiency and stability, factors such as storage requirement, simplicity, and applicability are often important. Updating the least squares solution to an over determined system of linear equations can be done in many ways. The method of Recursive Least Squares is simple and efficient, and works in most cases, although it is a bit sensitive to round-off errors. Updating the QR Decomposition, the Cholesky Factorization, or the Singular Value Decomposition is in general more stable, but these tasks are often a bit more complex than the Recursive Least Squares. Updating problems with constraints is possible when using Constrained Recursive Least Squares. These methods all give a single solution as result, for example the least squares solution, but errors and uncertainty are not handled. The Bayesian Inference offers a different type of updating. Here the answer is given in form of a probability distribution, with which it is possible to study the reasonableness of different solutions. This approach handles measuring errors, and information about the uncertainty in the answer is available. Bayesian Inference can be applied to both linear and non-linear models, and one can incorporate additional information about the solution. When the noise and other errors are assumed Gaussian, the calculations are particularly simple and closely related to ordinary least squares problems. Some connections to non-Bayesian methods are pointed out, as well as a non-recursive property of the Bayesian Inference in linear problems with independent observation series. These two different approaches are discussed, and examples are given at the end to give concrete form to the theory.

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