<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/CINECAstyle.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-09-23T16:40:29Z</responseDate><request verb="GetRecord" identifier="oai:iris.unica.it:11584/266590" metadataPrefix="oai_dc">https://iris.unica.it/oai/request</request><GetRecord><record><header><identifier>oai:iris.unica.it:11584/266590</identifier><datestamp>2022-10-15T19:56:57Z</datestamp><setSpec>com_11584_207615</setSpec><setSpec>com_11584_111066</setSpec><setSpec>col_11584_265854</setSpec></header><metadata><oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
<dc:title>Applications of low-rank approximation: complex networks and inverse problems</dc:title>
<dc:creator>FENU, CATERINA</dc:creator>
<dc:subject>approssimazioni a basso rango</dc:subject>
<dc:subject>complex networks</dc:subject>
<dc:subject>inverse problems</dc:subject>
<dc:subject>low-rank approximations</dc:subject>
<dc:subject>problemi inversi</dc:subject>
<dc:subject>reti complesse</dc:subject>
<dc:subject>Settore MAT/08 - Analisi Numerica</dc:subject>
<dc:description>The use of low-rank approximation is crucial when one is interested in solving&#xd;
problems of large dimension. In this case, the matrix with reduced rank can&#xd;
be obtained starting from the singular value decomposition considering only&#xd;
the largest components. This thesis describes how the use of the low-rank&#xd;
approximation can be applied both in the analysis of complex networks and in&#xd;
the solution of inverse problems.&#xd;
In the first case, it will be explained how to identify the most important&#xd;
nodes or how to determine the ease of traveling between them in large-scale&#xd;
networks that arise in many applications. The use of low-rank approximation is&#xd;
presented both for undirected and directed networks, whose adjacency matrices&#xd;
are symmetric and nonsymmetric, respectively.&#xd;
As a second application, we propose how to identify inhomogeneities in the&#xd;
ground or the presence of conductive substances. This survey is addressed&#xd;
with the aid of electromagnetic induction measurements taken with a ground&#xd;
conductivity meter. Starting from electromagnetic data collected by this device,&#xd;
the electrical conductivity profile of the soil is reconstructed with the aid of a&#xd;
regularized damped Gauss{Newton method. The inversion method is based on&#xd;
the low-rank approximation of the Jacobian of the function to be inverted.</dc:description>
<dc:date>2015-04-16</dc:date>
<dc:type>info:eu-repo/semantics/doctoralThesis</dc:type>
<dc:identifier>http://hdl.handle.net/11584/266590</dc:identifier>
<dc:language>eng</dc:language>
<dc:relation>numberofpages:136</dc:relation>
<dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
<dc:publisher>Università degli Studi di Cagliari</dc:publisher>
<dc:rights>license:Non specificato</dc:rights>
</oai_dc:dc></metadata></record></GetRecord></OAI-PMH>