Log in

Relevant bibliographies by topics / Converge / Journal articles

To see the other types of publications on this topic, follow the link: Converge.

Journal articles on the topic 'Converge'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Converge.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Luo, Xu-Ren, Chun-Hsiao Chu, and Henry C. J. Chao. "Novel Solution Method for Inventory Models with Stochastic Demand and Defective Units." Mathematical Problems in Engineering 2020 (October 10, 2020): 1–13. http://dx.doi.org/10.1155/2020/3528706.

Full text

Abstract:

This paper is a response to two papers. We improve the lengthy proof for the first paper by an elegant verification. For the second paper, we point out the three-sequence approach will result in different convergent rates such that when the other two sequences are converged, the ordering quantity sequence may still not converge to the optimal solution. We construct a novel iterative method to simplify the previous approach proposed by the three-sequence approach for the optimal solution. By the same numerical examples of three published papers, we demonstrate that we can control our findings t

APA, Harvard, Vancouver, ISO, and other styles

2

Cunjalo, Fikret. "Almost convergence of double subsequences." Filomat 22, no. 2 (2008): 87–93. http://dx.doi.org/10.2298/fil0802087c.

Full text

Abstract:

Almost-convergence of double sequences (subsequences) is equivalent to almost Cauchy condition. If the set of all almost convergent subsequences of a sequence S = Snm is of the second category, then S is convergent in the simple sense. For the sequence S = Snm which almost converges to L, Lebesgue measure of the set of all its subsequences which almost converge to L is either 1 or 0. .

APA, Harvard, Vancouver, ISO, and other styles

3

Zmijewski, Piotr, Piotr Dziekan, and Hanna Pawlowska. "Modeling collision–coalescence in particle microphysics: numerical convergence of mean and variance of precipitation in cloud simulations using the University of Warsaw Lagrangian Cloud Model (UWLCM) 2.1." Geoscientific Model Development 17, no. 2 (2024): 759–80. http://dx.doi.org/10.5194/gmd-17-759-2024.

Full text

Abstract:

Abstract. Numerical convergence of the collision–coalescence algorithm used in Lagrangian particle-based microphysics is studied in 2D simulations of an isolated cumulus congestus (CC) and in box and multi-box simulations of collision–coalescence. Parameters studied are the time step for coalescence and the number of super-droplets (SDs) per cell. A time step of 0.1 s gives converged droplet size distribution (DSD) in box simulations and converged mean precipitation in CC. Variances of the DSD and of precipitation are not sensitive to the time step. In box simulations, mean DSD converges for 1

APA, Harvard, Vancouver, ISO, and other styles

4

Yuille, A. L. "CCCP Algorithms to Minimize the Bethe and Kikuchi Free Energies: Convergent Alternatives to Belief Propagation." Neural Computation 14, no. 7 (2002): 1691–722. http://dx.doi.org/10.1162/08997660260028674.

Full text

Abstract:

