2007
DOI: 10.1016/j.amc.2007.02.027
|View full text |Cite
|
Sign up to set email alerts
|

A high order B-spline collocation method for linear boundary value problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
12
0

Year Published

2008
2008
2023
2023

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 15 publications
(12 citation statements)
references
References 9 publications
0
12
0
Order By: Relevance
“…As the famous articles on splines claim finding suitable bound for ‖ B −1 ‖ ∞ of m th order B‐splines in terms of 2 j + m − 1, the number of collocation points is not an easy problem and the full analysis of this argument as far as we know has not been yet established. Although, as we checked numerically for m < 18, we noticed that when the maximum points of the B‐splines (Botella) or Greville points over [0,1] are used as interpolation points, the bound of ‖ B −1 ‖ ∞ depends only on m and does not depend on j for fixed m . Figure illustrates this situation just for m < 10.…”
Section: Some Definitions and Elementary Resultsmentioning
confidence: 99%
“…As the famous articles on splines claim finding suitable bound for ‖ B −1 ‖ ∞ of m th order B‐splines in terms of 2 j + m − 1, the number of collocation points is not an easy problem and the full analysis of this argument as far as we know has not been yet established. Although, as we checked numerically for m < 18, we noticed that when the maximum points of the B‐splines (Botella) or Greville points over [0,1] are used as interpolation points, the bound of ‖ B −1 ‖ ∞ depends only on m and does not depend on j for fixed m . Figure illustrates this situation just for m < 10.…”
Section: Some Definitions and Elementary Resultsmentioning
confidence: 99%
“…Although, the order of accuracy for collocation methods are known to be suboptimal, choosing appropriate interior points is critical to obtain optimal order of accuracy [20]. To solve the equations, each tubule and medulla were divided with P interior points (called collocation points) that were chosen as roots of an orthogonal Jacobi polynomial of P-th degree.…”
Section: Boundary Conditionsmentioning
confidence: 99%
“…The purpose of this work is to explain an efficient and stable method, based on orthogonal collocation scheme, to solve numerically the differential-algebraic equations (DAEs) arising in steady-state models of renal concentrating mechanism. Because of simplicity, inherent efficiency for applications to boundary value problems and optimal order accuracy for the error, the orthogonal collocation method is widely used [20]. In Newton-based methods, to minimize the truncation error which is introduced by converting differential equations to algebraic ones, the discretization number must be large.…”
Section: Introductionmentioning
confidence: 99%
“…Over the years, many researchers have worked on boundary value problems by using different methods for numerical solutions [2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20]. So far various numerical methods such as Cubic spline method [2], Iterative methods [3], Perturbed collocation method [4], Modified decomposition method [5], Decomposition method [6], Differential transform method [7,8], A higher order B-spline collocation method [9], Homotopy perturbation method [10], Variational iteration technique [11], Sinc-Galerkin method [12], Spline techniques [13][14][15][16], Galerkin method with quintic B-splines [17], B-spline collocation method [18], Cubic B-spline collocation method [19], Galerkin method with cubic B-splines [20] have been employed to solve fourth order boundary balue problems. So far, fourth order boundary value problems have not been solved by using Petrov-Galerkin method with cubic B-splines as basis functions and quintic B-splines as weight functions .…”
Section: Introductionmentioning
confidence: 99%