From: Wolfgang Bangerth Date: Thu, 12 Aug 2010 20:25:38 +0000 (+0000) Subject: Fix computation of points in QGaussLobatto. X-Git-Tag: v8.0.0~5736 X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=f6dcd1df71ae4d228852bb2cdb7ce2b47468d2bf;p=dealii.git Fix computation of points in QGaussLobatto. git-svn-id: https://svn.dealii.org/trunk@21648 0785d39b-7218-0410-832d-ea1e28bc413d --- diff --git a/deal.II/base/source/quadrature_lib.cc b/deal.II/base/source/quadrature_lib.cc index 4370d4bf51..0ee73d7fbf 100644 --- a/deal.II/base/source/quadrature_lib.cc +++ b/deal.II/base/source/quadrature_lib.cc @@ -230,6 +230,14 @@ compute_quadrature_points(const unsigned int q, double_eps * 5 ); + // The following implementation + // follows closely the one given in + // the appendix of the book by + // Karniadakis and Sherwin: + // Spectral/hp element methods for + // computational fluid dynamics + // (Oxford University Press, 2005) + // we take the zeros of the Chebyshev // polynomial (alpha=beta=-0.5) as // initial values: @@ -237,6 +245,7 @@ compute_quadrature_points(const unsigned int q, x[i] = - std::cos( (long double) (2*i+1)/(2*m) * numbers::PI ); long double r, s, J_x, f, delta; + for (unsigned int k=0; k +
  • Fixed: The computation of quadrature points in the QGaussLobatto + class uses a Newton method that was wrongly implemented. While the + results were correct (at least for moderate orders), it required more + iterations than necessary. This is now fixed. +
    + (Andrea Bonito 2010/08/12) +

    +
  • Changed: The DataOutBase::write_vtu function now writes data as 64-bit values, rather than 32-bit values.
    (Scott Miller 2010/08/5)

    -
  • New: MappingQ and MappingQEulerian now support order > 1 also in +

  • New: MappingQ and MappingQEulerian now support order > 1 also in codimension one. Step-34 has been modified to show how this works.
    (Luca Heltai 2010/07/23-27) @@ -187,12 +195,12 @@ inconvenience this causes.

    lac

    -
      +
      1. Updated: Changes to the SLEPcWrappers to preserve compatibility with SLEPc version 3.1. Main new updated features are new solver classes: (i) Power; and (ii) Generalized Davidson. -
        - (Toby D. Young 2010/08/04) +
        + (Toby D. Young 2010/08/04)

      2. Fixed: SparseMatrix::precondition_SSOR and @@ -216,7 +224,7 @@ inconvenience this causes.
        (Andrew McBride 2010/07/29)

        - +
      3. Fixed: In some rather pathological cases, the function