996 resultados para Generic linear ODEs
Resumo:
Exam questions and solutions in PDF
Resumo:
Exercises and solutions in LaTex
Resumo:
Exercises and solutions in LaTex
Resumo:
Exam questions and solutions in PDF
Resumo:
Exam questions and solutions in LaTex
Resumo:
The Euler obstruction of a function f can be viewed as a generalization of the Milnor number for functions defined on singular spaces. In this work, using the Euler obstruction of a function, we establish several Lê–Greuel type formulas for germs f:(X,0)→(C,0) and g:(X,0)→(C,0). We give applications when g is a generic linear form and when f and g have isolated singularities.
Resumo:
Let G be a reductive complex Lie group acting holomorphically on normal Stein spaces X and Y, which are locally G-biholomorphic over a common categorical quotient Q. When is there a global G-biholomorphism X → Y? If the actions of G on X and Y are what we, with justification, call generic, we prove that the obstruction to solving this local-to-global problem is topological and provide sufficient conditions for it to vanish. Our main tool is the equivariant version of Grauert's Oka principle due to Heinzner and Kutzschebauch. We prove that X and Y are G-biholomorphic if X is K-contractible, where K is a maximal compact subgroup of G, or if X and Y are smooth and there is a G-diffeomorphism ψ : X → Y over Q, which is holomorphic when restricted to each fibre of the quotient map X → Q. We prove a similar theorem when ψ is only a G-homeomorphism, but with an assumption about its action on G-finite functions. When G is abelian, we obtain stronger theorems. Our results can be interpreted as instances of the Oka principle for sections of the sheaf of G-biholomorphisms from X to Y over Q. This sheaf can be badly singular, even for a low-dimensional representation of SL2(ℂ). Our work is in part motivated by the linearisation problem for actions on ℂn. It follows from one of our main results that a holomorphic G-action on ℂn, which is locally G-biholomorphic over a common quotient to a generic linear action, is linearisable.
Resumo:
2000 Mathematics Subject Classification: 26A33 (primary), 35S15 (secondary)
Resumo:
2000 Mathematics Subject Classification: 26A33 (primary), 35S15
Resumo:
This work is focussed on developing a commissioning procedure so that a Monte Carlo model, which uses BEAMnrc’s standard VARMLC component module, can be adapted to match a specific BrainLAB m3 micro-multileaf collimator (μMLC). A set of measurements are recommended, for use as a reference against which the model can be tested and optimised. These include radiochromic film measurements of dose from small and offset fields, as well as measurements of μMLC transmission and interleaf leakage. Simulations and measurements to obtain μMLC scatter factors are shown to be insensitive to relevant model parameters and are therefore not recommended, unless the output of the linear accelerator model is in doubt. Ultimately, this note provides detailed instructions for those intending to optimise a VARMLC model to match the dose delivered by their local BrainLAB m3 μMLC device.
Resumo:
Earthwork planning has been considered in this article and a generic block partitioning and modelling approach has been devised to provide strategic plans of various levels of detail. Conceptually this approach is more accurate and comprehensive than others, for instance those that are section based. In response to environmental concerns the metric for decision making was fuel consumption and emissions. Haulage distance and gradient are also included as they are important components of these metrics. Advantageously the fuel consumption metric is generic and captures the physical difficulties of travelling over inclines of different gradients, that is consistent across all hauling vehicles. For validation, the proposed models and techniques have been applied to a real world road project. The numerical investigations have demonstrated that the models can be solved with relatively little CPU time. The proposed block models also result in solutions of superior quality, i.e. they have reduced fuel consumption and cost. Furthermore the plans differ considerably from those based solely upon a distance based metric thus demonstrating a need for industry to reflect upon their current practices.
Resumo:
Stability analyses have been widely used to better understand the mechanism of traffic jam formation. In this paper, we consider the impact of cooperative systems (a.k.a. connected vehicles) on traffic dynamics and, more precisely, on flow stability. Cooperative systems are emerging technologies enabling communication between vehicles and/or with the infrastructure. In a distributed communication framework, equipped vehicles are able to send and receive information to/from other equipped vehicles. Here, the effects of cooperative traffic are modeled through a general bilateral multianticipative car-following law that improves cooperative drivers' perception of their surrounding traffic conditions within a given communication range. Linear stability analyses are performed for a broad class of car-following models. They point out different stability conditions in both multianticipative and nonmultianticipative situations. To better understand what happens in unstable conditions, information on the shock wave structure is studied in the weakly nonlinear regime by the mean of the reductive perturbation method. The shock wave equation is obtained for generic car-following models by deriving the Korteweg de Vries equations. We then derive traffic-state-dependent conditions for the sign of the solitary wave (soliton) amplitude. This analytical result is verified through simulations. Simulation results confirm the validity of the speed estimate. The variation of the soliton amplitude as a function of the communication range is provided. The performed linear and weakly nonlinear analyses help justify the potential benefits of vehicle-integrated communication systems and provide new insights supporting the future implementation of cooperative systems.
Resumo:
In this paper we propose a general Linear Programming (LP) based formulation and solution methodology for obtaining optimal solution to the load distribution problem in divisible load scheduling. We exploit the power of the versatile LP formulation to propose algorithms that yield exact solutions to several very general load distribution problems for which either no solutions or only heuristic solutions were available. We consider both star (single-level tree) networks and linear daisy chain networks, having processors equipped with front-ends, that form the generic models for several important network topologies. We consider arbitrary processing node availability or release times and general models for communication delays and computation time that account for constant overheads such as start up times in communication and computation. The optimality of the LP based algorithms is proved rigorously.