Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userNumerical Method for Finding Single and Multiple Integrals
طريقة عددية لإيجاد التكاملات الأحادية و الثنائية و الثلاثية
1937
3 35
0
(
0
)
Created by
Shamra Editor
Ask ChatGPT about the research
تم في هذا البحث تقديم طريقة عددية تكرارية لإيجاد القيم التقريبية للتكاملات الأحادية و الثنائية و الثلاثية. تعتمد الطريقة المقترحة على تقريب دالة التكاملات الأحادية بكثيرة حدود شرائحية من الدرجة الخامسة، ثم استخدام نقاط غوص-ليجندر بالإضافة إلى التقريبات الشرائحية لإيجاد التكاملات الثنائية و الثلاثية. تبين الدراسة أن الطريقة تكون متقاربة من الرتبة السادسة عند تطبيقها لإيجاد التكاملات الأحادية، و تكون أيضا متقاربة من الرتبة السادسة عند تطبيقها لإيجاد التكاملات الثنائية و الثلاثية باستخدام ثلاث نقاط غوصية أو أكثر. تم اختبار فعالية الطريقة المقترحة بتطبيقها لإيجاد بعض التكاملات الأحادية و الثنائية و الثلاثية المختلفة ثم مقارنة نتائج هذه الطريقة مع نتائج بعض الطرائق الأخرى.
In this paper, an iterative numerical method for obtaining approximate values of definite single, double and triple integrals will be illustrated. This method depends on approximating the single integral function by spline polynomial of fifth degree, while Gauss Legendre points as well as spline polynomials are used for finding multiple integrals. The study shows that when the method are applied to single integrals is convergent of order sixth, as well as when applied to triple integrals is convergent of order sixth for three Gauss Legendre points or greater. Errors estimates of the proposed method alongside numerical examples are given to test the convergence and accuracy of the method.
References used
HASHISH H., S.H. Behiry, N.A. El-Shamy, Numerical integration using wavelets, Applied Mathematics and Computation 211 (2009) 480-487
(SIRAJ-ul-Islam , Imran Aziz , Fazal Haq, A comparative study of numerical integration based on Haar wavelets and hybrid functions, Computers and Mathematics with Applications, doi:10.1016, pp.1-12, (2010
RATHOD H.T., K.V. Nagaraja, B. Venkatesudu, Numerical integration of some functions over an arbitrary linear tetrahedra in Euclidean three-dimensional space, Applied Mathematics and Computation 191 (2007) 397-409
rate research
Read More
According to the method VMA Based on the direct
analysis of data related to total section functional angular
section, In order to access the parameters of optical
scattering Optimally which is based on the inner link between
the two parts (real – imaginary) Which is expressed through
Dispersion relation
The results of a seismic profiling application are strongly dependent upon
field parameters, So every area has its own character and difficulty .To
increase the energy of seismic sources and to choose the most suitable source
arrays are important
factors to avoid the difficulty of the area and to help
attenuate ground role. To get good engineering seismic resolution, the
displacement of sources must be perpendicular to the profile line within a
definite distance .
In this paper we present mathematical models for
transportation problems, primal problem and dual. First, we show
how is the formulation of dual transportation problem models.
Finally, As a solution to the two models lead to a solution other
model, we have to dissolve the Dual transportation problem, so we
relied on the least cost method in resolving the primal
transportation problem.
There are two approaches for pairwise sentence scoring: Cross-encoders, which perform full-attention over the input pair, and Bi-encoders, which map each input independently to a dense vector space. While cross-encoders often achieve higher performan
ce, they are too slow for many practical use cases. Bi-encoders, on the other hand, require substantial training data and fine-tuning over the target task to achieve competitive performance. We present a simple yet efficient data augmentation strategy called Augmented SBERT, where we use the cross-encoder to label a larger set of input pairs to augment the training data for the bi-encoder. We show that, in this process, selecting the sentence pairs is non-trivial and crucial for the success of the method. We evaluate our approach on multiple tasks (in-domain) as well as on a domain adaptation task. Augmented SBERT achieves an improvement of up to 6 points for in-domain and of up to 37 points for domain adaptation tasks compared to the original bi-encoder performance.
The availability of parallel sentence simplification (SS) is scarce for neural SS modelings. We propose an unsupervised method to build SS corpora from large-scale bilingual translation corpora, alleviating the need for SS supervised corpora. Our met
hod is motivated by the following two findings: neural machine translation model usually tends to generate more high-frequency tokens and the difference of text complexity levels exists between the source and target language of a translation corpus. By taking the pair of the source sentences of translation corpus and the translations of their references in a bridge language, we can construct large-scale pseudo parallel SS data. Then, we keep these sentence pairs with a higher complexity difference as SS sentence pairs. The building SS corpora with an unsupervised approach can satisfy the expectations that the aligned sentences preserve the same meanings and have difference in text complexity levels. Experimental results show that SS methods trained by our corpora achieve the state-of-the-art results and significantly outperform the results on English benchmark WikiLarge.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
