<node id="318121">
  <nid>318121</nid>
  <type>event</type>
  <uid>
    <user id="28077"><![CDATA[28077]]></user>
  </uid>
  <created>1408698020</created>
  <changed>1475892531</changed>
  <title><![CDATA[Ph.D. Defense by Lili Hu]]></title>
  <body><![CDATA[&nbsp;<p>Ph.D. Defense by Lili Hu</p><p>Date: Aug 27th<br />Time: 11am -1pm<br />Location: Skiles 006 (School of Math)</p><p>Title: Numerical Algorithms based on the back and forth error compensation and correction</p><p>Oral defense committee members:<br />Prof. Yingjie Liu, Advisor, School of Math<br />Prof. Luca Dieci, School of Math<br />Prof. Sung Ha Kang, School of Math<br />Prof. Haomin Zhou, School of Math<br />Prof. Jarek Rossignac, School of Interactive Computing</p><strong>ABSTRACT:</strong><br />In this thesis we carry out a further study of the back and forth error compen- sation and correction (BFECC) method. The first part discusses the time reversibility of numerical schemes. Motivated by the BFECC method, a variety of new numeri- cal schemes that aim at improving the time reversibility are developed and studied. We also introduce an interpolation algorithm based on BFECC in this part. In the second part we introduce a new limiting strategy which requires another backward advection in time so that overshoots/undershoots at the new time level get exposed when they are transformed back to compare with the solution at the old time level. This new technique is very simple to implement even for unstructured meshes and is able to eliminate artifacts induced by jump discontinuities in the solution itself or in its derivatives.&nbsp;]]></body>
  <field_summary_sentence>
    <item>
      <value><![CDATA[Numerical Algorithms based on the back and forth error compensation and correction]]></value>
    </item>
  </field_summary_sentence>
  <field_summary>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_summary>
  <field_time>
    <item>
      <value><![CDATA[2014-08-27T12:00:00-04:00]]></value>
      <value2><![CDATA[2014-08-27T14:00:00-04:00]]></value2>
      <rrule><![CDATA[]]></rrule>
      <timezone><![CDATA[America/New_York]]></timezone>
    </item>
  </field_time>
  <field_fee>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_fee>
  <field_extras>
      </field_extras>
  <field_audience>
          <item>
        <value><![CDATA[Public]]></value>
      </item>
      </field_audience>
  <field_media>
      </field_media>
  <field_contact>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_contact>
  <field_location>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_location>
  <field_sidebar>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_sidebar>
  <field_phone>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_phone>
  <field_url>
    <item>
      <url><![CDATA[]]></url>
      <title><![CDATA[]]></title>
            <attributes><![CDATA[]]></attributes>
    </item>
  </field_url>
  <field_email>
    <item>
      <email><![CDATA[]]></email>
    </item>
  </field_email>
  <field_boilerplate>
    <item>
      <nid><![CDATA[]]></nid>
    </item>
  </field_boilerplate>
  <links_related>
      </links_related>
  <files>
      </files>
  <og_groups>
          <item>221981</item>
      </og_groups>
  <og_groups_both>
          <item><![CDATA[Graduate Studies]]></item>
      </og_groups_both>
  <field_categories>
          <item>
        <tid>1788</tid>
        <value><![CDATA[Other/Miscellaneous]]></value>
      </item>
      </field_categories>
  <field_keywords>
          <item>
        <tid>1808</tid>
        <value><![CDATA[graduate students]]></value>
      </item>
          <item>
        <tid>256</tid>
        <value><![CDATA[math]]></value>
      </item>
          <item>
        <tid>100811</tid>
        <value><![CDATA[Phd Defense]]></value>
      </item>
      </field_keywords>
  <userdata><![CDATA[]]></userdata>
</node>
