Log in

Relevant bibliographies by topics / Methods for solving / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Methods for solving.

Dissertations / Theses on the topic 'Methods for solving'

Author: Grafiati

Published: 30 May 2022

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Methods for solving.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Chan, Ka Hou. "Bayesian methods for solving linear systems." Thesis, University of Macau, 2011. http://umaclib3.umac.mo/record=b2493250.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Jain, Pramod. "APPROXIMATE METHODS FOR SOLVING FLOWSHOP PROBLEMS." MSSTATE, 2005. http://sun.library.msstate.edu/ETD-db/theses/available/etd-11072005-155525/.

Full text

Abstract:

The flow shop scheduling problem is a classical combinatorial problem being studied for years. The focus of this research is to study two variants of the flow shop scheduling problem in order to minimize makespan by scheduling n jobs on m machines. A solution approach is developed for the modified flow shop problem with due dates and release times. This algorithm is an attempt to contribute to the limited literature for the problem. Another tabu search-based solution approach is developed to solve the classical flow shop scheduling problem. This meta-heuristic (called 3XTS) allows an efficient

APA, Harvard, Vancouver, ISO, and other styles

3

Terry, Elaine Audrey. "Problem solving methods in game theory." DigitalCommons@Robert W. Woodruff Library, Atlanta University Center, 1988. http://digitalcommons.auctr.edu/dissertations/1796.

Full text

Abstract:

Game theory is the mathematical theory associated with winning strategic and non-strategic games. In order to win a game, a player must find an optimal strategy to play. Strategies may be either pure or mixed. The latter is used when there are no pure strategies available . Games that require mixed strategies may be solved by various methods. This study is concerned with the basic theory of games. Definitions and methods for solving games are discussed. The methods for solving involve both pure and mixed strategies. The simplex method for solving linear programming problems is reviewed. The nu

APA, Harvard, Vancouver, ISO, and other styles

4

Scanlon, Eileen. "Modelling physics problem solving." Thesis, Open University, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.277276.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Lindgren, Tony. "Methods of solving conflicts among induced rules /." Kista : Department of Computer and Systems Sciences, Stockholm University [Institutionen för data- och systemvetenskap, Stockholms universitet], 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-855.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Tran, Nhan Thanh. "Numerical methods for solving wave scattering problems." Diss., Kansas State University, 2016. http://hdl.handle.net/2097/32508.

Full text

Abstract:

Doctor of Philosophy<br>Department of Mathematics<br>Alexander G. Ramm<br>In this thesis, the author presents several numerical methods for solving scalar and electromagnetic wave scattering problems. These methods are taken from the papers of Professor Alexander Ramm and the author, see [1] and [2]. In Chapter 1, scalar wave scattering by many small particles of arbitrary shapes with impedance boundary condition is studied. The problem is solved asymptotically and numerically under the assumptions a << d << λ, where k = 2π/λ is the wave number, λ is the wave length, a is the characteris

APA, Harvard, Vancouver, ISO, and other styles

7

Zhao, Kezhong. "A domain decomposition method for solving electrically large electromagnetic problems." Columbus, Ohio : Ohio State University, 2007. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1189694496.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Hussein, Sayed A. "Implicit methods in initial value problems." Thesis, University of Essex, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.302882.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Gheorghe, Simona. "On multigrid methods for solving electromagnetic scattering problems." [S.l.] : [s.n.], 2006. http://e-diss.uni-kiel.de/diss_1664/d1664.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Homolle, Thomas (Thomas Michel Marie). "Efficient particle methods for solving the Boltzmann equation." Thesis, Massachusetts Institute of Technology, 2007. http://hdl.handle.net/1721.1/38649.

Full text

Abstract:

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2007.<br>Includes bibliographical references (leaves 85-86).<br>A new particle simulation method for solving the Boltzmann equation is presented and tested. This method holds a significant computational efficiency advantage for low-signal flows compared to traditional particle methods such as the Direct Simulation Monte Carlo (DSMC). More specifically, the proposed algorithm can efficiently simulate arbitrarily small deviations from equilibrium (e.g. low speed flows) at a computational cost that does n

APA, Harvard, Vancouver, ISO, and other styles

11

Indratno, Sapto Wahyu. "Numerical methods for solving linear ill-posed problems." Diss., Kansas State University, 2011. http://hdl.handle.net/2097/8109.

Full text

Abstract:

Doctor of Philosophy<br>Department of Mathematics<br>Alexander G. Ramm<br>A new method, the Dynamical Systems Method (DSM), justified recently, is applied to solving ill-conditioned linear algebraic system (ICLAS). The DSM gives a new approach to solving a wide class of ill-posed problems. In Chapter 1 a new iterative scheme for solving ICLAS is proposed. This iterative scheme is based on the DSM solution. An a posteriori stopping rules for the proposed method is justified. We also gives an a posteriori stopping rule for a modified iterative scheme developed in A.G.Ramm, JMAA,330 (2007

APA, Harvard, Vancouver, ISO, and other styles

12

Kwok, Ting On. "Adaptive meshless methods for solving partial differential equations." HKBU Institutional Repository, 2009. http://repository.hkbu.edu.hk/etd_ra/1076.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Pindza, Edson. "Robust Spectral Methods for Solving Option Pricing Problems." University of the Western Cape, 2012. http://hdl.handle.net/11394/4092.

Full text

Abstract:

Doctor Scientiae - DSc<br>Robust Spectral Methods for Solving Option Pricing Problems by Edson Pindza PhD thesis, Department of Mathematics and Applied Mathematics, Faculty of Natural Sciences, University of the Western Cape Ever since the invention of the classical Black-Scholes formula to price the financial derivatives, a number of mathematical models have been proposed by numerous researchers in this direction. Many of these models are in general very complex, thus closed form analytical solutions are rarely obtainable. In view of this, we present a class of efficient spectral met

APA, Harvard, Vancouver, ISO, and other styles

14

Cabezas, García José Xavier. "Heuristic methods for solving two discrete optimization problems." Thesis, University of Edinburgh, 2018. http://hdl.handle.net/1842/31093.

Full text

Abstract:

In this thesis we study two discrete optimization problems: Traffic Light Synchronization and Location with Customers Orderings. A widely used approach to solve the synchronization of traffic lights on transport networks is the maximization of the time during which cars start at one end of a street and can go to the other without stopping for a red light (bandwidth maximization). The mixed integer linear model found in the literature, named MAXBAND, can be solved by optimization solvers only for small instances. In this manuscript we review in detail all the constraints of the original linear

APA, Harvard, Vancouver, ISO, and other styles

15

Dyhoum, Taysir Emhemed. "The method of fundamental solutions and MCMC methods for solving electrical tomography problems." Thesis, University of Leeds, 2016. http://etheses.whiterose.ac.uk/15552/.

Full text

Abstract:

Electrical impedance tomography (EIT) is a non-intrusive and portable imaging technique which has been used widely in many medical, geological and industrial applications for imaging the interior electrical conductivity distribution within a region from the knowledge of the injected currents through attached electrodes and resulting voltages, or boundary potential and current flux. If the quantities involved are all real then EIT is called electrical resistance tomography (ERT). The work in this thesis focuses on solving inverse geometric problems in ERT where we seek detecting the size, the s

APA, Harvard, Vancouver, ISO, and other styles

16

Zhu, Hong. "Solving optimization problems with generalized orthogonality constraints." HKBU Institutional Repository, 2016. https://repository.hkbu.edu.hk/etd_oa/341.

Full text

Abstract:

This thesis focuses on optimization problems with generalized orthogonality constraints, which may also contains linear equality constraints. These problems appear in many areas, such as machine learning, signal processing, computer vision and so on.;Many problems in this form are NP hard. One challenge posed by generalized orthogonality constraints is local minimizers loaded by nonconvex constraints. More-over, the generalized orthogonality constraints are numerically expensive to preserve during iterations.;This thesis is mainly divided into two parts. The first part is focused on solving ge

APA, Harvard, Vancouver, ISO, and other styles

17

Duberg, Daniel, and Jakob Tideström. "Comparison of Rubik’s Cube Solving Methods Made for Humans." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-166727.

Full text

Abstract:

This study analyzed and compared four different methods of solving a Rubik’s Cube. Those four methods being the method on Rubik’s official website, the CFOP method, the Roux method and the ZZ method. The factors that were considered were the number of moves each method requires for solving a Rubik’s Cube, how many algorithms they require as well as how concrete or intuitive they are. Our conclusion is that the CFOP, Roux, and ZZ method are fairly equivalent when it comes to move span, but CFOP has the lowest average number of moves used to solve a Rubik’s Cube. CFOP has more concrete algorithm

APA, Harvard, Vancouver, ISO, and other styles

18

Niu, Fei. "Learning-based Software Testing using Symbolic Constraint Solving Methods." Licentiate thesis, KTH, Teoretisk datalogi, TCS, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-41932.

Full text

Abstract:

Software testing remains one of the most important but expensive approaches to ensure high-quality software today. In order to reduce the cost of testing, over the last several decades, various techniques such as formal verification and inductive learning have been used for test automation in previous research. In this thesis, we present a specification-based black-box testing approach, learning-based testing (LBT), which is suitable for a wide range of systems, e.g. procedural and reactive systems. In the LBT architecture, given the requirement specification of a system under test (SUT), a la

APA, Harvard, Vancouver, ISO, and other styles

19

Smith, James A. "“Looking for nothing" : Bayes linear methods for solving equations." Thesis, Durham University, 1993. http://etheses.dur.ac.uk/2207/.

Full text

Abstract:

Here I will describe and implement Bayes linear methods for finding zeros of deterministic functions. We assume that the zero is known to be unique. Initially, the value of the function is modelled simply as the product of two independent factors, the position of the point from the zero and a "slope" which is assumed to vary "smoothly” with position. Additional prior information specifies first and second order properties of the slopes and the position of the zero: in particular, smoothness is specified by modelling the slope process to be stationary with a decreasing correlation function. Thi

APA, Harvard, Vancouver, ISO, and other styles

20

Mulholland, Lawrence Sydney. "Aspects of pseudospectral methods for solving partial differential equations." Thesis, University of Strathclyde, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.389737.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Shramchenko, B. L. "Application of graph theory methods for solving mechatronic tasks." Thesis, Київський національний університет технологій та дизайну, 2018. https://er.knutd.edu.ua/handle/123456789/9715.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Attia, Ahmed Mohamed Mohamed. "Advanced Sampling Methods for Solving Large-Scale Inverse Problems." Diss., Virginia Tech, 2016. http://hdl.handle.net/10919/73683.

Full text

Abstract:

Ensemble and variational techniques have gained wide popularity as the two main approaches for solving data assimilation and inverse problems. The majority of the methods in these two approaches are derived (at least implicitly) under the assumption that the underlying probability distributions are Gaussian. It is well accepted, however, that the Gaussianity assumption is too restrictive when applied to large nonlinear models, nonlinear observation operators, and large levels of uncertainty. This work develops a family of fully non-Gaussian data assimilation algorithms that work by directly sa

APA, Harvard, Vancouver, ISO, and other styles

23

Ali, Ali Hasan. "Modifying Some Iterative Methods for Solving Quadratic Eigenvalue Problems." Wright State University / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=wright1515029541712239.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Al, Mugahwi Mohammed. "Methods for Solving Node Centrality Measure Problems for LargeNetworks." Kent State University / OhioLINK, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=kent1594905870792566.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Gábor, Richard. "Project Management and Problem Solving Methods in Management Consulting." Master's thesis, Vysoká škola ekonomická v Praze, 2011. http://www.nusl.cz/ntk/nusl-71931.

Full text

Abstract:

Conducting management consulting project for Transparency International Czech Republic, the leading non-profit non-governmental organization active in anti-corruption practices, by applying selected project management and problem solving methods, the objective of the thesis is to support the assumption that proper selection and application of suitable methods to problem identification, definition and decomposition enables to come up with the solution of the problem by analyzing it with no need for further solution development.

APA, Harvard, Vancouver, ISO, and other styles

26

Lin, Yuan. "High-order finite difference methods for solving heat equations /." Available to subscribers only, 2008. http://proquest.umi.com/pqdweb?did=1559848541&sid=1&Fmt=2&clientId=1509&RQT=309&VName=PQD.

Full text

Abstract:

Thesis (Ph. D.)--Southern Illinois University Carbondale, 2008.<br>"Department of Mathematics." Keywords: High-order finite difference, Heat equations Includes bibliographical references (p. 64-68). Also available online.

APA, Harvard, Vancouver, ISO, and other styles

27

Marlow, Robert. "Moving mesh methods for solving parabolic partial differential equations." Thesis, University of Leeds, 2010. http://etheses.whiterose.ac.uk/1528/.

Full text

Abstract:

In this thesis, we introduce and assess a new adaptive method for solving non-linear parabolic partial differential equations with fixed or moving boundaries, using a moving mesh with continuous finite elements. The evolution of the mesh within the interior of the spatial domain is based upon conserving the distribution of a chosen monitor function across the domain throughout time, where the initial distribution is based upon the given initial data. For the moving boundary cases, the mesh movement at the boundary is governed by a second monitor function. The method is applied with different m

APA, Harvard, Vancouver, ISO, and other styles

28

Horáček, Jan [Verfasser]. "Algebraic and Logic Solving Methods for Cryptanalysis / Jan Horáček." Passau : Universität Passau, 2020. http://d-nb.info/1205155228/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Chai, Qinqin. "Computational methods for solving optimal industrial process control problems." Thesis, Curtin University, 2013. http://hdl.handle.net/20.500.11937/1227.

Full text

Abstract:

In this thesis, we develop new computational methods for three classes of dynamic optimization problems: (i) A parameter identification problem for a general nonlinear time-delay system; (ii) an optimal control problem involving systems with both input and output delays, and subject to continuous inequality state constraints; and (iii) a max-min optimal control problem arising in gradient elution chromatography.In the first problem, we consider a parameter identification problem involving a general nonlinear time-delay system, where the unknown time delays and system parameters are to be ident

APA, Harvard, Vancouver, ISO, and other styles

30

Santos, Trigo Luz Manuel. "College students' methods for solving mathematical problems as a result of instruction based on problem solving." Thesis, University of British Columbia, 1990. http://hdl.handle.net/2429/31100.

Full text

Abstract:

This study investigates the effects of implementing mathematical problem solving instruction in a regular calculus course taught at the college level. Principles associated with this research are: i) mathematics is developed as a response to finding solutions to mathematical problems, ii) attention to the processes involved in solving mathematical problems helps students understand and develop mathematics, and iii) mathematics is learned in an active environment which involves the use of guesses, conjectures, examples, counterexamples, and cognitive and metacognitive strategies. Classroom acti

