<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns="http://purl.org/rss/1.0/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:sy="http://purl.org/rss/1.0/modules/syndication/" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel>
    <title>eCommons Collection: Cornell Theory Center Technical Reports</title>
    <link>http://hdl.handle.net/1813/5440</link>
    <description />
    <items>
      <rdf:Seq>
        <rdf:li resource="http://hdl.handle.net/1813/5598" />
        <rdf:li resource="http://hdl.handle.net/1813/5597" />
        <rdf:li resource="http://hdl.handle.net/1813/5596" />
        <rdf:li resource="http://hdl.handle.net/1813/5595" />
      </rdf:Seq>
    </items>
  </channel>
  <image>
    <title>The Channel Image</title>
    <url>http://dspace.library.cornell.edu/retrieve/31734</url>
    <link>http://hdl.handle.net/1813/5440</link>
  </image>
  <textInput>
    <title>The Collection's search engine</title>
    <description>Search the Channel</description>
    <name>search</name>
    <link>http://dspace.library.cornell.edu/simple-search</link>
  </textInput>
  <item rdf:about="http://hdl.handle.net/1813/5598">
    <title>Accurate Solution of Weighted Least Squares by Iterative Methods</title>
    <link>http://hdl.handle.net/1813/5598</link>
    <description>Title: Accurate Solution of Weighted Least Squares by Iterative Methods
&lt;br/&gt;
&lt;br/&gt;Authors: Bobrovnikova, Elena Y.; Vavasis, Stephen A.
&lt;br/&gt;
&lt;br/&gt;Abstract: We consider the weighted least-squares (WLS) problem with a very ill-conditioned weight matrix.  Weighted least-squares problems arise in many applications including linear programming, electrical networks, boundary value problems, and structures.  Because of roundoff errors, standard iterative methods for solving a WLS problem with ill-conditioned weights may not give the correct answer.  Indeed, the difference between the true and computed solution (forward error) may be large.  We propose an iterative algorithm, called MINRES-L, for solving WLS problems.  The MINRES-L method is the application of MINRES, a Krylov-space method due to Paige and Saunders, to a certain layered linear system.  Using a simplified model of the effects of round off error, we prove that MINRES-L gives answers with small forward error.  We present computational experiments for some applications.</description>
  </item>
  <item rdf:about="http://hdl.handle.net/1813/5597">
    <title>Local correlation energies of two-electron atoms and model systems</title>
    <link>http://hdl.handle.net/1813/5597</link>
    <description>Title: Local correlation energies of two-electron atoms and model systems
&lt;br/&gt;
&lt;br/&gt;Authors: Huang, Chien-Jung; Umrigar, C.J.
&lt;br/&gt;
&lt;br/&gt;Abstract: We present nearly-local definitions of the correlation energy
density, and its potential and kinetic components, and evaluate them for several two-electron systems.  This information should provide valuable guidance in constructing better correlation functionals than those in common use.  In addition, we demonstrate that the quantum chemistry and the density functional definitions of the correlation energy rapidly approach one another with increasing atomic number.</description>
  </item>
  <item rdf:about="http://hdl.handle.net/1813/5596">
    <title>Quality Mesh Generation in Higher Dimensions</title>
    <link>http://hdl.handle.net/1813/5596</link>
    <description>Title: Quality Mesh Generation in Higher Dimensions
&lt;br/&gt;
&lt;br/&gt;Authors: Mitchell, Scott A.; Vavasis, Stephen A.
&lt;br/&gt;
&lt;br/&gt;Abstract: We consider the problem of triangulating a d-dimensional region.  Our mesh generation algorithm, called QMG, is a qradtree-based algorithm that can triangulate any polyhedral region including nonconvexregions with holes.  Furthermore, our algorithm guarantees a bounded aspect ratio triangulation provided that the input domain itself has no sharp angles. Finally, our algorithm is guaranteed never to over refine the domain in the sense that the number of simplices produced by QMG is bounded above by a factor times the number produced by any competing algorithm, where the factor depends on the aspect ratio bound satisfied by the competing algorithm. The QMG algorithm has been implemented in C++ and is used as a mesh generator for the finite element method.</description>
  </item>
  <item rdf:about="http://hdl.handle.net/1813/5595">
    <title>Model fermion Monte Carlo with correlated pairs II</title>
    <link>http://hdl.handle.net/1813/5595</link>
    <description>Title: Model fermion Monte Carlo with correlated pairs II
&lt;br/&gt;
&lt;br/&gt;Authors: Kalos, M.H.; Schmidt, K.E.
&lt;br/&gt;
&lt;br/&gt;Abstract: Correlated dynamics can produce stable algorithms for excited states of quantum many-body problems.  We study a variety of harmonic oscillator problems to demonstrate the kinds of correlations needed.  We show that marginally correct dynamics that produce a stable overlap with an antisymmetrictrial function give the correct fermion ground state.</description>
  </item>
</rdf:RDF>

