<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.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-20T00:24:28Z</responseDate><request verb="GetRecord" identifier="oai:dspace.mit.edu:1721.1/42455" metadataPrefix="dim">https://dspace.mit.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:dspace.mit.edu:1721.1/42455</identifier><datestamp>2022-01-13T07:54:53Z</datestamp><setSpec>com_1721.1_7582</setSpec><setSpec>com_1721.1_7581</setSpec><setSpec>col_1721.1_131023</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor" lang="en_US">Gilbert Strang.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en_US">Hussain, Mohammad Tariq</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="other" lang="en_US">Massachusetts Institute of Technology. Computation for Design and Optimization Program.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department">Massachusetts Institute of Technology. Computation for Design and Optimization Program</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2008-09-03T15:43:12Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2008-09-03T15:43:12Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="copyright" lang="en_US">2008</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en_US">2008</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/1721.1/42455</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="oclc" lang="en_US">240704675</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Thesis (S.M.)--Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2008.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">In title on t.p., "L" appears as italic letters and "[infinity]" appears as the symbol.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Includes bibliographical references (leaves 47-48).</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">The Cheeger constant h(Q) of a domain Q is defined as the minimum value of ...... with D varying over all smooth sub-domains of Q. The D that achieves this minimum is called the Cheeger set of Q. We present some analytical and numerical work on the Cheeger set for the unit cube ... using the ...and the ... norms for measuring IIDII. We look at the equivalent max-flow min-cut problem for continuum flows, and use it to get numerical results for the problem. We then use these results to suggest analytical solutions to the problem and optimize these shapes using calculus and numerical methods. Finally we make some observations about the general shapes we get, and how they can be derived using an algorithm similar to the one for finding Cheeger sets for domains in ...</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="statementofresponsibility" lang="en_US">by Mohammad Tariq Hussain.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">S.M.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent" lang="en_US">48 leaves</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">eng</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en_US">Massachusetts Institute of Technology</dim:field>
   <dim:field mdschema="dc" element="rights" lang="en_US">M.I.T. theses are protected by 
copyright. They may be viewed from this source for any purpose, but 
reproduction or distribution in any format is prohibited without written 
permission. See provided URL for inquiries about permission.</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri" lang="en_US">http://dspace.mit.edu/handle/1721.1/7582</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Computation for Design and Optimization Program.</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Cheeger sets for unit cube : analytical and numerical solutions for L [infinity] and L² norms</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dspace" element="authorsordered">false</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="b74ace1c-af46-4037-8264-40ca47265bfd">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>eng&lt;/Language>
   	&lt;Title>Cheeger sets for unit cube : analytical and numerical solutions for L [infinity] and L² norms&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2008&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Hussain, Mohammad Tariq&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;DisplayName>Massachusetts Institute of Technology&lt;/DisplayName>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;License>http://dspace.mit.edu/handle/1721.1/7582&lt;/License>
    &lt;Keyword>Computation for Design and Optimization Program.&lt;/Keyword>
   	&lt;Abstract>The Cheeger constant h(Q) of a domain Q is defined as the minimum value of ...... with D varying over all smooth sub-domains of Q. The D that achieves this minimum is called the Cheeger set of Q. We present some analytical and numerical work on the Cheeger set for the unit cube ... using the ...and the ... norms for measuring IIDII. We look at the equivalent max-flow min-cut problem for continuum flows, and use it to get numerical results for the problem. We then use these results to suggest analytical solutions to the problem and optimize these shapes using calculus and numerical methods. Finally we make some observations about the general shapes we get, and how they can be derived using an algorithm similar to the one for finding Cheeger sets for domains in ...&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>