نتایج جستجو برای: chebyshev gauss lobatto points

تعداد نتایج: 279438  

2009
GRADIMIR V. MILOVANOVIĆ MIODRAG M. SPALEVIĆ

We study the kernel Kn,s(z) of the remainder term Rn,s( f ) of Gauss–Turán–Kronrod quadrature rules with respect to one of the generalized Chebyshev weight functions for analytic functions. The location on the elliptic contours where the modulus of the kernel attains its maximum value is investigated. This leads to effective L∞-error bounds of Gauss–Turán–Kronrod quadratures. Following Kronrod,...

2014
Abhijeet Paul Mathieu Luisier Gerhard Klimeck Samarth Agarwal

A new adaptive quadrature algorithm that places a greater emphasis on cost reduction while still maintaining an acceptable accuracy is demonstrated. The different needs of science and engineering applications are highlighted as the existing algorithms are shown to be inadequate. The performance of the new algorithm is compared with the well known adaptive Simpson, Gauss-Lobatto and GaussKronrod...

Journal: :Math. Comput. 2000
David Hunter Geno P. Nikolov

Gauss-Lobatto quadrature formulae associated with symmetric weight functions are considered. The kernel of the remainder term for classes of analytic functions is investigated on elliptical contours. Sufficient conditions are found ensuring that the kernel attains its maximal absolute value at the intersection point of the contour with either the real or the imaginary axis. The results obtained...

Journal: :Journal of Computational and Applied Mathematics 1996

2015
Paul Garrett

A form of this was conjectured by Gauss about 1800, [Chebyshev 1848/52] and [Chebyshev 1850/52] made notable progress with essentially elementary methods. The landmark paper Riemann 1859] made clear the intimate connection between prime numbers and the behavior of ζ(s) as a function of a complex variable. The theorem was proven independently by [Hadamard 1896] and [de la Vallée Poussin 1896] by...

Journal: :SIAM J. Scientific Computing 2007
Luca F. Pavarino Elena Zampieri Richard Pasquetti Francesca Rapetti

The classical overlapping Schwarz algorithm is here extended to the triangular/tetrahedral spectral element (TSEM) discretization of elliptic problems. This discretization, based on Fekete nodes, is a generalization to nontensorial elements of the tensorial Gauss–Lobatto–Legendre quadrilateral spectral elements (QSEM). The overlapping Schwarz preconditioners are based on partitioning the domain...

2012
J. Gwinner

This paper is concerned with the hp-version of the finite element method (hp-FEM) to treat a variational inequality that models frictional contact in linear elastostatics. Such an approximation of higher order leads to a nonconforming discretization scheme. We employ Gauss-Lobatto quadrature for the approximation of the nonsmooth frictiontype functional and take the resulting quadrature error i...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید