18 products were found matching your search for Piecewise in 1 shops:

Piecewise monotone mappings on an interval provide simple examples of discrete dynamical systems whose behaviour can be very complicated. These notes are concerned with the properties of the iterates of such mappings. The material presented can be understood by anyone who has had a basic course in (one-dimensional) real analysis. The account concentrates on the topological (as opposed to the measure theoretical) aspects of the theory of piecewise monotone mappings. As well as offering an elementary introduction to this theory, these notes also contain a more advanced treatment of the problem of classifying such mappings up to topological conjugacy.

The book gives an account of handle theory in a piecewise-linear setting and could be the basis of a first year postgraduate lecture or reading course.

The first five chapters of this book form an introductory course in piece­ wise-linear topology in which no assumptions are made other than basic topological notions. This course would be suitable as a second course in topology with a geometric flavour, to follow a first course in point-set topology, andi)erhaps to be given as a final year undergraduate course. The whole book gives an account of handle theory in a piecewise­ linear setting and could be the basis of a first year postgraduate lecture or reading course. Some results from algebraic topology are needed for handle theory and these are collected in an appendix. In a second appen­ dix are listed the properties of Whitehead torsion which are used in the s-cobordism theorem. These appendices should enable a reader with only basic knowledge to complete the book. The book is also intended to form an introduction to modern geo­ metric topology as a research subject, a bibliography of research papers being included. We have omitted acknowledgements and references from the main text and have collected these in a set of "historical notes" to be found after the appendices.

The first five chapters of this book form an introductory course in piece­ wise-linear topology in which no assumptions are made other than basic topological notions. This course would be suitable as a second course in topology with a geometric flavour, to follow a first course in point-set topology, andi)erhaps to be given as a final year undergraduate course. The whole book gives an account of handle theory in a piecewise­ linear setting and could be the basis of a first year postgraduate lecture or reading course. Some results from algebraic topology are needed for handle theory and these are collected in an appendix. In a second appen­ dix are listed the properties of Whitehead torsion which are used in the s-cobordism theorem. These appendices should enable a reader with only basic knowledge to complete the book. The book is also intended to form an introduction to modern geo­ metric topology as a research subject, a bibliography of research papers being included. We have omitted acknowledgements and references from the main text and have collected these in a set of "historical notes" to be found after the appendices.

The book explores the possibility of extending the notions of "Grassmannian" and "Gauss map" to the PL category. They are distinguished from "classifying space" and "classifying map" which are essentially homotopy-theoretic notions. The analogs of Grassmannian and Gauss map defined incorporate geometric and combinatorial information. Principal applications involve characteristic class theory, smoothing theory, and the existence of immersion satifying certain geometric criteria, e.g. curvature conditions. The book assumes knowledge of basic differential topology and bundle theory, including Hirsch-Gromov-Phillips theory, as well as the analogous theories for the PL category. The work should be of interest to mathematicians concerned with geometric topology, PL and PD aspects of differential geometry and the geometry of polyhedra.

The book explores the possibility of extending the notions of "Grassmannian" and "Gauss map" to the PL category. They are distinguished from "classifying space" and "classifying map" which are essentially homotopy-theoretic notions. The analogs of Grassmannian and Gauss map defined incorporate geometric and combinatorial information. Principal applications involve characteristic class theory, smoothing theory, and the existence of immersion satifying certain geometric criteria, e.g. curvature conditions. The book assumes knowledge of basic differential topology and bundle theory, including Hirsch-Gromov-Phillips theory, as well as the analogous theories for the PL category. The work should be of interest to mathematicians concerned with geometric topology, PL and PD aspects of differential geometry and the geometry of polyhedra.

Analytic philosophers once pantomimed physics: they tried to understand the world by breaking it down into the smallest possible bits. Thinkers from the Darwinian sciences now pose alternatives to this simplistic reductionism. In this intellectual tour--essays spanning thirty years--William Wimsatt argues that scientists seek to atomize phenomena only when necessary in the search to understand how entities, events, and processes articulate at different levels. Evolution forms the natural world not as Laplace's all-seeing demon but as a backwoods mechanic fixing and re-fashioning machines out of whatever is at hand. W. V. Quine's lost search for a "desert ontology" leads instead to Wimsatt's walk through a tropical rain forest.This book offers a philosophy for error-prone humans trying to understand messy systems in the real world. Against eliminative reductionism, Wimsatt pits new perspectives to deal with emerging natural and social complexities. He argues that our philosophy should be rooted in heuristics and models that work in practice, not only in principle. He demonstrates how to do this with an analysis of the strengths, the limits, and a recalibration of our reductionistic and analytic methodologies. Our aims are changed and our philosophy is transfigured in the process.

