scispace - formally typeset
Search or ask a question
Author

Kenneth Morgan

Bio: Kenneth Morgan is an academic researcher from Swansea University. The author has contributed to research in topics: Finite element method & Mesh generation. The author has an hindex of 41, co-authored 164 publications receiving 7336 citations. Previous affiliations of Kenneth Morgan include University College of Engineering & University of Wales.


Papers
More filters
Journal ArticleDOI
TL;DR: An adaptive mesh procedure for improving the quality of steady state solutions of the Euler equations in two dimensions is described, implemented in conjunction with a finite element solution algorithm, using linear triangular elements, and an explicit time-stepping scheme.

1,079 citations

Journal ArticleDOI
TL;DR: A new robust optimisation algorithm, which can be regarded as a modification of the recently developed cuckoo search, is presented and shows a high convergence rate to the true global minimum even at high numbers of dimensions.
Abstract: A new robust optimisation algorithm, which can be regarded as a modification of the recently developed cuckoo search, is presented. The modification involves the addition of information exchange between the top eggs, or the best solutions. Standard optimisation benchmarking functions are used to test the effects of these modifications and it is demonstrated that, in most cases, the modified cuckoo search performs as well as, or better than, the standard cuckoo search, a particle swarm optimiser, and a differential evolution strategy. In particular the modified cuckoo search shows a high convergence rate to the true global minimum even at high numbers of dimensions.

508 citations

Journal ArticleDOI
TL;DR: In this article, a high resolution finite element method for the solution of problems involving high speed compressible flows is presented in a form which is suitable for implementation on completely unstructured triangular or tetrahedral meshes.
Abstract: A high resolution finite element method for the solution of problems involving high speed compressible flows is presented. The method uses the concepts of flux-corrected transport and is presented in a form which is suitable for implementation on completely unstructured triangular or tetrahedral meshes. Transient and steady state examples are solved to illustrate the performance of the algorithm.

420 citations

Journal ArticleDOI
TL;DR: In this paper, a two-step explicit FEM solution algorithm for the three-dimensional compressible Euler and Navier-Stokes equations based on unstructured triangular and tetrahedral grids is described and demonstrated.
Abstract: A two-step explicit FEM solution algorithm for the three-dimensional compressible Euler and Navier-Stokes equations based on unstructured triangular and tetrahedral grids is described and demonstrated. The method represents an extension and refinement of the algorithms presented by Loehner et al. (1984 and 1985), Peraire et al. (1987), and Morgan et al. (1987). The formulation and numerical implementation are outlined; the mesh generation, data structures, and adaptive remeshing are explained; and results for a two-dimensional airfoil, a three-dimensional engine air intake, a B747 in landing configuration, and a generic fighter aircraft are presented in extensive graphics and discussed in detail.

345 citations

Journal ArticleDOI
TL;DR: In this paper, the phase change in transient non-linear heat conduction problems is solved using quadratic isoparametric elements and it is demonstrated that very good accuracy may be achieved.
Abstract: The algorithm in a earlier paper by Comini et al1 for handling the phase change in transient non-linear heat conduction problems is simplified and improved. Two examples involving phase change are solved using quadratic isoparametric elements and it is demonstrated that very good accuracy may be achieved.

271 citations


Cited by
More filters
Journal ArticleDOI

[...]

08 Dec 2001-BMJ
TL;DR: There is, I think, something ethereal about i —the square root of minus one, which seems an odd beast at that time—an intruder hovering on the edge of reality.
Abstract: There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality. Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

33,785 citations

Journal ArticleDOI
TL;DR: Machine learning addresses many of the same research questions as the fields of statistics, data mining, and psychology, but with differences of emphasis.
Abstract: Machine Learning is the study of methods for programming computers to learn. Computers are applied to a wide range of tasks, and for most of these it is relatively easy for programmers to design and implement the necessary software. However, there are many tasks for which this is difficult or impossible. These can be divided into four general categories. First, there are problems for which there exist no human experts. For example, in modern automated manufacturing facilities, there is a need to predict machine failures before they occur by analyzing sensor readings. Because the machines are new, there are no human experts who can be interviewed by a programmer to provide the knowledge necessary to build a computer system. A machine learning system can study recorded data and subsequent machine failures and learn prediction rules. Second, there are problems where human experts exist, but where they are unable to explain their expertise. This is the case in many perceptual tasks, such as speech recognition, hand-writing recognition, and natural language understanding. Virtually all humans exhibit expert-level abilities on these tasks, but none of them can describe the detailed steps that they follow as they perform them. Fortunately, humans can provide machines with examples of the inputs and correct outputs for these tasks, so machine learning algorithms can learn to map the inputs to the outputs. Third, there are problems where phenomena are changing rapidly. In finance, for example, people would like to predict the future behavior of the stock market, of consumer purchases, or of exchange rates. These behaviors change frequently, so that even if a programmer could construct a good predictive computer program, it would need to be rewritten frequently. A learning program can relieve the programmer of this burden by constantly modifying and tuning a set of learned prediction rules. Fourth, there are applications that need to be customized for each computer user separately. Consider, for example, a program to filter unwanted electronic mail messages. Different users will need different filters. It is unreasonable to expect each user to program his or her own rules, and it is infeasible to provide every user with a software engineer to keep the rules up-to-date. A machine learning system can learn which mail messages the user rejects and maintain the filtering rules automatically. Machine learning addresses many of the same research questions as the fields of statistics, data mining, and psychology, but with differences of emphasis. Statistics focuses on understanding the phenomena that have generated the data, often with the goal of testing different hypotheses about those phenomena. Data mining seeks to find patterns in the data that are understandable by people. Psychological studies of human learning aspire to understand the mechanisms underlying the various learning behaviors exhibited by people (concept learning, skill acquisition, strategy change, etc.).

13,246 citations

Book
01 Jan 2000
TL;DR: In this paper, a summary account of the subject of a posteriori error estimation for finite element approximations of problems in mechanics is presented, focusing on methods for linear elliptic boundary value problems.
Abstract: This monograph presents a summary account of the subject of a posteriori error estimation for finite element approximations of problems in mechanics. The study primarily focuses on methods for linear elliptic boundary value problems. However, error estimation for unsymmetrical systems, nonlinear problems, including the Navier-Stokes equations, and indefinite problems, such as represented by the Stokes problem are included. The main thrust is to obtain error estimators for the error measured in the energy norm, but techniques for other norms are also discussed.

2,607 citations

Journal ArticleDOI
TL;DR: A new error estimator is presented which is not only reasonably accurate but whose evaluation is computationally so simple that it can be readily implemented in existing finite element codes.
Abstract: A new error estimator is presented which is not only reasonably accurate but whose evaluation is computationally so simple that it can be readily implemented in existing finite element codes. The estimator allows the global energy norm error to be well estmated and alos gives a good evaluation of local errors. It can thus be combined with a full adaptive process of refinement or, more simply, provide guidance for mesh redesign which allows the user to obtain a desired accuracy with one or two trials. When combined with an automatic mesh generator a very efficient guidance process to analysis is avaiable. Estimates other than the energy norm have successfully been applied giving, for instance, a predetermined accuracy of stresses.

2,449 citations

Journal ArticleDOI
TL;DR: In this paper, a Lagrangian finite element method of fracture and fragmentation in brittle materials is developed, where a cohesive-law fracture model is used to propagate multiple cracks along arbitrary paths.

1,970 citations