Relevant bibliographies by topics / Quadratic polynomial

Academic literature on the topic 'Quadratic polynomial'

Author: Grafiati
Published: 10 December 2022
Last updated: 28 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 'Quadratic 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 "Quadratic polynomial"

1

Sankari, Hasan, and Ahmad Abdo. "On Polynomial Solutions of Pell’s Equation." Journal of Mathematics 2021 (August 12, 2021): 1–4. http://dx.doi.org/10.1155/2021/5379284.

Full text
Abstract:
Polynomial Pell’s equation is x 2 − D y 2 = ± 1 , where D is a quadratic polynomial with integer coefficients and the solutions X , Y must be quadratic polynomials with integer coefficients. Let D = a 2 x 2 + a 1 x + a 0 be a polynomial in Z x . In this paper, some quadratic polynomial solutions are given for the equation x 2 − D y 2 = ± 1 which are significant from computational point of view.
APA, Harvard, Vancouver, ISO, and other styles
2

AHMADI, OMRAN, FLORIAN LUCA, ALINA OSTAFE, and IGOR E. SHPARLINSKI. "ON STABLE QUADRATIC POLYNOMIALS." Glasgow Mathematical Journal 54, no. 2 (March 29, 2012): 359–69. http://dx.doi.org/10.1017/s001708951200002x.

Full text
Abstract:
AbstractWe recall that a polynomial f(X) ∈ K[X] over a field K is called stable if all its iterates are irreducible over K. We show that almost all monic quadratic polynomials f(X) ∈ ℤ[X] are stable over ℚ. We also show that the presence of squares in so-called critical orbits of a quadratic polynomial f(X) ∈ ℤ[X] can be detected by a finite algorithm; this property is closely related to the stability of f(X). We also prove there are no stable quadratic polynomials over finite fields of characteristic 2 but they exist over some infinite fields of characteristic 2.
APA, Harvard, Vancouver, ISO, and other styles
3

YU, PEI, and MAOAN HAN. "FOUR LIMIT CYCLES FROM PERTURBING QUADRATIC INTEGRABLE SYSTEMS BY QUADRATIC POLYNOMIALS." International Journal of Bifurcation and Chaos 22, no. 10 (October 2012): 1250254. http://dx.doi.org/10.1142/s0218127412502549.

Full text
Abstract:
In this paper, we present four limit cycles in quadratic near-integrable polynomial systems. It is shown that when a quadratic integrable system has two centers and is perturbed by quadratic polynomials, it can generate at least four limit cycles with (3,1)-distribution. This result provides a positive answer to an open question in this research area.
APA, Harvard, Vancouver, ISO, and other styles
4

Coelho, Terence, and Bahman Kalantari. "How many real attractive fixed points can a polynomial have?" Mathematical Gazette 103, no. 556 (February 14, 2019): 65–76. http://dx.doi.org/10.1017/mag.2019.8.

Full text
Abstract:
While the notion of roots of a quadratic polynomial is rudimentary in high school mathematics, that of its fixed points is uncommon. A real or complex number is a fixed point of a polynomial p (x) p (θ) = θ. The fact that the notion of fixed point of polynomials is not commonly covered in high school or undergraduate mathematics is surprising because the relevance of the fixed points of a quadratic can be demonstrated easily via iterative methods for the approximation of such numbers as , when the quadratic formula offers no remedy.
APA, Harvard, Vancouver, ISO, and other styles
5

Yuksel, Cem. "High-Performance Polynomial Root Finding for Graphics." Proceedings of the ACM on Computer Graphics and Interactive Techniques 5, no. 3 (July 25, 2022): 1–15. http://dx.doi.org/10.1145/3543865.

Full text
Abstract:
We present a computationally-efficient and numerically-robust algorithm for finding real roots of polynomials. It begins with determining the intervals where the given polynomial is monotonic. Then, it performs a robust variant of Newton iterations to find the real root within each interval, providing fast and guaranteed convergence and satisfying the given error bound, as permitted by the numerical precision used. For cubic polynomials, the algorithm is more accurate and faster than both the analytical solution and directly applying Newton iterations. It trivially extends to polynomials with arbitrary degrees, but it is limited to finding the real roots only and has quadratic worst-case complexity in terms of the polynomial's degree. We show that our method outperforms alternative polynomial solutions we tested up to degree 20. We also present an example rendering application with a known efficient numerical solution and show that our method provides faster, more accurate, and more robust solutions by solving polynomials of degree 10.
APA, Harvard, Vancouver, ISO, and other styles
6

Rukhin, A. L. "Admissible polynomial estimators for quadratic polynomials of normal parameters." Journal of Mathematical Sciences 68, no. 4 (February 1994): 566–76. http://dx.doi.org/10.1007/bf01254283.

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

Braś, M. "NORDSIECK METHODS WITH INHERENT QUADRATIC STABILITY." Mathematical Modelling and Analysis 16, no. 1 (April 8, 2011): 82–96. http://dx.doi.org/10.3846/13926292.2011.560617.

Full text
Abstract:
We derive suffcient conditions which guarantee that the stability polynomial of Nordsieck method for ordinary differential equations has only two nonzero roots. Examples of such methods up to order four are presented which are A-and L-stable. These examples were obtained by computer search using the Schurcriterion applied to the quadratic factor of the resulting stability polynomials.
APA, Harvard, Vancouver, ISO, and other styles
8

Mollin, R. A. "A Completely General Rabinowi1sch Criterion for Complex Quadratic Fields." Canadian Mathematical Bulletin 39, no. 1 (March 1, 1996): 106–10. http://dx.doi.org/10.4153/cmb-1996-013-1.

Full text
Abstract:
AbstractWe provide a criterion for the class group of a complex quadratic field to have exponent at most 2. This is given in terms of the factorization of a generalized Euler-Rabinowitsch polynomial and has consequences for consecutive distinct initial prime-producing quadratic polynomials which we cite as applications.
APA, Harvard, Vancouver, ISO, and other styles
9

Louboutin, Stéphane. "Prime Producing Quadratic Polynomials and Class-Numbers of Real Quadratic Fields." Canadian Journal of Mathematics 42, no. 2 (April 1, 1990): 315–41. http://dx.doi.org/10.4153/cjm-1990-018-3.

Full text
Abstract:
Frobenius-Rabinowitsch's theorem provides us with a necessary and sufficient condition for the class-number of a complex quadratic field with negative discriminant D to be one in terms of the primality of the values taken by the quadratic polynomial with discriminant Don consecutive integers (See [1], [7]). M. D. Hendy extended Frobenius-Rabinowitsch's result to a necessary and sufficient condition for the class-number of a complex quadratic field with discriminant D to be two in terms of the primality of the values taken by the quadratic polynomials and with discriminant D (see [2], [7]).
APA, Harvard, Vancouver, ISO, and other styles
10

Llibre, Jaume, Bruno D. Lopes, and Paulo R. da Silva. "Bifurcations of the Riccati Quadratic Polynomial Differential Systems." International Journal of Bifurcation and Chaos 31, no. 06 (May 2021): 2150094. http://dx.doi.org/10.1142/s0218127421500942.

Full text
Abstract:
In this paper, we characterize the global phase portrait of the Riccati quadratic polynomial differential system [Formula: see text] with [Formula: see text], [Formula: see text] nonzero (otherwise the system is a Bernoulli differential system), [Formula: see text] (otherwise the system is a Liénard differential system), [Formula: see text] a polynomial of degree at most [Formula: see text], [Formula: see text] and [Formula: see text] polynomials of degree at most 2, and the maximum of the degrees of [Formula: see text] and [Formula: see text] is 2. We give the complete description of the phase portraits in the Poincaré disk (i.e. in the compactification of [Formula: see text] adding the circle [Formula: see text] of the infinity) modulo topological equivalence.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Quadratic polynomial"

1

Boljunčić, Jadranka. "Quadratic programming : quantitative analysis and polynomial running time algorithms." Thesis, University of British Columbia, 1987. http://hdl.handle.net/2429/27532.

Full text
Abstract:
Many problems in economics, statistics and numerical analysis can be formulated as the optimization of a convex quadratic function over a polyhedral set. A polynomial algorithm for solving convex quadratic programming problems was first developed by Kozlov at al. (1979). Tardos (1986) was the first to present a polynomial algorithm for solving linear programming problems in which the number of arithmetic steps depends only on the size of the numbers in the constraint matrix and is independent of the size of the numbers in the right hand side and the cost coefficients. In the first part of the thesis we extended Tardos' results to strictly convex quadratic programming of the form max {cTx-½xTDx : Ax ≤ b, x ≥0} with D being symmetric positive definite matrix. In our algorithm the number of arithmetic steps is independent of c and b but depends on the size of the entries of the matrices A and D. Another part of the thesis is concerned with proximity and sensitivity of integer and mixed-integer quadratic programs. We have shown that for any optimal solution z̅ for a given separable quadratic integer programming problem there exist an optimal solution x̅ for its continuous relaxation such that
z̅ - x̅
∞≤n∆(A) where n is the number of variables and ∆(A) is the largest absolute sub-determinant of the integer constraint matrix A . We have further shown that for any feasible solution z, which is not optimal for the separable quadratic integer programming problem, there exists a feasible solution z̅ having greater objective function value and with
z - z̅
∞≤n∆(A). Under some additional assumptions the distance between a pair of optimal solutions to the integer quadratic programming problem with right hand side vectors b and b', respectively, depends linearly on
b — b'
₁. The extension to the mixed-integer nonseparable quadratic case is also given. Some sensitivity analysis results for nonlinear integer programming problems are given. We assume that the nonlinear 0 — 1 problem was solved by implicit enumeration and that some small changes have been made in the right hand side or objective function coefficients. We then established what additional information to keep in the implicit enumeration tree, when solving the original problem, in order to provide us with bounds on the optimal value of a perturbed problem. Also, suppose that after solving the original problem to optimality the problem was enlarged by introducing a new 0 — 1 variable, say xn+1. We determined a lower bound on the added objective function coefficients for which the new integer variable xn+1 remains at zero level in the optimal solution for the modified integer nonlinear program. We discuss the extensions to the mixed-integer case as well as to the case when integer variables are not restricted to be 0 or 1. The computational results for an example with quadratic objective function, linear constraints and 0—1 variables are provided. Finally, we have shown how to replace the objective function of a quadratic program with 0—1 variables ( by an integer objective function whose size is polynomially bounded by the number of variables) without changing the set of optimal solutions. This was done by making use of the algorithm given by Frank and Tardos (1985) which in turn uses the simultaneous approximation algorithm of Lenstra, Lenstra and Lovász (1982).
Business, Sauder School of
Graduate
APA, Harvard, Vancouver, ISO, and other styles
2

Tuncbilek, Cihan H. "Polynomial and indefinite quadratic programming problems: algorithms and applications." Diss., Virginia Tech, 1994. http://hdl.handle.net/10919/39040.

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

Poirier, Schmitz Alfredo. "Invariant measures on polynomial quadratic Julia sets with no interior." Pontificia Universidad Católica del Perú, 2014. http://repositorio.pucp.edu.pe/index/handle/123456789/96022.

Full text
Abstract:
We characterize invariant measures for quadratic polynomial Julia sets with no interior. We prove that besides the harmonic measure —the only one that is even and invariant—, all others are generated by a suitable odd measure.
En este artículo caracterizamos medidas invariantes sobre conjuntos de Julia sin interior asociados con polinomios cuadráticos.  Probamos que más allá de la medida armónica —la única par e invariante—, el resto son generadas por su parte impar.
APA, Harvard, Vancouver, ISO, and other styles
4

Ferragut, i. Amengual Antoni. "Polynomial inverse integrating factors of quadratic differential systems and other results." Doctoral thesis, Universitat Autònoma de Barcelona, 2006. http://hdl.handle.net/10803/3093.

Full text
Abstract:
Aquesta tesi està dividida en dues parts diferents. En la primera, estudiam els sistemes quadràtics (sistemes polinomials de grau dos) que tenen un invers de factor integrant polinomial. En la segona, estudiam tres problemes diferents referits als sistemes diferencials polinomials.
La primera part
En l'estudi dels sistemes diferencials plans el coneixement d'una integral primera és molt important. Els seus conjunts de nivell estan formats per òrbites i ens permeten dibuixar el retrat de fase del sistema, objectiu principal de la teoria qualitativa de les equacions diferencials al pla. Com ja se sap, existeix una bijecció entre l'estudi de les integrals primeres i l'estudi dels inversos de factor integrant. De fet, és més senzill l'estudi dels inversos de factor integrant que el de les integrals primeres. Una classe és dels sistemes quadràtics àmpliament estudiada dins els sistemes diferencials al pla és la dels sistemes quadràtics. Hi ha més d'un miler d'articles publicats sobre aquest tipus de sistemes, però encara som lluny de conèixer quins d'aquests sistemes són integrables, és a dir, si tenen una integral primera.
En aquest treball, estudiam els sistemes quadràtics que tenen un invers de factor integrant polinomial V = V(x, y), i per tant també tenen una integral primera, definida allà on no s'anul·la. Aquesta classe de sistemes diferencials és important per diferents motius:
1. La integral primera és sempre Darboux.
2. Conté la classe dels sistemes quàdratics homogenis, àmpliament estudiada (Date, Sibirskii, Vulpe...).
3. Conté la classe dels sistemes quàdratics amb un centre, també estudiada (Dulac, Kapteyn, Bautin,...).
4. Conté la classe dels sistemes quàdratics Hamiltonians (Artés, Llibre, Vulpe).
5. Conté la classe dels sistemes quàdratics amb una integral primera polinomial (Chavarriga, García, Llibre, Pérez de Rio, Rodríguez).
6. Conté la classe dels sistemes quàdratics amb una integral primera racional de grau dos (Cairó, Llibre).
La segona part
Presentam els següents tres articles:
1. A. Ferragut, J. Llibre and A. Mahdi, Polynomial inverse integrating factors for polynomial vector ?elds, to appear in Discrete and Continuous Dynamical Systems.
2. A. Ferragut, J. Llibre and M.A. Teixeira, Periodic orbits for a class of C(1) three-dimensional systems, submitted.
3. A. Ferragut, J. Llibre and M.A. Teixeira, Hyperbolic periodic orbits coming from the bifurcation of a 4-dimensional non-linear center, to appear in Int. J. Of Bifurcation and Chaos.
En el primer article donam tres resultats principals. Primer provam que un camp vectorial polinomial que té una integral primera polinomial té un invers de factor integrant polinomial. El segon resultat és un exemple d'un camp vectorial polinomial que té una integral primera racional i no té ni una integral primera polinomial ni un invers de factor integrant polinomial. Era un problema obert el fet de sebre si existien camps vectorials polinomials veri?cant aquestes condicions. El tercer resultat és un exemple d'un camp vectorial polinomial que té un centre i no té invers de factor integrant polinomial. Un exemple d'aquest tipus era esperat però desconegut en la literatura.
En el segon article estudiam camps vectorials polinomials reversibles de grau quatre en R(3) que tenen, sota certes condicions genèriques, un nombre arbitrari d'-orbitesperi-odiques hiperb-oliques. Sense aquestes condicions, tenen un nombre arbitrari d'òrbites periòdiques hiperbòliques. Sense aquestes condicions, tenen un nombre arbitrari d'òrbites periòdiques.
Finalment, en el tercer article, estudiam la pertorbació d'un centre de R(4) que prove d'un problema de la física. Mitjançant la teoria dels termes mitjans de primer ordre dins els camps vectorials polinomials de grau quatre, el sistema pertorbat pot tenir fins a setze òrbites periòdiques hiperbòliques bifurcant de les òrbites peròdiques del centre.
This thesis is divided into two different parts. In the first one, we study the quadratic systems (polynomial systems of degree two) having a polynomial inverse integrating factor. In the second one, we study three different problems related to polynomial differential systems.
The ?rst part.
It is very important, for planar differential systems, the knowledge of a ?rst integral. Its level sets are formed by orbits and they let us draw the phase portrait of the system, which is the main objective of the qualitative theory of planar differential equations.
As it is known, there is a bijection between the study of the ?rst integrals and the study of inverse integrating factors. In fact, it is easier to study the inverse integrating factors than the ?rst integrals.
A widely studied class of planar differential systems is the quadratic one. There are more than a thousand published articles about this subject of differential systems, but we are far away of knowing which quadratic systems are integrable, that is, if they have a ?rst integral.
In this work, we study the quadratic systems having a polynomial inverse integrating factor V = V (x, y), so they also have a ?rst integral, de?ned where V does not vanish. This class of quadratic systems is important for several reasons:
1. The ?rst integral is always Darboux.
2. It contains the class of homogeneous quadratic system, widely studied (Date, Sibirskii, Vulpe,...).
3. It contains the class of quadratic systems having a center, also studied (Dulac, Kapteyn, Bautin,...).
4. It contains the class of Hamiltonian quadratic systems (Artés, Llibre, Vulpe).
5. It contains the class of quadratic systems having a polynomial ?rst integral (Chavarriga, García, Llibre, Pérez de Rio, Rodríguez).
6. It contains the class of quadratic systems having a rational ?rst integral of de gree two (Cairó, Llibre).
The classi?cation of the quadratic systems having a polynomial inverse integrating factor is not completely ?nished. There remain near a 5% of the cases to study. We leave their study for an immediate future.
The second part.
We present the following three articles:
1. A. Ferragut, J. Llibre and A. Mahdi, Polynomial inverse integrating factors for polynomial vector ?elds, to appear in Discrete and Continuous Dynamical Systems.
2. A. Ferragut, J. Llibre and M.A. Teixeira, Periodic orbits for a class of C(1) three-dimensional systems, submitted.
3. A. Ferragut, J. Llibre and M.A. Teixeira, Hyperbolic periodic orbits coming from the bifurcation of a 4-dimensional non-linear center, to appear in Int. J. Of Bifurcation and Chaos.
In the first article we give three main results. First we prove that a polynomial vector field having a polynomial must have a polynomial inverse integrating factor. The second one is an example of a polynomial vector ?eld having a rational ?rst integral and having neither polynomial ?rst integral nor polynomial inverse integrating factor. It was an open problem to know if there exist polynomial vector ?elds verifying these conditions. The third one is an example of a polynomial vector ?eld having a center and not having a polynomial inverse integrating factor. An example of this type was expected but unknown in the literature.
In the second article we study reversible polynomial vector ?elds of degree four in R(3) which have, under certain generic conditions, an arbitrary number of hyperbolic periodic orbits. Without these conditions, they have an arbitrary number of periodic orbits.
Finally, in the third article, we study the perturbation of a center in R(4) which comes from a problem of physics. By the ?rst order averaging theory and perturbing inside the polynomial vector ?elds of degree four, the perturbed system may have at most sixteen hyperbolic periodic orbits bifurcating from the periodic orbits of the center.
APA, Harvard, Vancouver, ISO, and other styles
5

Riggs, Laurie Jan. "Polynomial equations and solvability: A historical perspective." CSUSB ScholarWorks, 1996. https://scholarworks.lib.csusb.edu/etd-project/1186.

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

Liu, Dunxue Carleton University Dissertation Mathematics. "Dihedral polynomial congruences and binary quadratic forms: a class field theory approach." Ottawa, 1992.

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

Lahnovych, Carrie. "Analysis and computation of a quadratic matrix polynomial with Schur-products and applications to the Barboy-Tenne model /." Online version of thesis, 2010. http://ritdml.rit.edu/handle/1850/12207.

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

Begum, Monzu Ara. "Bifurcation in complex quadratic polynomial and some fold theorems involving the geometry of bulbs of the Mandelbrot set." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp05/MQ64045.pdf.

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

Ryu, Jong Hoon. "Permutation polynomial based interleavers for turbo codes over integer rings theory and applications /." Columbus, Ohio : Ohio State University, 2007. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1181139404.

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

Ali, Ali Hasan. "Modifying Some Iterative Methods for Solving Quadratic Eigenvalue Problems." Wright State University / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=wright1515029541712239.

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

Books on the topic "Quadratic polynomial"

1

From polynomials to sums of squares. Bristol: Institute of Physics Pub., 1995.

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

Penrose, Christopher S. On quotients of the shift associated with dendrite Julia sets of quadratic polynomials. [s.l.]: typescript, 1990.

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

International Conference on p-Adic Functional Analysis (11th 2010 Université Blaise Pascal). Advances in non-Archimedean analysis: Eleventh International Conference on p-Adic Functional Analysis, July 5-9 2010, Université Blaise Pascal, Clermont-Ferrand, France. Edited by Araujo-Gomez Jesus 1965-, Diarra B. (Bertin) 1944-, and Escassut Alain. Providence, R.I: American Mathematical Society, 2011.

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

Schlomiuk, Dana, Joan C. Artés, Jaume Llibre, and Nicolae Vulpe. Geometric Configurations of Singularities of Planar Polynomial Differential Systems: A Global Classification in the Quadratic Case. Birkhäuser, 2020.

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

Schlomiuk, Dana, Joan C. Artés, Jaume Llibre, and Nicolae Vulpe. Geometric Configurations of Singularities of Planar Polynomial Differential Systems: A Global Classification in the Quadratic Case. Springer International Publishing AG, 2022.

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

Minds, Great. Eureka Math, A Story of Functions : Algebra I, Module 4: Polynomial and Quadratic Expressions, Equations and Functions, Teacher Edition. Jossey-Bass, 2014.

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

Beyond the Quadratic Formula. Mathematical Association of America, 2015.

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

Olshanski, Grigori. Enumeration of maps. Edited by Gernot Akemann, Jinho Baik, and Philippe Di Francesco. Oxford University Press, 2018. http://dx.doi.org/10.1093/oxfordhb/9780198744191.013.26.

Full text
Abstract:
This article discusses the relationship between random matrices and maps, i.e. graphs drawn on surfaces, with particular emphasis on the one-matrix model and how it can be used to solve a map enumeration problem. It first provides an overview of maps and related objects, recalling the basic definitions related to graphs and defining maps as graphs embedded into surfaces before considering a coding of maps by pairs of permutations. It then examines the connection between matrix integrals and maps, focusing on the Hermitian one-matrix model with a polynomial potential and how the formal expansion of its free energy around a Gaussian point (quadratic potential) can be represented by diagrams identifiable with maps. The article also illustrates how the solution of the map enumeration problem can be deduced by means of random matrix theory (RMT). Finally, it explains how the matrix model result can be translated into a bijective proof.
APA, Harvard, Vancouver, ISO, and other styles
9

Limmer, Douglas James. Measure-equivalence of quadratic forms. 1999.

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

Limmer, Douglas James. Measure-equivalence of quadratic forms. 1999.

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

Book chapters on the topic "Quadratic polynomial"

1

Ben-Ari, Mordechai. "Solving Quadratic Equations." In Mathematical Surprises, 73–87. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-13566-8_7.

Full text
Abstract:
AbstractPoh-Shen Loh proposed a method for solving quadratic equations that is based on a relation between the coefficients of the quadratic polynomial and its roots. Section 7.1 reviews the traditional methods for solving quadratic equations. Section 7.2 tries to convince the reader that Loh’s method makes sense and then explains howto compute the roots. In Sect. 7.3 the computation is carried out for two quadratic polynomials and a similar computation for a quartic polynomial. Section 7.4 derives the traditional formula for the roots from Loh’s formulas.
APA, Harvard, Vancouver, ISO, and other styles
2

Luo, Albert C. J. "Quadratic Nonlinear Functional Systems." In Polynomial Functional Dynamical Systems, 5–41. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-031-79709-5_2.

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

Luo, Albert C. J. "Quadratic Nonlinear Discrete Systems." In Bifurcation Dynamics in Polynomial Discrete Systems, 1–92. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-5208-3_1.

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

Gelfand, Israel M., and Alexander Shen. "The graph of the quadratic polynomial." In Algebra, 110–13. Boston, MA: Birkhäuser Boston, 2004. http://dx.doi.org/10.1007/978-1-4612-0335-3_57.

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

Caiming, Zhang, Ji Xiuhua, and Liu Hui. "Determining Knots with Quadratic Polynomial Precision." In Computational Science – ICCS 2007, 130–37. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-72586-2_17.

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

Shparlinski, Igor. "Inversive, Polynomial and Quadratic Exponential Generators." In Cryptographic Applications of Analytic Number Theory, 283–94. Basel: Birkhäuser Basel, 2003. http://dx.doi.org/10.1007/978-3-0348-8037-4_27.

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

Tangian, Andranik, and Josef Gruber. "Constructing Quadratic and Polynomial Objective Functions." In Lecture Notes in Economics and Mathematical Systems, 166–94. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/978-3-642-48773-6_12.

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

Gutiérrez, J., T. Recio, and C. Ruiz de Velasco. "Polynomial decomposition algorithm of almost quadratic complexity." In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 471–75. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/3-540-51083-4_83.

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

Gelfand, Israel M., and Alexander Shen. "Maximum and minimum values of a quadratic polynomial." In Algebra, 114–16. Boston, MA: Birkhäuser Boston, 2004. http://dx.doi.org/10.1007/978-1-4612-0335-3_59.

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

Artés, Joan C., Jaume Llibre, Dana Schlomiuk, and Nicolae Vulpe. "Classifications of quadratic systems with special singularities." In Geometric Configurations of Singularities of Planar Polynomial Differential Systems, 163–260. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-50570-7_7.

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

Conference papers on the topic "Quadratic polynomial"

1

Gu, Lei. "A Comparison of Polynomial Based Regression Models in Vehicle Safety Analysis." In ASME 2001 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2001. http://dx.doi.org/10.1115/detc2001/dac-21063.

Full text
Abstract:
Abstract Vehicle crash is a highly nonlinear event in terms of the structural and dummy responses. However, Linear and quadratic polynomials regression are still widely used in the design optimization and reliability based optimization of vehicle safety analysis. This paper investigates the polynomial based subset selection regression models for vehicle safety analysis. Three subset selection techniques: all possible subset with linear polynomial, stepwise with quadratic polynomial and sequential replacement with quadratic and cubic polynomials, are discussed. The methods have been applied to data from finite element simulations of vehicle full frontal crash, side impact and frontal offset impact. It is shown subset selection with sequential replacement algorithm gives the best accuracy responses. It is also shown from limited finite element simulation data, the quadratic polynomial is good enough for most structural and dummy responses when gauges and materials are used as design variables. For vehicle weight, linear polynomial fits well.
APA, Harvard, Vancouver, ISO, and other styles
2

Zhang, Congcong, Ying Li, and Qian Yu. "Quadratic polynomial interpolation on triangular domain." In Ninth International Conference on Graphic and Image Processing, edited by Hui Yu and Junyu Dong. SPIE, 2018. http://dx.doi.org/10.1117/12.2302956.

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

Goyal, Komal, and Bhagwati Prasad. "Dynamics of iterative schemes for quadratic polynomial." In ADVANCEMENT IN MATHEMATICAL SCIENCES: Proceedings of the 2nd International Conference on Recent Advances in Mathematical Sciences and its Applications (RAMSA-2017). Author(s), 2017. http://dx.doi.org/10.1063/1.5008710.

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

Xing Huo and Kai Xie. "LCD colorimetric characterization based on quadratic polynomial." In 2014 11th International Conference on Service Systems and Service Management (ICSSSM). IEEE, 2014. http://dx.doi.org/10.1109/icsssm.2014.6874148.

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

Ishak, Asnor Juraiza, Siti Salasiah Mokri, Mohd Marzuki Mustafa, and Aini Hussain. "Weed Detection utilizing Quadratic Polynomial and ROI Techniques." In 2007 5th Student Conference on Research and Development. IEEE, 2007. http://dx.doi.org/10.1109/scored.2007.4451360.

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

Wang Jian, Zhao Honglian, Liu Bing, and Wang Dezhuang. "Illumination compensation algorithm based on quadratic polynomial model." In 2009 Chinese Control and Decision Conference (CCDC). IEEE, 2009. http://dx.doi.org/10.1109/ccdc.2009.5194890.

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

Lee, Chong-dao, Yaotsu Chang, and Trieu-kien Truong. "Decoding Binary Quadratic Residue Codes Using Syndrome Polynomial." In 2006 International Conference on Communications, Circuits and Systems. IEEE, 2006. http://dx.doi.org/10.1109/icccas.2006.284785.

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

Chi, Ching-Lung, and Chih-Hsiao Kuo. "Quadratic permutation polynomial interleaver for LTE turbo coding." In 2012 International Conference on Information Security and Intelligence Control (ISIC). IEEE, 2012. http://dx.doi.org/10.1109/isic.2012.6449769.

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

Macariu, Georgiana, and Dana Petcu. "Parallel Multiple Polynomial Quadratic Sieve on Multi-Core Architectures." In 2007 Ninth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing. IEEE, 2007. http://dx.doi.org/10.1109/synasc.2007.21.

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

Wu, Baofeng. "New classes of quadratic bent functions in polynomial forms." In 2014 IEEE International Symposium on Information Theory (ISIT). IEEE, 2014. http://dx.doi.org/10.1109/isit.2014.6875150.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Quadratic 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