Relevant bibliographies by topics / Recursive moments

Academic literature on the topic 'Recursive moments'

Author: Grafiati
Published: 10 December 2022
Last updated: 29 January 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Recursive moments.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Recursive moments"

1

Chong, Chee-Way, P. Raveendran, and R. Mukundan. "An Efficient Algorithm for Fast Computation of Pseudo-Zernike Moments." International Journal of Pattern Recognition and Artificial Intelligence 17, no. 06 (September 2003): 1011–23. http://dx.doi.org/10.1142/s0218001403002769.

Full text
Abstract:
Pseudo-Zernike moments have better feature representation capability, and are more robust to image noise than those of the conventional Zernike moments. However, due to the computation complexity of pseudo-Zernike polynomials, pseudo-Zernike moments are yet to be extensively used as feature descriptors as compared to Zernike moments. In this paper, we propose two new algorithms, namely coefficient method and p-recursive method, to accelerate the computation of pseudo-Zernike moments. Coefficient method calculates polynomial coefficients recursively. It eliminates the need of using factorial functions. Individual order or index of pseudo-Zernike moments can be derived independently, which is useful if selected orders or indices of moments are needed as pattern features. p-recursive method uses a combination of lower order polynomials to derive higher order polynomials with the same index q. Fast computation is achieved because it eliminates the requirements of calculating polynomial coefficients, Bpqk, and power of radius, rk, in each polynomial. The performance of the proposed algorithms on moment computation and image reconstruction, as compared to those of the present methods, are experimentally verified using a set of binary and grayscale images.
APA, Harvard, Vancouver, ISO, and other styles
2

Rincón, Luis. "A moment recursive formula for a class of distributions." Revista de Matemática: Teoría y Aplicaciones 28, no. 2 (July 6, 2021): 261–77. http://dx.doi.org/10.15517/rmta.v28i2.44507.

Full text
Abstract:
We provide a recursive formula for the computation of moments of distributions belonging to a subclass of the exponential family. This subclass includes important cases as the binomial, negative binomial, Poisson, gamma and normal distribution, among others. The recursive formula provides a procedure to sequentially calculate the moments using only elementary operations. The approach makes no use of the moment generating function.
APA, Harvard, Vancouver, ISO, and other styles
3

KIM, JI HYUN. "CODES ASSOCIATED WITH Sp(4,q) AND EVEN-POWER MOMENTS OF KLOOSTERMAN SUMS." Bulletin of the Australian Mathematical Society 79, no. 3 (April 17, 2009): 427–35. http://dx.doi.org/10.1017/s0004972708001366.

Full text
Abstract:
AbstractHere we derive a recursive formula for even-power moments of Kloosterman sums or equivalently for power moments of two-dimensional Kloosterman sums. This is done by using the Pless power-moment identity and an explicit expression of the Gauss sum for Sp(4,q).
APA, Harvard, Vancouver, ISO, and other styles
4

Kuba, Markus, and Alois Panholzer. "Limiting Distributions for a Class Of Diminishing Urn Models." Advances in Applied Probability 44, no. 1 (March 2012): 87–116. http://dx.doi.org/10.1239/aap/1331216646.

Full text
Abstract:
In this work we analyze a class of 2 × 2 Pólya-Eggenberger urn models with ball replacement matrix and c = pa with . We determine limiting distributions by obtaining a precise recursive description of the moments of the considered random variables, which allows us to deduce asymptotic expansions of the moments. In particular, we obtain limiting distributions for the pills problem a = c = d = 1, originally proposed by Knuth and McCarthy. Furthermore, we also obtain limiting distributions for the well-known sampling without replacement urn, a = d = 1 and c = 0, and generalizations of it to arbitrary and c = 0. Moreover, we obtain a recursive description of the moment sequence for a generalized problem.
APA, Harvard, Vancouver, ISO, and other styles
5

Kuba, Markus, and Alois Panholzer. "Limiting Distributions for a Class Of Diminishing Urn Models." Advances in Applied Probability 44, no. 01 (March 2012): 87–116. http://dx.doi.org/10.1017/s0001867800005462.

Full text
Abstract:
In this work we analyze a class of 2 × 2 Pólya-Eggenberger urn models with ball replacement matrix and c = pa with . We determine limiting distributions by obtaining a precise recursive description of the moments of the considered random variables, which allows us to deduce asymptotic expansions of the moments. In particular, we obtain limiting distributions for the pills problem a = c = d = 1, originally proposed by Knuth and McCarthy. Furthermore, we also obtain limiting distributions for the well-known sampling without replacement urn, a = d = 1 and c = 0, and generalizations of it to arbitrary and c = 0. Moreover, we obtain a recursive description of the moment sequence for a generalized problem.
APA, Harvard, Vancouver, ISO, and other styles
6

Hesselager, Ole. "A Recursive Procedure for Calculation of some Compound Distributions." ASTIN Bulletin 24, no. 1 (May 1994): 19–32. http://dx.doi.org/10.2143/ast.24.1.2005078.

Full text
Abstract:
AbstractWe consider compound distributions where the counting distribution has the property that the ratio between successive probabilities may be written as the ratio of two polynomials. We derive a recursive algorithm for the compound distribution, which is more efficient than the one suggested by Panjer & Willmot (1982) and Willmot & Panjer (1987). We also derive a recursive algorithm for the moments of the compound distribution. Finally, we present an application of the recursion to the problem of calculating the probability of ruin in a particular mixed Poisson process.
APA, Harvard, Vancouver, ISO, and other styles
7

HOSNY, KHALID M. "EFFICIENT COMPUTATION OF LEGENDRE MOMENTS FOR GRAY LEVEL IMAGES." International Journal of Image and Graphics 07, no. 04 (October 2007): 735–47. http://dx.doi.org/10.1142/s021946780700288x.

Full text
Abstract:
Direct computation of Legendre orthogonal moments requires huge arithmetic operations, which is very time consuming. Many works have described methods for reducing the computations involved in evaluating Legendre moments. Nevertheless, reduction computational complexity is still an open problem and needs more investigation. Existing algorithms mainly focused on binary images and compute Legendre moments using a set of geometric moments. We propose a fast and efficient method for computation of Legendre moments for binary and gray level images. A recurrence formula of one-dimensional Legendre moments will be established using the recursive property of Legendre polynomials; then the method will be extended to calculate the two-dimensional Legendre moments. This method is completely independent on geometric moment. The complexity analysis shows that the proposed method computes Legendre moments more efficiently than the direct method and the other conventional methods.
APA, Harvard, Vancouver, ISO, and other styles
8

Dräger, Lena. "RECURSIVE INATTENTIVENESS WITH HETEROGENEOUS EXPECTATIONS." Macroeconomic Dynamics 20, no. 4 (October 9, 2015): 1073–100. http://dx.doi.org/10.1017/s1365100514000741.

Full text
Abstract:
We model agents' endogenous updating of information sets over time under changing macroeconomic conditions. Building on sticky information models, the degree of inattentiveness is endogenized by allowing agents to choose between a costly full-information predictor and a costless sticky-information predictor. This is modeled as a choice between discrete alternatives under rational inattention. Recursive simulation shows that the dynamic equilibrium paths of aggregate variables are highly persistent and match the moments of U.S. data better than a model with fixed sticky information or with sticky prices, especially with regard to higher moments and the degree of persistence. Predictors are chosen in line with the predictions from rational inattention models, as the aggregate degree of attentiveness increases with rising variance of the forecast variable. Moreover, the model can generate hump-shaped impulse responses of inflation to a monetary policy shock if the degree of inattentiveness is sufficiently high.
APA, Harvard, Vancouver, ISO, and other styles
9

Hillier, Grant, Raymond Kan, and Xiaolu Wang. "GENERATING FUNCTIONS AND SHORT RECURSIONS, WITH APPLICATIONS TO THE MOMENTS OF QUADRATIC FORMS IN NONCENTRAL NORMAL VECTORS." Econometric Theory 30, no. 2 (October 17, 2013): 436–73. http://dx.doi.org/10.1017/s0266466613000364.

Full text
Abstract:
Recursive relations for objects of statistical interest have long been important for computation, and they remain so even with hugely improved computing power. Such recursions are frequently derived by exploiting relations between generating functions. For example, the top-order zonal polynomials that occur in much distribution theory under normality can be recursively related to other (easily computed) symmetric functions (power-sum and elementary symmetric functions; Ruben, 1962, Annals of Mathematical Statistics 33, 542–570; Hillier, Kan, and Wang, 2009, Econometric Theory 25, 211–242). Typically, in a recursion of this type the kth object of interest, dk, say, is expressed in terms of all lower order dj’s. In Hillier et al. (2009) we pointed out that, in the case of top-order zonal polynomials and other invariant polynomials of multiple matrix argument, a fixed length recursion can be deduced. We refer to this as a short recursion. The present paper shows that the main results in Hillier et al. (2009) can be generalized and that short recursions can be obtained for a much larger class of objects/generating functions. As applications, we show that short recursions can be obtained for various problems involving quadratic forms in noncentral normal vectors, including moments, product moments, and expectations of ratios of powers of quadratic forms. For this class of problems, we also show that the length of the recursion can be further reduced by an application of a generalization of Horner’s method (cf. Brown, 1986, SIAM Journal on Scientific and Statistical Computing 7, 689–695), producing a super-short recursion that is significantly more efficient than even the short recursion.
APA, Harvard, Vancouver, ISO, and other styles
10

Ramaswami, V., and D. M. Lucantoni. "Moments Of the stationary waiting time in the Gi/Ph/1 queue." Journal of Applied Probability 25, no. 3 (September 1988): 636–41. http://dx.doi.org/10.2307/3213992.

Full text
Abstract:
Recursive relations for computing the higher moments of the stationary waiting time distribution in a stable GI/PH/1 queue are derived. These provide an accurate and stable technique to compute these moments.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Recursive moments"

1

Burns, Jonathan. "Recursive Methods in Number Theory, Combinatorial Graph Theory, and Probability." Scholar Commons, 2014. https://scholarcommons.usf.edu/etd/5193.

Full text
Abstract:
Recursion is a fundamental tool of mathematics used to define, construct, and analyze mathematical objects. This work employs induction, sieving, inversion, and other recursive methods to solve a variety of problems in the areas of algebraic number theory, topological and combinatorial graph theory, and analytic probability and statistics. A common theme of recursively defined functions, weighted sums, and cross-referencing sequences arises in all three contexts, and supplemented by sieving methods, generating functions, asymptotics, and heuristic algorithms. In the area of number theory, this work generalizes the sieve of Eratosthenes to a sequence of polynomial values called polynomial-value sieving. In the case of quadratics, the method of polynomial-value sieving may be characterized briefly as a product presentation of two binary quadratic forms. Polynomials for which the polynomial-value sieving yields all possible integer factorizations of the polynomial values are called recursively-factorable. The Euler and Legendre prime producing polynomials of the form n2+n+p and 2n2+p, respectively, and Landau's n2+1 are shown to be recursively-factorable. Integer factorizations realized by the polynomial-value sieving method, applied to quadratic functions, are in direct correspondence with the lattice point solutions (X,Y) of the conic sections aX2+bXY +cY2+X-nY=0. The factorization structure of the underlying quadratic polynomial is shown to have geometric properties in the space of the associated lattice point solutions of these conic sections. In the area of combinatorial graph theory, this work considers two topological structures that are used to model the process of homologous genetic recombination: assembly graphs and chord diagrams. The result of a homologous recombination can be recorded as a sequence of signed permutations called a micronuclear arrangement. In the assembly graph model, each micronuclear arrangement corresponds to a directed Hamiltonian polygonal path within a directed assembly graph. Starting from a given assembly graph, we construct all the associated micronuclear arrangements. Another way of modeling genetic rearrangement is to represent precursor and product genes as a sequence of blocks which form arcs of a circle. Associating matching blocks in the precursor and product gene with chords produces a chord diagram. The braid index of a chord diagram can be used to measure the scope of interaction between the crossings of the chords. We augment the brute force algorithm for computing the braid index to utilize a divide and conquer strategy. Both assembly graphs and chord diagrams are closely associated with double occurrence words, so we classify and enumerate the double occurrence words based on several notions of irreducibility. In the area of analytic probability, moments abstractly describe the shape of a probability distribution. Over the years, numerous varieties of moments such as central moments, factorial moments, and cumulants have been developed to assist in statistical analysis. We use inversion formulas to compute high order moments of various types for common probability distributions, and show how the successive ratios of moments can be used for distribution and parameter fitting. We consider examples for both simulated binomial data and the probability distribution affiliated with the braid index counting sequence. Finally we consider a sequence of multiparameter binomial sums which shares similar properties with the moment sequences generated by the binomial and beta-binomial distributions. This sequence of sums behaves asymptotically like the high order moments of the beta distribution, and has completely monotonic properties.
APA, Harvard, Vancouver, ISO, and other styles
2

Hefny, Ahmed. "Efficient Methods for Prediction and Control in Partially Observable Environments." Research Showcase @ CMU, 2018. http://repository.cmu.edu/dissertations/1210.

Full text
Abstract:
State estimation and tracking (also known as filtering) is an integral part of any system performing inference in a partially observable environment, whether it is a robot that is gauging an environment through noisy sensors or a natural language processing system that is trying to model a sequence of characters without full knowledge of the syntactic or semantic state of the text. In this work, we develop a framework for constructing state estimators. The framework consists of a model class, referred to as predictive state models, and a learning algorithm, referred to as two-stage regression. Our framework is based on two key concepts: (1) predictive state: where our belief about the latent state of the environment is represented as a prediction of future observation features and (2) instrumental regression: where features of previous observations are used to remove sampling noise from future observation statistics, allowing for unbiased estimation of system dynamics. These two concepts allow us to develop efficient and tractable learning methods that reduce the unsupervised problem of learning an environment model to a supervised regression problem: first, a regressor is used to remove noise from future observation statistics. Then another regressor uses the denoised observation features to estimate the dynamics of the environment. We show that our proposed framework enjoys a number of theoretical and practical advantages over existing methods, and we demonstrate its efficacy in a prediction setting, where the task is to predict future observations, as well as a control setting, where the task is to optimize a control policy via reinforcement learning.
APA, Harvard, Vancouver, ISO, and other styles
3

Louis, Maryse. "Migration-development nexus : macro and micro empirical evidence." Thesis, Aix-Marseille, 2013. http://www.theses.fr/2013AIXM1084/document.

Full text
Abstract:
Cette thèse examine la relation complexe et la causalité entre la migration et le développement, sujet d'actualité vus les flux croissants de migrants et les transferts de fonds privés. La revue de la littérature théorique et empirique montre la complexité de cette relation, et l’absence de consensus dégagé par les travaux menés sur les causes et les effets de la migration sur le développement. Sur les causes de migration, une première estimation empirique montre qu’elle fait partie intégrante du processus de développement et n’est donc pas une simple conséquence de faibles niveaux de développement: le niveau de développement des pays d'origine s’accroissant, les aspirations et les capabilités des populations augmentent et si celles-ci font face à l'absence d’opportunités, elles vont migrer à condition d’en avoir les capabilités (compétences requises, moyens financiers, politiques de migration, etc.). Concernant l’impact de la migration, une deuxième estimation empirique montre un effet positif sur le développement via les transferts privés. Les modèles indiquent que leur contribution se fait à travers deux principaux canaux, l'investissement en capital et le capital humain (éducation et santé), lesquels sont susceptibles de permettre un développement à long terme des pays d'origine. Au niveau micro, une troisième série de modèles étudie le mécanisme de cet impact au niveau de ménages, à partir du cas de l'Egypte. Ces modèles confirment l'importance des transferts privés sur les niveaux d'éducation et de santé dans les ménages qui les reçoivent. Ces résultats sont censés contribuer à la compréhension de cette relation complexe entre migration et développement
This thesis is concerned with the causal and complex relation between migration and development. A timely subject, especially with increasing flows of migrants and the remittances these migrants send home. Both the theoretical and empirical literature reviews address the complexity of this relation but consensuses on the causes and impacts of migration on development are generally inconclusive. On the causes of migration, our first empirical estimation shows that migration is part of the development process and not a simple result of its low levels: the increasing development level of the home countries increase the aspirations and capabilities of their populations and if these are faced with lack of opportunities at home, individuals seek migration provided they have the right capabilities (skills required, financial means, migration policies, etc.). On the impact of migration, our second empirical estimation gives evidence of a positive impact through remittances on the development of the home countries. The models show the positive contributions of remittances towards development through two main channels: capital investment and human capital (education and health). These two channels are believed to achieve long-term development of the home countries. At the micro level, we look at the mechanism of this impact at the household level, addressing the case study of Egypt. Our third models give evidence of the importance of these remittances in increasing both education and health status of the recipients’ households’. These findings are believed to make a contribution towards the understanding of this complex relation between migration and development
APA, Harvard, Vancouver, ISO, and other styles
4

Teo, Chee Chong. "A Study of Moment Recursion Models for Tactical Planning of a Job Shop: Literature Survey and Research Opportunities." 2003. http://hdl.handle.net/1721.1/3920.

Full text
Abstract:
The Moment Recursion (MR) models are a class of models for tactical planning of job shops or other processing networks. The MR model can be used to determine or approximate the first two moments of production quantities and queue lengths at each work station of a job shop. Knowledge of these two moments is sufficient to carry out a variety of performance evaluation, optimization and decision-support applications. This paper presents a literature survey of the Moment-Recursion models. Limitations in the existing research and possible research opportunities are also discussed. Based on the research opportunities discussed, we are in the process of building a model that attempts to fill these research gaps.
Singapore-MIT Alliance (SMA)
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Recursive moments"

1

Cain, Michael. The recursive evaluation of the moments of the minimum of bivariate normal random variables. Aberystwyth: University of Wales, Aberystwyth, Dept. of Economics, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

A, Fialkow Lawrence, ed. Flat extensions of positive moment matrices: Recursively generated relations. Providence, R.I: American Mathematical Society, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Zieger, Susan. The Mediated Mind. Fordham University Press, 2018. http://dx.doi.org/10.5422/fordham/9780823279821.001.0001.

