نتایج جستجو برای: legendre gauss collocation method

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

Journal: :I. J. Bifurcation and Chaos 2006
Tatyana Luzyanina Dirk Roose

This paper concerns the computation and local stability analysis of periodic solutions to semi-explicit differential algebraic equations with time delays (delay DAEs) of index 1 and index 2. By presenting different formulations of delay DAEs, we motivate our choice of a direct treatment of these equations. Periodic solutions are computed by solving a periodic two-point boundary value problem, w...

2009
J. S. C. Prentice

The RK5GL3 method is a numerical method for solving initial value problems in ordinary differential equations, and is based on a combination of a fifth-order Runge-Kutta method and 3-point Gauss-Legendre quadrature. In this paper we describe an effective local error control algorithm for RK5GL3, which uses local extrapolation with an eighth-order Runge-Kutta method in tandem with RK5GL3, and a ...

Journal: :نظریه تقریب و کاربرد های آن 0
ل. هوشنگیان دانشگاه آزاد واحد دزفول د. میرزایی دانشکده ریاضی دانشگاه اصفهان

this paper gives an ecient numerical method for solving the nonlinear systemof volterra-fredholm integral equations. a legendre-spectral method based onthe legendre integration gauss points and lagrange interpolation is proposedto convert the nonlinear integral equations to a nonlinear system of equationswhere the solution leads to the values of unknown functions at collocationpoints.

Journal: :computational methods for differential equations 0
hossein pourbashash department of mathematics, university of garmsar, garmsar-iran

in this paper, a numerical efficient method is proposed for the solution of time fractionalmobile/immobile equation. the fractional derivative of equation is described in the caputosense. the proposed method is based on a finite difference scheme in time and legendrespectral method in space. in this approach the time fractional derivative of mentioned equationis approximated by a scheme of order o...

2014
Michael A. Patterson William W. Hager Anil V. Rao

A mesh refinement method is described for solving a continuous-time optimal control problem using collocation at Legendre–Gauss–Radau points. The method allows for changes in both the number of mesh intervals and the degree of the approximating polynomial within a mesh interval. First, a relative error estimate is derived based on the difference between the Lagrange polynomial approximation of ...

Journal: :Optimal Control Applications & Methods 2021

A mesh refinement method is described for solving optimal control problems using Legendre-Gauss-Radau collocation. The detects discontinuities in the solution by employing an edge detection scheme based on jump function approximations. When are identified, refined with a targeted h-refinement approach whereby discontinuity locations bracketed points. remaining smooth portions of previously deve...

2013
Anil V. Rao Michael. A. Patterson William W. Hager

A mesh refinement method is described for solving a continuous-time optimal control problem using collocation at Legendre-Gauss-Radau points. The method allows for changes in both the number of mesh intervals and the degree of the approximating polynomial within a mesh interval. First, a relative error estimate is derived based on the difference between the Lagrange polynomial approximation of ...

2015
John Barrett Joseph Formaggio Thomas Corona

We describe a technique to analytically compute the multipole moments of a charge distribution confined to a planar triangle, which may be useful in solving the Laplace equation using the fast multipole boundary element method (FMBEM) and for charged particle tracking. This algorithm proceeds by performing the necessary integration recursively within a specific coordinate system, and then trans...

2010
Blair Swartz

Local projection methods which yield c'm_1) piecewise polynomials of order m + k as approximate solutions of a boundary value problem for an mth order ordinary differential equation are determined by the k linear functional at which the residual error in each partition interval is required to vanish on. We develop a condition on these k f unctionals which implies breakpoint superconvergence (of...

Journal: :Journal of Computational and Applied Mathematics 2021

Nodal point sets, and associated collocation projections, play an important role in a range of high-order methods, including Flux Reconstruction (FR) schemes. Historically, efforts have focused on identifying nodal sets that aim to minimise the L∞ error interpolating polynomial. The present work combines comprehensive review known approximation theory results, with new numerical experiments, mo...

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

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