APA, Harvard, Vancouver, ISO, and other styles

31

Edwards, M. G. "Moving element methods with emphasis on the Euler equations." Thesis, University of Reading, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.378193.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Oe, Duck Ki. "Formally certified satisfiability solving." Diss., University of Iowa, 2012. https://ir.uiowa.edu/etd/3362.

Full text

Abstract:

Satisfiability (SAT) and satisfiability modulo theories (SMT) solvers are high-performance automated propositional and first-order theorem provers, used as underlying tools in many formal verification and artificial intelligence systems. Theoretic and engineering advancement of solver technologies improved the performance of modern solvers; however, the increased complexity of those solvers calls for formal verification of those tools themselves. This thesis discusses two methods to formally certify SAT/SMT solvers. The first method is generating proofs from solvers and certifying those proofs

APA, Harvard, Vancouver, ISO, and other styles

33

Hamm, Jolene Diane. "Exploring the Dimensions of Problem-solving Ability on High-achieving Secondary Students: A Mixed Methods Study." Diss., Virginia Tech, 2010. http://hdl.handle.net/10919/40265.

Full text

Abstract:

This mixed-methods study investigated the relationship between self-concept and problem-solving style and how these two constructs compared and contrasted in regards to a participantâ s perception of his or her problem-solving ability. The 86 study participants were high-achieving rising 11th and 12th grade students attending a summer enrichment program for agriculture. This study used a concurrent triangulation mixed methods design. The quantitative aspect of the study employed two instruments, SDQ III to test perceived self-concept and the VIEW to determine the perceived problem-solving st

APA, Harvard, Vancouver, ISO, and other styles

34

Chiang, Weng Cheng Venus. "High-order finite difference methods for solving convection diffusion equations." Thesis, University of Macau, 2008. http://umaclib3.umac.mo/record=b1807119.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Beardwood, Fiona Nicole. "Computational methods of solving inverse problems, geophysical and medical applications." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/nq31113.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Ewen, Tracy Leanne. "Mixed product Krylov subspace methods for solving nonsymmetric linear systems." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp03/MQ51707.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Anhaouy, Pichmony. "Fourier spectral methods for solving the Korteweg-de Vries equation." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp03/MQ51284.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Calame, Jens Rüdiger. "Testing reactive systems with data enumerative methods and constraint solving /." Enschede : University of Twente [Host], 2008. http://doc.utwente.nl/59368.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Rehm, Markus, and Josefine Thiede. "A survey of recent methods for solving project scheduling problems." Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-100591.

Full text

Abstract:

This paper analyses the current state of research regarding solution methods dealing with resource-constrained project scheduling problems. The intention is to present a concentrated survey and brief scientific overview on models, their decision variables and constraints as well as current solution methods in the field of project scheduling. The allocation of scarce resources among multiple projects with different, conflicting decision variables is a highly difficult problem in order to achieve an optimal schedule which meets all (usually different) of the projects’ objectives. Those projects,