Full text
Abstract:
The latter half of the nineteenth century witnessed a mass media revolution in the widespread explosion of print; this book shows how the habits of consuming printed ephemera are still with us, even as pixels supersede paper. Trivial, disposable printed items, from temperance medals and cigarette cards to cartoons and even novels tell us much about nineteenth-century mediated experience, and our own. For a fresh perspective on media consumption, the book examines affect, a dynamic quality of human mind and body that links emotion to cognition, self to other, and self to environment. Affect shows how mass-mediated material began to dwell in the mind – less so the rational mind of egoistic cognition, than the embodied mind of daydreaming, reverie, and feeling. In such fugitive spaces, the sovereign individual gives way to community and inter-subjectivity as he or she recreates the social body. The book makes visible an array of positions, habitable by people of different classes, genders, ages, and sexualities, such as the mass live audience member, the enchanted viewer, the information “addict,” the self-fashioner, the collector, and the re-player of experience. These positions characterize an earlier moment in a genealogy of media consumption that endures today. The book describes them by putting disposable print forms into conversation with performance, visual culture, literary fantasy, and media theories. Demonstrating the recursive relations between affects and mass media, it reveals the cultural and psychological contours of ephemeral experience.
APA, Harvard, Vancouver, ISO, and other styles
4

Anderson, Greg. Being in a Different World. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780190886646.003.0017.

Full text
Abstract:
After summarizing the book’ s alternative recursive analysis of the Athenian politeia, the chapter confronts three possible objections to this new account. First, despite possible appearances to the contrary, this kind of ontological history can in fact accommodate the “messiness” of “real life.” While its primary purpose is to recover the ontological and metaphysical commitments which were presupposed by Athenian demokratia, it is not necessarily contradicted by evidence for conduct that might seem to defy those commitments. Second, nor is this kind of analysis necessarily contradicted by the texts of, say, Plato, Thucydides, or other contemporary intellectuals which seem to offer us very different accounts of Greek “realities.” Such texts represent the thought of only a tiny elite minority, intellectuals who were expressly challenging conventional presuppositions about the givens of existence. And it is those conventional presuppositions which the book is primarily concerned with, since they constituted the “world-making common sense” of the age, the social knowledge that was at once presupposed and reproduced by the most vital life-sustaining practices of the Athenians, the thought which actively helped to make their world whatever it really was at the time. By contrast, elite oppositional claims were merely ideational constructs, mere renegade “worldviews.” Third, while the book’ s ontological history is written in the synchronic mode, treating the classical era as a single extended moment, this does not mean that it is incapable of accounting for change. Indeed, as the chapter shows, it is quite possible to imagine a diachronic ontological history.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Recursive moments"

1

Palenichka, Roman M. "Fast Recursive Computation of Local Axial Moments by Using Primitive Kernel Functions." In Parallel Computation, 596–97. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-49164-3_67.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Glynn, Peter W., and Donald L. Iglehart. "Recursive moment formulas for regenerative simulation." In Semi-Markov Models, 99–109. Boston, MA: Springer US, 1986. http://dx.doi.org/10.1007/978-1-4899-0574-1_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Guadagnini, Alberto, and Shlomo P. Neuman. "Recursive Conditional Moment Equations for Advective Transport in Randomly Heterogeneous Velocity Fields." In Dispersion in Heterogeneous Geological Formations, 37–67. Dordrecht: Springer Netherlands, 2001. http://dx.doi.org/10.1007/978-94-017-1278-1_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Schek, Israel, and Robert E. Wyatt. "Generation and Importance of Linked and Irreducible Moment Diagrams in the Recursive Residue Generation Method." In Methods of Laser Spectroscopy, 347–51. Boston, MA: Springer US, 1986. http://dx.doi.org/10.1007/978-1-4615-9459-8_46.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bailly, François, Justin Carpentier, Bruno Watier, and Philippe Souères. "Recursive Filtering of Kinetic and Kinematic Data for Center of Mass and Angular Momentum Derivative Estimation." In Lecture Notes in Computational Vision and Biomechanics, 398–410. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-43195-2_33.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Trigeassou, J. C., and P. Coirault. "RECURSIVE IDENTIFICATION AND FAULT DETECTION USING PARTIAL TIME MOMENTS." In Advanced Information Processing in Automatic Control (AIPAC '89), 63–68. Elsevier, 1990. http://dx.doi.org/10.1016/b978-0-08-037034-7.50013-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

J. Miana, Pedro, and Natalia Romero. "Moments of Catalan Triangle Numbers." In Number Theory and Its Applications. IntechOpen, 2020. http://dx.doi.org/10.5772/intechopen.92046.

