<?xml version="1.0" encoding="ISO-8859-1"?>

<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:dc="http://purl.org/dc/elements/1.1/"
 xmlns:syn="http://purl.org/rss/1.0/modules/syndication/"
 xmlns:prism="http://purl.org/rss/1.0/modules/prism/"
 xmlns:admin="http://webns.net/mvcb/"
>

<channel rdf:about="http://imajna.oxfordjournals.org">
<title>IMA Journal of Numerical Analysis - current issue</title>
<link>http://imajna.oxfordjournals.org</link>
<description>IMA Journal of Numerical Analysis - RSS feed of current issue</description>
<prism:eIssn>1464-3642</prism:eIssn>
<prism:coverDisplayDate>October 2009</prism:coverDisplayDate>
<prism:publicationName>IMA Journal of Numerical Analysis</prism:publicationName>
<prism:issn>0272-4979</prism:issn>
<items>
 <rdf:Seq>
  <rdf:li rdf:resource="http://imajna.oxfordjournals.org/cgi/content/short/29/4/827?rss=1" />
  <rdf:li rdf:resource="http://imajna.oxfordjournals.org/cgi/content/short/29/4/856?rss=1" />
  <rdf:li rdf:resource="http://imajna.oxfordjournals.org/cgi/content/short/29/4/882?rss=1" />
  <rdf:li rdf:resource="http://imajna.oxfordjournals.org/cgi/content/short/29/4/917?rss=1" />
  <rdf:li rdf:resource="http://imajna.oxfordjournals.org/cgi/content/short/29/4/937?rss=1" />
  <rdf:li rdf:resource="http://imajna.oxfordjournals.org/cgi/content/short/29/4/960?rss=1" />
  <rdf:li rdf:resource="http://imajna.oxfordjournals.org/cgi/content/short/29/4/986?rss=1" />
  <rdf:li rdf:resource="http://imajna.oxfordjournals.org/cgi/content/short/29/4/1008?rss=1" />
  <rdf:li rdf:resource="http://imajna.oxfordjournals.org/cgi/content/short/29/4/1023?rss=1" />
  <rdf:li rdf:resource="http://imajna.oxfordjournals.org/cgi/content/short/29/4/1046?rss=1" />
 </rdf:Seq>
</items>
</channel>

<item rdf:about="http://imajna.oxfordjournals.org/cgi/content/short/29/4/827?rss=1">
<title><![CDATA[Compact embeddings of broken Sobolev spaces and applications]]></title>
<link>http://imajna.oxfordjournals.org/cgi/content/short/29/4/827?rss=1</link>
<description><![CDATA[
<p>In this paper, we present several extensions of theoretical tools for the analysis of discontinuous Galerkin (DG) method beyond the linear case. We define broken Sobolev spaces for Sobolev indices in [1, ), and we prove generalizations of many techniques of classical analysis in Sobolev spaces. Our targeted application is the convergence analysis for DG discretizations of energy minimization problems of the calculus of variations. Our main tool in this analysis is a theorem which permits the extraction of a &lsquo;weakly&rsquo; converging subsequence of a family of discrete solutions and which shows that any &lsquo;weak limit&rsquo; is a Sobolev function. As a second application, we compute the optimal embedding constants in broken Sobolev&ndash;Poincar&eacute; inequalities.</p>
]]></description>
<dc:creator><![CDATA[Buffa, A., Ortner, C.]]></dc:creator>
<dc:date>Tue, 27 Oct 2009 03:48:04 PDT</dc:date>
<dc:identifier>info:doi/10.1093/imanum/drn038</dc:identifier>
<dc:title><![CDATA[Compact embeddings of broken Sobolev spaces and applications]]></dc:title>
<dc:publisher>Institute of Mathematics and its Applications</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>29</prism:volume>
<prism:endingPage>855</prism:endingPage>
<prism:publicationDate>2009-10-01</prism:publicationDate>
<prism:startingPage>827</prism:startingPage>
<prism:section>Articles</prism:section>
</item>

