Results 241 to 250 of about 1,263,858 (270)
Some of the next articles are maybe not open access.
Difference schemes or element schemes?
International Journal for Numerical Methods in Engineering, 1979AbstractSeveral examples are presented to illustrate how standard finite differnce schemes for the wave eqation (e.g. Lax–Wendroff, Leafrog, etc.) can be developed from finite element analysis. The development of the diffrence schemes from the element schemes is made possible by using Galerkin's method on both the spacial and temporal dimensions.
openaire +1 more source
$\epsilon$-convergent splines difference scheme
Publicationes Mathematicae Debrecen, 1994A singular boundary value problem \(- \varepsilon u'' + p(x)u = f(x)\), \(x \in [0,1]\), \(u(0) = u_ 0\), \(u(1) = u_ 1\) is solved where \(0 < \varepsilon \ll 1\), \(p,f \in C^ 2 [0,1]\), \(p(x) \geq \beta > 0\) and \(p'(0) = p'(1) = 0\). A method is given for which the truncation error \(R\) is bounded by \(\| R \| < Mh \sqrt \varepsilon\) in the ...
openaire +1 more source
Different schemes for different teams
Computer Fraud & Security, 2009There has been a lot of talk recently about ‘parceling’ or ‘parcel mule scams’ whose victims are ‘mules’ who pass on goods acquired with dirty money. Parceling is a variant of ‘money mule scams’, differing from them in terms of dynamics and type of ‘hook’ (job offers, dating services, or even fake charitable organisations that ask the victim to help ...
openaire +1 more source
1994
Let us consider the problem of approximating the function e-z near z = 0 by rational functions $$ \begin{gathered} R_{j,l} (z) = \frac{{P_{j,l} (z)}} {{Q_{j,l} (z)}} = \frac{{a_0 + a_1 z + ... + a_j z^j }} {{}}, \hfill \\ a_r = a_r (j,l),r = 1...j,b_r = b_r (j,l),r = 1...,l,a_j \ne 0,b_l \ne 0,b_0 \ne 0. \hfill \\ \end{gathered} $$
A. Ashyralyev, P. E. Sobolevskii
openaire +1 more source
Let us consider the problem of approximating the function e-z near z = 0 by rational functions $$ \begin{gathered} R_{j,l} (z) = \frac{{P_{j,l} (z)}} {{Q_{j,l} (z)}} = \frac{{a_0 + a_1 z + ... + a_j z^j }} {{}}, \hfill \\ a_r = a_r (j,l),r = 1...j,b_r = b_r (j,l),r = 1...,l,a_j \ne 0,b_l \ne 0,b_0 \ne 0. \hfill \\ \end{gathered} $$
A. Ashyralyev, P. E. Sobolevskii
openaire +1 more source
1984
To arrive at finite difference equations modeling magnetohydrodynamic equilibrium we use a technique that is motivated by the finite element method [3]. First we develop a second order accurate numerical quadrature formula for the Hamiltonian E based on a rectangular grid of mesh points over a unit cube of the space with coordinates s, u and v.
Frances Bauer +2 more
openaire +1 more source
To arrive at finite difference equations modeling magnetohydrodynamic equilibrium we use a technique that is motivated by the finite element method [3]. First we develop a second order accurate numerical quadrature formula for the Hamiltonian E based on a rectangular grid of mesh points over a unit cube of the space with coordinates s, u and v.
Frances Bauer +2 more
openaire +1 more source
2020
Due to its relative simplicity, finite-difference (FD) analysis was historically the first numerical technique for boundary value problems in mathematical physics.
openaire +1 more source
Due to its relative simplicity, finite-difference (FD) analysis was historically the first numerical technique for boundary value problems in mathematical physics.
openaire +1 more source
Stable Matching of Difference Schemes
SIAM Journal on Numerical Analysis, 1972Approximations that result from the natural matching of two stable dissipative difference schemes across a coordinate line are shown to be stable. The basic idea is to reformulate the matching scheme consistent to an equivalent initial boundary value problem and to verify the algebraic conditions for stability of such systems. An interesting comparison
openaire +2 more sources
Multisplitting with Different Weighting Schemes
SIAM Journal on Matrix Analysis and Applications, 1989Iterative methods for approximating the solution of a linear algebraic system \(Ax=b\) are considered. A multisplitting of the matrix A is a sequence of splittings of the form \(A=B-C\), where B is nonsingular. When coupled with weighting diagonal matrices one can form a parallel algorithm.
openaire +1 more source
Weighted NND difference schemes
Communications in Nonlinear Science and Numerical Simulation, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Ruquan, Shen, Yiqing
openaire +1 more source
Weighted ENN difference schemes
Communications in Nonlinear Science and Numerical Simulation, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Ruquan, Shen, Yiqing
openaire +2 more sources