Search results for "Mathematica"
showing 10 items of 7971 documents
Finite element approximation of parabolic hemivariational inequalities
1998
In this paper we introduce a finite element approximation for a parabolic hemivariational initial boundary value problem. We prove that the approximate problem is solvable and its solutions converge on subsequences to the solutions of the continuous problem
Real-time clothoid approximation by Rational Bezier curves
2008
This paper presents a novel technique for implementing Clothoidal real-time paths for mobile robots. As first step, rational Bezier curves are obtained as approximation of the Fresnel integrals. By rescaling, rotating and translating the previously computed RBC, an on-line Clothoidal path is obtained. In this process, coefficients, weights and control points are kept invariant. This on-line approach guarantees that an RBC has the same behavior as the original Clothoid using a low curve order. The resulting Clothoidal path allows any two arbitrary poses to be joined in a plane. RBCs working as Clothoids are also used to search for the shortest bounded-curvature path with a significant comput…
Reduced complexity models in the identification of dynamical networks: Links with sparsification problems
2009
In many applicative scenarios it is important to derive information about the topology and the internal connections of more dynamical systems interacting together. Examples can be found in fields as diverse as Economics, Neuroscience and Biochemistry. The paper deals with the problem of deriving a descriptive model of a network, collecting the node outputs as time series with no use of a priori insight on the topology. We cast the problem as the optimization of a cost function operating a trade-off between accuracy and complexity in the final model. We address the problem of reducing the complexity by fixing a certain degree of sparsity, and trying to find the solution that “better” satisfi…
Convergence of KAM iterations for counterterm problems
1998
Abstract We analyse two iterative KAM methods for counterterm problems for finite-dimensional matrices. The starting point for these methods is the KAM iteration for Hamiltonians linear in the action variable in classical mechanics. We compare their convergence properties when a perturbation parameter is varied. The first method has no fixed points beyond a critical value of the perturbation parameter. The second one has fixed points for arbitrarily large perturbations. We observe different domains of attraction separated by Julia sets.
Arbitrarily shaped plates analysis via Line Element-Less Method (LEM)
2018
Abstract An innovative procedure is introduced for the analysis of arbitrarily shaped thin plates with various boundary conditions and under generic transverse loading conditions. Framed into Line Element-less Method, a truly meshfree method, this novel approach yields the solution in terms of the deflection function in a straightforward manner, without resorting to any discretization, neither in the domain nor on the boundary. Specifically, expressing the deflection function through a series expansion in terms of harmonic polynomials, it is shown that the proposed method requires only the evaluation of line integrals along the boundary parametric equation. Further, minimization of appropri…
On Functions of Integrable Mean Oscillation
2005
Given we denote by the modulus of mean oscillation given by where is an arc of , stands for the normalized length of , and . Similarly we denote by the modulus of harmonic oscillation given by where and stand for the Poisson kernel and the Poisson integral of respectively. It is shown that, for each , there exists such that
Branch-Price-and-Cut for the Soft-Clustered Capacitated Arc-Routing Problem
2021
The soft-clustered capacitated arc-routing problem (SoftCluCARP) is a variant of the classical capacitated arc-routing problem. The only additional constraint is that the set of required edges, that is, the streets to be serviced, is partitioned into clusters, and feasible routes must respect the soft-cluster constraint, that is, all required edges of the same cluster must be served by the same vehicle. In this article, we design an effective branch-price-and-cut algorithm for the exact solution of the SoftCluCARP. Its new components are a metaheuristic and branch-and-cut-based solvers for the solution of the column-generation subproblem, which is a profitable rural clustered postman tour …
New Heuristic Algorithms for the Windy Rural Postman Problem
2005
[EN] In this paper we deal with the windy rural postman problem. This problem generalizes several important arc routing problems and has interesting real-life applications. Here, we present several heuristics whose study has lead to the design of a scatter search algorithm for the windy rural postman problem. Extensive computational experiments over different sets of instances, with sizes up to 988 nodes and 3952 edges, are also presented. (c) 2004 Elsevier Ltd. All rights reserved.
A branch-and-cut algorithm for the Profitable Windy Rural Postman Problem
2016
[EN] In this paper we study the profitable windy rural postman problem. This is an arc routing problem with profits defined on a windy graph in which there is a profit associated with some of the edges of the graph, consisting of finding a route maximizing the difference between the total profit collected and the total cost. This problem generalizes the rural postman problem and other well-known arc routing problems and has real-life applications, mainly in snow removal operations. We propose here a formulation for the problem and study its associated polyhedron. Several families of facet-inducing inequalities are described and used in the design of a branch-and-cut procedure. The algorithm…
The Windy clustered prize-collecting arc-routing problem
2011
This paper introduces the windy clustered prize-collecting arc-routing problem. It is an arc-routing problem where each demand edge is associated with a profit that is collected once if the edge is serviced, independent of the number of times the edge is traversed. It is further required that if a demand edge is serviced, then all the demand edges of its component are also serviced. A mathematical programming formulation is given and some polyhedral results including several facet-defining and valid inequalities are presented. The separation problem for the different families of inequalities is studied. Numerical results from computational experiments are analyzed. © 2011 INFORMS.