Analytic philosophers once pantomimed physics: they tried to understand the world by breaking it down into the smallest possible bits. Thinkers from the Darwinian sciences now pose alternatives to this simplistic reductionism. In this intellectual tour--essays spanning thirty years--William Wimsatt argues that scientists seek to atomize phenomena only when necessary in the search to understand how entities, events, and processes articulate at different levels. Evolution forms the natural world not as Laplace's all-seeing demon but as a backwoods mechanic fixing and re-fashioning machines out of whatever is at hand. W. V. Quine's lost search for a "desert ontology" leads instead to Wimsatt's walk through a tropical rain forest.This book offers a philosophy for error-prone humans trying to understand messy systems in the real world. Against eliminative reductionism, Wimsatt pits new perspectives to deal with emerging natural and social complexities. He argues that our philosophy should be rooted in heuristics and models that work in practice, not only in principle. He demonstrates how to do this with an analysis of the strengths, the limits, and a recalibration of our reductionistic and analytic methodologies. Our aims are changed and our philosophy is transfigured in the process.

Written by authors at the forefront of modern algorithms research, Delaunay Mesh Generation demonstrates the power and versatility of Delaunay meshers in tackling complex geometric domains ranging from polyhedra with internal boundaries to piecewise smooth surfaces. Covering both volume and surface meshes, the authors fully explain how and why these meshing algorithms work. The book is one of the first to integrate a vast amount of cutting-edge material on Delaunay triangulations. It begins with introducing the problem of mesh generation and describing algorithms for constructing Delaunay triangulations. The authors then present algorithms for generating high-quality meshes in polygonal and polyhedral domains. They also illustrate how to use restricted Delaunay triangulations to extend the algorithms to surfaces with ridges and patches and volumes with smooth surfaces. For researchers and graduate students, the book offers a rigorous theoretical analysis of mesh generation methods. It provides the necessary mathematical foundations and core theoretical results upon which researchers can build even better algorithms in the future. For engineers, the book shows how the algorithms work well in practice. It explains how to effectively implement them in the design and programming of mesh generation software.

This volume comprises the proceedings of the second Shrivenham conference on Algorithms for Approximation. The term 'approximation' here refers to 'the approximation of functions and data by similar functions', and leads to such topics as curve and surface fitting, spline and piecewise polynomial methods, finite element modelling, and computer-aided design. Applications are given to a wide variety of areas such as surveying, meteorology, radar antenna and acoustic array design, topography, engineering metrology, and CAD/CAM. Emphasis at the meeting was placed on the development of useful algorithms, and on practical applications in defence and industry.In addition, some 40 submitted papers were selected and presented on a multitude of topics such as multivariate interpolation, optimization methods, constrained problems, spline fitting, data modelling, and applications in microwave measurement, isotropic antennas, sound measurement, and digitized contours.

Most functions that occur in mathematics cannot be used directly in computer calculations. Instead they are approximated by manageable functions such as polynomials and piecewise polynomials. The general theory of the subject and its application to polynomial approximation are classical, but piecewise polynomials have become far more useful during the last twenty years. Thus many important theoretical properties have been found recently and many new techniques for the automatic calculation of approximations to prescribed accuracy have been developed. This book gives a thorough and coherent introduction to the theory that is the basis of current approximation methods. Professor Powell describes and analyses the main techniques of calculation supplying sufficient motivation throughout the book to make it accessible to scientists and engineers who require approximation methods for practical needs. Because the book is based on a course of lectures to third-year undergraduates in mathematics at Cambridge University, sufficient attention is given to theory to make it highly suitable as a mathematical textbook at undergraduate or postgraduate level.

This book is a publication in Swiss Seminars, a subseries of Progress in Mathematics. It is an expanded version of the notes from a seminar on intersection cohomology theory, which met at the University of Bern, Switzerland, in the spring of 1983. This volume supplies an introduction to the piecewise linear and sheaf-theoretic versions of that theory as developed by M. Goresky and R. MacPherson in Topology 19 (1980), and in Inventiones Mathematicae 72 (1983). While some familiarity with algebraic topology and sheaf theory is assumed, the notes include a self-contained account of further material on constructibility, derived categories, Verdier duality, biduality, and on stratified spaces, which is used in the second paper but not found in standard texts.   "The volume should be useful to someone interested in acquiring some basic knowledge about the field..." —Mathematical Reviews

Most functions that occur in mathematics cannot be used directly in computer calculations. Instead they are approximated by manageable functions such as polynomials and piecewise polynomials. The general theory of the subject and its application to polynomial approximation are classical, but piecewise polynomials have become far more useful during the last twenty years. Thus many important theoretical properties have been found recently and many new techniques for the automatic calculation of approximations to prescribed accuracy have been developed. This book gives a thorough and coherent introduction to the theory that is the basis of current approximation methods. Professor Powell describes and analyses the main techniques of calculation supplying sufficient motivation throughout the book to make it accessible to scientists and engineers who require approximation methods for practical needs. Because the book is based on a course of lectures to third-year undergraduates in mathematics at Cambridge University, sufficient attention is given to theory to make it highly suitable as a mathematical textbook at undergraduate or postgraduate level.

This book is a publication in Swiss Seminars, a subseries of Progress in Mathematics. It is an expanded version of the notes from a seminar on intersection cohomology theory, which met at the University of Bern, Switzerland, in the spring of 1983. This volume supplies an introduction to the piecewise linear and sheaf-theoretic versions of that theory as developed by M. Goresky and R. MacPherson in Topology 19 (1980), and in Inventiones Mathematicae 72 (1983). While some familiarity with algebraic topology and sheaf theory is assumed, the notes include a self-contained account of further material on constructibility, derived categories, Verdier duality, biduality, and on stratified spaces, which is used in the second paper but not found in standard texts.   "The volume should be useful to someone interested in acquiring some basic knowledge about the field..." —Mathematical Reviews

Written by authors at the forefront of modern algorithms research, Delaunay Mesh Generation demonstrates the power and versatility of Delaunay meshers in tackling complex geometric domains ranging from polyhedra with internal boundaries to piecewise smooth surfaces. Covering both volume and surface meshes, the authors fully explain how and why these meshing algorithms work. The book is one of the first to integrate a vast amount of cutting-edge material on Delaunay triangulations. It begins with introducing the problem of mesh generation and describing algorithms for constructing Delaunay triangulations. The authors then present algorithms for generating high-quality meshes in polygonal and polyhedral domains. They also illustrate how to use restricted Delaunay triangulations to extend the algorithms to surfaces with ridges and patches and volumes with smooth surfaces. For researchers and graduate students, the book offers a rigorous theoretical analysis of mesh generation methods. It provides the necessary mathematical foundations and core theoretical results upon which researchers can build even better algorithms in the future. For engineers, the book shows how the algorithms work well in practice. It explains how to effectively implement them in the design and programming of mesh generation software.

This book is based on research on the rigorous proof of chaos and bifurcations in 2-D quadratic maps, especially the invertible case such as the Hénon map, and in 3-D ODE's, especially piecewise linear systems such as the Chua's circuit. In addition, the book covers some recent works in the field of general 2-D quadratic maps, especially their classification into equivalence classes, and finding regions for chaos, hyperchaos, and non-chaos in the space of bifurcation parameters. Following the main introduction to the rigorous tools used to prove chaos and bifurcations in the two representative systems, is the study of the invertible case of the 2-D quadratic map, where previous works are oriented toward Hénon mapping. 2-D quadratic maps are then classified into 30 maps with well-known formulas. Two proofs on the regions for chaos, hyperchaos, and non-chaos in the space of the bifurcation parameters are presented using a technique based on the second-derivative test and bounds for Lyapunov exponents. Also included is the proof of chaos in the piecewise linear Chua's system using two methods, the first of which is based on the construction of Poincaré map, and the second is based on a computer-assisted proof. Finally, a rigorous analysis is provided on the bifurcational phenomena in the piecewise linear Chua's system using both an analytical 2-D mapping and a 1-D approximated Poincaré mapping in addition to other analytical methods.

Compactly supported smooth piecewise polynomial functions provide an efficient tool for the approximation of curves and surfaces and other smooth functions of one and several arguments. Since they are locally polynomial, they are easy to evaluate. Since they are smooth, they can be used when smoothness is required, as in the numerical solution of partial differential equations (in the Finite Element method) or the modeling of smooth sur­ faces (in Computer Aided Geometric Design). Since they are compactly supported, their linear span has the needed flexibility to approximate at all, and the systems to be solved in the construction of approximations are 'banded'. The construction of compactly supported smooth piecewise polynomials becomes ever more difficult as the dimension, s, of their domain G ~ IRs, i. e. , the number of arguments, increases. In the univariate case, there is only one kind of cell in any useful partition, namely, an interval, and its boundary consists of two separated points, across which polynomial pieces would have to be matched as one constructs a smooth piecewise polynomial function. This can be done easily, with the only limitation that the num­ ber of smoothness conditions across such a breakpoint should not exceed the polynomial degree (since that would force the two joining polynomial pieces to coincide). In particular, on any partition, there are (nontrivial) compactly supported piecewise polynomials of degree ~ k and in C(k-l), of which the univariate B-spline is the most useful example.

Compactly supported smooth piecewise polynomial functions provide an efficient tool for the approximation of curves and surfaces and other smooth functions of one and several arguments. Since they are locally polynomial, they are easy to evaluate. Since they are smooth, they can be used when smoothness is required, as in the numerical solution of partial differential equations (in the Finite Element method) or the modeling of smooth sur­ faces (in Computer Aided Geometric Design). Since they are compactly supported, their linear span has the needed flexibility to approximate at all, and the systems to be solved in the construction of approximations are 'banded'. The construction of compactly supported smooth piecewise polynomials becomes ever more difficult as the dimension, s, of their domain G ~ IRs, i. e. , the number of arguments, increases. In the univariate case, there is only one kind of cell in any useful partition, namely, an interval, and its boundary consists of two separated points, across which polynomial pieces would have to be matched as one constructs a smooth piecewise polynomial function. This can be done easily, with the only limitation that the num­ ber of smoothness conditions across such a breakpoint should not exceed the polynomial degree (since that would force the two joining polynomial pieces to coincide). In particular, on any partition, there are (nontrivial) compactly supported piecewise polynomials of degree ~ k and in C(k-l), of which the univariate B-spline is the most useful example.