An optimal algorithm for certain boundary value problem (Q1372105): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Finite Difference Analogue of an Elliptic Boundary Problem which is Neither Diagonally Dominant Nor of Non‐negative Type / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-accuracy <i>P</i>-stable Methods for <i>y<sup>″</sup></i> = <i>f(t, y)</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-order P-stable multistep methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An explicit four-step phase-fitted method for the numerical integration of second-order initial-value problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit two-step methods with minimal phase-lag for the numerical integration of special second-order initial-value problems and their application to the one-dimensional Schrödinger equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: O(h\({}^ 4)\) locally overconvergent semidiscrete scheme for the equation \(u_ t=u_{xx}+f(t,x,u)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5342712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5604166 / rank
 
Normal rank

Revision as of 19:56, 27 May 2024

scientific article
Language Label Description Also known as
English
An optimal algorithm for certain boundary value problem
scientific article

    Statements

    An optimal algorithm for certain boundary value problem (English)
    0 references
    0 references
    0 references
    4 June 1998
    0 references
    This paper deals with the following system of differential equations, \(-u''= g(x,u)\), \(a\leq x\leq b\), with the boundary condition \(u(a)= u_0\), \(u(b)= u_{n+1}\). The authors approximate this system by the following finite difference scheme with the global error \(O(h^4)\): \(-L_hv_i= g(x_i, v_i)\), \(i=1,2,\dots, n\); \(v_0= u_0\), \(v_{n+1}= u_{n+1}\), where \(v_i= v(x_i)\), \(x_i= a+ih\), \(i= 0,1,\dots,n+1\), \(h= (b-a)/(n+1)\), and the finite difference operator \(L_h\) is given by \[ \begin{aligned} L_hv_i & = (v_{i-1}- 2v_i+ v_{i+1})/h^2\quad\text{for } i=1,n;\\ L_hv_i & = (-v_{i-2}+ 16v_{i-1}- 30v_i+ 16v_{i+1}- v_{i+2})/12h^2\quad\text{for }i=2,\dots,n- 1.\end{aligned} \] The factorization is used to derive an optimal algorithm for solving a linear system of equations with the pentadiagonal matrix. A Mathematica module designed for the purpose of testing and using the method is attached.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    error bound
    0 references
    system
    0 references
    finite difference scheme
    0 references
    optimal algorithm
    0 references
    Mathematica module
    0 references