This article introduces a class of discrete iterative algorithms that are provably convergent alternatives to belief propagation (BP) and generalized belief propagation (GBP). Our work builds on recent results by Yedidia, Freeman, and Weiss (2000), who showed that the fixed points of BP and GBP algorithms correspond to extrema of the Bethe and Kikuchi free energies, respectively. We obtain two algorithms by applying CCCP to the Bethe and Kikuchi free energies, respectively (CCCP is a procedure, introduced here, for obtaining discrete iterative algorithms by decomposing a cost function into a c

APA, Harvard, Vancouver, ISO, and other styles

5

Khan, Luqman, Laiq Khan, Shahrukh Agha, Kamran Hafeez, and Jamshed Iqbal. "Passivity-based Rieman Liouville fractional order sliding mode control of three phase inverter in a grid-connected photovoltaic system." PLOS ONE 19, no. 2 (2024): e0296797. http://dx.doi.org/10.1371/journal.pone.0296797.

Full text

Abstract:

Photovoltaic (PV) system parameters are always non-linear due to variable environmental conditions. The Maximum power point tracking (MPPT) is difficult under multiple uncertainties, disruptions and the occurrence of time-varying stochastic conditions. Therefore, Passivity based Fractional order Sliding-Mode controller (PBSMC) is proposed to examine and develop a storage function in error tracking for PV power and direct voltage in this research work. A unique sliding surface for Fractional Order Sliding Mode Control (FOSMC) framework is proposed and its stability and finite time convergence i

APA, Harvard, Vancouver, ISO, and other styles

6

Cohen, Jason, Sidney Resnick, and Gennady Samorodnitsky. "Sample correlations of infinite variance time series models: an empirical and theoretical study." Journal of Applied Mathematics and Stochastic Analysis 11, no. 3 (1998): 255–82. http://dx.doi.org/10.1155/s1048953398000227.

Full text

Abstract:

When the elements of a stationary ergodic time series have finite variance the sample correlation function converges (with probability 1) to the theoretical correlation function. What happens in the case where the variance is infinite? In certain cases, the sample correlation function converges in probability to a constant, but not always. If within a class of heavy tailed time series the sample correlation functions do not converge to a constant, then more care must be taken in making inferences and in model selection on the basis of sample autocorrelations. We experimented with simulating va

APA, Harvard, Vancouver, ISO, and other styles

7

RAWDON, ERIC J., and JONATHAN K. SIMON. "POLYGONAL APPROXIMATION AND ENERGY OF SMOOTH KNOTS." Journal of Knot Theory and Its Ramifications 15, no. 04 (2006): 429–51. http://dx.doi.org/10.1142/s0218216506004543.

Full text

Abstract:

We establish a fundamental connection between smooth and polygonal knot energies, showing that the Minimum Distance Energy for polygons inscribed in a smooth knot converges to the Möbius Energy of the smooth knot as the polygons converge to the smooth knot. For this to work, the polygons must converge in a "nice" way, and the energies must be correctly regularized. We determine an explicit error bound for the convergence.

APA, Harvard, Vancouver, ISO, and other styles

8

Xia, Tai Wu, and Hong Jun Liu. "Multiuser Beamforming Using Weighted Orthogonal Constant Modulus Algorithm." Advanced Materials Research 204-210 (February 2011): 2162–66. http://dx.doi.org/10.4028/www.scientific.net/amr.204-210.2162.

Full text

Abstract:

Beamforming is a core technique in intelligent antenna signal processing and has been receiving a prevalent focus by researchers. Common orthogonal constant modulus algorithm (OCMA) doesn’t guarantee that the weights of different beamformers converge to corresponding signals when the array of receivers takes in signals with same feature. Thereby a weighted orthogonal constant modulus algorithm (WOCMA) is proposed in which weights of different beamformers are ensured to be disparate by controlling their relevance down to a low level, which concludes different weight converges to corresponding s

APA, Harvard, Vancouver, ISO, and other styles

9

MOREIRA, DIEGO R., and EDUARDO V. O. TEIXEIRA. "Weak convergence under nonlinearities." Anais da Academia Brasileira de Ciências 75, no. 1 (2003): 9–19. http://dx.doi.org/10.1590/s0001-37652003000100002.

Full text

Abstract:

In this paper, we prove that if a Nemytskii operator maps Lp(omega, E) into Lq(omega, F), for p, q greater than 1, E, F separable Banach spaces and F reflexive, then a sequence that converge weakly and a.e. is sent to a weakly convergent sequence. We give a counterexample proving that if q = 1 and p is greater than 1 we may not have weak sequential continuity of such operator. However, we prove that if p = q = 1, then a weakly convergent sequence that converges a.e. is mapped into a weakly convergent sequence by a Nemytskii operator. We show an application of the weak continuity of the Nemytsk

APA, Harvard, Vancouver, ISO, and other styles

10

Gåsemyr, J., and Terje Aven. "Asymptotic distributions for downtimes of monotone systems." Journal of Applied Probability 36, no. 3 (1999): 814–24. http://dx.doi.org/10.1239/jap/1032374636.

Full text

Abstract:

Consider a monotone system with independent alternating renewal processes as component processes, and assume the component uptimes are exponentially distributed. In this paper we study the asymptotic properties of the distribution of the rth downtime of the system, as the failure rates of the components converge to zero. We show that this distribution converges, and the limiting function has a simple form. Thus we have established an easy computable approximation formula for the downtime distribution of the system for highly available systems. We also show that the steady state downtime distri

APA, Harvard, Vancouver, ISO, and other styles

11

Gåsemyr, J., and Terje Aven. "Asymptotic distributions for downtimes of monotone systems." Journal of Applied Probability 36, no. 03 (1999): 814–24. http://dx.doi.org/10.1017/s0021900200017599.

Full text

Abstract:

Consider a monotone system with independent alternating renewal processes as component processes, and assume the component uptimes are exponentially distributed. In this paper we study the asymptotic properties of the distribution of the rth downtime of the system, as the failure rates of the components converge to zero. We show that this distribution converges, and the limiting function has a simple form. Thus we have established an easy computable approximation formula for the downtime distribution of the system for highly available systems. We also show that the steady state downtime distri

APA, Harvard, Vancouver, ISO, and other styles

12

Hubber, David A., Sam A. E. G. Falle, and Simon P. Goodwin. "Convergence of SPH and AMR simulations." Proceedings of the International Astronomical Union 6, S270 (2010): 429–32. http://dx.doi.org/10.1017/s1743921311000767.

Full text

Abstract:

AbstractWe present the first results of a large suite of convergence tests between Adaptive Mesh Refinement (AMR) Finite Difference Hydrodynamics and Smoothed Particle Hydrodynamics (SPH) simulations of the non-linear thin shell instability and the Kelvin-Helmholtz instability. We find that the two methods converge in the limit of high resolution and accuracy. AMR and SPH simulations of the non-linear thin shell instability converge with each other with standard algorithms and parameters. The Kelvin-Helmholtz instability in SPH requires both an artificial conductivity term and a kernel with la

APA, Harvard, Vancouver, ISO, and other styles

13

Kantrowitz, Robert, and Michael Schramm. "Series that Converge Absolutely but Don't Converge." College Mathematics Journal 43, no. 4 (2012): 331–33. http://dx.doi.org/10.4169/college.math.j.43.4.331.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Wang, Yang, Guirong Liu, and Xiong Li. "Entire solutions in a delayed nonlocal dispersal competitive system." International Journal of Biomathematics 12, no. 04 (2019): 1950035. http://dx.doi.org/10.1142/s1793524519500359.

Full text

Abstract:

In this paper, we are concerned with the existence of an entire solution in a delayed nonlocal dispersal competitive system. This entire solution converges to two monotone fronts with different speeds, which approach each other from both sides of the [Formula: see text]-axis, as [Formula: see text] converge to [Formula: see text] and then converge to [Formula: see text] as [Formula: see text] converges to [Formula: see text]. Its global dynamic shows the superior species invade the inferior ones from both sides of the [Formula: see text]-axis and then the inferior ones become extinct, which is

APA, Harvard, Vancouver, ISO, and other styles

15

Vo, Thi Van Anh. "Complete Convergence for M-Pairwise Negatively Dependent Random Variables." Journal of Technical Education Science, no. 72A (October 28, 2022): 28–33. http://dx.doi.org/10.54644/jte.72a.2022.1135.

Full text

Abstract:

Hsu and Robbins (1947) introduce the concept complete convergence as follows. A sequence of random variables is said to converge completely to a constant if for all The converse is true if the are independent. They also show that the sequence of arithmetic means of independent and identically distributed random variables converges completely to the expected value if the variance of the summands is finite. Erdös proved the converse. The result of Hsu-Robbins-Erdös is a fundamental theorem in probability theory and has been generalized and extended in several directions by many authors. In this

APA, Harvard, Vancouver, ISO, and other styles

16

Klei, Heinz-Albrecht. "Measure convergent sequences in Lebesgue spaces and Fatou's lemma." Bulletin of the Australian Mathematical Society 54, no. 2 (1996): 197–202. http://dx.doi.org/10.1017/s0004972700017652.

Full text

Abstract:

Let (fn) be a sequence of positive P-integrable functions such that (∫ fndP)n converges. We prove that (fn) converges in measure to if and only if equality holds in the generalised Fatou's lemma. Let f∞ be an integrable function such that (∥fn − f∞∥1)n converges. We present in terms of the modulus of uniform integrability of (fn) necessary and sufficient conditions for (fn) to converge in measure to f∞.

APA, Harvard, Vancouver, ISO, and other styles

17

Kash, I. A., E. J. Friedman, and J. Y. Halpern. "Multiagent Learning in Large Anonymous Games." Journal of Artificial Intelligence Research 40 (March 22, 2011): 571–98. http://dx.doi.org/10.1613/jair.3213.

Full text

Abstract:

In large systems, it is important for agents to learn to act effectively, but sophisticated multi-agent learning algorithms generally do not scale. An alternative approach is to find restricted classes of games where simple, efficient algorithms converge. It is shown that stage learning efficiently converges to Nash equilibria in large anonymous games if best-reply dynamics converge. Two features are identified that improve convergence. First, rather than making learning more difficult, more agents are actually beneficial in many settings. Second, providing agents with statistical information

APA, Harvard, Vancouver, ISO, and other styles

18

Li, Zhaoling, Weipeng Xuan, and Weilun Xie. "Two-dimensional phononic crystal based on-chip surface acoustic waves convergence." Journal of Physics: Conference Series 2809, no. 1 (2024): 012054. http://dx.doi.org/10.1088/1742-6596/2809/1/012054.

Full text

Abstract:

Abstract Surface acoustic wave (SAW) technology is widely used in microwave electronics, and is often used to produce such devices as filters, sensors and actuators. In this work, a structure constructed by a two-dimensional phononic crystal (PnC) is designed to converge two incident SAWs. Based on the equifrequency contour (EFC) theory and unique band characteristic at high-symmetric point, aggregating SAWs within the PnC region and then the converged output could be observed. This specific utilization of PnC to converge SAWs can be a useful complement to the delicate manipulation, which can

APA, Harvard, Vancouver, ISO, and other styles

19

Galántai, Aurél. "A Stochastic Convergence Result for the Nelder–Mead Simplex Method." Mathematics 11, no. 9 (2023): 1998. http://dx.doi.org/10.3390/math11091998.

Full text

Abstract:

We prove that the Nelder–Mead simplex method converges in the sense that the simplex vertices converge to a common limit point with a probability of one. The result may explain the practical usefulness of the Nelder–Mead method.

APA, Harvard, Vancouver, ISO, and other styles

20

Thirring, W. "ENTROPY INCREASE AND K-SYSTEMS IN QUANTUM THEORY." International Journal of Modern Physics B 04, no. 05 (1990): 1119–26. http://dx.doi.org/10.1142/s0217979290000553.

Full text

Abstract:

It is shown that the relative entropy converges to its equilibrium value when the states converge strongly. This can happen only for subalgebras for which the clustering is uniform. It happens for K-systems for which this uniformity in clustering has the maximal extent which is possible.

APA, Harvard, Vancouver, ISO, and other styles

21

MAŁYSZ, ROBERT. "A GENERALIZATION OF FRACTAL INTERPOLATION STOCHASTIC PROCESSES TO HIGHER DIMENSIONS." Fractals 09, no. 04 (2001): 415–28. http://dx.doi.org/10.1142/s0218348x01000907.

Full text

Abstract:

We generalize the notion of fractal interpolation functions (FIFs) to stochastic processes. We prove that the Minkowski dimension of trajectories of such interpolations for self-similar processes with stationary increments converges to 2-α. We generalize the notion of vector-valued FIFs to stochastic processes. Trajectories of such interpolations based on an equally spaced sample of size n on the interval [0,1] converge to the trajectory of the original process. Moreover, for fractional Brownian motion and, more generally, for self-similar processes with stationary increments (α-sssi) processe

APA, Harvard, Vancouver, ISO, and other styles

22

Altaie, Huda Omran, Adel Rashed A. Ali, and Reem Waleed Huisen. "Semi-analytical iteration techniques for solving differential equations." Journal of Interdisciplinary Mathematics 27, no. 4 (2024): 715–19. http://dx.doi.org/10.47974/jim-1756.

Full text

Abstract:

The main objective of this work is to use and compare some techniques, namely the variational Iteration method (VIM), Decomposition Method (ADM), Differential Transform Method (DTM), and Temimi and Ansari Method (TAM) for differential equations of the first and second orders that appeared in physics and engineering. Notably, the results indicate that the VIM gives a solution in series form, which converges to an exact solution;. At the same time, DTM is easy to apply but requires transformation, ADM does not need any transformation except the calculation of Adomain polynomials. TAM solved nonl

APA, Harvard, Vancouver, ISO, and other styles

23

Martynyuk, Eduard. "The convergent processes of the religious life of our time." Ukrainian Religious Studies, no. 35 (September 9, 2005): 45–54. http://dx.doi.org/10.32420/2005.35.1595.

Full text

Abstract:

The most common tendencies in religious life of the second half of the twentieth century, which I propose to call "convergent processes". The term "convergence" (from the Latin. Convergentio, convergo - converge, approach) was first used by German scholar Henry Frick in his work Comparative Religion. In seeking to approximate the terminology of the natural sciences and social sciences, begun by DF Schlemmacher, G. Frick used the term in the sense in which it was already used primarily in biology, where this concept characterizes the process of appearance of similarities in the structure and fu

APA, Harvard, Vancouver, ISO, and other styles

24

Grigorian, Gevorg A. "A Fast Convergent Approximation Method for the Solution of Second Order Linear Ordinary Differential Equations." Sarajevo Journal of Mathematics 19, no. 2 (2024): 241–53. http://dx.doi.org/10.5644/sjm.19.02.09.

Full text

Abstract:

The Riccati equation method is used to obtain a fast convergent approximation method for the solution of second order linear ordinary differential equations. By using examples it is shown how fast the proposed method can converge.

APA, Harvard, Vancouver, ISO, and other styles

25

Gonzalez, Gilbert. "DIVIDE OR CONVERGE?" Muma Case Review 1 (2016): 1–23. http://dx.doi.org/10.28945/3581.

Full text

Abstract:

Gilbert Gonzalez, founder and CEO of Mission Critical Solutions (MCS), was reflecting on the path forward for his company. MCS maintained and updated a five-year strategic plan each year since its inception in 1990. In the early years, the strategic plan focused on the key strategic factors (KSFs) and resulted in a narrow mission. Year after year, that focus on the KSFs was rewarded by the market. Doing the most important things well kept the organization focused and efficient. The consistently evolving mission of the organization necessitated adding new products, services, and solutions. In t

APA, Harvard, Vancouver, ISO, and other styles

26

Gonzalez, Gilbert. "DIVIDE OR CONVERGE?" Journal of Information Technology Education: Discussion Cases 5 (2016): 07. http://dx.doi.org/10.28945/3599.

Full text

Abstract:

Should Mission Critical Solutions (MCS) stay converged in a functional organization strategy with capability-based teams, or organize into separate standalone entities with unique identities and separate overheads, focusing more on the individual capability-based technology specialization?

APA, Harvard, Vancouver, ISO, and other styles

27

Kolb, Holger. "When Extremes Converge." Comparative Migration Studies 2, no. 1 (2014): 57–75. http://dx.doi.org/10.5117/cms2014.1.kolb.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Blow, Julian. "Many strands converge." Nature 326, no. 6112 (1987): 441–42. http://dx.doi.org/10.1038/326441a0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Greenstein, S. "When technologies converge." IEEE Micro 19, no. 1 (1999): 8–9. http://dx.doi.org/10.1109/40.748790.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Whalley, Katherine. "Inhibitory signals converge." Nature Reviews Neuroscience 8, no. 4 (2007): 245. http://dx.doi.org/10.1038/nrn2116.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Willison, James. "Invitation to converge." Infosecurity 4, no. 8 (2007): 17. http://dx.doi.org/10.1016/s1754-4548(07)70197-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

KEMSLEY, JYLLIAN. "192 LASERS CONVERGE." Chemical & Engineering News 87, no. 13 (2009): 30–33. http://dx.doi.org/10.1021/cen-v087n013.p030.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Martin, Kevan A. C. "Parallel pathways converge." Current Biology 2, no. 10 (1992): 555–57. http://dx.doi.org/10.1016/0960-9822(92)90037-b.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Apergis, Nicholas, and Yannis Georgellis. "Does Happiness Converge?" Journal of Happiness Studies 16, no. 1 (2014): 67–76. http://dx.doi.org/10.1007/s10902-013-9495-y.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Bartels, Larry M. "Failure to Converge." ANNALS of the American Academy of Political and Social Science 667, no. 1 (2016): 143–65. http://dx.doi.org/10.1177/0002716216661145.

Full text

Abstract:

The logic of electoral competition suggests that candidates should have to adopt moderate issue positions to win majority support. But U.S. presidential candidates consistently take relatively extreme positions on a variety of important issues. Some observers have attributed these “polarized” positions to the extreme views of the parties’ core supporters. I characterize the issue preferences of core Republicans, core Democrats, and swing voters over the past three decades and assess how well the positions of presidential candidates reflect those preferences. I find that Republican candidates h

APA, Harvard, Vancouver, ISO, and other styles

36

Januchowski-Hartley, Stephanie R. "Two Rivers Converge." BioScience 69, no. 5 (2019): 398–99. http://dx.doi.org/10.1093/biosci/biz028.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Clay, Keith. "Parallel worlds converge." Trends in Ecology & Evolution 13, no. 1 (1998): 38–39. http://dx.doi.org/10.1016/s0169-5347(97)01265-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Meyer, Helen. "Security, management converge." Computers & Security 17, no. 6 (1998): 518–19. http://dx.doi.org/10.1016/s0167-4048(98)80082-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Skipper, Magdalena. "Converge and diversify." Nature Reviews Genetics 7, no. 11 (2006): 828. http://dx.doi.org/10.1038/nrg2001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Moroni, Lorenzo, and Clemens A. van Blitterswijk. "Converge and regenerate." Nature Materials 5, no. 6 (2006): 437–38. http://dx.doi.org/10.1038/nmat1665.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

INOUE, D., and K. TANAKA. "Conditional Converge Cast." IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E91-A, no. 6 (2008): 1537–40. http://dx.doi.org/10.1093/ietfec/e91-a.6.1537.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Tadj, Lotfi. "Converge, Version 3.0." Journal of Applied Mathematics and Stochastic Analysis 6, no. 3 (1993): 281–85. http://dx.doi.org/10.1155/s1048953393000243.

Full text

Abstract:

Although intended for college teachers/students, Converge presents a feature that may interest all scientists: it allows an easy export of graphic files to most known word processors, specifically to the 𝔼𝕏ℙ, Version 2.1, a powerful WYSIWYG mathematical word processor.

APA, Harvard, Vancouver, ISO, and other styles

43

Hansen, Jo-Ida C. "To Converge or Not to Converge: That Is the Question." Contemporary Psychology: A Journal of Reviews 40, no. 9 (1995): 904–5. http://dx.doi.org/10.1037/003987.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Cohen, T. "Medical and information technologies converge medical and information technologies converge." IEEE Engineering in Medicine and Biology Magazine 23, no. 3 (2004): 59–65. http://dx.doi.org/10.1109/memb.2004.1317983.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Argyros, Ioannis K., Samundra Regmi, Jinny Ann John, and Jayakumar Jayaraman. "Extended Convergence for Two Sixth Order Methods under the Same Weak Conditions." Foundations 3, no. 1 (2023): 127–39. http://dx.doi.org/10.3390/foundations3010012.

Full text

Abstract:

High-convergence order iterative methods play a major role in scientific, computational and engineering mathematics, as they produce sequences that converge and thereby provide solutions to nonlinear equations. The convergence order is calculated using Taylor Series extensions, which require the existence and computation of high-order derivatives that do not occur in the methodology. These results cannot, therefore, ensure that the method converges in cases where there are no such high-order derivatives. However, the method could converge. In this paper, we are developing a process in which bo

APA, Harvard, Vancouver, ISO, and other styles

46

Kumar Nayak, Sapan, and P. K. Parida. "Global convergence analysis of Caputo fractional Whittaker method with real world applications." Cubo (Temuco) 26, no. 1 (2024): 167–90. http://dx.doi.org/10.56754/0719-0646.2601.167.

Full text

Abstract:

The present article deals with the effect of convexity in the study of the well-known Whittaker iterative method, because an iterative method converges to a unique solution \(t^*\) of the nonlinear equation \(\psi(t)=0\) faster when the function's convexity is smaller. Indeed, fractional iterative methods are a simple way to learn more about the dynamic properties of iterative methods, i.e., for an initial guess, the sequence generated by the iterative method converges to a fixed point or diverges. Often, for a complex root search of nonlinear equations, the selective real initial guess fails

APA, Harvard, Vancouver, ISO, and other styles

47

Sadek, Jawad. "On the monotonicity behaviour of a generalised Fibonacci-type Sequence." Mathematical Gazette 109, no. 574 (2025): 34–38. https://doi.org/10.1017/mag.2025.6.

Full text

Abstract:

In [1], the authors presented a class of sequences generated by powers of the kth-order Fibonacci recurrence relation and showed that the sequences converge. Precisely, the following result was shown:Suppose that k ∈ Z+ and 0 < p < 1. Let x1, x2, …, xk be positive numbers. For n > k, let (1) Then {xn} converges to .

APA, Harvard, Vancouver, ISO, and other styles

48

MOON, WOOJIN. "Party Activists, Campaign Resources and Candidate Position Taking: Theory, Tests and Applications." British Journal of Political Science 34, no. 4 (2004): 611–33. http://dx.doi.org/10.1017/s0007123404000213.

Full text

Abstract:

Electoral competition is here specified as revolving around both candidate policy positions and non-policy issues.Two candidates spend their resources on non-policy issues to sway citizens' ideological voting decisions but they are constrained by their party activists who provide them with electoral resources. In this setting, a candidate with a resource advantage converges more towards the centre, but a candidate with a resource disadvantage diverges more from the centre. This asymmetry in two candidates' incentives to converge generates the result that the two candidates do not converge towa

APA, Harvard, Vancouver, ISO, and other styles

49

Berger, Josef, and Douglas Bridges. "Rearranging Series Constructively." JUCS - Journal of Universal Computer Science 15, no. (17) (2009): 3160–68. https://doi.org/10.3217/jucs-015-17-3160.

Full text

Abstract:

Riemann's theorems on the rearrangement of absolutely convergent and conditionally convergent series of real numbers are analysed within Bishop-style constructive mathematics. The constructive proof that every rearrangement of an absolutely convergent series has the same sum is relatively straightforward; but the proof that a conditionally convergent series can be rearranged to converge to whatsoever we please is a good deal more delicate in the constructive framework. The work in the paper answers affirmatively a question posed many years ago by Beeson.

APA, Harvard, Vancouver, ISO, and other styles

50

Fukuda, Naohiro, Tamotu Kinoshita, and Toshio Suzuki. "On the unconditional convergence of wavelet expansions for continuous functions." International Journal of Wavelets, Multiresolution and Information Processing 14, no. 01 (2016): 1650007. http://dx.doi.org/10.1142/s0219691316500077.

Full text

Abstract:

In this paper, we study the unconditional convergence of wavelet expansions with Lipschitz wavelets. Especially with the Strömberg wavelet, we shall construct a counter example which shows that uniformly convergent wavelet expansions even for continuous functions do not always converge unconditionally in [Formula: see text].

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!