<item rdf:about="http://imajna.oxfordjournals.org/cgi/content/short/29/4/856?rss=1">
<title><![CDATA[Discontinuous Galerkin approximations for Volterra integral equations of the first kind]]></title>
<link>http://imajna.oxfordjournals.org/cgi/content/short/29/4/856?rss=1</link>
<description><![CDATA[
<p>Motivated by the problem of developing accurate and stable time-stepping methods for the single-layer potential equation for acoustic scattering from a surface, we present new convergence results for piecewise polynomial discontinuous Galerkin (DG) approximations of a first-kind Volterra integral equation of convolution kernel type, where the kernel <I>K</I> is smooth and satisfies <I>K</I>(0) != 0. We show that an <I>m</I>th degree DG approximation exhibits global convergence of order <I>m</I> when <I>m</I> is odd and order <I>m</I> + 1 when <I>m</I> is even. There is local superconvergence of one order higher (i.e. order <I>m</I> + 1 when <I>m</I> is odd and <I>m</I> + 2 when <I>m</I> is even), but in the even order case, there is superconvergence only if the exact solution <I>u</I> of the equation satisfies <I>u</I><sup>(<I>m</I> + 1)</sup>(0) = 0. We also present numerical test results which show that these theoretical convergence rates are optimal.</p>
]]></description>
<dc:creator><![CDATA[Brunner, H., Davies, P. J., Duncan, D. B.]]></dc:creator>
<dc:date>Tue, 27 Oct 2009 03:48:04 PDT</dc:date>
<dc:identifier>info:doi/10.1093/imanum/drn037</dc:identifier>
<dc:title><![CDATA[Discontinuous Galerkin approximations for Volterra integral equations of the first kind]]></dc:title>
<dc:publisher>Institute of Mathematics and its Applications</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>29</prism:volume>
<prism:endingPage>881</prism:endingPage>
<prism:publicationDate>2009-10-01</prism:publicationDate>
<prism:startingPage>856</prism:startingPage>
<prism:section>Articles</prism:section>
</item>

<item rdf:about="http://imajna.oxfordjournals.org/cgi/content/short/29/4/882?rss=1">
<title><![CDATA[From high oscillation to rapid approximation III: multivariate expansions]]></title>
<link>http://imajna.oxfordjournals.org/cgi/content/short/29/4/882?rss=1</link>
<description><![CDATA[
<p>In this paper, we expand upon the theme of modified Fourier expansions and extend the theory to a multivariate setting and to expansions in eigenfunctions of the Laplace&ndash;Neumann operator. We pay detailed attention to expansions in a <I>d</I>-dimensional cube and to an effective derivation of expansion coefficients there by means of quadratures of highly oscillatory integrals. Thus, we present asymptotic and Filon-type formulae for an effective derivation of expansion coefficients and discuss their design and relative advantages. Such methods are effective only for large indices; hence, we introduce and analyse alternative quadrature schemes that require a relatively modest number of additional function evaluations.</p>
]]></description>
<dc:creator><![CDATA[Iserles, A., Norsett, S. P.]]></dc:creator>
<dc:date>Tue, 27 Oct 2009 03:48:04 PDT</dc:date>
<dc:identifier>info:doi/10.1093/imanum/drn020</dc:identifier>
<dc:title><![CDATA[From high oscillation to rapid approximation III: multivariate expansions]]></dc:title>
<dc:publisher>Institute of Mathematics and its Applications</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>29</prism:volume>
<prism:endingPage>916</prism:endingPage>
<prism:publicationDate>2009-10-01</prism:publicationDate>
<prism:startingPage>882</prism:startingPage>
<prism:section>Articles</prism:section>
</item>

<item rdf:about="http://imajna.oxfordjournals.org/cgi/content/short/29/4/917?rss=1">
<title><![CDATA[Convergence rates for adaptive finite elements]]></title>
<link>http://imajna.oxfordjournals.org/cgi/content/short/29/4/917?rss=1</link>
<description><![CDATA[
<p>In this article, we prove that it is possible to construct, using newest vertex bisection, meshes that equidistribute the error in the <I>H</I><sup>1</sup>-norm whenever the function to be approximated can be decomposed as a sum of a regular part plus a singular part with singularities around a finite number of points. This decomposition is usual in regularity results of partial differential equations. As a consequence, the meshes turn out to be quasi-optimal, and convergence rates for adaptive finite-element methods using Lagrange finite elements of any polynomial degree are obtained.</p>
]]></description>
<dc:creator><![CDATA[Gaspoz, F. D., Morin, P.]]></dc:creator>
<dc:date>Tue, 27 Oct 2009 03:48:04 PDT</dc:date>
<dc:identifier>info:doi/10.1093/imanum/drn039</dc:identifier>
<dc:title><![CDATA[Convergence rates for adaptive finite elements]]></dc:title>
<dc:publisher>Institute of Mathematics and its Applications</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>29</prism:volume>
<prism:endingPage>936</prism:endingPage>
<prism:publicationDate>2009-10-01</prism:publicationDate>
<prism:startingPage>917</prism:startingPage>
<prism:section>Articles</prism:section>
</item>

<item rdf:about="http://imajna.oxfordjournals.org/cgi/content/short/29/4/937?rss=1">
<title><![CDATA[Numerical approximation of corotational dumbbell models for dilute polymers]]></title>
<link>http://imajna.oxfordjournals.org/cgi/content/short/29/4/937?rss=1</link>
<description><![CDATA[
<p>We construct a general family of Galerkin methods for the numerical approximation of weak solutions to a bead-spring model that arises from the kinetic theory of dilute solutions of polymeric liquids with noninteracting polymer chains. The model consists of the unsteady incompressible Navier&ndash;Stokes equations, for the velocity and the pressure of the fluid, with an elastic extra-stress tensor as right-hand side in the momentum equation. The extra-stress tensor stems from the random movement of the polymer chains and is defined through the associated probability density function satisfying a Fokker&ndash;Planck-type parabolic equation. We focus on finitely extensible nonlinear elastic-type dumbbell models. In the case of a corotational drag term, we perform a rigorous passage to the limit as the spatial and temporal discretization parameters tend to zero and show that a (sub)sequence of numerical solutions converges to a weak solution of this coupled Navier&ndash;Stokes&ndash;Fokker&ndash;Planck system.</p>
]]></description>
<dc:creator><![CDATA[Barrett, J. W., Suli, E.]]></dc:creator>
<dc:date>Tue, 27 Oct 2009 03:48:04 PDT</dc:date>
<dc:identifier>info:doi/10.1093/imanum/drn022</dc:identifier>
<dc:title><![CDATA[Numerical approximation of corotational dumbbell models for dilute polymers]]></dc:title>
<dc:publisher>Institute of Mathematics and its Applications</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>29</prism:volume>
<prism:endingPage>959</prism:endingPage>
<prism:publicationDate>2009-10-01</prism:publicationDate>
<prism:startingPage>937</prism:startingPage>
<prism:section>Articles</prism:section>
</item>

<item rdf:about="http://imajna.oxfordjournals.org/cgi/content/short/29/4/960?rss=1">
<title><![CDATA[Convolution of hp-functions on locally refined grids]]></title>
<link>http://imajna.oxfordjournals.org/cgi/content/short/29/4/960?rss=1</link>
<description><![CDATA[
<p>Usually, the fast evaluation of a convolution integral <f><inline-fig>
<link locator="imanumdrn047fx1_ht"></inline-fig></f> requires that the functions <I>f</I> and <I>g</I> have a simple structure based on an equidistant grid in order to apply the fast Fourier transform. Here, we discuss the efficient performance of the convolution of <I>hp</I>-functions in certain locally refined grids. More precisely, the convolution result is projected into some given <I>hp</I>-space (Galerkin approximation). The overall cost is O(<I>p</I><sup>2</sup><I>N</I> log <I>N</I>), where <I>N</I> is the sum of the dimensions of the subspaces containing <I>f</I>, <I>g</I> and the resulting function, while <I>p</I> is the maximal polynomial degree.</p>
]]></description>
<dc:creator><![CDATA[Hackbusch, W.]]></dc:creator>
<dc:date>Tue, 27 Oct 2009 03:48:04 PDT</dc:date>
<dc:identifier>info:doi/10.1093/imanum/drn047</dc:identifier>
<dc:title><![CDATA[Convolution of hp-functions on locally refined grids]]></dc:title>
<dc:publisher>Institute of Mathematics and its Applications</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>29</prism:volume>
<prism:endingPage>985</prism:endingPage>
<prism:publicationDate>2009-10-01</prism:publicationDate>
<prism:startingPage>960</prism:startingPage>
<prism:section>Articles</prism:section>
</item>

<item rdf:about="http://imajna.oxfordjournals.org/cgi/content/short/29/4/986?rss=1">
<title><![CDATA[A two-scale sparse grid method for a singularly perturbed reaction-diffusion problem in two dimensions]]></title>
<link>http://imajna.oxfordjournals.org/cgi/content/short/29/4/986?rss=1</link>
<description><![CDATA[
<p>The linear reaction&ndash;diffusion problem &ndash; <I></I><sup>2</sup><I>u</I> + <I>bu</I> = <I>f</I> is considered on the unit square with homogeneous Dirichlet boundary conditions. Here <I></I> is a small positive parameter and the problem is in general singularly perturbed. The numerical solution of this problem is analysed on a Shishkin mesh that has <I>N</I> intervals in each coordinate direction, using the Galerkin finite-element method with bilinear trial functions. The accuracy of this method, measured in the associated energy norm, is shown to be O(<I>N</I><sup>&ndash;2</sup> + <I></I><sup>1/2</sup><I>N</I><sup>&ndash;1</sup> ln <I>N</I>). It is proved that a two-scale sparse grid method achieves the same order of accuracy while reducing the number of degrees of freedom from O(<I>N</I><sup>2</sup>) to O(<I>N</I><sup>3/2</sup>). These results are then generalized to systems of reaction&ndash;diffusion equations.</p>
]]></description>
<dc:creator><![CDATA[Liu, F., Madden, N., Stynes, M., Zhou, A.]]></dc:creator>
<dc:date>Tue, 27 Oct 2009 03:48:04 PDT</dc:date>
<dc:identifier>info:doi/10.1093/imanum/drn048</dc:identifier>
<dc:title><![CDATA[A two-scale sparse grid method for a singularly perturbed reaction-diffusion problem in two dimensions]]></dc:title>
<dc:publisher>Institute of Mathematics and its Applications</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>29</prism:volume>
<prism:endingPage>1007</prism:endingPage>
<prism:publicationDate>2009-10-01</prism:publicationDate>
<prism:startingPage>986</prism:startingPage>
<prism:section>Articles</prism:section>
</item>

