958 resultados para Extremal polynomial ultraspherical polynomials
Resumo:
This research is based on the problems in secondary school algebra I have noticed in my own work as a teacher of mathematics. Algebra does not touch the pupil, it remains knowledge that is not used or tested. Furthermore the performance level in algebra is quite low. This study presents a model for 7th grade algebra instruction in order to make algebra more natural and useful to students. I refer to the instruction model as the Idea-based Algebra (IDEAA). The basic ideas of this IDEAA model are 1) to combine children's own informal mathematics with scientific mathematics ("math math") and 2) to structure algebra content as a "map of big ideas", not as a traditional sequence of powers, polynomials, equations, and word problems. This research project is a kind of design process or design research. As such, this project has three, intertwined goals: research, design and pedagogical practice. I also assume three roles. As a researcher, I want to learn about learning and school algebra, its problems and possibilities. As a designer, I use research in the intervention to develop a shared artefact, the instruction model. In addition, I want to improve the practice through intervention and research. A design research like this is quite challenging. Its goals and means are intertwined and change in the research process. Theory emerges from the inquiry; it is not given a priori. The aim to improve instruction is normative, as one should take into account what "good" means in school algebra. An important part of my study is to work out these paradigmatic questions. The result of the study is threefold. The main result is the instruction model designed in the study. The second result is the theory that is developed of the teaching, learning and algebra. The third result is knowledge of the design process. The instruction model (IDEAA) is connected to four main features of good algebra education: 1) the situationality of learning, 2) learning as knowledge building, in which natural language and intuitive thinking work as "intermediaries", 3) the emergence and diversity of algebra, and 4) the development of high performance skills at any stage of instruction.
Resumo:
Identification of the optimum generation schedule by various methods of coordinating incremental generation costs and incremental transmission losses has been described previously in the literature. This paper presents an analytical approach which reduces the time-consuming iterative procedure into a mere positive-root determination of a third-order polynomial in λ. This approach includes the effect of transmission losses and is suitable for systems with any number of plants. The validity and effectiveness of this method are demonstrated by analysing a sample system.
Resumo:
A finite element analysis of thin-walled open-section laminated anisotropic beams is presented herein. A two-noded, 8 degrees of freedom per node thin-walled open-section laminated anisotropic beam finite element has been developed and used. The displacements of the element reference axes are expressed in terms of one-dimensional first order Hermite interpolation polynomials and line member assumptions are invoked in the formulation of the stiffness matrix. The problems of: 1. (a) an isotropic material Z section straight cantilever beam, and 2. (b) a single-layer (0°) composite Z section straight cantilever beam, for which continuum solutions (exact/approximate) are possible, have been solved in order to evaluate the performance of the finite element. Its applicability has been shown by solving the following problems: 3. (c) a two-layer (45°/−45°) composite Z section straight cantilever beam, 4. (d) a three-layer (0°/45°/0°) composite Z section straight cantilever beam.
Resumo:
The details of development of the stiffness matrix of a laminated anisotropic curved beam finite element are reported. It is a 16 dof element which makes use of 1-D first order Hermite interpolation polynomials for expressing it's assumed displacement state. The performance of the element is evaluated considering various examples for which analytical or other solutions are available.
Resumo:
Using polynomial regression and response surface analysis to examine the non-linearity between variables, this study demonstrates that better analytical nuances are required to investigate the relationships between constructs when the underlying theories suggest non-linearity. By utilising the Theory of Planned Behaviour (TPB), Ettlie’s adoption stages as well as employing data gathered from 162 owners of Small and Medium-sized Enterprises (SMEs), our findings reveal that subjective norms and attitude have differing influences upon behavioural intention in both the evaluation and trial stages of the adoption.
Resumo:
The “partition method” or “sub-domain method” consists of expressing the solution of a governing differential equation, partial or ordinary, in terms of functions which satisfy the boundary conditions and setting to zero the error in the differential equation integrated over each of the sub-domains into which the given domain is partitioned. In this paper, the use of this method in eigenvalue problems with particular reference to vibration of plates is investigated. The deflection of the plate is expressed in terms of polynomials satisfying the boundary conditions completely. Setting the integrated error in each of the subdomains to zero results in a set of simultaneous, linear, homogeneous, algebraic equations in the undetermined coefficients of the deflection series. The algebraic eigenvalue problem is then solved for eigenvalues and eigenvectors. Convergence is examined in a few typical cases and is found to be satisfactory. The results obtained are compared with existing results based on other methods and are found to be in very good agreement.
Resumo:
This paper considers the on-line identification of a non-linear system in terms of a Hammerstein model, with a zero-memory non-linear gain followed by a linear system. The linear part is represented by a Laguerre expansion of its impulse response and the non-linear part by a polynomial. The identification procedure involves determination of the coefficients of the Laguerre expansion of correlation functions and an iterative adjustment of the parameters of the non-linear gain by gradient methods. The method is applicable to situations involving a wide class of input signals. Even in the presence of additive correlated noise, satisfactory performance is achieved with the variance of the error converging to a value close to the variance of the noise. Digital computer simulation establishes the practicability of the scheme in different situations.
Resumo:
The “partition method” or “sub-domain method” consists of expressing the solution of a governing differential equation, partial or ordinary, in terms of functions which satisfy the boundary conditions and setting to zero the error in the differential equation integrated over each of the sub-domains into which the given domain is partitioned. In this paper, the use of this method in eigenvalue problems with particular reference to vibration of plates is investigated. The deflection of the plate is expressed in terms of polynomials satisfying the boundary conditions completely. Setting the integrated error in each of the subdomains to zero results in a set of simultaneous, linear, homogeneous, algebraic equations in the undetermined coefficients of the deflection series. The algebraic eigenvalue problem is then solved for eigenvalues and eigenvectors. Convergence is examined in a few typical cases and is found to be satisfactory. The results obtained are compared with existing results based on other methods and are found to be in very good agreement.
Resumo:
The parametric resonance in a system having two modes of the same frequency is studied. The simultaneous occurence of the instabilities of the first and second kind is examined, by using a generalized perturbation procedure. The region of instability in the first approximation is obtained by using the Sturm's theorem for the roots of a polynomial equation.
Resumo:
Self-tuning is applied to the control of nonlinear systems represented by the Hammerstein model wherein the nonlinearity is any odd-order polynomial. But control costing is not feasible in general. Initial relay control is employed to contain the deviations.
Resumo:
The classical Rayleigh-Ritz method with simple polynomials as admissible functions has been used for obtaining natural frequencies of transversely vibrating polar orthotropic annular plates. The method in conjunction with transformations introduced in the analysis has been found to be quite effective, particularly for large hole sizes. Estimates of natural frequencies corresponding to modes with one as well as two nodal diameters are obtained for the nine combinations of clamped, simply supported and free edge conditions and for various values of rigidity ratio and hole sizes. Based on the variation of eigenvalue parameter with rigidity ratio, the frequencies of these modes as well as those of axisymmetric modes have been expressed by means of simple formulae in terms of rigidity ratio and the frequencies of corresponding modes in the isotropic case. These formulae have been used in determining the fundamental frequencies of orthotropic plates.
Resumo:
This thesis consists of an introduction, four research articles and an appendix. The thesis studies relations between two different approaches to continuum limit of models of two dimensional statistical mechanics at criticality. The approach of conformal field theory (CFT) could be thought of as the algebraic classification of some basic objects in these models. It has been succesfully used by physicists since 1980's. The other approach, Schramm-Loewner evolutions (SLEs), is a recently introduced set of mathematical methods to study random curves or interfaces occurring in the continuum limit of the models. The first and second included articles argue on basis of statistical mechanics what would be a plausible relation between SLEs and conformal field theory. The first article studies multiple SLEs, several random curves simultaneously in a domain. The proposed definition is compatible with a natural commutation requirement suggested by Dubédat. The curves of multiple SLE may form different topological configurations, ``pure geometries''. We conjecture a relation between the topological configurations and CFT concepts of conformal blocks and operator product expansions. Example applications of multiple SLEs include crossing probabilities for percolation and Ising model. The second article studies SLE variants that represent models with boundary conditions implemented by primary fields. The most well known of these, SLE(kappa, rho), is shown to be simple in terms of the Coulomb gas formalism of CFT. In the third article the space of local martingales for variants of SLE is shown to carry a representation of Virasoro algebra. Finding this structure is guided by the relation of SLEs and CFTs in general, but the result is established in a straightforward fashion. This article, too, emphasizes multiple SLEs and proposes a possible way of treating pure geometries in terms of Coulomb gas. The fourth article states results of applications of the Virasoro structure to the open questions of SLE reversibility and duality. Proofs of the stated results are provided in the appendix. The objective is an indirect computation of certain polynomial expected values. Provided that these expected values exist, in generic cases they are shown to possess the desired properties, thus giving support for both reversibility and duality.
Resumo:
We study a Hamiltonian describing a pendulum coupled with several anisochronous oscillators, giving a simple construction of unstable KAM tori and their stable and unstable manifolds for analytic perturbations. When the coupling takes place through an even trigonometric polynomial in the angle variables, we extend analytically the solutions of the equations of motion, order by order in the perturbation parameter, to a large neighbourhood of the real line representing time. Subsequently, we devise an asymptotic expansion for the splitting (matrix) associated with a homoclinic point. This expansion consists of contributions that are manifestly exponentially small in the limit of vanishing gravity, by a shift-of-countour argument. Hence, we infer a similar upper bound for the splitting itself. In particular, the derivation of the result does not call for a tree expansion with explicit cancellation mechanisms.
Resumo:
Planar curves arise naturally as interfaces between two regions of the plane. An important part of statistical physics is the study of lattice models. This thesis is about the interfaces of 2D lattice models. The scaling limit is an infinite system limit which is taken by letting the lattice mesh decrease to zero. At criticality, the scaling limit of an interface is one of the SLE curves (Schramm-Loewner evolution), introduced by Oded Schramm. This family of random curves is parametrized by a real variable, which determines the universality class of the model. The first and the second paper of this thesis study properties of SLEs. They contain two different methods to study the whole SLE curve, which is, in fact, the most interesting object from the statistical physics point of view. These methods are applied to study two symmetries of SLE: reversibility and duality. The first paper uses an algebraic method and a representation of the Virasoro algebra to find common martingales to different processes, and that way, to confirm the symmetries for polynomial expected values of natural SLE data. In the second paper, a recursion is obtained for the same kind of expected values. The recursion is based on stationarity of the law of the whole SLE curve under a SLE induced flow. The third paper deals with one of the most central questions of the field and provides a framework of estimates for describing 2D scaling limits by SLE curves. In particular, it is shown that a weak estimate on the probability of an annulus crossing implies that a random curve arising from a statistical physics model will have scaling limits and those will be well-described by Loewner evolutions with random driving forces.
Resumo:
The analysis of sequential data is required in many diverse areas such as telecommunications, stock market analysis, and bioinformatics. A basic problem related to the analysis of sequential data is the sequence segmentation problem. A sequence segmentation is a partition of the sequence into a number of non-overlapping segments that cover all data points, such that each segment is as homogeneous as possible. This problem can be solved optimally using a standard dynamic programming algorithm. In the first part of the thesis, we present a new approximation algorithm for the sequence segmentation problem. This algorithm has smaller running time than the optimal dynamic programming algorithm, while it has bounded approximation ratio. The basic idea is to divide the input sequence into subsequences, solve the problem optimally in each subsequence, and then appropriately combine the solutions to the subproblems into one final solution. In the second part of the thesis, we study alternative segmentation models that are devised to better fit the data. More specifically, we focus on clustered segmentations and segmentations with rearrangements. While in the standard segmentation of a multidimensional sequence all dimensions share the same segment boundaries, in a clustered segmentation the multidimensional sequence is segmented in such a way that dimensions are allowed to form clusters. Each cluster of dimensions is then segmented separately. We formally define the problem of clustered segmentations and we experimentally show that segmenting sequences using this segmentation model, leads to solutions with smaller error for the same model cost. Segmentation with rearrangements is a novel variation to the segmentation problem: in addition to partitioning the sequence we also seek to apply a limited amount of reordering, so that the overall representation error is minimized. We formulate the problem of segmentation with rearrangements and we show that it is an NP-hard problem to solve or even to approximate. We devise effective algorithms for the proposed problem, combining ideas from dynamic programming and outlier detection algorithms in sequences. In the final part of the thesis, we discuss the problem of aggregating results of segmentation algorithms on the same set of data points. In this case, we are interested in producing a partitioning of the data that agrees as much as possible with the input partitions. We show that this problem can be solved optimally in polynomial time using dynamic programming. Furthermore, we show that not all data points are candidates for segment boundaries in the optimal solution.