CiteExport$(function(){PrimeFaces.cw("TieredMenu","widget_formSmash_upper_j_idt167",{id:"formSmash:upper:j_idt167",widgetVar:"widget_formSmash_upper_j_idt167",autoDisplay:true,overlay:true,my:"left top",at:"left bottom",trigger:"formSmash:upper:exportLink",triggerEvent:"click"});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_upper_j_idt172_j_idt174",{id:"formSmash:upper:j_idt172:j_idt174",widgetVar:"widget_formSmash_upper_j_idt172_j_idt174",target:"formSmash:upper:j_idt172:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});

Reverse Stress Test Optimization: A study on how to optimize an algorithm for reverse stress testingPrimeFaces.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();
}
}
2018 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
##### Abstract [en]

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

2018.
##### National Category

Computational Mathematics
##### Identifiers

URN: urn:nbn:se:umu:diva-149178OAI: oai:DiVA.org:umu-149178DiVA, id: diva2:1219560
##### External cooperation

Cinnober Financial Technology
##### Subject / course

Examensarbete i teknisk fysik
##### Educational program

Master of Science Programme in Engineering Physics
#####

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt609",{id:"formSmash:j_idt609",widgetVar:"widget_formSmash_j_idt609",multiple:true});
##### Supervisors

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt616",{id:"formSmash:j_idt616",widgetVar:"widget_formSmash_j_idt616",multiple:true});
##### Examiners

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt622",{id:"formSmash:j_idt622",widgetVar:"widget_formSmash_j_idt622",multiple:true}); Available from: 2018-06-25 Created: 2018-06-16 Last updated: 2018-06-25Bibliographically approved

In this thesis we investigate how to optimize an algorithm that determines a scenario multiplier for a reverse stress test with a method where predefined scenarios are scaled. The scenarios are composed by different risk factors that represents market events. A reverse stress test is used for risk estimation and explains for what market condition a given portfolio will lose a particular amount. In this study we consider a reverse stress test where the goal is to find for what scenario a clearing house become insolvent, that is when the clearing house's loss is equal to its resource pool. The goal with this work is to find a more efficient algorithm than the current bisection algorithm for finding the scenario multiplier in the reverse stress test.

The algorithms that were examined were one bracketing algorithm (the false-position algorithm) and two iterative algorithms (the Newton-Raphson and Halley's algorithms), which were implemented in MATLAB. A comparative study was made where the efficiency of the optimized algorithms were compared with the bisection algorithm. The algorithms were evaluated by comparing the running times and number of iterations needed to find the scenario multiplier in the reverse stress test. Other optimization strategies that were investigated were to reduce the number of scenarios in the predefined scenario matrix to decrease the running time and determine an appropriate initial multiplier to use in the iterative algorithms. The reduction of scenarios consisted of removing the scenarios that were multiples of other scenarios by comparing the risk factors in each scenario. We used Taylor approximation to simplify the loss function and thereby approximate an initial multiplier, which would reduce the manually input from the user. Furthermore, we investigated the running times and number of iterations needed to find the scenario multiplier when several initial multipliers were used in the iterative algorithms to increase the chance of finding a solution.

The result shows that both the Newton-Raphson algorithm and Halley's algorithm are more efficient and need less iterations to find the scenario multiplier than the current bisection algorithm. Halley's algorithm is the most efficient, which is on average 200-470% faster than the current algorithm depending on how many initial multipliers that are used (one, two or three), while the Newton-Raphson algorithm is on average 150-300% faster than the current algorithm. Furthermore, the result shows that the false-position algorithm is not efficient for this aim. The result from the reduction of scenarios shows that scenarios could be removed by this approach, where the real scenario obtained from performing a reverse stress test was never among the removed scenarios. Moreover, the initial multiplier approximation could be used when the scenario matrix contains a certain type of risk factors. Finally, this study shows that the current bisection algorithm can be optimized by the Newton-Raphson algorithm and Halley's algorithm.

urn-nbn$(function(){PrimeFaces.cw("Tooltip","widget_formSmash_j_idt1938",{id:"formSmash:j_idt1938",widgetVar:"widget_formSmash_j_idt1938",showEffect:"fade",hideEffect:"fade",showDelay:500,hideDelay:300,target:"formSmash:altmetricDiv"});});

CiteExport$(function(){PrimeFaces.cw("TieredMenu","widget_formSmash_lower_j_idt2044",{id:"formSmash:lower:j_idt2044",widgetVar:"widget_formSmash_lower_j_idt2044",autoDisplay:true,overlay:true,my:"left top",at:"left bottom",trigger:"formSmash:lower:exportLink",triggerEvent:"click"});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_lower_j_idt2045_j_idt2047",{id:"formSmash:lower:j_idt2045:j_idt2047",widgetVar:"widget_formSmash_lower_j_idt2045_j_idt2047",target:"formSmash:lower:j_idt2045:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});