Dissertationen: „Linear and non-linear problems“

1

Minne, Andreas. „Non-linear Free Boundary Problems“. Doctoral thesis, KTH, Matematik (Avd.), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-178110.

Der volle Inhalt der Quelle

Annotation:

This thesis consists of an introduction and four research papers related to free boundary problems and systems of fully non-linear elliptic equations. Paper A and Paper B prove optimal regularity of solutions to general elliptic and parabolic free boundary problems, where the operators are fully non-linear and convex. Furthermore, it is proven that the free boundary is continuously differentiable around so called "thick" points, and that the free boundary touches the fixed boundary tangentially in two dimensions. Paper C analyzes singular points of solutions to perturbations of the unstable obstacle problem, in three dimensions. Blow-up limits are characterized and shown to be unique. The free boundary is proven to lie close to the zero-level set of the corresponding blow-up limit. Finally, the structure of the singular set is analyzed. Paper D discusses an idea on how existence and uniqueness theorems concerning quasi-monotone fully non-linear elliptic systems can be extended to systems that are not quasi-monotone.

QC 20151210

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Wokiyi, Dennis. „Non-linear inverse geothermal problems“. Licentiate thesis, Linköpings universitet, Matematik och tillämpad matematik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-143031.

Der volle Inhalt der Quelle

Annotation:

The inverse geothermal problem consist of estimating the temperature distribution below the earth’s surface using temperature and heat-flux measurements on the earth’s surface. The problem is important since temperature governs a variety of the geological processes including formation of magmas, minerals, fosil fuels and also deformation of rocks. Mathematical this problem is formulated as a Cauchy problem for an non-linear elliptic equation and since the thermal properties of the rocks depend strongly on the temperature, the problem is non-linear. This problem is ill-posed in the sense that it does not satisfy atleast one of Hadamard’s definition of well-posedness. We formulated the problem as an ill-posed non-linear operator equation which is defined in terms of solving a well-posed boundary problem. We demonstrate existence of a unique solution to this well-posed problem and give stability estimates in appropriate function spaces. We show that the operator equation is well-defined in appropriate function spaces. Since the problem is ill-posed, regularization is needed to stabilize computations. We demostrate that Tikhonov regularization can be implemented efficiently for solving the operator equation. The algorithm is based on having a code for solving a well- posed problem related to the operator equation. In this study we demostrate that the algorithm works efficiently for 2D calculations but can also be modified to work for 3D calculations.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Edlund, Ove. „Solution of linear programming and non-linear regression problems using linear M-estimation methods /“. Luleå, 1999. http://epubl.luth.se/1402-1544/1999/17/index.html.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Toutip, Wattana. „The dual reciprocity boundary element method for linear and non-linear problems“. Thesis, University of Hertfordshire, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.369302.

Der volle Inhalt der Quelle

Annotation:

A problem encountered in the boundary element method is the difficulty caused by corners and/or discontinuous boundary conditions. An existing code using standard linear continuous elements is modified to overcome such problems using the multiple node method with an auxiliary boundary collocation approach. Another code is implemented applying the gradient approach as an alternative to handle such problems. Laplace problems posed on variety of domain shapes have been introduced to test the programs. For Poisson problems the programs have been developed using a transformation to a Laplace problem. This method cannot be applied to solve Poissontype equations. The dual reciprocity boundary element method (DRM) which is a generalised way to avoid domain integrals is introduced to solve such equations. The gradient approach to handle corner problems is co-opted in the program using DRM. The program is modified to solve non-linear problems using an iterative method. Newton's method is applied in the program to enhance the accuracy of the results and reduce the number of iterations. The program is further developed to solve coupled Poisson-type equations and such a formulation is considered for the biharmonic problems. A coupled pair of non-linear equations describing the ohmic heating problem is also investigated. Where appropriate results are compared with those from reference solutions or exact solutions. v

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

McKay, Barry. „Wrinkling problems for non-linear elastic membranes“. Thesis, University of Glasgow, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.307187.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Baek, Kwang-Hyun. „Non-linear optimisation problems in active control“. Thesis, University of Southampton, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.243131.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Garcia, Francisco Javier. „THREE NON-LINEAR PROBLEMS ON NORMED SPACES“. Kent State University / OhioLINK, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=kent1171042141.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Sorour, Ahmed El-Sayed. „Some problems in non-linear open loop systems“. Thesis, University of Kent, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.279420.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Shikongo, Albert. „Numerical Treatment of Non-Linear singular pertubation problems“. Thesis, Online access, 2007. http://etd.uwc.ac.za/usrfiles/modules/etd/docs/etd_gen8Srv25Nme4_3831_1257936459.pdf.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Ruggeri, Felipe. „A higher order time domain panel method for linear and weakly non linear seakeeping problems“. Universidade de São Paulo, 2016. http://www.teses.usp.br/teses/disponiveis/3/3135/tde-09122016-074844/.

Der volle Inhalt der Quelle

Annotation:

This thesis addresses the development of a weakly non-linear Higher Order Time Domain Rankine Panel Method (TDRPM) for the linear and weakly non-linear seakeeping analysis of floating offshore structures, including wave-current interaction effects. A higher order boundary elements method is adopted based on the body geometry description using Non-uniform Rational B-splines (NURBS) formulation, which can be generated by many standard Computed Aided Design (CAD) softwares widely available, and the several computed quantities (velocity potential, free surface elevation and others) are described using a B-spline formulation of arbitrary degree. The problem is formulated considering wave-current-body interactions up to second order effects, these ones considering the terms obtained by interaction of zero/first order quantities. In order to provide numerical stability, the Initial Boundary Value Problem (IBVP) is formulated in terms of the velocity potential and the local acceleration potential, the later used to predict the hydrodynamic pressure accurately. The zeroth order problem is solved using the double-body linearization instead of the Neumman-Kelvin one in order to allow bluff bodies simulation, leading to very complex expressions regarding the m-terms computation. The method adopts the Rankine sources as Green\'s function, which are integrated using Gauss quadrature in the entire domain, but for the self-influence terms that are integrated using a desingularized procedure. The numerical method is verified initially considering simplified geometries (sphere and circular cylinder) for both, first and second-order computations, with and without current effects. The derivatives of the velocity potential are verified by comparing the numerical m-terms to the analytical solutions for a hemisphere under uniform flow. The mean and double frequency drift forces are computed for fixed and floating structures and the quantities involved in these computations (wave runup, velocity field) are also compared to literature results, including the free floating response of a sphere under current effects. Two practical cases are also studied, namely the wave-induced second order responses of a semi-submersible platform and the wavedrift-damping effect evaluated through the equilibrium angle of a turret moored FPSO. For the former, some specific model tests were designed and conducted in a wave-basin.
Essa tese aborda o desenvolvimento de um método de Rankine de ordem alta no domínio do tempo (TDRPM) para o estudo de problemas lineares e fracamente não lineares, incluindo o efeito de corrente, envolvendo sistemas flutuantes. O método de ordem alta desenvolvido considera a geometria do corpo como descrita pelo padrão Non-uniform Rational Basis Spline (NURBS), que está disponível em diverso0s softwares de Computed Aided Design (CAD) disponíveis, sendo as diversas funções (potencial de velocidades, elevação da superfície-livre e outros) descritos usando B-splines de grau arbitrário. O problema é formulado considerando interações onda-corrente-estrutura para efeitos de até segunda ordem, os de ordem superior sendo calculados considerando as interações somente dos termos de ordem inferior. Para garantir a estabilidade numérica, o problema de contorno com valor inicial é formulado0 com relação ao potencial de velocidade e de parcela local do potencial de acelerações, este para garantir cálculos precisos da pressão dinâmica. O problema de ordem zero é resolvido usando a linearização de corpo-duplo ao invés da linearização de Neumman-Kelvin para permitir a análise de corpos rombudos, o que requer o cálculo de termos-m de grande complexidade. O método adota fontes de Rankine como funções de Green, que são integradas através de quadratura de Gauss-Legendre no domínio todo, exceto com relação aos termos de auto-influência que adotasm um procedimento de dessingularização. O método numérico é inicialmente verificado considerando corpos de geometria simplificada (esfera e cilindro), considerando efeitos de primeira e segunda ordens, com e sem corrente. As derivadas do potencial de velocidade são verificadas comparando os termos-m obtidos numericamente com soluções analíticas disponíveis para a esfera em fluído infinito. As forças de deriva média e dupla-frequência são calculadas para estruturas fixas e flutuantes, sendo as funções calculadas (elevação da superfície, campo de velocidade) comparadas com resultados disponíveis na literatura, incluindo o movimento da esfera flutuante sob a ação de corrente e ondas. São também estudados dois casos de aplicação prática, a resposta de segunda ordem de uma plataforma semi-submersível e o efeito de wave-drift damping para o ângulo de equilíbrio de uma plataforma FPSO ancorada através de sistema turred. No caso da semi-submersível, os ensaios foram projetados e realizados em tanque de provas.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

11

Jonsson, Karl. „Two Problems in non-linear PDE’s with Phase Transitions“. Licentiate thesis, KTH, Matematik (Avd.), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-223562.

Der volle Inhalt der Quelle

Annotation:

This thesis is in the field of non-linear partial differential equations (PDE), focusing on problems which show some type of phase-transition. A single phase Hele-Shaw flow models a Newtoninan fluid which is being injected in the space between two narrowly separated parallel planes. The time evolution of the space that the fluid occupies can be modelled by a semi-linear PDE. This is a problem within the field of free boundary problems. In the multi-phase problem we consider the time-evolution of a system of phases which interact according to the principle that the joint boundary which emerges when two phases meet is fixed for all future times. The problem is handled by introducing a parameterized equation which is regularized and penalized. The penalization is non-local in time and tracks the history of the system, penalizing the joint support of two different phases in space-time. The main result in the first paper is the existence theory of a weak solution to the parameterized equations in a Bochner space using the implicit function theorem. The family of solutions to the parameterized problem is uniformly bounded allowing us to extract a weakly convergent subsequence for the case when the penalization tends to infinity. The second problem deals with a parameterized highly oscillatory quasi-linear elliptic equation in divergence form. As the regularization parameter tends to zero the equation gets a jump in the conductivity which occur at the level set of a locally periodic function, the obstacle. As the oscillations in the problem data increases the solution to the equation experiences high frequency jumps in the conductivity, resulting in the corresponding solutions showing an effective global behaviour. The global behavior is related to the so called homogenized solution. We show that the parameterized equation has a weak solution in a Sobolev space and derive bounds on the solutions used in the analysis for the case when the regularization is lost. Surprisingly, the limiting problem in this case includes an extra term describing the interaction between the solution and the obstacle, not appearing in the case when obstacle is the zero level-set. The oscillatory nature of the problem makes standard numerical algorithms computationally expensive, since the global domain needs to be resolved on the micro scale. We develop a multi scale method for this problem based on the heterogeneous multiscale method (HMM) framework and using a finite element (FE) approach to capture the macroscopic variations of the solutions at a significantly lower cost. We numerically investigate the effect of the obstacle on the homogenized solution, finding empirical proof that certain choices of obstacles make the limiting problem have a form structurally different from that of the parameterized problem.

QC 20180222

APA, Harvard, Vancouver, ISO und andere Zitierweisen

12

Yagoob, Muhammad Moeen. „Computationally efficient algorithms for non-linear target tracking problems“. Thesis, Imperial College London, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.499109.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

13

Sustar, Tomaz. „A solution approach to non-linear multi-field problems“. Thesis, Swansea University, 2002. https://cronfa.swan.ac.uk/Record/cronfa42573.

Der volle Inhalt der Quelle

Annotation:

In this work a solution approach for non-linear multi-filed problems is presented. The approach is based on co-operative usage of several advanced techniques inside a single environment instead of combining several different systems. The objective of this work is to demonstrate the applicability of advanced computational techniques to complex numerical problems and to present advantages of a co-operative solution environment in the development of finite elements. The solution environment, implemented in Mathematica, consists of a symbolic code generator - AceGen, a package of prearranged modules for the automatic creation of the interfaces between the generated code and specific finite element environment - Computational Templates and a model finite element environment called Finite Element Driver. Within the scope of this work the ANSI C version of Finite Element Driver - CDriver was developed and used for numerical evaluation throughout the work. The CDriver is fully integrated with Mathematica and it provides high numerical efficiency to the environment. The solution approach is demonstrated on magneto-thermo-mechanical problem of inductive heat treatment. First the high abstract formulation level, which is required for efficient symbolic description, was introduced. Following the general formulation the models of individual magnetic, thermal and displacement fields were derived. After the individual fields model were verified the magneto-thermal and magneto- thermo-mechanical problems were formulated and derived. Both non-linear multi- filed models were verified using analytical solutions and numerical convergence tests. Different multi-filed solution strategies were applied to numerical examples and their performance issues were studied using the magneto-thermo-mechanical model. Finally the large scale numerical example of inductive heat treatment was solved.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

14

Ray, Aparna. „Some Non-linear Problems of thin Plates and Shells“. Thesis, University of North Bengal, 1998. http://hdl.handle.net/123456789/1614.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

15

Mayger, E. M. „Superspace calculations and techniques for non-linear field theories“. Thesis, University of Cambridge, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.384546.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

16

Bai, Xianglan. „Non-Krylov Non-iterative Subspace Methods For Linear Discrete Ill-posed Problems“. Kent State University / OhioLINK, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=kent1627042947894919.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

17

Kuang, Jinbo. „Finite element analysis of transient non-linear coupled field problems“. Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape4/PQDD_0016/NQ53723.pdf.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

18

Drexler, Michael. „Newton's method as a global solver for non-linear problems“. Thesis, University of Oxford, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.360197.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

19

Abdulaziz, Ali Ahmed. „Neural-based controller development for solving non-linear control problems“. Thesis, University of Newcastle Upon Tyne, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.260976.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

20

Han, F. S. „Non-linear free surface problems using the boundary element method“. Thesis, University of Manchester, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.378300.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

21

Loines, J. „Boundary integral equation methods for problems in non-linear magnetostatics“. Thesis, Imperial College London, 1985. http://hdl.handle.net/10044/1/37768.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

22

Johnson, I. W. „Moving finite elements for diffusion problems“. Thesis, University of Reading, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.373470.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

23

Al-Edani, Ameen Ahmed Nassar. „Efficient fracture mechanics programming system for linear and non-linear problems using finite-element and boundary-element methods“. Thesis, Cranfield University, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.276169.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

24

