Results 221 to 230 of about 15,025 (256)
Some of the next articles are maybe not open access.
Numerische Mathematik, 2013
The article deals with the theoretical convergence rate of the sinc indefinite integration combined with the double-exponential (DE) transformation for a class of functions for which the single-exponential (SE) transformation is suitable. Although the DE transformation is considered as an enhanced version of the SE transformation for sinc-related ...
Tomoaki Okayama +3 more
openaire +4 more sources
The article deals with the theoretical convergence rate of the sinc indefinite integration combined with the double-exponential (DE) transformation for a class of functions for which the single-exponential (SE) transformation is suitable. Although the DE transformation is considered as an enhanced version of the SE transformation for sinc-related ...
Tomoaki Okayama +3 more
openaire +4 more sources
Applied Mathematics and Computation, 1986
A Galerkin method using Whittaker cardinal or ''sinc'' functions as basis functions is described for the solution of boundary value problems. When the solution is analytic in the interior of the domain, the error of approximation using \(2N+1\) points is \(O(e^{-\gamma N^{1/2}})\) even if derivatives of the solution are singular at the boundaries.
Schaffer, Steve, Stenger, Frank
openaire +2 more sources
A Galerkin method using Whittaker cardinal or ''sinc'' functions as basis functions is described for the solution of boundary value problems. When the solution is analytic in the interior of the domain, the error of approximation using \(2N+1\) points is \(O(e^{-\gamma N^{1/2}})\) even if derivatives of the solution are singular at the boundaries.
Schaffer, Steve, Stenger, Frank
openaire +2 more sources
Proceedings of the 2009 conference on Symbolic numeric computation, 2009
The present talk gives a survey of the DE-Sinc numerical methods (= the Sinc numerical methods, which have been developed by Stenger and his school, incorporated with double-exponential transformations). The DE-Sinc numerical methods have a feature that they enjoys the convergence rate O(exp(-κ'n/log n)) with some κ'>0 even if the function, or the ...
openaire +1 more source
The present talk gives a survey of the DE-Sinc numerical methods (= the Sinc numerical methods, which have been developed by Stenger and his school, incorporated with double-exponential transformations). The DE-Sinc numerical methods have a feature that they enjoys the convergence rate O(exp(-κ'n/log n)) with some κ'>0 even if the function, or the ...
openaire +1 more source
The RK-Sinc Method for Schrödinger equation
2021 International Applied Computational Electromagnetics Society (ACES-China) Symposium, 2021In this work, the time-dependent Schrodinger equations were implemented by the RK-Sinc method. It offers a high quality in spatial approximations with the Sinc function and a high-efficiency procedure to close to the time advance with the strong stability and low storage Runge-Kutta method.
Min Zhu, Yi Wang
openaire +1 more source
2002
In this chapter we consider an FK2 of the form (1.2.2): ϕ(x) — λ ∫ a b k(x,s)ϕ(s)ds = f (s), where a ≤ x,s ≤ b, and the kernel k(x,s) has a weak singularity at an endpoint. In numerical approximations, whether in quadrature, finite differences,finite elements, and the like, the computational methods generally use polynomials as basis functions to ...
Prem K. Kythe, Pratap Puri
openaire +1 more source
In this chapter we consider an FK2 of the form (1.2.2): ϕ(x) — λ ∫ a b k(x,s)ϕ(s)ds = f (s), where a ≤ x,s ≤ b, and the kernel k(x,s) has a weak singularity at an endpoint. In numerical approximations, whether in quadrature, finite differences,finite elements, and the like, the computational methods generally use polynomials as basis functions to ...
Prem K. Kythe, Pratap Puri
openaire +1 more source
Sinc methods for domain decomposition
Applied Mathematics and Computation, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lybeck, Nancy J., Bowers, Kenneth L.
openaire +2 more sources
Sinc-Galerkin method for solving biharmonic problems
Applied Mathematics and Computation, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mohamed El-Gamel +2 more
openaire +1 more source
2020
Optimal bounds for the uniform errors of approximation and quadrature in the Sinc basis are extended from simple cartesian products to a class of polyhedra sufficient for most applications by complexification of the space of a simplicial complex. The complexification admits approximation of functions defined on realizations of simplicial complexes that
openaire +1 more source
Optimal bounds for the uniform errors of approximation and quadrature in the Sinc basis are extended from simple cartesian products to a class of polyhedra sufficient for most applications by complexification of the space of a simplicial complex. The complexification admits approximation of functions defined on realizations of simplicial complexes that
openaire +1 more source
An analysis of research methods in IJPR since inception
International Journal of Production Research, 2017Production research as an academic field has experienced tremendous growth in the last few decades.
Andrew S. Manikas +3 more
openaire +1 more source
Convergence of the sinc overlapping domain decomposition method
Applied Mathematics and Computation, 1999An initial implementation of a sinc-collocation domain decomposition method for two-point boundary value problems with boundary singularities is investigated. The algorithm used to find the solution of an equation approximated with the overlapping method relies on the bordering algorithm [cf. \textit{H. B. Keller}, Numerical solution of bifurcation and
Anne C. Morlet +2 more
openaire +1 more source