نتایج جستجو برای: gauss lobatto nodes
تعداد نتایج: 141634 فیلتر نتایج به سال:
Computational methods are developed for generating Gauss-type quadrature formulae having nodes of arbitrary multiplicity at one or both end points of the interval of integration. Positivity properties of the boundary weights are investigated numerically, and related conjectures are formulated. Applications are made to moment-preserving spline approximation. AMS subject classification: 65D30.
φ(t) = F (t, φ(t)), t ∈ [a, b], φ(a) = φa. (1.1) where φa, φ(t) ∈ C n and F : R × C → C. Let {t}n=0 be equally spaced nodes in the interval [a, b] with t0 = a, tN = b. Let {t j n} M j=0 be the Legendre-Gauss-Lobatto nodes in the subinterval [tn, tn+1] with t 0 n = tn, t M n = tn+1. Denote ∆n = t j+1 n − t j n. 1.1 Forward Euler Scheme The Picard integral equation in each [tn, tn+1] associated w...
In this paper, we investigate the stability of a numerical method for solving wave equation. The uses explicit leap-frog in time and high order continuous discontinuous (DG) finite elements using standard Lagrange Hermite basis functions space. Matrix eigenvalue analysis is used to calculate time-step restrictions. We show that restriction independent nodal distribution, such as equidistributed...
Recently Laurie presented a new algorithm for the computation of (2n+1)-point Gauss-Kronrod quadrature rules with real nodes and positive weights. This algorithm first determines a symmetric tridiagonal matrix of order 2n+ 1 from certain mixed moments, and then computes a partial spectral factorization. We describe a new algorithm that does not require the entries of the tridiagonal matrix to b...
In this paper, we consider Chebyshev–Legendre Pseudo-Spectral (CLPS) method for solving coupled viscous Burgers (VB) equations. A leapfrog scheme is used in time direction, while CLPS method is used for space direction. Chebyshev–Gauss–Lobatto (CGL) nodes are used for practical computation. The error estimates of semi-discrete and fully-discrete of CLPS method for coupled VB equations are obtai...
We present an a priori analysis of the hp-version of the finite element method for the primal formulation of frictional contact in linear elasticity. We introduce a new limiting case estimate for the interpolation error at Gauss and Gauss-Lobatto quadrature points. An hp-adaptive strategy is presented; numerical results shows that this strategy can lead to exponential convergence.
This paper concerns the iterative solution of the linear system arising from the Chebyshev–collocation approximation of second-order elliptic equations and presents an optimal multigrid preconditioner based on alternating line Gauss–Seidel smoothers for the corresponding stiffness matrix of bilinear finite elements on the Chebyshev–Gauss–Lobatto grid. 2000 IMACS. Published by Elsevier Science...
This paper is devoted to a rigorous analysis of exponential convergence of polynomial interpolation and spectral differentiation based on the Gegenbauer-Gauss and Gegenbauer-Gauss-Lobatto points, when the underlying function is analytic on and within an ellipse. Sharp error estimates in the maximum norm are derived.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید