Introduction to Scientific Programming: Computational Problem Solving Using Maple and C.

Zachary, Joseph L.; Cook, David M.

doi:10.1119/1.18778

Cited by 10 publications

(13 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore the algorithm shown in Fig. 1 was developed (many other algorithms, for example according to the bisection method [19], may be possible).…”

Section: Capacity Value Calculationmentioning

confidence: 99%

Capacity Value of Wind Power, Calculation, and Data Requirements: the Irish Power System Case

Hasche

Keane

O’Malley

2011

IEEE Trans. Power Syst.

107

View full text Add to dashboard Cite

Abstract-The capacity value of wind power indicates the extent to which wind power contributes to the generation system adequacy of a power system. The related data requirements may be subject to difficulties due to the temporal variability and spatial distribution of wind power in connection with the limited databases currently available. This paper presents a methodology to identify the minimal amount of data required for reliable studies. Based on wind power data of 74 stations in Ireland, covering up to 10 years, the effects of different numbers of stations and different time periods of data on the capacity value are analysed. The calculations are performed by means of a fast calculation code. The results show that at least 4 to 5 years of data in an hourly resolution are necessary for reliable studies and that 40 to 50 evenly distributed stations give an acceptable representation of the total wind power generation in Ireland.

show abstract

“…Therefore the algorithm shown in Fig. 1 was developed (many other algorithms, for example according to the bisection method [19], may be possible).…”

Section: Capacity Value Calculationmentioning

confidence: 99%

Capacity Value of Wind Power, Calculation, and Data Requirements: the Irish Power System Case

Hasche

Keane

O’Malley

2011

IEEE Trans. Power Syst.

107

View full text Add to dashboard Cite

show abstract

“…Then, by substituting Equations (23), (24), (26) and (28) in Equation (22), we obtain the following optimal asymptotical error constant term:…”

Section: Construction Of the Familymentioning

confidence: 99%

An Efficient Family of Optimal Eighth-Order Multiple Root Finders

2018

View full text Add to dashboard Cite

Finding a repeated zero for a nonlinear equation f (x) = 0, f : I ⊆ R → R has always been of much interest and attention due to its wide applications in many fields of science and engineering. Modified Newton's method is usually applied to solve this kind of problems. Keeping in view that very few optimal higher-order convergent methods exist for multiple roots, we present a new family of optimal eighth-order convergent iterative methods for multiple roots with known multiplicity involving a multivariate weight function. The numerical performance of the proposed methods is analyzed extensively along with the basins of attractions. Real life models from life science, engineering, and physics are considered for the sake of comparison. The numerical experiments and dynamical analysis show that our proposed methods are efficient for determining multiple roots of nonlinear equations.

show abstract

“…are independent of α j 's and β j 's where j = i, this set of equations can be solved numerically (e.g., using a bisection method [21]). …”

Section: Dynamic Client Configurationmentioning

confidence: 99%

Adaptive hash routing for a cluster of client-side web proxies

Tang¹,

Chanson²

2004

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

Hash routing reduces cache misses for a cluster of web proxies by eliminating the duplication of cache contents. In this paper, we investigate the optimization of hash routing performance by dynamically adapting object and DNS allocations to the traffic pattern. An analytical model is developed for hash routing that takes into consideration the original request distribution, the object allocation strategy, the speeds of the proxies and the cache hit ratios. Based on this model, the optimal hash routing problem is studied. The analytical results are applied to the design of two adaptive hash routing schemes: ADA-OBJ optimizes object allocation under static client configuration, and ADA-OBJ/DNS optimizes both object and DNS allocations under dynamic client configuration. Trace-driven simulation experiments have been conducted to evaluate the performance of the proposed schemes. The results show that they significantly outperform the intuitive static hash routing scheme based only on the speeds of the proxies.

show abstract

Introduction to Scientific Programming: Computational Problem Solving Using Maple and C.

Cited by 10 publications

References 0 publications

Capacity Value of Wind Power, Calculation, and Data Requirements: the Irish Power System Case

Capacity Value of Wind Power, Calculation, and Data Requirements: the Irish Power System Case

An Efficient Family of Optimal Eighth-Order Multiple Root Finders

Adaptive hash routing for a cluster of client-side web proxies

Contact Info

Product

Resources

About