APA, Harvard, Vancouver, ISO, and other styles

40

Johansson, Björn, T. Keviczky, Mikael Johansson, and Karl Henrik Johansson. "Subgradient methods and consensus algorithms for solving convex optimization problems." KTH, Reglerteknik, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-80707.

Full text

Abstract:

In this paper we propose a subgradient method for solving coupled optimization problems in a distributed way given restrictions on the communication topology. The iterative procedure maintains local variables at each node and relies on local subgradient updates in combination with a consensus process. The local subgradient steps are applied simultaneously as opposed to the standard sequential or cyclic procedure. We study convergence properties of the proposed scheme using results from consensus theory and approximate subgradient methods. The framework is illustrated on an optimal distributed

APA, Harvard, Vancouver, ISO, and other styles

41

James, Alan John. "Solving the many electron problem with quantum Monte-Carlo methods." Thesis, Imperial College London, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.309224.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Campos, Frederico Ferreira. "Analysis of conjugate gradients-type methods for solving linear equations." Thesis, University of Oxford, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.282319.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Ng, Kwok-po, and 吳國寶. "Fast iterative methods for solving Toeplitz and Toeplitz-like systems." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1992. http://hub.hku.hk/bib/B31210946.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

陳鴻昌 and Hung-cheong Chan. "Iterative methods for solving Toeplitz systems generated by rational functions." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1995. http://hub.hku.hk/bib/B31212062.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Sahimi, Mohd S. "Numerical methods for solving hyperbolic and parabolic partial differential equations." Thesis, Loughborough University, 1986. https://dspace.lboro.ac.uk/2134/12077.

Full text

Abstract:

The main object of this thesis is a study of the numerical 'solution of hyperbolic and parabolic partial differential equations. The introductory chapter deals with a general description and classification of partial differential equations. Some useful mathematical preliminaries and properties of matrices are outlined. Chapters Two and Three are concerned with a general survey of current numerical methods to solve these equations. By employing finite differences, the differential system is replaced by a large matrix system. Important concepts such as convergence, consistency, stability and acc

APA, Harvard, Vancouver, ISO, and other styles

46

Rajpathak, Dnyanesh. "A generic library of problem solving methods for scheduling applications." Thesis, Open University, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.417488.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Kottler, Stephan [Verfasser], and Michael [Akademischer Betreuer] Kaufmann. "Advanced Methods for SAT Solving / Stephan Kottler ; Betreuer: Michael Kaufmann." Tübingen : Universitätsbibliothek Tübingen, 2013. http://d-nb.info/1162844248/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Grier, Nathaniel J. (Nathaniel Jedidiah) 1978. "Improved methods for solving traffic flow problems in dynamic networks." Thesis, Massachusetts Institute of Technology, 2002. http://hdl.handle.net/1721.1/84805.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Pindza, Edson. "Spectral difference methods for solving equations of the KdV hierarchy." Thesis, Stellenbosch : Stellenbosch University, 2008. http://hdl.handle.net/10019.1/2168.

Full text

Abstract:

Thesis (MSc (Applied Mathematics))--Stellenbosch University, 2008.<br>The Korteweg-de Vries (KdV) hierarchy is an important class of nonlinear evolution equa- tions with various applications in the physical sciences and in engineering. In this thesis analytical solution methods were used to ¯nd exact solutions of the third and ¯fth order KdV equations, and numerical methods were used to compute numerical solutions of these equations. Analytical methods used include the Fan sub-equation method for constructing exact trav- eling wave solutions, and the simpli¯ed Hirota method for construct

APA, Harvard, Vancouver, ISO, and other styles

50

Hilal, Mohammed Azeez. "Domain decomposition like methods for solving an electrocardiography inverse problem." Thesis, Nantes, 2016. http://www.theses.fr/2016NANT4060.

Full text

Abstract:

L’objectif de cette thèse est d’étudier un problème électrocardiographique (ECG), modélisant l’activité électrique cardiaque en utilisant un modèle bidomaine stationnaire. Deux types de modélisation sont considérées : la modélisation basée sur un modèle mathématique directe et la modélisation basée sur un problème inverse de Cauchy. Dans le premier cas, le problème directe est résolu en utilisant la méthode de décomposition de domaine et l’approximation par la méthode des éléments finis. Dans le deuxième cas le problème inverse de Cauchy de l’ECG a été reformulé en un problème de point fixe. P

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!