Piecewise

About: Piecewise is a research topic. Over the lifetime, 21064 publications have been published within this topic receiving 432096 citations. The topic is also known as: piecewise-defined function & hybrid function.

A practical guide to splines

Abstract: This book is based on the author's experience with calculations involving polynomial splines. It presents those parts of the theory which are especially useful in calculations and stresses the representation of splines as linear combinations of B-splines. After two chapters summarizing polynomial approximation, a rigorous discussion of elementary spline theory is given involving linear, cubic and parabolic splines. The computational handling of piecewise polynomial functions (of one variable) of arbitrary order is the subject of chapters VII and VIII, while chapters IX, X, and XI are devoted to B-splines. The distances from splines with fixed and with variable knots is discussed in chapter XII. The remaining five chapters concern specific approximation methods, interpolation, smoothing and least-squares approximation, the solution of an ordinary differential equation by collocation, curve fitting, and surface fitting. The present text version differs from the original in several respects. The book is now typeset (in plain TeX), the Fortran programs now make use of Fortran 77 features. The figures have been redrawn with the aid of Matlab, various errors have been corrected, and many more formal statements have been provided with proofs. Further, all formal statements and equations have been numbered by the same numbering system, to make it easier to find any particular item. A major change has occured in Chapters IX-XI where the B-spline theory is now developed directly from the recurrence relations without recourse to divided differences. This has brought in knot insertion as a powerful tool for providing simple proofs concerning the shape-preserving properties of the B-spline series.

Ideal spatial adaptation by wavelet shrinkage

Abstract: SUMMARY With ideal spatial adaptation, an oracle furnishes information about how best to adapt a spatially variable estimator, whether piecewise constant, piecewise polynomial, variable knot spline, or variable bandwidth kernel, to the unknown function. Estimation with the aid of an oracle offers dramatic advantages over traditional linear estimation by nonadaptive kernels; however, it is a priori unclear whether such performance can be obtained by a procedure relying on the data alone. We describe a new principle for spatially-adaptive estimation: selective wavelet reconstruction. We show that variable-knot spline fits and piecewise-polynomial fits, when equipped with an oracle to select the knots, are not dramatically more powerful than selective wavelet reconstruction with an oracle. We develop a practical spatially adaptive method, RiskShrink, which works by shrinkage of empirical wavelet coefficients. RiskShrink mimics the performance of an oracle for selective wavelet reconstruction as well as it is possible to do so. A new inequality in multivariate normal decision theory which we call the oracle inequality shows that attained performance differs from ideal performance by at most a factor of approximately 2 log n, where n is the sample size. Moreover no estimator can give a better guarantee than this. Within the class of spatially adaptive procedures, RiskShrink is essentially optimal. Relying only on the data, it comes within a factor log 2 n of the performance of piecewise polynomial and variableknot spline methods equipped with an oracle. In contrast, it is unknown how or if piecewise polynomial methods could be made to function this well when denied access to an oracle and forced to rely on data alone.

Optimal approximations by piecewise smooth functions and associated variational problems

Abstract: : This reprint will introduce and study the most basic properties of three new variational problems which are suggested by applications to computer vision. In computer vision, a fundamental problem is to appropriately decompose the domain R of a function g (x,y) of two variables. This problem starts by describing the physical situation which produces images: assume that a three-dimensional world is observed by an eye or camera from some point P and that g1(rho) represents the intensity of the light in this world approaching the point sub 1 from a direction rho. If one has a lens at P focusing this light on a retina or a film-in both cases a plane domain R in which we may introduce coordinates x, y then let g(x,y) be the strength of the light signal striking R at a point with coordinates (x,y); g(x,y) is essentially the same as sub 1 (rho) -possibly after a simple transformation given by the geometry of the imaging syste. The function g(x,y) defined on the plane domain R will be called an image. What sort of function is g? The light reflected off the surfaces Si of various solid objects O sub i visible from P will strike the domain R in various open subsets R sub i. When one object O1 is partially in front of another object O2 as seen from P, but some of object O2 appears as the background to the sides of O1, then the open sets R1 and R2 will have a common boundary (the 'edge' of object O1 in the image defined on R) and one usually expects the image g(x,y) to be discontinuous along this boundary. (JHD)

An improved algorithm for reaction path following

Abstract: A new algorithm is presented for obtaining points on a steepest descent path from the transition state of the reactants and products. In mass‐weighted coordinates, this path corresponds to the intrinsic reaction coordinate. Points on the reaction path are found by constrained optimizations involving all internal degrees of freedom of the molecule. The points are optimized so that the segment of the reaction path between any two adjacent points is given by an arc of a circle, and so that the gradient at each point is tangent to the path. Only the transition vector and the energy gradients are needed to construct the path. The resulting path is continuous, differentiable and piecewise quadratic. In the limit of small step size, the present algorithm is shown to take a step with the correct tangent vector and curvature vector; hence, it is a second order algorithm. The method has been tested on the following reactions: HCN→CNH, SiH2+H2→SiH4, CH4+H→CH3+H2, F−+CH3F→FCH3+F−, and C2H5F→C2H4+HF. Reaction paths calculated with a step size of 0.4 a.u. are almost identical to those computed with a step size of 0.1 a.u. or smaller.

Reaction Path Following in Mass-Weighted Internal Coordinates

Abstract: Our previous algorithm for following reaction paths downhill (J. Chem. Phys. 1989, 90, 2154), has been extended to use mass-weighted internal coordinates. Points on the reaction path are round by constrained optimizations involving the internal degrees or freedom or the molecule. The points are optimized so that the segment or the reaction path between any two adjacent points is described by an arc or a circle in mass-weighted internal coordinates, and so that the gradients (in mass-weighted internals) at the end points or the arc are tangent to the path. The algorithm has the correct tangent vector and curvature vectors in the limit or small step size but requires only the transition vector and the energy gradients; the resulting path is continuous, differentiable, and piecewise quadratic