Full text
Abstract:
In this chapter, we consider the Catalan numbers, C n = 1 n + 1 2 n n , and two of their generalizations, Catalan triangle numbers, B n , k and A n , k , for n , k ∈ N . They are combinatorial numbers and present interesting properties as recursive formulae, generating functions and combinatorial interpretations. We treat the moments of these Catalan triangle numbers, i.e., with the following sums: ∑ k = 1 n k m B n , k j , ∑ k = 1 n + 1 2 k − 1 m A n , k j , for j , n ∈ N and m ∈ N ∪ 0 . We present their closed expressions for some values of m and j . Alternating sums are also considered for particular powers. Other famous integer sequences are studied in Section 3, and its connection with Catalan triangle numbers are given in Section 4. Finally we conjecture some properties of divisibility of moments and alternating sums of powers in the last section.
APA, Harvard, Vancouver, ISO, and other styles
8

Gautschi, Walter. "Computational Methods." In Orthogonal Polynomials. Oxford University Press, 2004. http://dx.doi.org/10.1093/oso/9780198506720.003.0004.

Full text
Abstract:
The fundamental problem is to compute the first n recursion coefficients αk (dλ), Βk(dλ), k = 0, 1, . . . , n − 1 (cf. §1.3.1), where n ≥ 1 is a (typically large) integer and dλ a positive measure given either implicitly via moment information or explicitly. In the former case, an important aspect is the sensitivity of the problem with respect to small perturbations in the data (the first 2n moments or modified moments); this is the question of conditioning. In principle, there is a simple algorithm, essentially due to Chebyshev, that produces the desired recursion coefficients from given moment information. The effectiveness of this algorithm, however, depends critically on the conditioning of the underlying problem. If the problem is ill-conditioned, as it often is, recourse has to be made either to symbolic computation or to the explicit form of the measure. A procedure applicable in the latter case is discretization of the measure and subsequent approximation of the desired recursion coefficients by those relative to a discrete measure. Other problems calling for numerical methods are the evaluation of Cauchy integrals of orthogonal polynomials and the problem of passing from the recursion coefficients of a measure to those of a modified measure—the original measure multiplied by a rational function. Finally, Sobolev orthogonal polynomials present their own problems of calculating recursion coefficients and zeros. Orthogonal polynomials as well as their recursion coefficients are expressible in determinantal form in terms of the moments of the underlying measure. Indeed, much of the classical theory of orthogonal polynomials is moment-oriented. This is true, in particular, of a classical algorithm due to Chebyshev, which generates the recursion coefficients directly from the moments, bypassing determinants. The use of moments, unfortunately, is numerically problematic inasmuch as they give rise to severe ill-conditioning. In many cases, particularly for measures with bounded support, it is possible, however, to work with the so-called “modified moments,” which lead to better conditioned problems and a more stable analog of the Chebyshev algorithm.
APA, Harvard, Vancouver, ISO, and other styles
9

Garcia, Antero, and Cindy O'Donnell-Allen. "Pose/Wobble/Flow." In Handbook of Research on Digital Tools for Writing Instruction in K-12 Settings, 544–66. IGI Global, 2014. http://dx.doi.org/10.4018/978-1-4666-5982-7.ch027.

Full text
Abstract:
This chapter examines how culture, technology, and standards intersect to create a complex environment for preservice teachers that shapes their understanding of how to teach composition. The authors draw on the cases of two undergraduate students engaged in immersive digital writing experiences to present a model called “Pose/Wobble/Flow.” This model attempts to capture the non-linear, recursive nature of teachers' professional growth by acknowledging and interrogating uncertainties, positionality, and cultural privilege. The authors recommend the creation of virtual and face-to-face communities of practice wherein preservice teachers can take up stances, or poses, toward their practice and reflect on areas in which they “wobble” with the intent of attaining provisional moments of progress in their teaching. They conclude that engaging preservice teachers in cycles of Pose/Wobble/Flow increases the likelihood that they will in turn construct learning experiences for their students that include robust opportunities for digital composing and interaction.
APA, Harvard, Vancouver, ISO, and other styles
10

Storey, Mark. "Among the Ruins." In Time and Antiquity in American Empire, 164–93. Oxford University Press, 2021. http://dx.doi.org/10.1093/oso/9780198871507.003.0005.

Full text
Abstract:
From the ancient past of Chapter 3, this chapter moves to the account of contemporary American travelers through the ruins and remnants of the ancient Roman world. Starting with Jhumpa Lahiri’s period living in Rome, and touching also on Thomas Jefferson’s account of antique ruins over two hundred years before, the chapter uses the potent image of the “ruin”—both as noun and as verb—to read American travelers in Europe as observers of empire’s recursive temporalities. Closer examinations of travel writing by William Dean Howells, Mark Twain, Eleanor Clark, and Margaret Fuller reveal the ways in which the contemporary moment for each of these writers ends up filtered through the liberal observing subject via their confrontation with the materiality of an ancient empire, collectively registering the analogical history that the ruins of empire inculcate within the landscape.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Recursive moments"