Greven, Sonja. „Non-standard problems in inference for additive and linear mixed models“. Göttingen Cuvillier, 2007.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

25

Vogt, Pascal. „Catalytic superprocesses, collision local times and non-linear boundary value problems“. Thesis, University of Bath, 2003. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.426145.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

26

Kumar, Manish. „Converting some global optimization problems to mixed integer linear problems using piecewise linear approximations“. Diss., Rolla, Mo. : University of Missouri-Rolla, 2007. http://scholarsmine.umr.edu/thesis/pdf/Kumar_09007dcc803c8e68.pdf.

Der volle Inhalt der Quelle

Annotation:

Thesis (M.S.)--University of Missouri--Rolla, 2007.
Vita. The entire thesis text is included in file. Title from title screen of thesis/dissertation PDF file (viewed December 7, 2007) Includes bibliographical references (p. 28).

APA, Harvard, Vancouver, ISO und andere Zitierweisen

27

Tu, Zhiqi. „Enhancements of the Non-linear Knapsack Cryptosystem“. Thesis, University of Canterbury. Computer Science and Software Engineering, 2006. http://hdl.handle.net/10092/1080.

Der volle Inhalt der Quelle

Annotation:

Nowadays all existing public key cryptosystems are classified into three categories relied on different mathematical foundations. The first one is based on the difficulty of factoring the product of two big prime numbers. The representatives are the RSA and the Rabin cryptosystems. The second one such as the ElGamal cryptosystem is based on the discrete logarithm problem. The last one is based on the NP-completeness of the knapsack problem. The first two categories survived crypto attacks, whereas the last one was broken and there has been no attempt to use such a cryptosystem. In order to save the last category, Kiriyama proposed a new public key cryptosystem based on the non-linear knapsack problem, which is an NP-complete problem. Due to the non-linear property of the non-linear knapsack problem, this system resists all known attacks to the linear knapsack problem. Based on his work, we extend our research in several ways. Firstly, we propose an encrypted secret sharing scheme. We improve the security of shares by our method over other existing secret sharing schemes. Simply speaking, in our scheme, it would be hard for outsiders to recover a secret even if somehow they could collect all shares, because each share is already encrypted when it is generated. Moreover, our scheme is efficient. Then we propose a multiple identities authentication scheme, developed on the basis of the non-linear knapsack scheme. It verifies the ownership of an entity's several identities in only one execution of our scheme. More importantly, it protects the privacy of the entities from outsiders. Furthermore, it can be used in resource-constrained devices due to low computational complexity. We implement the above schemes in the C language under the Linux system. The experimental results show the high efficiency of our schemes, due to low computational complexity of the non-linear knapsack problem, which works as the mathematical foundation of our research.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

28

Yaakub, Abdul Razak Bin. „Computer solution of non-linear integration formula for solving initial value problems“. Thesis, Loughborough University, 1996. https://dspace.lboro.ac.uk/2134/25381.

Der volle Inhalt der Quelle

Annotation:

This thesis is concerned with the numerical solutions of initial value problems with ordinary differential equations and covers single step integration methods. focus is to study the numerical the various aspects of Specifically, its main methods of non-linear integration formula with a variety of means based on the Contraharmonic mean (C.M) (Evans and Yaakub [1995]), the Centroidal mean (C.M) (Yaakub and Evans [1995]) and the Root-Mean-Square (RMS) (Yaakub and Evans [1993]) for solving initial value problems. the applications of the second It includes a study of order C.M method for parallel implementation of extrapolation methods for ordinary differential equations with the ExDaTa schedule by Bahoshy [1992]. Another important topic presented in this thesis is that a fifth order five-stage explicit Runge Kutta method or weighted Runge Kutta formula [Evans and Yaakub [1996]) exists which is contrary to Butcher [1987] and the theorem in Lambert ([1991] ,pp 181). The thesis is organized as follows. An introduction to initial value problems in ordinary differential equations and parallel computers and software in Chapter 1, the basic preliminaries and fundamental concepts in mathematics, an algebraic manipulation package, e.g., Mathematica and basic parallel processing techniques are discussed in Chapter 2. Following in Chapter 3 is a survey of single step methods to solve ordinary differential equations. In this chapter, several single step methods including the Taylor series method, Runge Kutta method and a linear multistep method for non-stiff and stiff problems are also considered. Chapter 4 gives a new Runge Kutta formula for solving initial value problems using the Contraharmonic mean (C.M), the Centroidal mean (C.M) and the Root-MeanSquare (RMS). An error and stability analysis for these variety of means and numerical examples are also presented. Chapter 5 discusses the parallel implementation on the Sequent 8000 parallel computer of the Runge-Kutta contraharmonic mean (C.M) method with extrapolation procedures using explicit assignment scheduling Kutta RK(4, 4) method (EXDATA) strategies. A is introduced and the data task new Rungetheory and analysis of its properties are investigated and compared with the more popular RKF(4,5) method, are given in Chapter 6. Chapter 7 presents a new integration method with error control for the solution of a special class of second order ODEs. In Chapter 8, a new weighted Runge-Kutta fifth order method with 5 stages is introduced. By comparison with the currently recommended RK4 ( 5) Merson and RK5(6) Nystrom methods, the new method gives improved results. Chapter 9 proposes a new fifth order Runge-Kutta type method for solving oscillatory problems by the use of trigonometric polynomial interpolation which extends the earlier work of Gautschi [1961]. An analysis of the convergence and stability of the new method is given with comparison with the standard Runge-Kutta methods. Finally, Chapter 10 summarises and presents conclusions on the topics discussed throughout the thesis.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

