129 resultados para Proximal Point Algorithm


Relevância:

20.00% 20.00%

Publicador:

Resumo:

We investigate difference equations which arise as discrete approximations to two-point boundary value problems for systems of second-order, ordinary differential equations. We formulate conditions under which all solutions to the discrete problem satisfy certain a priori bounds which axe independent of the step-size. As a result, the nonexistence of spurious solutions are guaranteed. Some existence and convergence theorems for solutions to the discrete problem are also presented. (C) 2002 Elsevier Science Ltd. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Most species of lizards will shed their tails at the point of contact when grasped by a predator. We investigated the energetic consequences of tail loss by measuring lipids in a scincid lizard that stores energy in its tail for reproduction. Most of the lipids were concentrated in the proximal portion of the tail. Thus, partial tail loss may not severely affect energy stores if the distal portion of the tail is shed in predatory encounters. We also found that the width of the tail was a reliable non-invasive index of energy reserves in this species. (C) 2003 Elsevier Science Inc. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The Lanczos algorithm is appreciated in many situations due to its speed. and economy of storage. However, the advantage that the Lanczos basis vectors need not be kept is lost when the algorithm is used to compute the action of a matrix function on a vector. Either the basis vectors need to be kept, or the Lanczos process needs to be applied twice. In this study we describe an augmented Lanczos algorithm to compute a dot product relative to a function of a large sparse symmetric matrix, without keeping the basis vectors.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Most finite element packages use the Newmark algorithm for time integration of structural dynamics. Various algorithms have been proposed to better optimize the high frequency dissipation of this algorithm. Hulbert and Chung proposed both implicit and explicit forms of the generalized alpha method. The algorithms optimize high frequency dissipation effectively, and despite recent work on algorithms that possess momentum conserving/energy dissipative properties in a non-linear context, the generalized alpha method remains an efficient way to solve many problems, especially with adaptive timestep control. However, the implicit and explicit algorithms use incompatible parameter sets and cannot be used together in a spatial partition, whereas this can be done for the Newmark algorithm, as Hughes and Liu demonstrated, and for the HHT-alpha algorithm developed from it. The present paper shows that the explicit generalized alpha method can be rewritten so that it becomes compatible with the implicit form. All four algorithmic parameters can be matched between the explicit and implicit forms. An element interface between implicit and explicit partitions can then be used, analogous to that devised by Hughes and Liu to extend the Newmark method. The stability of the explicit/implicit algorithm is examined in a linear context and found to exceed that of the explicit partition. The element partition is significantly less dissipative of intermediate frequencies than one using the HHT-alpha method. The explicit algorithm can also be rewritten so that the discrete equation of motion evaluates forces from displacements and velocities found at the predicted mid-point of a cycle. Copyright (C) 2003 John Wiley Sons, Ltd.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This article presents Monte Carlo techniques for estimating network reliability. For highly reliable networks, techniques based on graph evolution models provide very good performance. However, they are known to have significant simulation cost. An existing hybrid scheme (based on partitioning the time space) is available to speed up the simulations; however, there are difficulties with optimizing the important parameter associated with this scheme. To overcome these difficulties, a new hybrid scheme (based on partitioning the edge set) is proposed in this article. The proposed scheme shows orders of magnitude improvement of performance over the existing techniques in certain classes of network. It also provides reliability bounds with little overhead.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This article is concerned primarily with an examination and comparison of select aspects of the model international consumer protection laws proposed by the United Nations (UN), the European Union (EU), and the Organisation for Economic Co-operation and Development (OECD), using the Trade Practices Act 1974 (Australia) as a basis for examination and comparison. As a secondary consideration, it also broadly examines the content of, and differences between, the model laws. The motive for this article is that any future enforceable international consumer protection regime (possibly in the form of an international treaty or convention) would need to take into account the UN, EU and OECD guidelines. A cross-comparison of those model laws, and a comparison of them with the consumer protection provisions of a well established national consumer protection law, should provide a useful starting point for the development of such a regime. The 'select aspects' of the model laws in question are the various provisions of those laws which could relate to situations involving the wrong delivery or non-delivery of goods.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A Combined Genetic Algorithm and Method of Moments design methods is presented for the design of unusual near-field antennas for use in Magnetic Resonance Imaging systems. The method is successfully applied to the design of an asymmetric coil structure for use at 190MHz and demonstrates excellent radiofrequency field homogeneity.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Difference equations which may arise as discrete approximations to two-point boundary value problems for systems of second-order, ordinary differential equations are investigated and conditions are formulated under which solutions to the discrete problem are unique. Some existence, uniqueness implies existence, and convergence theorems for solutions to the discrete problem are also presented.