Related papers: The ultraspherical rectangular collocation method …
In this paper we investigate numerically the order of convergence of an isogeometric collocation method that builds upon the least-squares collocation method presented in [1] and the variational collocation method presented in [2]. The…
A local convergence rate is established for an orthogonal collocation method based on Radau quadrature applied to an unconstrained optimal control problem. If the continuous problem has a sufficiently smooth solution and the Hamiltonian…
A local convergence rate is established for an orthogonal collocation method based on Gauss quadrature applied to an unconstrained optimal control problem. If the continuous problem has a sufficiently smooth solution and the Hamiltonian…
In this paper, exponential Runge-Kutta methods of collocation type (ERKC) which were originally proposed in (Appl Numer Math 53:323-339, 2005) are extended to semilinear parabolic problems with time-dependent delay. Two classes of the ERKC…
Under conditions that prevent tangential intersection, we prove quadratic convergence of a projection algorithm for the feasibility problem of finding a point in the intersection of a smooth curve and line in $\mathbb{R}^2$. This nonconvex…
We make a further step in the open problem of unisolvence for unsymmetric Kansa collocation, proving that the MultiQuadric Kansa method with fixed collocation points and random fictitious centers is almost surely unisolvent, for stationary…
Thepaperprovesconvergenceofone-levelandmultilevelunsymmetriccollocationforsecondorderelliptic boundary value problems on the bounded domains. By using Schaback's linear discretization theory,L2 errors are obtained based on the kernel-based…
The Circumcentered Reflection Method (CRM) is a recently developed projection method for solving convex feasibility problems. It offers preferable convergence properties compared to classic methods such as the Douglas-Rachford and the…
A fast algorithm (linear in the degrees of freedom) for the solution of linear variable-coefficient rational-order fractional integral and differential equations is described. The approach is related to the ultraspherical method for…
A local convergence rate is established for a Gauss orthogonal collocation method applied to optimal control problems with control constraints. If the Hamiltonian possesses a strong convexity property, then the theory yields convergence for…
We propose a stochastic collocation method based on the piecewise constant interpolation on the probability space combined with a finite volume method to solve the compressible Navier-Stokes system at the nodal points. We show convergence…
In recent work (Maierhofer & Huybrechs, 2022, Adv. Comput. Math.), the authors showed that least-squares oversampling can improve the convergence properties of collocation methods for boundary integral equations involving operators of…
We introduce a direct numerical treatment of nonlinear higher-index differential-algebraic equations by means of overdetermined polynomial least-squares collocation. The procedure is not much more computationally expensive than standard…
In this article, we propose the use of partitioning and clustering methods as an alternative to Gaussian quadrature for stochastic collocation. The key idea is to use cluster centers as the nodes for collocation. In this way, we can extend…
Collocation boundary element methods for integral equations are easier to implement than Galerkin methods because the elements of the discretization matrix are given by lower-dimensional integrals. For that same reason, the matrix assembly…
We propose implicit integrators for solving stiff differential equations on unit spheres. Our approach extends the standard backward Euler and Crank-Nicolson methods in Cartesian space by incorporating the geometric constraint inherent to…
This study introduces the reader to the theory of approximating the solution(s) of a non-linear, second order, ordinary differential equation (ODE) with piecewise polynomial functions by using the collocation method. It then focuses on the…
A new computational algorithm, the discrete singular convolution (DSC), is introduced for computational electromagnetics. The basic philosophy behind the DSC algorithm for the approximation of functions and their derivatives is studied.…
We extend the use of piecewise orthogonal collocation to computing periodic solutions of renewal equations, which are particularly important in modeling population dynamics. We prove convergence through a rigorous error analysis. Finally,…
We study the Robbins-Monro stochastic approximation algorithm with projections on a hyperrectangle and prove its convergence. This work fills a gap in the convergence proof of the classic book by Kushner and Yin. Using the ODE method, we…