1

Bo Li and Yuqi Zhang. "A piecewise and bi-recursive algorithm for computing high-order Krawtchouk moments." In 2015 4th International Conference on Computer Science and Network Technology (ICCSNT). IEEE, 2015. http://dx.doi.org/10.1109/iccsnt.2015.7490993.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ramli, Siti Norafidah Mohd, Nur Atikah Mohamed Rozali, Sharifah Farah Syed Yusoff Alhabshi, and Ishak Hashim. "Laplace transform on the recursive moments of copula-dependent aggregate discounted claims." In PROCEEDING OF THE 25TH NATIONAL SYMPOSIUM ON MATHEMATICAL SCIENCES (SKSM25): Mathematical Sciences as the Core of Intellectual Excellence. Author(s), 2018. http://dx.doi.org/10.1063/1.5041641.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ramli, Siti Norafidah Mohd, Nur Atikah Mohamed Rozali, Sharifah Farah Syed Yusoff Alhabshi, and Ishak Hashim. "Laplace transform on the recursive moments of aggregate discounted claims with Weibull interwaiting time." In PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON MATHEMATICAL SCIENCES AND TECHNOLOGY 2018 (MATHTECH2018): Innovative Technologies for Mathematics & Mathematics for Technological Innovation. AIP Publishing, 2019. http://dx.doi.org/10.1063/1.5136405.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Martinez, J., E. Staffetti, and F. Thomas. "A recursive updating rule for efficient computation of linear moments in sliding-window applications." In Proceedings of 13th International Conference on Pattern Recognition. IEEE, 1996. http://dx.doi.org/10.1109/icpr.1996.546836.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Al-Rawi, Mohammed S. "3D (pseudo) Zernike moments: Fast computation via symmetry properties of spherical harmonics and recursive radial polynomials." In 2012 19th IEEE International Conference on Image Processing (ICIP 2012). IEEE, 2012. http://dx.doi.org/10.1109/icip.2012.6467369.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Boada, Maria Jesus L., Beatriz L. Boada, Daniel Garcia-Pozuelo, and Vicente Diaz. "Application of Neural Networks for Estimation of Tyre/Road Forces." In ASME 2009 International Mechanical Engineering Congress and Exposition. ASMEDC, 2009. http://dx.doi.org/10.1115/imece2009-10092.

Full text
Abstract:
The behaviour of the tyre plays an important role in the vehicle handling. Thus for the analysis of vehicles and road safety, it is necessary to take into account the forces and moments generated at contact match. An accurate tyre model that estimates these forces and moments it is highly essential for the studies of vehicle dynamics and control. Much of the tyre models neglect the coupling of the forces in different directions. They describe the tyre-forces generated at the pure-slip conditions of braking, driving or cornering. Nevertheless, a steering maneuver during braking, generally, decreases the braking stiffness, the longitudinal peak force, and its corresponding slip value. A model for the interaction between the slip in both directions is therefore inevitable for more advanced vehicle simulations. In this work, a recursive lazy learning method based on neural networks is proposed in order to model the tyre force generation at combined slip. Experimental results obtained after training show that the neural model learns to model the tyre behaviour without difficulty.
APA, Harvard, Vancouver, ISO, and other styles
7

Matuzas, Vaidas, Juozas Augutis, and Eugenijus Uspuras. "Degradation Assessment in Complex Systems." In 14th International Conference on Nuclear Engineering. ASMEDC, 2006. http://dx.doi.org/10.1115/icone14-89190.

Full text
Abstract:
Components condition could change dynamically because of various dependencies existing in complex systems since usually not only physical connections exist in the system. Various processes (as degradation or wear out, reliability decrease, failures) affecting one component have influence to condition of other components as well. Current paper is devoted to the analysis and development of mathematical models to the reliability assessment of network systems. Degradation as the main process in the network systems is taken into account. The main attention in present work was paid to the mathematical description of the degradation spreading mechanism in network systems. Developed recursive mathematical model allows assess degradation in network systems during various time moments. Developed methods can be applied for assessment of various risk estimates of hazardous systems such as systems at nuclear power plants.
APA, Harvard, Vancouver, ISO, and other styles
8

Iliopoulos, Athanasios, John G. Michopoulos, and John C. Hermanson. "Composite Material Testing Data Reduction to Adjust for the Systematic 6-DoF Testing Machine Aberrations." In ASME 2012 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/detc2012-71119.

