Collocation for Two-Point Boundary Value Problems Revisited
SIAM Journal on Numerical Analysis, 1986Collocation methods for two-point boundary value problems for higher differential equations are considered. By using appropriate monomial bases, these methods are related to corresponding one-step schemes for first order systems of differential equations.
openaire +2 more sources
Collocation by L-Splines at Transformed Gaussian Points
SIAM Journal on Numerical Analysis, 1984zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Nonoverlapping domain decomposition with cross points for orthogonal spline collocation
Journal of Numerical Mathematics, 2008A nonoverlapping domain decomposition approach with uniform and matching grids is used to define and compute the orthogonal spline collocation solution of the Dirichlet boundary-value problem for Poisson's equation on a square partitioned into four squares.
Bernard Bialecki, Maksymilian Dryja
openaire +2 more sources
A pseudospectral method for optimal control based on collocation at the Gauss points
2018 IEEE Conference on Decision and Control (CDC), 2018A Gauss collocation method is developed for solving optimal control problems with convex control constraints. The method has a local exponential convergence rate when the solution of the continuous problem is smooth and the Hamiltonian possesses a convexity property.
William W. Hager +4 more
openaire +1 more source
Maximum principle and convergence analysis for the meshfree point collocation method
SIAM Journal on Numerical Analysis, 2006The discrete Laplacian operator is considered in the sense of the meshfree point collocation method which will be called the strong meshfree Laplacian operator. To define the strong meshfree Laplacian operator, we use the fast version of the generalized moving least square approximation, which can calculate the approximated derivatives of shape ...
Do Wan Kim, Wing Kam Liu
openaire +1 more source
Errors in Iteration Points in Oscillatory State for Chebyshev Collocation Points
1999When the Chebyshev collocation point is calculated by Newton’s iteration process, the round-off errors of iteration points are difficult to analyze. The equation which determines the unknown round-off error is obtained for the iteration point under the condition that the iteration point is stationary.
openaire +1 more source
Boundary element modeling with variable nodal and collocation point locations
Advances in Engineering Software, 2012In both the real variable and Complex Variable Boundary Element Methods (CVBEM), nodal points are typically located on the problem boundary and then various techniques are used to fit boundary condition values at the nodal point locations such as collocation (equating approximation function to boundary condition values at a discrete set of locations on
T. V. Hromadka II, Devon Zillmer
openaire +1 more source
Collocation Methods for General Caputo Two-Point Boundary Value Problems
Journal of Scientific Computing, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hui Liang 0001, Martin Stynes
openaire +1 more source
A new aspect for choosing collocation points for solving biharmonic equations
Applied Mathematics and Computation, 2006The author examines the question of the choice of collocation points for boundary-element methods for the biharmonic equation. He shows that it is possible to choose points in the singular element, so as to minimize the condition number of the corresponding matrix.
openaire +1 more source
Collocation by the Spline in Tension at Generalized Gaussian Points
1996Summary: We consider the numerical solution for a singularly perturbed two-point boundary value problem: \(\varepsilon y''+cy=f\). To approximate the solution we have used a spline in tension with the continuous first derivative, determined by the collocation at the collocation points which are the generalization of the classical Gaussian points. The B-
openaire +2 more sources