29

Croxton, Keely L., Bernard Gendon und Thomas L. Magnanti. „A Comparison of Mixed-Integer Programming Models for Non-Convex Piecewise Linear Cost Minimization Problems“. Massachusetts Institute of Technology, Operations Research Center, 2002. http://hdl.handle.net/1721.1/5233.

Der volle Inhalt der Quelle

Annotation:

We study a generic minimization problem with separable non-convex piecewise linear costs, showing that the linear programming (LP) relaxation of three textbook mixed integer programming formulations each approximates the cost function by its lower convex envelope. We also show a relationship between this result and classical Lagrangian duality theory.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

30

Espinoza, García Juan Carlos. „Robust optimization for discrete structures and non-linear impact of uncertainty“. Thesis, Cergy-Pontoise, Ecole supérieure des sciences économiques et commerciales, 2017. http://www.theses.fr/2017ESEC0004/document.

Der volle Inhalt der Quelle

Annotation:

L’objectif de cette thèse est de proposer des solutions efficaces à des problèmes de décision qui ont un impact sur la vie des citoyens, et qui reposent sur des données incertaines. Au niveau des applications, nous nous intéressons à deux problèmes de localisation qui ont un impact sur l’espace public, notamment la localisation de nouveaux logements, et la localisation de vendeurs mobiles dans l’espace urbain. Les problèmes de localisation ne sont pas un sujet récent dans la littérature, toutefois, pour ces deux problèmes qui reposent sur des modèles de choix pour le comportement d’achat des consommateurs, l’incertitude dans le modèle génère un cas spécial qui permet d’étendre la littérature sur l’Optimisation Robuste. Les contributions de cette thèse peuvent s’appliquer à divers problèmes génériques d’optimisation
We address decision problems under uncertain information with non-linear structures of parameter variation, and devise solution methods in the spirit of Bertsimas and Sim’s Γ-Robustness approach. Furthermore, although the non-linear impact of uncertainty often introduces discrete structures to the problem, for tractability, we provide the conditions under which the complexity class of the nominal model is preserved for the robust counterpart. We extend the Γ-Robustness approach in three avenues. First, we propose a generic case of non-linear impact of parameter variation, and model it with a piecewise linear approximation of the impact function. We show that the subproblem of determining the worst-case variation can be dualized despite the discrete structure of the piece-wise function. Next, we built a robust model for the location of new housing where the non-linearity is introduced by a choice model, and propose a solution combining Γ-Robustness with a scenario-based approach. We show that the subproblem is tractable and leads to a linear formulation of the robust problem. Finally, we model the demand in a Location Problem through a Poisson Process inducing, when demands are uncertain, non-linear structures of parameter variation. We propose the concept of Nested Uncertainty Budgets to manage uncertainty in a tractable way through a hierarchical structure and, under this framework, obtain a subproblem that includes both continuous and discrete deviation variables

APA, Harvard, Vancouver, ISO und andere Zitierweisen

31

Ang, W. T. „Some crack problems in linear elasticity /“. Title page, table of contents and summary only, 1987. http://web4.library.adelaide.edu.au/theses/09PH/09pha581.pdf.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

32

Higham, N. J. „Nearness problems in numerical linear algebra“. Thesis, University of Manchester, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.374580.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

33

Austin, D. M. „On two problems in linear elasticity“. Thesis, University of Manchester, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.378026.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

34

Yodpinyanee, Anak. „Sub-linear algorithms for graph problems“. Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/120411.

Der volle Inhalt der Quelle

Annotation:

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 189-199).
In the face of massive data sets, classical algorithmic models, where the algorithm reads the entire input, performs a full computation, then reports the entire output, are rendered infeasible. To handle these data sets, alternative algorithmic models are suggested to solve problems under the restricted, namely sub-linear, resources such as time, memory or randomness. This thesis aims at addressing these limitations on graph problems and combinatorial optimization problems through a number of different models. First, we consider the graph spanner problem in the local computation algorithm (LCA) model. A graph spanner is a subgraph of the input graph that preserves all pairwise distances up to a small multiplicative stretch. Given a query edge from the input graph, the LCA explores a sub-linear portion of the input graph, then decides whether to include this edge in its spanner or not - the answers to all edge queries constitute the output of the LCA. We provide the first LCA constructions for 3 and 5-spanners of general graphs with almost optimal trade-offs between spanner sizes and stretches, and for fixed-stretch spanners of low maximum-degree graphs. Next, we study the set cover problem in the oracle access model. The algorithm accesses a sub-linear portion of the input set system by probing for elements in a set, and for sets containing an element, then computes an approximate minimum set cover: a collection of an approximately-minimum number of sets whose union includes all elements. We provide probe-efficient algorithms for set cover, and complement our results with almost tight lower bound constructions. We further extend our study to the LP-relaxation variants and to the streaming setting, obtaining the first streaming results for the fractional set cover problem. Lastly, we design local-access generators for a collection of fundamental random graph models. We demonstrate how to generate graphs according to the desired probability distribution in an on-the-fly fashion. Our algorithms receive probes about arbitrary parts of the input graph, then construct just enough of the graph to answer these probes, using only polylogarithmic time, additional space and random bits per probe. We also provide the first implementation of random neighbor probes, which is a basic algorithmic building block with applications in various huge graph models.
by Anak Yodpinyanee.
Ph. D.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

35

Chonev, Ventsislav. „Reachability problems for linear dynamical systems“. Thesis, University of Oxford, 2015. https://ora.ox.ac.uk/objects/uuid:e73d1a5b-edce-4e1d-a593-fd8df7e2a817.

Der volle Inhalt der Quelle

Annotation:

The object of principal interest in this thesis is linear dynamical systems: deterministic systems which evolve under a linear operator. They are specified by an initial state set I, contained in ℝ^m, and a real m-by-m evolution matrix A. We distinguish two varieties of linear dynamical systems: discrete-time and continuous-time. In the discrete-time setting, the state x(n) of the system at time n for natural n is governed by the difference equation x(n)=Ax(n-1). Similarly, in the continuous case, the state x(t) at real, non-negative times t is determined by a system of first-order linear differential equations: x'(t) = Ax(t). In both cases, x(0) lies in I. Throughout this thesis, we will be interested in the Reachability Problem for linear dynamical systems, which may be formulated in a general way as follows: given a target set T contained in ℝ^m and a (discrete- or continuous-time) linear dynamical system specified by the evolution matrix A and the set of initial states I, determine whether for all x(0) in I, starting from x(0), the system will eventually be in a state which lies in T. In order to make the decision problem well-defined, one must first fix an admissible class of initial sets and, similarly, a class of target sets of interest. For the purposes of expressing the problem instance, it is also necessary to restrict the domain of the input data to a subset of the reals which may be represented effectively, such as the rational numbers or the algebraic numbers. As we vary the choice of domain, the types of initial and target sets under consideration and the discreteness of time, a rich landscape of decision problems emerges. The goal of the present thesis is to explore pointwise reachability problems, that is, reachability from a single initial state. Under the assumption that I consists of a single point in ℝ^m provided as part of the input data, we will study reachability to polyhedral targets, in the context of both discrete- and continuous-time linear dynamical systems. We prove both upper complexity bounds and hardness results, employing in the process a wide-ranging arsenal of techniques and mathematical tools. We rely on powerful number-theoretic results, such as Baker's Theorem on inhomogeneous linear forms of logarithms of algebraic numbers, Schanuel's Conjecture on the transcendence degree of certain field extensions of the rationals, and Kronecker's Theorem on simultaneous inhomogeneous Diophantine approximation. We draw interesting connections with the study of linear recurrence sequences and exponential polynomials, and relate pointwise reachability to open problems concerning the approximability by rationals of algebraic numbers and logarithms of algebraic numbers. Albeit a simple model, linear dynamical systems are of profound interest, both from a theoretical and a practical standpoint. Reachability problems for linear dynamical systems have recently elicited considerable attention, due to their frequent occurrence in practice and their deep and wide-ranging connections with other fascinating areas of study, such as problems on Markov chains (Akshay et al., 2015), quantum automata (Derksen et al., 2005), Lindenmayer systems (Salomaa and Soittola, 1978), linear loops (Braverman, 2006), linear recurrence sequences (Everest et al., 2003) and exponential polynomials (Bell et al., 2010).

APA, Harvard, Vancouver, ISO und andere Zitierweisen

36

Julius, Hayden. „Nonstandard solutions of linear preserver problems“. Kent State University / OhioLINK, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=kent1626101272174819.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

37

Schülke, Christophe. „Statistical physics of linear and bilinear inference problems“. Sorbonne Paris Cité, 2016. http://www.theses.fr/2016USPCC058.

Der volle Inhalt der Quelle

Annotation:

Le développement récent de l'acquisition comprimée a permis de spectaculaires avancées dans la compréhension des problèmes d'estimation linéaire parcimonieuse. Ce développement a suscité un intérêt renouvelé pour les problèmes d'inférence linéaire et bilinéaire généralisée. Ces problèmes combinent une étape linéaire avec une étape non lineaire et probabiliste, à l'issue de laquelle des mesures sont effectuées. Ce type de situations se présente notamment en imagerie médicale et en astronomie. Cette thèse s'intéresse à des algorithmes pour la résolution de ces problèmes et à leur analyse théorique. Pour cela, nous utilisons des algorithmes de passage de message, qui permettent d'échantillonner des distributions de haute dimension. Ces algorithmes connaissent des changements de phase, qui se laissent analyser à l'aide de la méthode des répliques, initialement développée dans le cadre de la physique statistique des milieux désordonnés. L'analyse des phases révèle qu'elles correspondent à des domaines dans lesquels l'inférence est facile, difficile ou impossible. Les principales contributions de cette thèse sont de trois types. D'abord, l'application d'algorithmes connus à des problèmes concrets : détection de communautés, codes correcteurs d'erreurs ainsi qu'un système d'imagerie innovant. Ensuite, un nouvel algorithme traitant le problème de calibration aveugle de capteurs, potentiellement applicable à de nombreux systèmes de mesure. Enfin, une analyse théorique du problème de reconstruction de matrices à petit rang à partir de projections linéaires, ainsi qu'une analyse d'une instabilité présente dans les algorithmes d'inférence bilinéaire
The recent development of compressed sensing has led to spectacular advances in the under standing of sparse linear estimation problems as well as in algorithms to solve them. It has also triggered anew wave of developments in the related fields of generalized linear and bilinear inference problems. These problems have in common that they combine a linear mixing step and a nonlinear, probabilistic sensing step, producing indirect measurements of a signal of interest. Such a setting arises in problems such as medical or astronomical Imaging. The aim of this thesis is to propose efficient algorithms for this class of problems and to perform their theoretical analysis. To this end, it uses belief propagation, thanks to which high-dimensional distributions can be sampled efficiently, thus making a bayesian approach to inference tractable. The resulting algorithms undergo phase transitions that can be analyzed using the replica method, initially developed in statistical physics of disordered systems. The analysis reveals phases in which inference is easy, hard or impossible, corresponding to different energy landscapes of the problem. The main contributions of this thesis can be divided into three categories. First, the application of known algorithms to concrete problems : community detection, superposition codes and an innovative imaging system. Second, a new, efficient message-passing algorithm for blind sensor calibration, that could be used in signal processing for a large class of measurement systems. Third, a theoretical analysis of achievable performances in matrix compressed sensing and of instabilities in bayesian bilinear inference algorithms

APA, Harvard, Vancouver, ISO und andere Zitierweisen

38

Placidi, Luca. „Solution of St.-Venant's and Almansi-Michell's Problems“. Thesis, Virginia Tech, 2002. http://hdl.handle.net/10919/35451.

Der volle Inhalt der Quelle

Annotation:

We use the semi-inverse method to solve a St. Venant and an Almansi-Michell problem for a prismatic body made of a homogeneous and isotropic elastic material that is stress free in the reference configuration. In the St. Venant problem, only the end faces of the prismatic body are loaded by a set of self-equilibrated forces. In the Almansi-Michell problem self equilibrated surface tractions are also applied on the mantle of the body. The St. Venant problem is also analyzed for the following two cases: (i) the reference configuration is subjected to a hydrostatic pressure, and (ii) stress-strain relations contain terms that are quadratic in displacement gradients. The Signorini method is also used to analyze the St. Venant problem. Both for the St. Venant and the Almansi-Michell problems, the solution of the three dimensional problem is reduced to that of solving a sequence of two dimensional problems. For the St. Venant problem involving a second-order elastic material, the first order deformation is assumed to be an infinitesimal twist. In the solution of the Almansi-Michell problem, surface tractions on the mantle of the cylindrical body are expressed as a polynomial in the axial coordinate. When solving the problem by the semi-inverse method, displacements are also expressed as a polynomial in the axial coordinate. An explicit solution is obtained for a hollow circular cylindrical body with surface tractions on the mantle given by an affine function of the axial coordinate
Master of Science

APA, Harvard, Vancouver, ISO und andere Zitierweisen

39

Haught, Damon. „On the Existence of Solutions to Discrete, Two Point, Non-linear Boundary Value Problems“. Youngstown State University / OhioLINK, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=ysu1299522079.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

40

羅恩妮 und Yan-nei Law. „Some additive preserver problems“. Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2000. http://hub.hku.hk/bib/B31222912.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

41

Law, Yan-nei. „Some additive preserver problems /“. Hong Kong : University of Hong Kong, 2000. http://sunzi.lib.hku.hk/hkuto/record.jsp?B22054820.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

42

Stoth, Barbara E. E. Jiang Song. „On periodic solutions of linear thermostat problems“. Bonn : [s.n.], 1989. http://catalog.hathitrust.org/api/volumes/oclc/19990668.html.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

43

Tsang, Siu Chung. „Preconditioners for linear parabolic optimal control problems“. HKBU Institutional Repository, 2017. https://repository.hkbu.edu.hk/etd_oa/464.

Der volle Inhalt der Quelle

Annotation:

In this thesis, we consider the computational methods for linear parabolic optimal control problems. We wish to minimize the cost functional while fulfilling the parabolic partial differential equations (PDE) constraint. This type of problems arises in many fields of science and engineering. Since solving such parabolic PDE optimal control problems often lead to a demanding computational cost and time, an effective algorithm is desired. In this research, we focus on the distributed control problems. Three types of cost functional are considered: Target States problems, Tracking problems, and All-time problems. Our major contribution in this research is that we developed a preconditioner for each kind of problems, so our iterative method is accelerated. In chapter 1, we gave a brief introduction to our problems with a literature review. In chapter 2, we demonstrated how to derive the first-order optimality conditions from the parabolic optimal control problems. Afterwards, we showed how to use the shooting method along with the flexible generalized minimal residual to find the solution. In chapter 3, we offered three preconditioners to enhance our shooting method for the problems with symmetric differential operator. Next, in chapter 4, we proposed another three preconditioners to speed up our scheme for the problems with non-symmetric differential operator. Lastly, we have the conclusion and the future development in chapter 5.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

44

Jamieson, Alan C. „Linear-time algorithms for edge-based problems“. Connect to this title online, 2007. http://etd.lib.clemson.edu/documents/1193079463/.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

45

馮漢國 und Hon-kwok Fung. „Some linear preserver problems in system theory“. Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1995. http://hub.hku.hk/bib/B3121227X.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

46

Noble, Raymond Keith. „Some problems associated with linear differential operators“. Thesis, Cardiff University, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.238160.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

47

GANDOLPHO, ANDRE ALVES. „METHODOLOGY FOR SOLVING FUZZY LINEAR PROGRAMMING PROBLEMS“. PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2005. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=8070@1.

Der volle Inhalt der Quelle

Annotation:

COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR
Esta tese propõe uma metodologia para obter uma solução para problemas de programação linear fuzzy. A metodologia aqui descrita apresenta um conjunto de soluções em que tanto os valores das variáveis quanto o valor ótimo para a função de custo, ou função objetivo, possuem uma faixa de valores possíveis. Assim, é possível fornecer um conjunto de soluções factíveis que atendam a diferentes cenários, além de fornecer ao tomador de decisões uma ferramenta de análise mais útil, permitindo que sejam analisadas outras soluções possíveis antes de se escolher uma solução em particular. O problema é resolvido de forma iterativa, tornando mais simples e de fácil aplicação a metodologia desenvolvida.
This work proposes an approach to obtain a solution to linear fuzzy programming problems. The approach described here presents a solution set in where both the variables values and the cost function optimun value to have an associated membership function. Thus, it is possible to provided not only a feasible solution set applicable to different scenarios but also to supply the decision maker with a more powerful tool for the analysis of other possible solutions. The problem is solved in an interactive way, so that the developed is approach easily applicable and simple to handle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

48

Spence, Euan Alastair. „Boundary value problems for linear elliptic PDEs“. Thesis, University of Cambridge, 2011. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.609476.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

49

Chen, Shang. „Reachability problems for systems with linear dynamics“. Thesis, Loughborough University, 2016. https://dspace.lboro.ac.uk/2134/22331.

Der volle Inhalt der Quelle

Annotation:

This thesis deals with reachability and freeness problems for systems with linear dynamics, including hybrid systems and matrix semigroups. Hybrid systems are a type of dynamical system that exhibit both continuous and discrete dynamic behaviour. Thus they are particularly useful in modelling practical real world systems which can both flow (continuous behaviour) and jump (discrete behaviour). Decision questions for matrix semigroups have attracted a great deal of attention in both the Mathematics and Theoretical Computer Science communities. They can also be used to model applications with only discrete components. For a computational model, the reachability problem asks whether we can reach a target point starting from an initial point, which is a natural question both in theoretical study and for real-world applications. By studying this problem and its variations, we shall prove in a formal mathematical sense that many problems are intractable or even unsolvable. Thus we know when such a problem appears in other areas like Biology, Physics or Chemistry, either the problem itself needs to be simplified, or it should by studied by approximation. In this thesis we concentrate on a specific hybrid system model, called an HPCD, and its variations. The objective of studying this model is twofold: to obtain the most expressive system for which reachability is algorithmically solvable and to explore the simplest system for which it is impossible to solve. For the solvable sub-cases, we shall also study whether reachability is in some sense easy or hard by determining which complexity classes the problem belongs to, such as P, NP(-hard) and PSPACE(-hard). Some undecidable results for matrix semigroups are also shown, which both strengthen our knowledge of the structure of matrix semigroups, and lead to some undecidability results for other models.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

50

Czornik, Adam. „On control problems for jump linear systems“. Praca habilitacyjna, Wydawnictwo Politechniki Śląskiej, 2003. https://delibra.bg.polsl.pl/dlibra/docmetadata?showContent=true&id=8802.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Dissertationen zum Thema „Linear and non-linear problems“

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an