Full text
Abstract:
This paper describes a data reduction methodology for eliminating the systematic aberrations introduced by the unwanted behavior of a multiaxial testing machine, into the massive amounts of experimental data collected from testing of composite material coupons. The machine in reference is a custom made 6-DoF system called NRL66.3 and developed at the NAval Research Laboratory, that consists of multiple sets of hexapod configurations essentially forming a recursive synthesis of multiple parallel mechanisms. Hexapod linkages, the grips, and other deformable parts of the machine absorb energy. This is manifested in an either reversible or irreversible manner, thus introducing a parasitic behavior that is undesirable from the perspective of our ultimate goal of the material constitutive characterization. The data reduction focuses both on the kinematic (pose of the grip) and the reaction (forces and moments) that are critical input quantities of the material characterization process. The kinematic response is reduced by exploitation of the kinematics of the dots used for full field measurements. A correction transformation is identified by solving an inverse problem that minimizes the known displacements at the grips as given by the full field measurements and those given by the machine’s displacement sensors. A Procrustes problem formalism was introduced to exploit a known material behavior tested by the testing machine. Consequently, a correction transformation was established and was applied on the load cell data of the machine in order to eliminate the spurious responses appearing in the force and moment data.
APA, Harvard, Vancouver, ISO, and other styles
9

Venkatesan, S., and R. Ganesan. "Variability in Dynamic Response of Non Self-Adjoint Mechanical Systems." In ASME 1995 Design Engineering Technical Conferences collocated with the ASME 1995 15th International Computers in Engineering Conference and the ASME 1995 9th Annual Engineering Database Symposium. American Society of Mechanical Engineers, 1995. http://dx.doi.org/10.1115/detc1995-0350.

Full text
Abstract:
Abstract Variations in strength, geometric and deterioration characteristics of both materials and machine components are quite common in real-life mechanical systems due to manufacturing defects and measurement errors. Such inherent fluctuations which are unavoidable even with the best quality control measures, are essentially random in nature. Effects of these random fluctuations on the performance levels, dynamic response and service life of mechanical systems need to be evaluated based on a stochastic approach, in order to assist design and diagnostics of industrial machinery. Non self-adjoint eigenproblems that correspond to the dynamic response of complex mechanical systems such as high speed rotors, fluid-flowing pipes and actively controlled structures are considered in the present work. The coefficients of the matrices are stochastic processes and are resulting from uncertain parameters of the mechanical system being described by the eigenproblem. A perturbational solution is sought and obtained in a form that does not involve repeated solutions of a recursive set of equations. Sample functions are generated based on the perturbational expansion and response moments are obtained by treating uncertain fluctuations to be stochastic perturbations. Complete covariance structures of both eigenvalues and eigenvectors are obtained through computationally efficient expressions. Applications of the developed procedure for real-life mechanical systems, that have uncertain material properties, are demonstrated.
APA, Harvard, Vancouver, ISO, and other styles
10

Xie, Kai, Laith K. Abbas, Dongyang Chen, and Xiaoting Rui. "Free Vibration Characteristic of a Rotating Cantilever Beam With Tip Mass." In ASME 2018 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2018. http://dx.doi.org/10.1115/detc2018-85120.

Full text
Abstract:
In many cases, vibration is a serious problem, undesirable, wasting energy and creating unwanted sound. Transfer Matrix Method for Multibody Systems (MSTMM) is one of the sophisticated methods that can be used efficiently to (1) Model large systems with a large number of subsystems and rigid-flexible structures, and (2) Calculate the vibration characteristics and dynamic responses of the multibody systems. The size of matrices in MSTMM remains small regardless of the number of elements in the model. Having smaller matrix sizes helps to have less computational expense leading to a faster answer. Based on the MSTMM advantages, vibration characteristic of a rotating cantilever beam with an attached tip mass is modeled and simulated in the present paper while the beam undergoes flapwise vibration. This system can be thought of as an extremely simplified model of a helicopter rotor blade or a blade of an auto-cooling fan. The overall transfer equation in the MSTMM context only involves boundary state vectors, whereas the state vectors at all other connection points do not appear. The state vectors at the boundary include the displacements, rotation angles, bending moments and shear forces. These are partly known and partly unknown. The eigenvalue problem is solved by using Frobenius method of solution in power series. Recursive eigenvalue search algorithm is used to determine the system frequencies. Numerical examples are performed to validate with those published in the literature and produced by Workbench ANSYS.
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Recursive moments"

1

Nuttall, Albert H. Evaluation of Densities and Distributions via Hermite and Generalized Laguerre Series Employing High-Order Expansion Coefficients Determined Recursively via Moments or Cumulants. Fort Belvoir, VA: Defense Technical Information Center, February 1985. http://dx.doi.org/10.21236/ada153950.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Recursive moments' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography