Relevant bibliographies by topics / M-Polynomial

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'M-Polynomial'

Author: Grafiati
Published: 3 June 2025
Last updated: 31 July 2025

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'M-Polynomial.'

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 "M-Polynomial"

1

Blel, Mongi. "On some m-symmetric generalized hypergeometric d-orthogonal polynomials." Filomat 38, no. 4 (2024): 1279–89. http://dx.doi.org/10.2298/fil2404279b.

Full text
Abstract:
In [9] I. Lamiri and M. Ouni state some characterization theorems for d-orthogonal polynomials of Hermite, Gould-Hopper and Charlier type polynomials. In [3] Y. Ben Cheikh I. Lamiri and M.Ouni give a characterization theorem for some classes of generalized hypergeometric polynomials containing for example, Gegenbauer polynomials, Gould-Hopper polynomials, Humbert polynomials, a generalization of Laguerre polynomials and a generalization of Charlier polynomials. In this work, we introduce a new class D of generalized hypergeometric m-symmetric polynomial sequence containing the Hermite polynomi
APA, Harvard, Vancouver, ISO, and other styles
2

Chami, Peter S., Bernd Sing, and Norris Sookoo. "Generalizing Krawtchouk Polynomials Using Hadamard Matrices." ISRN Applied Mathematics 2014 (March 4, 2014): 1–8. http://dx.doi.org/10.1155/2014/498135.

Full text
Abstract:
We investigate polynomials, called m-polynomials, whose generator polynomial has coefficients that can be arranged in a square matrix; in particular, the case where this matrix is a Hadamard matrix is considered. Orthogonality relations and recurrence relations are established, and coefficients for the expansion of any polynomial in terms of m-polynomials are obtained. We conclude this paper by an implementation of m-polynomials and some of the results obtained for them in Mathematica.
APA, Harvard, Vancouver, ISO, and other styles
3

Muhammad Hussian, Hasan Mahmood, Muhammad Abdullah, Sikandar Raza,. "Computing Topological Indices for Niobium Dioxide and Metal-Organic Frameworks via M-Polynomials." Power System Technology 48, no. 1 (2024): 211–27. http://dx.doi.org/10.52783/pst.268.

Full text
Abstract:
This paper investigates the topological properties of metal-organic frameworks and niobium dioxide using M-polynomials. The stability and wide range of bonding that the molecule exhibits make it a promising candidate for a number of uses, such as energy storage, gas detection, and catalysis. We use M-polynomials to calculate several degree-based topological indices for metal-organic frameworks and niobium dioxide. The M-polynomial is one such fundamental polynomial that provides a way to derive a multitude of degree-based topological indices. These indices are crucial for research in chemistry
APA, Harvard, Vancouver, ISO, and other styles
4

Mufti, Zeeshan Saleem, Ali H. Tedjani, Rukhshanda Anjum, and Turki Alsuraiheed. "Entropy and Multi-Fractal Analysis in Complex Fractal Systems Using Graph Theory." Axioms 12, no. 12 (2023): 1126. http://dx.doi.org/10.3390/axioms12121126.

Full text
Abstract:
In 1997, Sierpinski graphs, S(n,k), were obtained by Klavzar and Milutinovic. The graph S(1,k) represents the complete graph Kk and S(n,3) is known as the graph of the Tower of Hanoi. Through generalizing the notion of a Sierpinski graph, a graph named a generalized Sierpinski graph, denoted by Sie(Λ,t), already exists in the literature. For every graph, numerous polynomials are being studied, such as chromatic polynomials, matching polynomials, independence polynomials, and the M-polynomial. For every polynomial there is an underlying geometrical object which extracts everything that is hidde
APA, Harvard, Vancouver, ISO, and other styles
5

QIN, XIAOER, and SHAOFANG HONG. "CONSTRUCTING PERMUTATION POLYNOMIALS OVER FINITE FIELDS." Bulletin of the Australian Mathematical Society 89, no. 3 (2013): 420–30. http://dx.doi.org/10.1017/s0004972713000646.

Full text
Abstract:
AbstractIn this paper, we construct several new permutation polynomials over finite fields. First, using the linearised polynomials, we construct the permutation polynomial of the form ${ \mathop{\sum }\nolimits}_{i= 1}^{k} ({L}_{i} (x)+ {\gamma }_{i} ){h}_{i} (B(x))$ over ${\mathbf{F} }_{{q}^{m} } $, where ${L}_{i} (x)$ and $B(x)$ are linearised polynomials. This extends a theorem of Coulter, Henderson and Matthews. Consequently, we generalise a result of Marcos by constructing permutation polynomials of the forms $xh({\lambda }_{j} (x))$ and $xh({\mu }_{j} (x))$, where ${\lambda }_{j} (x)$ i
APA, Harvard, Vancouver, ISO, and other styles
6

BERGELSON, VITALY, and DONALD ROBERTSON. "Polynomial multiple recurrence over rings of integers." Ergodic Theory and Dynamical Systems 36, no. 5 (2015): 1354–78. http://dx.doi.org/10.1017/etds.2014.138.

Full text
Abstract:
We generalize the polynomial Szemerédi theorem to intersective polynomials over the ring of integers of an algebraic number field, by which we mean polynomials having a common root modulo every ideal. This leads to the existence of new polynomial configurations in positive-density subsets of $\mathbb{Z}^{m}$ and strengthens and extends recent results of Bergelson, Leibman and Lesigne [Intersective polynomials and the polynomial Szemerédi theorem. Adv. Math.219(1) (2008), 369–388] on polynomials over the integers.
APA, Harvard, Vancouver, ISO, and other styles
7

Hegland, Markus. "Numerical methods for computing the greatest common divisor of univariate polynomials using floating point arithmetic." ANZIAM Journal 60 (August 15, 2019): C127—C139. http://dx.doi.org/10.21914/anziamj.v60i0.14059.

Full text
Abstract:
Computing the greatest common divisor (GCD) for two polynomials in floating point arithmetic is computationally challenging and even standard library software might return the result GCD=1 even when the polynomials have a nontrivial GCD. Here we review Euclid's algorithm and test a variant for a class of random polynomials. We find that our variant of Euclid's method often produces an acceptable result. However, close monitoring of the norm of the vector of coefficients of the intermediate polynomials is required.
 
 References R. M. Corless, P. M. Gianni, B. M. Trager, and S. M. Wat
APA, Harvard, Vancouver, ISO, and other styles
8

Heintze, Sebastian. "Pillai's conjecture for polynomials." Glasnik Matematicki 58, no. 1 (2023): 67–74. http://dx.doi.org/10.3336/gm.58.1.05.

Full text
Abstract:
In this paper we study the polynomial version of Pillai's conjecture on the exponential Diophantine equation -17ex p^n - q^m = f. We prove that for any non-constant polynomial \( f \) there are only finitely many quadruples \( (n,m,\deg p,\deg q) \) consisting of integers \( n,m \geq 2 \) and non-constant polynomials \( p,q \) such that Pillai's equation holds. Moreover, we will give some examples that there can still be infinitely many possibilities for the polynomials \( p,q \).
APA, Harvard, Vancouver, ISO, and other styles
9

Stankov, Dragan. "On linear combinations of Chebyshev polynomials." Publications de l'Institut Math?matique (Belgrade) 97, no. 111 (2015): 57–67. http://dx.doi.org/10.2298/pim150220001s.

Full text
Abstract:
We investigate an infinite sequence of polynomials of the form: a0Tn(x) + a1Tn?1(x) + ... + amTn?m(x) where (a0, a1,..., am) is a fixed m-tuple of real numbers, a0, am ? 0, Ti(x) are Chebyshev polynomials of the first kind, n = m, m+ 1, m+ 2,.... Here we analyze the structure of the set of zeros of such polynomial, depending on A and its limit points when n tends to infinity. Also the expression of envelope of the polynomial is given. An application in number theory, more precise, in the theory of Pisot and Salem numbers, is presented.
APA, Harvard, Vancouver, ISO, and other styles
10

Almira, J. M. "Aichinger equation on commutative semigroups." Filomat 37, no. 16 (2023): 5301–11. http://dx.doi.org/10.2298/fil2316301a.

Full text
Abstract:
We consider Aichinger?s equation f (x1 +... + xm+1) = Xm+1 i=1 1i(x1, x2, ...,bxi,..., xm+1) for functions defined on commutative semigroups which take values on commutative groups. The solutions of this equation are, under very mild hypotheses, generalized polynomials. We use the canonical form of generalized polynomials to prove that compositions and products of generalized polynomials are again generalized polynomials and that the bounds for the degrees are, in this new context, the natural ones. In some cases, we also show that a polynomial function defined on a semigroup can uniquely be e
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "M-Polynomial"

1

Zhang, Yuexiu. "Polynomial identities of Lie subalgebras of M(n)." Thesis, University of Ottawa (Canada), 1995. http://hdl.handle.net/10393/10367.

Full text
Abstract:
Let $K\sb{n}(F)$ denote the Lie algebra of skew symmetric matrices with coefficients in a field F. For 1 $\le\ k \le\ m$ + 1, define $a\sb{m}(k)(x\sb1,\cdots,x\sb{m};y)\:=\ \sum\sb{\sigma\in{\cal S}\sb{m}} (-1)\sp{\sigma}x\sb{\sigma(1)}\cdots x\sb{\sigma(k-1)}yx\sb{\sigma(k)}\cdots x\sb{\sigma(m)},$ and let $a\sbsp{m}{+}$ (respectively $a\sbsp{m}{-}$) be the sum of all $a\sb{m}(k)$ with k even (respectively odd). This dissertation contains two parts. In the first part (Chapter 2), we prove that the almost standard polynomial $f(x\sb{1},\cdots, x\sb{m};y)\:=\ \alpha a\sbsp{m}{+} + \beta a\sbsp{
APA, Harvard, Vancouver, ISO, and other styles
2

Malagutti, Marcello. "C^m Solutions to a System of Linear Equations with Polynomial Coefficients." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2020. http://amslaurea.unibo.it/20795/.

Full text
Abstract:
La presente tesi verte sullo studio di una condizione necessaria e sufficiente per l'esistenza di soluzioni C^m, ovvero differenziabili fino all’ordine m, di un sistema di equazioni lineari. Con maggior dettaglio, in primo luogo vengono esposti gli studi di Charles Fefferman e Garving K. Luli, proposti nel lavoro “Solutions to a system of equations for C^m function”, nel caso in cui il sistema lineare considerato sia a coefficienti polinomiali. In secondo luogo viene introdotto un nuovo risultato per la determinazione di una condizione necessaria e sufficiente per l'esistenza di soluzioni con
APA, Harvard, Vancouver, ISO, and other styles
3

Sessler, Gunther M. A. [Verfasser]. "Schnell konvergierender Polynomial Expansion Multiuser Detektor mit niedriger Komplexität / Gunther M. A. Sessler." Karlsruhe : Inst. für Nachrichtentechnik, 2003. http://d-nb.info/1005262462/34.

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

Ahmad, Khan Mumtaz, and Bahman Alidad. "Three Variable Analogue of Boas and Buck Type Generating Functions and Its Generalizations to M-Variables." Pontificia Universidad Católica del Perú, 2014. http://repositorio.pucp.edu.pe/index/handle/123456789/97282.

Full text
Abstract:
The present papers deals with three variable analogue of Boas and Buck [14] type generating functions forpolynomials of two variables and then the same has been extended for m-variable analogue. The results obtained are extensions of those obtained by us in our earlier paper [14].<br>El presente artículo trata el anólogo de tres variables de la función generatriz de Boas and Buck [14] para polinomios de dos variables y lo mismo se puede extender para el análogo de m variables. Los resultados obtenidos son extensiones de un artículo previo [14].
APA, Harvard, Vancouver, ISO, and other styles
5

Novel, Aymeric. "Développement d’une méthode de méta modélisation des consommations énergétiques des bâtiments en fonction des facteurs d’usages et d’exploitation pour la garantie de résultat énergétique." Thesis, La Rochelle, 2019. http://www.theses.fr/2019LAROS001/document.

Full text
Abstract:
À mesure que les performances intrinsèques des bâtiments s’améliorent, les usages énergétiques non réglementés, que nous associons à une notion d’intensité énergétique des usages, prennent de plus en plus d’importance dans le bilan des consommations des bâtiments. De plus, les bâtiments performants font apparaître des problématiques au niveau de l’exploitation des installations. Ces constats nous permettent d’affirmer qu’il est aujourd’hui important de proposer un cadre pour le suivi et l’optimisation de la sobriété énergétique des usages et l’exploitation performante pour la maîtrise des cons
APA, Harvard, Vancouver, ISO, and other styles
6

Nicacio, Nilson Herminio. "Uma justificava da validade do teorema fundamental da ?lgebra para o ensino m?dio." Universidade Federal do Rio Grande do Norte, 2013. http://repositorio.ufrn.br:8080/jspui/handle/123456789/18666.

Full text
Abstract:
Made available in DSpace on 2015-03-03T15:36:13Z (GMT). No. of bitstreams: 1 NilsonHN_DISSERT.pdf: 1119783 bytes, checksum: 06971d48c83bfd25f8c12df9752dbc20 (MD5) Previous issue date: 2013-08-14<br>Coordena??o de Aperfei?oamento de Pessoal de N?vel Superior<br>Among several theorems which are taught in basic education some of them can be proved in the classroom and others do not, because the degree of difficulty of its formal proof. A classic example is the Fundamental Theorem of Algebra which is not proved, it is necessary higher-level knowledge in mathematics. In this paper, we just
APA, Harvard, Vancouver, ISO, and other styles
7

Tosun, Cemile. "Explicit Factorization of Generalized Cyclotomic Polynomials of Order $2^m 3$ Over a Finite Field $F_q$." OpenSIUC, 2013. https://opensiuc.lib.siu.edu/dissertations/733.

Full text
Abstract:
We give explicit factorizations of $a$-cyclotomic polynomials of order $2^m 3$, $Q_{2^m3,a}(x)$, over a finite field $F_q$ with $q$ elements where $q$ is a prime power, $m$ is a nonnegative integer and $a$ is a nonnegative element of $F_q$. We use the relation between usual cyclotomic polynomials and $a$-cyclotomic polynomials. Factorizations split into eight categories according to $q \equiv \pm1$ (mod 4), $a$ and $-3$ are square in $F_q$. We find that the coefficients of irreducible factors are primitive roots of unity and in some cases that are related with Dickson polynomials.
APA, Harvard, Vancouver, ISO, and other styles
8

Pallone, Ashley H. "Entangled Polynomials." Ohio University / OhioLINK, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1615312851673664.

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

Sabbah, Camille. "Contribution à l'étude des M-estimateurs polynômes locaux." Phd thesis, Université Pierre et Marie Curie - Paris VI, 2010. http://tel.archives-ouvertes.fr/tel-00509898.

Full text
Abstract:
L'objet de cette thèse est d'établir des résultats asymptotiques pour l'estimateur du quantile conditionnel par la méthode des polynômes locaux ainsi qu'à la généralisation de ces résultats pour les M-estimateurs. Nous étudions ces estimateurs et plus particulièrement leur représentation de Bahadur et leur biais. Nous donnons en outre un résultat sur les intervalles de confiance uniformes construits à partir de cette représentation pour le quantile conditionnel et ses dérivées.
APA, Harvard, Vancouver, ISO, and other styles
10

Huang, Yih-Ming, and 黃育民. "Concurrent Error Correction in Polynomial Basis Multiplier over GF(2^m)." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/39466757162325476703.

Full text
Abstract:
碩士<br>清雲科技大學<br>電子工程研究所<br>93<br>Appling the technique of Galois field, i.e, finite field multiplier, to cryptology has gained much concern been rising during the recent years. Such a technigue is also widely utilized in the fields of coding theory, cryptography, digital signal processing, switching theory, channel coding of communication systems, and pseudorandom number generation. In the field of cryptography, many researchers have worked hard to develop undecipherable cryptography, while the other researchers have tried to find a way to decipher already published cryptography. The newest cr
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "M-Polynomial"

1

United States. National Aeronautics and Space Administration., ed. The binary weight distribution of the extended (2[superscript m], 2[superscript m]-4) code of Reed-Solomon code over GF(2[superscript m]) with generator polynomial (x-[alpha])(x-[alpha]²)(x-[alpha]³): Technical report to NASA Goddard Space Flight Center. National Aeronautics and Space Administration, 1987.

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

Lin, Shu. The binary weight distribution of the extended (2[superscript m], 2[superscript m]-4) code of Reed-Solomon code over GF(2[superscript m]) with generator polynomial (x-[alpha])(x-[alpha]p2s)(x-[alpha]p3s): Technical report to NASA Goddard Space Flight Center. National Aeronautics and Space Administration, 1987.

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

Khoruzhenko, Boris, and Hans-Jurgen Sommers. Characteristic polynomials. Edited by Gernot Akemann, Jinho Baik, and Philippe Di Francesco. Oxford University Press, 2018. http://dx.doi.org/10.1093/oxfordhb/9780198744191.013.19.

Full text
Abstract:
This article considers characteristic polynomials and reviews a few useful results obtained in simple Gaussian models of random Hermitian matrices in the presence of an external matrix source. It first considers the products and ratio of characteristic polynomials before discussing the duality theorems for two different characteristic polynomials of Gaussian weights with external sources. It then describes the m-point correlation functions of the eigenvalues in the Gaussian unitary ensemble and how they are deduced from their Fourier transforms U(s1, … , sm). It also analyses the relation of t
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "M-Polynomial"

1

Cholak, Peter, and Rod Downey. "Undecidability and Definability for Parametrized Polynomial Time m-Reducibilities." In Logical Methods. Birkhäuser Boston, 1993. http://dx.doi.org/10.1007/978-1-4612-0325-4_7.

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

Blondin, Michael, and Javier Esparza. "Separators in Continuous Petri Nets." In Lecture Notes in Computer Science. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-99253-8_5.

Full text
Abstract:
AbstractLeroux has proved that unreachability in Petri nets can be witnessed by a Presburger separator, i.e. if a marking $$\boldsymbol{m}_\text {src}$$ m src cannot reach a marking $$\boldsymbol{m}_\text {tgt}$$ m tgt , then there is a formula $$\varphi $$ φ of Presburger arithmetic such that: $$\varphi (\boldsymbol{m}_\text {src})$$ φ ( m src ) holds; $$\varphi $$ φ is forward invariant, i.e., $$\varphi (\boldsymbol{m})$$ φ ( m ) and $$\boldsymbol{m} \rightarrow \boldsymbol{m}'$$ m → m ′ imply $$\varphi (\boldsymbol{m}'$$ φ ( m ′ ); and $$\lnot \varphi (\boldsymbol{m}_\text {tgt})$$ ¬ φ ( m
APA, Harvard, Vancouver, ISO, and other styles
3

Yixuan, Liu, and J. R. Wishart. "Local Polynomial M-Estimation in Random Design Regression with Dependent Errors." In Springer Proceedings in Mathematics & Statistics. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-28665-1_16.

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

Hazmi, Ibrahim, Fayez Gebali, and Atef Ibrahim. "Systolic Design Space Exploration of Polynomial Division over $$GF(3^m)$$." In Proceedings of the Future Technologies Conference (FTC) 2018. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-02683-7_68.

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

Castryck, Wouter, and Frederik Vercauteren. "A Polynomial Time Attack on Instances of M-SIDH and FESTA." In Advances in Cryptology – ASIACRYPT 2023. Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-99-8739-9_5.

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

Lee, Chiou-Yng, Wen-Yo Lee, Che Wun Chiou, Jeng-Shyang Pan, and Cheng-Huai Ni. "Hybrid Digit-Serial Multiplier for Shifted Polynomial Basis of GF(2 m )." In Advances in Intelligent Systems and Computing. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-01796-9_39.

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

Durmuş, Oğuzhan, Umut Can Çabuk, and Feriştah Dalkılıç. "A Study on the Performance of Base-m Polynomial Selection Algorithm Using GPU." In Artificial Intelligence and Applied Mathematics in Engineering Problems. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-36178-5_40.

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

Schost, Éric, and Arash Hariri. "Subquadratic Polynomial Multiplication over GF(2 m ) Using Trinomial Bases and Chinese Remaindering." In Selected Areas in Cryptography. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-04159-4_23.

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

Komlov, Aleksandr. "Polynomial Hermite Padé m-System and Reconstruction of the Values of Algebraic Functions." In Trends in Mathematics. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-74417-5_17.

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

Queffelec, Hoel, and Antonio Sartori. "A Note on $$\mathfrak {gl}_{m|n}$$ Link Invariants and the HOMFLY–PT Polynomial." In Knots, Low-Dimensional Topology and Applications. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-16031-9_13.

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

Conference papers on the topic "M-Polynomial"

1

Rocchini, Gabriele. "pH Influence on Magnetite Stability in Steam Generator Tubes." In CORROSION 1992. NACE International, 1992. https://doi.org/10.5006/c1992-92252.

Full text
Abstract:
Abstract Magnetite solubility, as a function of temperature and partial hydrogen pressure and with reference to the typical conditions of the operating fluid of a steam generator of a thermal power plant, has been studied by rigorously solving the problem of chemical equilibria and adopting the scheme proposed by Sweeton and Baes. Stoichiometric calculations have proved that magnetite solubility attains its maximum value, which depends on the characteristics of the electrolytic solution, when temperature is about 100°C, independently of the type of environment. The rigorous pH calculation was
APA, Harvard, Vancouver, ISO, and other styles
2

Juliana, Sinar. "Re-Entry Flight Clearance with m- and Polynomial based Analysis." In 54th International Astronautical Congress of the International Astronautical Federation, the International Academy of Astronautics, and the International Institute of Space Law. American Institute of Aeronautics and Astronautics, 2003. http://dx.doi.org/10.2514/6.iac-03-a.2.05.

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

Jensen, Arthur E. "Interferogram aberration analysis to very high orders." In OSA Annual Meeting. Optica Publishing Group, 1987. http://dx.doi.org/10.1364/oam.1987.mv6.

Full text
Abstract:
Three-hundred and sixty-one Zernike circle polynomials (with radial index N and angular index M so that 0 ≤ N + M ≤ 36, 0 ≤ M ≤ N, N – M is even) have been least-squares fit to wavefront maps derived from interferograms or synthesized test data. The analysis is based on the assumption that the wavefront aperture is symmetric about the X, Y and 45° axes. This, however, covers a large and useful class of circular or noncircular apertures with circular or noncircular obstructions. The role of aperture symmetry and wavefront manipulation in the analysis is discussed along with the accuracy and con
APA, Harvard, Vancouver, ISO, and other styles
4

Ghandali, Samaneh, Bijan Alizadeh, Zainalabedin Navabi, and Masahiro Fujita. "Polynomial datapath synthesis and optimization based on vanishing polynomial over Z2m and algebraic techniques." In 2012 10th IEEE/ACM International Conference on Formal Methods and Models for Codesign (MEMOCODE 2012). IEEE, 2012. http://dx.doi.org/10.1109/memcod.2012.6292301.

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

Jin, Weixuan, Jie Wang, Hongshu Liao, and Lu Gan. "Estimation of primitive polynomial for m-sequence with finite sequence length." In 2018 IEEE 3rd Advanced Information Technology, Electronic and Automation Control Conference (IAEAC). IEEE, 2018. http://dx.doi.org/10.1109/iaeac.2018.8577906.

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

Chu, Junfeng, and Mohammed Benaissa. "GF(2m) multiplier using Polynomial Residue Number System." In APCCAS 2008 - 2008 IEEE Asia Pacific Conference on Circuits and Systems (APCCAS). IEEE, 2008. http://dx.doi.org/10.1109/apccas.2008.4746320.

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

Wei, Xinzhou, Lin Leung, and Michael Anshel. "A Fast lattice-based polynomial digital signature system for m-commerce." In International Symposium on Optical Science and Technology, edited by Mark S. Schmalz. SPIE, 2003. http://dx.doi.org/10.1117/12.451254.

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

Danielyan, Arthur A. "M. A. Lavrentyev’s problems on pointwise polynomial approximation and related questions." In Third CMFT Conference. WORLD SCIENTIFIC, 1999. http://dx.doi.org/10.1142/9789812833044_0011.

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

El-Razouk, Hayssam, and Arash Reyhani-Masoleh. "New Bit-Level Serial GF (2^m) Multiplication Using Polynomial Basis." In 2015 IEEE 22nd Symposium on Computer Arithmetic (ARITH). IEEE, 2015. http://dx.doi.org/10.1109/arith.2015.11.

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

Lai, Ye-Chen, Timothy C. S. Liang, and Zhenxue Jia. "Implementation of p and h-p Versions of the Finite Element Method." In ASME 1992 International Computers in Engineering Conference and Exposition. American Society of Mechanical Engineers, 1992. http://dx.doi.org/10.1115/cie1992-0114.

Full text
Abstract:
Abstract Based on hierarchic shape functions and an effective convergence procedure, the p-version and h-p adaptive analysis capabilities were incorporated into a finite element software system, called COSMOS/M. The range of the polynomial orders can be varied from 1 to 10 for two dimensional linear elastic analysis. In the h-p adaptive analysis process, a refined mesh are first achieved via adaptive h-refinement. The p-refinement is then added on to the h-version designed mesh by uniformly increasing the degree of the polynomials. Some numerical results computed by COSMOS/M are presented to i
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "M-Polynomial"

1

Cattaneo, Matias D., Richard K. Crump, Max H. Farrell, and Yingjie Feng. Nonlinear Binscatter Methods. Federal Reserve Bank of New York, 2024. http://dx.doi.org/10.59576/sr.1110.

Full text
Abstract:
Binned scatter plots are a powerful statistical tool for empirical work in the social, behavioral, and biomedical sciences. Available methods rely on a quantile-based partitioning estimator of the conditional mean regression function to primarily construct flexible yet interpretable visualization methods, but they can also be used to estimate treatment effects, assess uncertainty, and test substantive domain-specific hypotheses. This paper introduces novel binscatter methods based on nonlinear, possibly nonsmooth M-estimation methods, covering generalized linear, robust, and quantile regressio
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'M-Polynomial' for particular source types:
Journal articles Dissertations / Theses
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