<item rdf:about="http://imajna.oxfordjournals.org/cgi/content/short/29/4/1008?rss=1">
<title><![CDATA[Enhancing eigenvalue approximation by gradient recovery on adaptive meshes]]></title>
<link>http://imajna.oxfordjournals.org/cgi/content/short/29/4/1008?rss=1</link>
<description><![CDATA[
<p>We utilize the recovered gradient by the polynomial-preserving recovery to enhance the eigenvalue approximation of the Laplace operator under adaptive meshes. Superconvergence rate is established and numerical tests on benchmark problems support our theoretical findings.</p>
]]></description>
<dc:creator><![CDATA[Wu, H., Zhang, Z.]]></dc:creator>
<dc:date>Tue, 27 Oct 2009 03:48:04 PDT</dc:date>
<dc:identifier>info:doi/10.1093/imanum/drn050</dc:identifier>
<dc:title><![CDATA[Enhancing eigenvalue approximation by gradient recovery on adaptive meshes]]></dc:title>
<dc:publisher>Institute of Mathematics and its Applications</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>29</prism:volume>
<prism:endingPage>1022</prism:endingPage>
<prism:publicationDate>2009-10-01</prism:publicationDate>
<prism:startingPage>1008</prism:startingPage>
<prism:section>Articles</prism:section>
</item>

<item rdf:about="http://imajna.oxfordjournals.org/cgi/content/short/29/4/1023?rss=1">
<title><![CDATA[Gauss-Hermite wave packet dynamics: convergence of the spectral and pseudo-spectral approximation]]></title>
<link>http://imajna.oxfordjournals.org/cgi/content/short/29/4/1023?rss=1</link>
<description><![CDATA[
<p>The time-dependent linear Schr&ouml;dinger equation for nuclei on the whole space is semidiscretized using Hermite and Gauss&ndash;Hermite basis functions. These are well suited, on the one hand, for the conservation properties of the numerical solution and, on the other hand, for their remarkable approximation properties. We investigate theoretically and numerically the convergence of the spectral and pseudo-spectral Gauss&ndash;Hermite semidiscretization schemes.</p>
]]></description>
<dc:creator><![CDATA[Faou, E., Gradinaru, V.]]></dc:creator>
<dc:date>Tue, 27 Oct 2009 03:48:05 PDT</dc:date>
<dc:identifier>info:doi/10.1093/imanum/drn041</dc:identifier>
<dc:title><![CDATA[Gauss-Hermite wave packet dynamics: convergence of the spectral and pseudo-spectral approximation]]></dc:title>
<dc:publisher>Institute of Mathematics and its Applications</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>29</prism:volume>
<prism:endingPage>1045</prism:endingPage>
<prism:publicationDate>2009-10-01</prism:publicationDate>
<prism:startingPage>1023</prism:startingPage>
<prism:section>Articles</prism:section>
</item>

<item rdf:about="http://imajna.oxfordjournals.org/cgi/content/short/29/4/1046?rss=1">
<title><![CDATA[Some numerical methods for second-kind Fredholm integral equations on the real semiaxis]]></title>
<link>http://imajna.oxfordjournals.org/cgi/content/short/29/4/1046?rss=1</link>
<description><![CDATA[
<p>In this paper we introduce some numerical methods for solving Fredholm integral equations of the second kind on the real semiaxis and prove that the proposed procedures are stable and convergent. Error estimates and numerical tests are also included.</p>
]]></description>
<dc:creator><![CDATA[Mastroianni, G., Milovanovic, G. V.]]></dc:creator>
<dc:date>Tue, 27 Oct 2009 03:48:05 PDT</dc:date>
<dc:identifier>info:doi/10.1093/imanum/drn056</dc:identifier>
<dc:title><![CDATA[Some numerical methods for second-kind Fredholm integral equations on the real semiaxis]]></dc:title>
<dc:publisher>Institute of Mathematics and its Applications</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>29</prism:volume>
<prism:endingPage>1066</prism:endingPage>
<prism:publicationDate>2009-10-01</prism:publicationDate>
<prism:startingPage>1046</prism:startingPage>
<prism:section>Articles</prism:section>
</item>

</rdf:RDF>