scholarly journals Midpoint Derivative-Based Closed Newton-Cotes Quadrature

2013 ◽  
Vol 2013 ◽  
pp. 1-10 ◽  
Author(s):  
Weijing Zhao ◽  
Hongxing Li

A novel family of numerical integration of closed Newton-Cotes quadrature rules is presented which uses the derivative value at the midpoint. It is proved that these kinds of quadrature rules obtain an increase of two orders of precision over the classical closed Newton-Cotes formula, and the error terms are given. The computational cost for these methods is analyzed from the numerical point of view, and it has shown that the proposed formulas are superior computationally to the same order closed Newton-Cotes formula when they reduce the error below the same level. Finally, some numerical examples show the numerical superiority of the proposed approach with respect to closed Newton-Cotes formulas.

2014 ◽  
Vol 2014 ◽  
pp. 1-16 ◽  
Author(s):  
Fiza Zafar ◽  
Saira Saleem ◽  
Clarence O. E. Burg

Some new families of open Newton-Cotes rules which involve the combinations of function values and the evaluation of derivative at uniformly spaced points of the interval are presented. The order of accuracy of these numerical formulas is higher than that of the classical open Newton-Cotes formulas. An extensive comparison of the computational cost, order of accuracy, error terms, coefficients of the error terms, observed order of accuracy, CPU usage time, and results obtained from these formulas is given. The comparisons show that we have been able to define some new open Newton-Cotes rules which are superior to classical open rules for less number of nodes and less computational cost with increased order of accuracy.


2021 ◽  
Vol 47 (4) ◽  
pp. 1-24
Author(s):  
Quoc T. Le Gia ◽  
Ming Li ◽  
Yu Guang Wang

Vector spherical harmonics on the unit sphere of ℝ 3 have broad applications in geophysics, quantum mechanics, and astrophysics. In the representation of a tangent vector field, one needs to evaluate the expansion and the Fourier coefficients of vector spherical harmonics. In this article, we develop fast algorithms (FaVeST) for vector spherical harmonic transforms on these evaluations. The forward FaVeST evaluates the Fourier coefficients and has a computational cost proportional to N log √ N for N number of evaluation points. The adjoint FaVeST, which evaluates a linear combination of vector spherical harmonics with a degree up to ⊡ M for M evaluation points, has cost proportional to M log √ M . Numerical examples of simulated tangent fields illustrate the accuracy, efficiency, and stability of FaVeST.


2019 ◽  
Vol 11 (1) ◽  
pp. 168781401881990
Author(s):  
Chigbogu Godwin Ozoegwu

The vibration of the engineering systems with distributed delay is governed by delay integro-differential equations. Two-stage numerical integration approach was recently proposed for stability identification of such oscillators. This work improves the approach by handling the distributed delay—that is, the first-stage numerical integration—with tensor-based higher order numerical integration rules. The second-stage numerical integration of the arising methods remains the trapezoidal rule as in the original method. It is shown that local discretization error is of order [Formula: see text] irrespective of the order of the numerical integration rule used to handle the distributed delay. But [Formula: see text] is less weighted when higher order numerical integration rules are used to handle the distributed delay, suggesting higher accuracy. Results from theoretical error analyses, various numerical rate of convergence analyses, and stability computations were combined to conclude that—from application point of view—it is not necessary to increase the first-stage numerical integration rule beyond the first order (trapezoidal rule) though the best results are expected at the second order (Simpson’s 1/3 rule).


2019 ◽  
Vol 17 (06) ◽  
pp. 1950077 ◽  
Author(s):  
Sheng-Tong Zhou ◽  
Qian Xiao ◽  
Jian-Min Zhou ◽  
Hong-Guang Li

Rackwitz–Fiessler (RF) method is well accepted as an efficient way to solve the uncorrelated non-Normal reliability problems by transforming original non-Normal variables into equivalent Normal variables based on the equivalent Normal conditions. However, this traditional RF method is often abandoned when correlated reliability problems are involved, because the point-by-point implementation property of equivalent Normal conditions makes the RF method hard to clearly describe the correlations of transformed variables. To this end, some improvements on the traditional RF method are presented from the isoprobabilistic transformation and copula theory viewpoints. First of all, the forward transformation process of RF method from the original space to the standard Normal space is interpreted as the isoprobabilistic transformation from the geometric point of view. This viewpoint makes us reasonably describe the stochastic dependence of transformed variables same as that in Nataf transformation (NATAF). Thus, a corresponding enhanced RF (EnRF) method is proposed to deal with the correlated reliability problems described by Pearson linear correlation. Further, we uncover the implicit Gaussian copula hypothesis of RF method according to the invariant theorem of copula and the strictly increasing isoprobabilistic transformation. Meanwhile, based on the copula-only rank correlations such as the Spearman and Kendall correlations, two improved RF (IRF) methods are introduced to overcome the potential pitfalls of Pearson correlation in EnRF. Later, taking NATAF as a reference, the computational cost and efficiency of above three proposed RF methods are also discussed in Hasofer–Lind reliability algorithm. Finally, four illustrative structure reliability examples are demonstrated to validate the availability and advantages of the new proposed RF methods.


Geophysics ◽  
2019 ◽  
Vol 84 (5) ◽  
pp. S365-S372 ◽  
Author(s):  
Lele Zhang ◽  
Jan Thorbecke ◽  
Kees Wapenaar ◽  
Evert Slob

We have compared three data-driven internal multiple reflection elimination schemes derived from the Marchenko equations and inverse scattering series (ISS). The two schemes derived from Marchenko equations are similar but use different truncation operators. The first scheme creates a new data set without internal multiple reflections. The second scheme does the same and compensates for transmission losses in the primary reflections. The scheme derived from ISS is equal to the result after the first iteration of the first Marchenko-based scheme. It can attenuate internal multiple reflections with residuals. We evaluate the success of these schemes with 2D numerical examples. It is shown that Marchenko-based data-driven schemes are relatively more robust for internal multiple reflection elimination at a higher computational cost.


2015 ◽  
Vol 651-653 ◽  
pp. 1294-1300
Author(s):  
Diego Canales ◽  
Adrien Leygue ◽  
Francisco Chinesta ◽  
Elias Cueto ◽  
Eric Feulvarch ◽  
...  

A new efficient updated-Lagrangian strategy for numerical simulations of material forming processes is presented in this work. The basic ingredients are the in-plane-out-of-plane PGD-based decomposition and the use of a robust numerical integration technique (the Stabilized Conforming Nodal Integration). This strategy is of general purpose, although it is especially well suited for plateshape geometries. This paper is devoted to show the feasibility of the technique through some simple numerical examples.


1999 ◽  
Vol 09 (03) ◽  
pp. 211-217 ◽  
Author(s):  
RÉGIS P. LANDIM ◽  
BENJAMIM R. DE MENEZES ◽  
SELÊNIO R. SILVA ◽  
WALMIR M. CAMINHAS

This work presents a Neo-Fuzzy-Neuron algorithm for the identification of nonlinear dynamic systems at the point of view of a rotor flux observer. The algorithm training is on-line, has low computational cost, does not require previous training and its convergence in one step is proved. The gradient descent method is used for its weights adjustment. Simulation and experimental results demonstrate the effetiveness of the algorithm for flux observer of induction motor drive system.


2011 ◽  
Vol 2011 ◽  
pp. 1-12 ◽  
Author(s):  
Jessé C. Costa ◽  
Débora Mondini ◽  
Jörg Schleicher ◽  
Amélia Novais

Three-dimensional wave-equation migration techniques are still quite expensive because of the huge matrices that need to be inverted. Several techniques have been proposed to reduce this cost by splitting the full 3D problem into a sequence of 2D problems. We compare the performance of splitting techniques for stable 3D Fourier finite-difference (FFD) migration techniques in terms of image quality and computational cost. The FFD methods are complex Padé FFD and FFD plus interpolation, and the compared splitting techniques are two- and four-way splitting as well as alternating four-way splitting, that is, splitting into the coordinate directions at one depth and the diagonal directions at the next depth level. From numerical examples in homogeneous and inhomogeneous media, we conclude that, though theoretically less accurate, alternate four-way splitting yields results of comparable quality as full four-way splitting at the cost of two-way splitting.


Sign in / Sign up

Export Citation Format

Share Document