نتایج جستجو برای: s iterations

تعداد نتایج: 725127  

Journal: : 2022

In recent years, there has been a growing interest on non-localmodels because of their relevance in many practical applications. Awidely studied class non-local models involves fractional orderoperators. They usually describe anomalous diffusion. Inparticular, these equations provide more faithful representationof the long-memory and nonlocal dependence diffusion fractaland porous media, heat f...

There are different methods for the hydraulic analysis of water supply networks. In the solution process of most of these methods, a large system of linear equations is solved in each iteration. This usually requires a high computational effort. Hardy Cross method is one of the approaches that do not need such a process and may converge to the solution through scalar divisions. However, this me...

2001
Jaime Gutierrez Domingo Gómez-Pérez

In this paper we present an extension of a result in [2] about a discrepancy bound for sequences of s-tuples of successive nonlinear multiple recursive congruential pseudorandom numbers of higher orders. The key of this note is based on linear properties of the iterations of multivariate polynomials.

2016
Animashree Anandkumar Prateek Jain Yang Shi U. N. Niranjan

A Bounds for block sparse tensors One of the main bounds to control is the spectral norm of the sparse perturbation tensor S. The success of the power iterations and the improvement in accuracy of recovery over iterative steps of RTD requires this bound.

Journal: :Applied Mathematics and Computation 2006
J. M. Soriano

Sufficient conditions are given to assert that a perturbed mapping has only one zero in a specific open ball. This zero is estimated by means of a sequence of Newton s iterations. The proof of the result is constructive and is based upon continuation methods. 2005 Elsevier Inc. All rights reserved.

2002
Daniel A. Spielman Shang-Hua Teng Alper Üngör

In this paper, we analyze the omplexity of natural parallelizations of Delaunay re nement methods for mesh generation. The parallelizations employ a simple strategy: at ea h iteration, they hoose a set of \independent" points to insert into the domain, and then update the Delaunay triangulation. We show that su h a set of independent points an be onstru ted eÆ iently in parallel and that the nu...

Journal: :Journal of Mathematical Analysis and Applications 1994

Journal: :Applied Mathematics Letters 2005

Journal: :Computers & Mathematics with Applications 1980

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید