Keith Jones – författare

Big ideas in the mathematics curriculum for older school students, especially those that are hard to learn and hard to teach, are covered in this book. It will be a first port of call for research about teaching big ideas for students from 9-19 and also has implications for a wider range of students. These are the ideas that really matter, that students get stuck on, and that can be obstacles to future learning. It shows how students learn, why they sometimes get things wrong, and the strengths and pitfalls of various teaching approaches. Contemporary high-profile topics like modelling are included. The authors are experienced teachers, researchers and mathematics educators, and many teachers and researchers have been involved in the thinking behind this book, funded by the Nuffield Foundation. An associated website, hosted by the Nuffield Foundation, summarises the key messages in the book and connects them to examples of classroom tasks that address important learning issues about particular mathematical ideas.

Smart, strategic inventory management delivers competitive advantage, yet Inventory Turn trends suggest that little seems to change. Sustainable improvement through increasing control of systems and processes generates savings that can, in turn, be invested in growth initiatives. Inventory is not something that just concerns planning, production and finance. By working to better understand and control their inventory-related processes, everyone can drive improvements that will harness inventory’s potential to become a source of sustainable competitive advantage. Unlike other guides to inventory management, this book is not only aimed at planners or inventory managers, but details the impact, both direct and indirect, that all functions have on inventory. It is rich in practical tools that can be clearly implemented, including a detailed purchasing strategy and guide to error management. It is also rich in best-practice cases that further show how to implement these methodologies in a real-world context. This book is essential reading for any manager or executive looking to boost their organisation’s competitive advantage, as well as students of inventory management, production and operations management.

The Haifa 2000 Workshop on "Inherently Parallel Algorithms for Feasibility and Optimization and their Applications" brought together top scientists in this area. The objective of the Workshop was to discuss, analyze and compare the latest developments in this fast growing field of applied mathematics and to identify topics of research which are of special interest for industrial applications and for further theoretical study.

Inherently parallel algorithms, that is, computational methods which are, by their mathematical nature, parallel, have been studied in various contexts for more than fifty years. However, it was only during the last decade that they have mostly proved their practical usefulness because new generations of computers made their implementation possible in order to solve complex feasibility and optimization problems involving huge amounts of data via parallel processing. These led to an accumulation of computational experience and theoretical information and opened new and challenging questions concerning the behavior of inherently parallel algorithms for feasibility and optimization, their convergence in new environments and in circumstances in which they were not considered before their stability and reliability. Several research groups all over the world focused on these questions and it was the general feeling among scientists involved in this effort that the time has come to survey the latest progress and convey a perspective for further development and concerted scientific investigations. Thus, the editors of this volume, with the support of the Israeli Academy for Sciences and Humanities, took the initiative of organizing a Workshop intended to bring together the leading scientists in the field. The current volume is the Proceedings of the Workshop representing the discussions, debates and communications that took place. Having all that information collected in a single book will provide mathematicians and engineers interested in the theoretical and practical aspects of the inherently parallel algorithms for feasibility and optimization with a tool for determining when, where and which algorithms in this class are fit for solving specific problems, how reliable they are, how they behave and how efficient they were in previous applications. Such a tool will allow software creators to choose ways of better implementing these methods by learning from existing experience.

/homepage/sac/cam/na2000/index.html7-Volume Set now available at special set price !Over the second half of the 20th century the subject area loosely referred to as numerical analysis of partial differential equations (PDEs) has undergone unprecedented development. At its practical end, the vigorous growth and steady diversification of the field were stimulated by the demand for accurate and reliable tools for computational modelling in physical sciences and engineering, and by the rapid development of computer hardware and architecture. At the more theoretical end, the analytical insight into the underlying stability and accuracy properties of computational algorithms for PDEs was deepened by building upon recent progress in mathematical analysis and in the theory of PDEs. To embark on a comprehensive review of the field of numerical analysis of partial differential equations within a single volume of this journal would have been an impossible task. Indeed, the 16 contributions included here, by some of the foremost world authorities in the subject, represent only a small sample of the major developments. We hope that these articles will, nevertheless, provide the reader with a stimulating glimpse into this diverse, exciting and important field. The opening paper by Thomée reviews the history of numerical analysis of PDEs, starting with the 1928 paper by Courant, Friedrichs and Lewy on the solution of problems of mathematical physics by means of finite differences. This excellent survey takes the reader through the development of finite differences for elliptic problems from the 1930s, and the intense study of finite differences for general initial value problems during the 1950s and 1960s. The formulation of the concept of stability is explored in the Lax equivalence theorem and the Kreiss matrix lemmas. Reference is made to the introduction of the finite element method by structural engineers, and a description is given of the subsequent development and mathematical analysis of the finite element method with piecewise polynomial approximating functions. The penultimate section of Thomée's survey deals with `other classes of approximation methods', and this covers methods such as collocation methods, spectral methods, finite volume methods and boundary integral methods. The final section is devoted to numerical linear algebra for elliptic problems. The next three papers, by Bialecki and Fairweather, Hesthaven and Gottlieb and Dahmen, describe, respectively, spline collocation methods, spectral methods and wavelet methods. The work by Bialecki and Fairweather is a comprehensive overview of orthogonal spline collocation from its first appearance to the latest mathematical developments and applications. The emphasis throughout is on problems in two space dimensions. The paper by Hesthaven and Gottlieb presents a review of Fourier and Chebyshev pseudospectral methods for the solution of hyperbolic PDEs. Particular emphasis is placed on the treatment of boundaries, stability of time discretisations, treatment of non-smooth solutions and multidomain techniques. The paper gives a clear view of the advances that have been made over the last decade in solving hyperbolic problems by means of spectral methods, but it shows that many critical issues remain open. The paper by Dahmen reviews the recent rapid growth in the use of wavelet methods for PDEs. The author focuses on the use of adaptivity, where significant successes have recently been achieved. He describes the potential weaknesses of wavelet methods as well as the perceived strengths, thus giving a balanced view that should encourage the study of wavelet methods. Aspects of finite element methods and adaptivity are dealt with in the three papers by Cockburn, Rannacher and Suri. The paper by Cockburn is concerned with the development and analysis of discontinuous Galerkin (DG) finite element methods for hyperbolic problems. It reviews the key properties of DG methods for nonlinear hyperbolic conservation laws from a novel viewpoint that stems from the observation that hyperbolic conservation laws are normally arrived at via model reduction, by elimination of dissipation terms. Rannacher's paper is a first-rate survey of duality-based a posteriori error estimation and mesh adaptivity for Galerkin finite element approximations of PDEs. The approach is illustrated for simple examples of linear and nonlinear PDEs, including also an optimal control problem. Several open questions are identified such as the efficient determination of the dual solution, especially in the presence of oscillatory solutions. The paper by Suri is a lucid overview of the relative merits of the hp and p versions of the finite element method over the h version. The work is presented in a non-technical manner by focusing on a class of problems concerned with linear elasticity posed on thin domains. This type of problem is of considerable practical interest and it generates a number of significant theoretical problems. Iterative methods and multigrid techniques are reviewed in a paper by Silvester, Elman, Kay and Wathen, and in three papers by Stüben, Wesseling and Oosterlee and Xu. The paper by Silvester et al. outlines a new class of robust and efficient methods for solving linear algebraic systems that arise in the linearisation and operator splitting of the Navier-Stokes equations. A general preconditioning strategy is described that uses a multigrid V-cycle for the scalar convection-diffusion operator and a multigrid V-cycle for a pressure Poisson operator. This two-stage approach gives rise to a solver that is robust with respect to time-step-variation and for which the convergence rate is independent of the grid. The paper by Stüben gives a detailed overview of algebraic multigrid. This is a hierarchical and matrix-based approach to the solution of large, sparse, unstructured linear systems of equations. It may be applied to yield efficient solvers for elliptic PDEs discretised on unstructured grids. The author shows why this is likely to be an active and exciting area of research for several years in the new millennium. The paper by Wesseling and Oosterlee reviews geometric multigrid methods, with emphasis on applications in computational fluid dynamics (CFD). The paper is not an introduction to multigrid: it is more appropriately described as a refresher paper for practitioners who have some basic knowledge of multigrid methods and CFD. The authors point out that textbook multigrid efficiency cannot yet be achieved for all CFD problems and that the demands of engineering applications are focusing research in interesting new directions. Semi-coarsening, adaptivity and generalisation to unstructured grids are becoming more important. The paper by Xu presents an overview of methods for solving linear algebraic systems based on subspace corrections. The method is motivated by a discussion of the local behaviour of high-frequency components in the solution of an elliptic problem. Of novel interest is the demonstration that the method of subspace corrections is closely related to von Neumann's method of alternating projections. This raises the question as to whether certain error estimates for alternating directions that are available in the literature may be used to derive convergence estimates for multigrid and/or domain decomposition methods. Moving finite element methods and moving mesh methods are presented, respectively, in the papers by Baines and Huang and Russell. The paper by Baines reviews recent advances in Galerkin and least-squares methods for solving first- and second-order PDEs with moving nodes in multidimensions. The methods use unstructured meshes and they minimise the norm of the residual of the PDE over both the computed solution and the nodal positions. The relationship between the moving finite element method and L2 least-squares methods is discussed. The paper also describes moving finite volume and discrete l2 least-squares methods. Huang and Russell review a class of moving mesh algorithms based upon a moving mesh partial differential equation (MMPDE). The authors are leading players in this research area, and the paper is largely a review of their own work in developing viable MMPDEs and efficient solution strategies. The remaining three papers in this special issue are by Budd and Piggott, Ewing and Wang and van der Houwen and Sommeijer. The paper by Budd and Piggott on geometric integration is a survey of adaptive methods and scaling invariance for discretisations of ordinary and partial differential equations. The authors have succeeded in presenting a readable account of material that combines abstract concepts and practical scientific computing. Geometric integration is a new and rapidly growing area which deals with the derivation of numerical methods for differential equations that incorporate qualitative information in their structure. Qualitative features that may be present in PDEs might include symmetries, asymptotics, invariants or orderings and the objective is to take these properties into account in deriving discretisations. The paper by Ewing and Wang gives a brief summary of numerical methods for advection-dominated PDEs. Models arising in porous medium fluid flow are presented to motivate the study of the advection-dominated flows. The numerical methods reviewed are applicable not only to porous medium flow problems but second-order PDEs with dominant hyperbolic behaviour in general. The paper by van der Houwen and Sommeijer deals with approximate factorisation for time-dependent PDEs. The paper begins with some historical notes and it proceeds to present various approximate factorisation techniques. The objective is to show that the linear system arising from linearisation and discretisation of the PDE may be solved more efficiently if the coefficient matrix is replaced by an approximate factorisation based on splitting. The paper presents a number of new stability results obtained by the group at CWI Amsterdam for the resulting time integration methods.

Poetry that seeks kinship and hopeful futures amid traumas of colonialism, displacement, and climate disaster.  The poems of Las Palmas conjure, walk beside, and tarry with the entangled grief of the long histories and violences in which we are all still embedded. Jones offers homage to the anguished beauties and truths that poet Jay Wright once said were “the disturbances” that “our ancestors create in us.” Grounded in musicality and haptics, Las Palmas seeks to salvage and mend while meditating on materiality, loss, cartography, kinship, displacement, coloniality, the “modern” world, and climate disasters. Throughout this collection, Keith Jones finds truth and community amid despair and the cruelest of circumstances, working through traumatic intimacies and mapping new imaginaries.Las Palmas is the winner of the 2023 Omnidawn Poetry Chapbook Contest, selected by Brody Parrish Craig.

When two simple hobos-a pigeon and his elephant buddy-are wrongfully accused of murdering Mr. Mouse Mouser, the consequences are dire. Secretimes delineates an alternate universe-a world that fa- vors the rich and grinds the poor and unfortunate into paste. Each page is a brightly colored nightmare populated with vapid celebrities and lazily scheming businessmen. Keith Jones creates a pop parable that is stunning and alluring to look at and hellish to live in. Graffiti- covered walls, melting neon figures, idiosyncratic sound effects, and anthropomorphized bros meld together in this satire of modern life and mod- ern values. His sense of humor is manic, snick- ering, and surreal, each line imbued with a rich sense of irony. Jones's pacing gives each page a frenzied paranoia that belies his charcters' fantasies of utter control. Secretimes is darkly funy in Jones's irresistibly offkilter signature style.

Lyrically inventive, ekphrastic poems that interrogate art, race, and humanity’s dark history.These poems stress the weight of what it means to speak from and in an already “known” world.  In this debut collection from Keith Jones, the opening poems tarry with and think alongside the paintings of Cy Twombly. If Twombly is a painter of the Middle Sea, this song series conjures the longue durée of the Middle Passage. The poems then turn to resituate a “you” and “I” in a world, our world, disfigured by false and deathly approximations of the “human.” Perched on the jagged-edge of how many known and unknown catastrophes, how do we remake, rethink, reimagine, repair in language and act our relations to one another and to the earth?  In the thinking and feeling of these poems, the great recursive swirling arcs of Twombly’s painterly line recur and intersect.Beyond the materiality of Twombly’s paint, beyond the materiality of the poem, we arrive at a profound place of thought, a kind of state, perhaps a republic of many worlds, alive to all our relations and how much they matter.

In this context, research on the teaching and learning of geometry will continue to be a key element on the research agendas of mathematics educators, as researchers continue to look for ways to enhance student learning and to understand student thinking and teachers’ decision making.

This book contributes to both mathematical problem solving and the communication of mathematics by students, and the role of personal and home technologies in learning beyond school. It does this by reporting on major results and implications of the Problem@Web project that investigated youngsters’ mathematical problem solving and, in particular, their use of digital technologies in tackling, and communicating the results of their problem solving, in environments beyond school. The book has two focuses: Mathematical problem solving skills and strategies, forms of representing and expressing mathematical thinking, technological-based solutions; and students´ and teachers´ perspectives on mathematics learning, especially school compared to beyond-school mathematics.

In this context, research on the teaching and learning of geometry will continue to be a key element on the research agendas of mathematics educators, as researchers continue to look for ways to enhance student learning and to understand student thinking and teachers’ decision making.

This book contributes to both mathematical problem solving and the communication of mathematics by students, and the role of personal and home technologies in learning beyond school.

The innovative volume seeks to broaden the scope of research on mathematical problem solving in different educational environments. It brings together contributions not only from leading researchers, but also highlights collaborations with younger researchers to broadly explore mathematical problem-solving across many fields: mathematics education, psychology of education, technology education, mathematics popularization, and more. The volume’s three major themes—technology, creativity, and affect—represent key issues that are crucially embedded in the activity of problem solving in mathematics teaching and learning, both within the school setting and beyond the school. Through the book’s new pedagogical perspectives on these themes, it advances the field of research towards a more comprehensive approach on mathematical problem solving. Broadening the Scope of Research on Mathematical Problem Solving will prove to be a valuable resource for researchers and teachers interestedin mathematical problem solving, as well as researchers and teachers interested in technology, creativity, and affect.

Most real-world spectrum analysis problems involve the computation of the real-data discrete Fourier transform (DFT), a unitary transform that maps elements N of the linear space of real-valued N-tuples, R , to elements of its complex-valued N counterpart, C , and when carried out in hardware it is conventionally achieved via a real-from-complex strategy using a complex-data version of the fast Fourier transform (FFT), the generic name given to the class of fast algorithms used for the ef?cient computation of the DFT. Such algorithms are typically derived by explo- ing the property of symmetry, whether it exists just in the transform kernel or, in certain circumstances, in the input data and/or output data as well. In order to make effective use of a complex-data FFT, however, via the chosen real-from-complex N strategy, the input data to the DFT must ?rst be converted from elements of R to N elements of C . The reason for choosing the computational domain of real-data problems such N N as this to be C , rather than R , is due in part to the fact that computing equ- ment manufacturers have invested so heavily in producing digital signal processing (DSP) devices built around the design of the complex-data fast multiplier and accumulator (MAC), an arithmetic unit ideally suited to the implementation of the complex-data radix-2 butter?y, the computational unit used by the familiar class of recursive radix-2 FFT algorithms.