ALTERNATIVE SOLUTION TO THE QUARTIC EQUATION by Farid A. Chouery 1, P.E. 2006, All rights reserved
|
|
- Derek Mitchell
- 6 years ago
- Views:
Transcription
1
2
3 ALTERNATIVE SOLUTION TO THE QUARTIC EQUATION b Farid A. Chouer, P.E. 006, All rights reserved Abstract A new method to obtain a closed form solution of the fourth order olnomial equation is roosed in this aer. The algorithm is robust, avoids comlex numbers under the square roots in the solution, has a new resolvent cubic equation and simle to build without the need for iterative methods. Also, the most ositive and most negative root in the third order olnomial solution will be clearl defined among all the existing roots. Ke words quartic equation, cubic equation, olnomial equation, roots of a olnomial.. Introduction. In man design situations in engineering, and in the numerical analsis of models of natural sstems, one often requires the solution of a third or a fourth order olnomial equation. In man cases, when solving the roblem several times, seed is of imortance and hence, a closed form solution is referred. Also, if the roots of the equations need to be differentiated or integrated with resect to a certain coefficient, one often relies on a closed form solution. The solution for a olnomial u to the fourth order can be found in man Mathematics and Engineering handbooks [,]. The classical solution of the fourth order equation requires the finding of an one root of another third order olnomial, called the resolvent cubic, which is derived from the original equation. However, in man cases, when this root is found and imlemented in the solution, an undesirable imaginar number inside a square root sign ma occur in the obtained roots. Thus, the user must take further stes to obtain the rincial roots. For this reason the distinction between the four roots is not clear. Electrical/Structural/Foundation Professional Engineer, BSEE, MSEE, MSE (Structural) from the Universit of Washington, Seattle, WA. President of FAC SYSTEMS INC. Seattle, WA (
4 In man engineering roblems an earl distinction between the roots can be valuable. For examle, the design calculation for the underground deth of a sheet ile wall require solving a third or fourth order olnomial equation. At least one of the roots in the solution of this equation is exected to be ositive. The most ositive will generall be used as the design arameter, while the other roots are ignored. If an earl distinction can be made of which root will give the most ositive value, much time will be saved. Onl one root will be calculated with confidence, instead of three or more. Thus, there is less chance of errors. It is the urose of this article to resent a general, comutationall efficient, and closed form solution for the quartic equation and to clearl define among all the existing roots the most ositive and negative root for the cubic equation.. Lemma. The roots of the Quartic equation (.) + + q + r+ s= 0 are: (.) n n a b, = + ±, and n (.), = n n a b ± + n where (.) a = 6 + q, b = 8 q r b 0,, and n > 0 is the most ositive root of the cubic equation (.5) n + an + ( a c) n b = 0 where
5 (.6) c = + q r s If b = 0, then the roots,,, = x, where x is the root of the following equations (.7) ± [ c a] x+ c = 0 x ; for a < c or (.8) a x = ± c ; for a c. In all of the above terms there are no imaginar values under the square root signs. (.) + + q + r+ s= 0. Proof of Lemma. for the following quartic equation define and substitute x = + in equation (.). Thus the equation becomes (.) x + ax + bx+ c= 0, where (.) a = 6 + q, b = 8 q r, and c = + q r s If b = 0 then equation (.) becomes (.) x + ax + c= 0, 5
6 and the solution can be obtained b using the classical method of solving the roots of a quadratic equation in x. Thus, equation (.8) is obtained. This solution is chosen when the discriminant is greater than zero, or when root of equation (.8). For the case when a c. In this case, no imaginar number is resent under the square a < c, equation (.) is factored into two quadratic olnomials, as in equation (.7). B finding the roots of the quadratic equations in of equation (.7), the four roots are obtained. Consequentl, the roots of equation (.) are obtained when b = 0, and the solution of equation (.) is = + x. If b 0, then equation (.) can be written as follows a n b a n b (.5) x + ax + bx+ c= x nx+ + + x + nx+ + n n, where n is a new unknown constant. B algebraicall multiling the two quadratic olnomials of equation (.5) the following equation is obtained (.6) x a+ n b + ax + bx+. n B equating the coefficients of equation (.6) to the coefficients of equation (.) term b term, the following condition must be satisfied a+ n b (.7) = c n. B rearranging equation (.7) ields the cubic equation (.5); ( a c) n = 0 n + an + b. This cubic equation has at least one ositive root. This can be seen b Descartes' rule of signs and the fact that the last term on the left side of the equation is negative. So for examle, if equation (.5) is set to equal some function f(n) instead of zero, then f(0)<0 and f(+ )>0, which means a change of sign occurs in the interval 0<n<+ and a ositive real root must exist. B taking the most ositive root of equation (.5), n>0 is found. Substituting n in the two factored quadratic 6
7 olnomials of equation (.5) and solving for the roots of these factors b using the classical solution of a quadratic equation, gives the last two terms on the right side of equations (.) and (.). Finall b adding the term. is roven. to the solution, the roots,,, are obtained. Thus Lemma. Lemma. For the cubic equation (.) + + q+ r = 0, where its three real roots can be written (.) = m cosθ π = mcos( θ + ) and π = m cos( θ + ), with a b m=, θ = cos, am a = + q, and b = q r, is the most ositive root, is the most negative root, and. (5.) + + q+ r = 0 5. Proof of Lemma. for the cubic equation define and substitute x= + in equation (5.). Thus the equation becomes (5.) x + ax+ b= 0, Where 7
8 (5.) a = + q, and b = q r. According to the classical solution [], if + 0, there are three real roots (5.) = m cosθ π = mcos( θ + ) and π = m cos( θ + ), with a b m= and θ = cos. am Now, if + 0 (5.) is ositive. Also, if + 0, then ields, then a < 0 or a > 0 a. Thus a. Thus, m > 0, and the amlitudes of equation a b a a and this inequalit (5.5) am b am b or = cosθ. am Therefore, (5.6) 0 θ π or Also, π 0 θ. π π (5.7) θ + π and π π 5 θ + π. Since m > 0, the curve of the roots as a function of the coefficient Ω can easil be lotted as = m cosω. This curve, reresenting equations (5.), is shown in Fig.(). The intervals 8
9 π π 0 Ω, Ω π and the figure. π 5 Ω π, where the three roots can be found, are identified in Interval for = mcosω - / -/ 0 π/ π/ π π/ 5π/ Figure () Plot of intervals of roots to the cubic equation. From Fig.(), it is clear that is the largest root, is the smallest root, and If two roots are equal, then the would be on the dashed line in Fig. () and Ω can be π/ or π/ (θ = π/ or θ = 0). If three roots are equal, then m and a must be 0, and equation (5.) does not al because + > 0. Thus Lemma is roven. To comlete the solution of the cubic equation for the other case where + > 0, the second art of the solution is stated as follows: the onl real root is (5.8) = + [ + + u] + [ + u ] where u =. 9
10 For the remaining imaginar roots, let quadratic equation in x x = + and solve for the roots of the following (5.8) x + x x+ a+ x = 0 The comlex roots are, x x = x, = a i ± + 6. Algorithm. The following algorithm is used to find the most ositive root of the cubic equation + + q+ r = 0 Ste. Find the values a and b where a = + q, and b = q r Ste. Find the value u, where u = and b 0. If b= 0 and a < 0 then go to ste 5 else if b= 0 and a 0 then x 0 and go to ste 7 Ste. If +u < 0 go to ste 5; otherwise, go to ste. Ste. Find the value x, where x [ + + u] + [ + ] = u And then go to ste 7. Ste 5. Find the values a b m= and θ = cos am Ste 6. Find the value x, where x = m cosθ. = For the resolvent cubic equation (.5), if the root x = 0, it makes n = 0 or b = 0 in equation (.5). Which it is not allowed. When finding the root of the resolvent cubic equation b 0 in equation (.5) is alwas assumed. 0
11 Ste 7. Find the root = x, which is the most ositive root. If one would like to continue to find the remaining roots, then continue with ste 8. Ste 8. if +u < 0 go to ste 9 else the roots are comlex and are, x x = x, = a i ± + Ste 9. the roots are real and are, = x, = x x ± a 7. Algorithm. The following algorithm is used to find the roots of the quartic equation + + q + r+ s= 0 Ste. Find the values a, b and c where, a = 6 + q, b = 8 q r, and c = + q r s Ste. If b 0, then go to ste 6; otherwise, go to ste. Ste. If a c, then go to ste 5; otherwise, go to ste. Ste. Find the four roots x, x, x and x of the following two quadratic equations: [ ] c a x+ = 0 x + c and In order to be sensitive to comuter code rogramming the two roots, of equation (.) are not used.
12 [ ] c a x+ c = 0 x, and then go to ste 9. Ste 5. Find the four values x, x, x and x, of the following two quadratic equations x a and = + c and then go to ste 9. a x = c, Ste 6. Find the most ositive n > 0 using algorithm in section 6 of the following cubic equation ( a c) n = 0 n + an + b. Ste 8. Find the four roots x, x, x and x, of the following two quadratic equations a n b x nx+ + + = 0 and n a n b x + nx+ + = 0. n Ste 9. Find the roots,,, = x,,,. 8. Conclusions. The resented new closed form solution of the quartic equation is robust and simle to build without the need for iterative methods. It avoids having imaginar numbers under a square root sign. Thus when the solution is used, fewer stes are needed. The stes are eas to track. Calculation time is shortened giving good confidence level. In the second art of the aer, the most ositive and negative roots of the cubic equation are identified. This identification hels to solve for the roots of the new resolvent cubic equation of the quartic equation and is needed in man engineering alications. The resented cubic and quartic algorithm has been used in shoring
13 and foundation engineering in the western United States b several consultants including cit and state engineering deartments for over 0 ears with no errors and no ossibilit of errors giving a good confidence level in the solutions. The results alwas made sense from an engineering ersective. The solution is a classic examle of how to be careful with cook book mathematical solutions showing the resented alternative is referred. The algorithms resented in this aer are efficient and can be used in various comuter rograms. If used in some comuter rograms, where iteration methods are difficult to rogram and where the execution time is considerabl slow, will shorten the execution time. One alication of such a rogram is a sread sheet, where columns or rows of olnomial root solutions are created and listed in a table.. Carl E. Pearson, Handbook of Alied Math, nd ed., Van Norstrand Reinhold, New York, 98, age &. Samuel M. Selb, Standard Math. Tables, 0th ed., the Chemical Rubber Co., Cleveland, Ohio, 97, age 0)06.
José Alberto Mauricio. Instituto Complutense de Análisis Económico. Universidad Complutense de Madrid. Campus de Somosaguas Madrid - SPAIN
A CORRECTED ALGORITHM FOR COMPUTING THE THEORETICAL AUTOCOVARIANCE MATRICES OF A VECTOR ARMA MODEL José Alberto Mauricio Instituto Comlutense de Análisis Económico Universidad Comlutense de Madrid Camus
More informationAnalysis of the Effect of Number of Knots in a Trajectory on Motion Characteristics of a 3R Planar Manipulator
Analysis of the Effect of Number of Knots in a Trajectory on Motion Characteristics of a Planar Maniulator Suarno Bhattacharyya & Tarun Kanti Naskar Mechanical Engineering Deartment, Jadavur University,
More informationOptimization of Gear Design and Manufacture. Vilmos SIMON *
7 International Conference on Mechanical and Mechatronics Engineering (ICMME 7) ISBN: 978--6595-44- timization of Gear Design and Manufacture Vilmos SIMN * Budaest Universit of Technolog and Economics,
More informationON THE LEAST SIGNIFICANT p ADIC DIGITS OF CERTAIN LUCAS NUMBERS
#A13 INTEGERS 14 (014) ON THE LEAST SIGNIFICANT ADIC DIGITS OF CERTAIN LUCAS NUMBERS Tamás Lengyel Deartment of Mathematics, Occidental College, Los Angeles, California lengyel@oxy.edu Received: 6/13/13,
More informationFinding Shortest Hamiltonian Path is in P. Abstract
Finding Shortest Hamiltonian Path is in P Dhananay P. Mehendale Sir Parashurambhau College, Tilak Road, Pune, India bstract The roblem of finding shortest Hamiltonian ath in a eighted comlete grah belongs
More informationVerifying Two Conjectures on Generalized Elite Primes
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 12 (2009), Article 09.4.7 Verifying Two Conjectures on Generalized Elite Primes Xiaoqin Li 1 Mathematics Deartment Anhui Normal University Wuhu 241000,
More informationSolvability and Number of Roots of Bi-Quadratic Equations over p adic Fields
Malaysian Journal of Mathematical Sciences 10(S February: 15-35 (016 Secial Issue: The 3 rd International Conference on Mathematical Alications in Engineering 014 (ICMAE 14 MALAYSIAN JOURNAL OF MATHEMATICAL
More informationRobust Performance Design of PID Controllers with Inverse Multiplicative Uncertainty
American Control Conference on O'Farrell Street San Francisco CA USA June 9 - July Robust Performance Design of PID Controllers with Inverse Multilicative Uncertainty Tooran Emami John M Watkins Senior
More informationOn Line Parameter Estimation of Electric Systems using the Bacterial Foraging Algorithm
On Line Parameter Estimation of Electric Systems using the Bacterial Foraging Algorithm Gabriel Noriega, José Restreo, Víctor Guzmán, Maribel Giménez and José Aller Universidad Simón Bolívar Valle de Sartenejas,
More informationCERIAS Tech Report The period of the Bell numbers modulo a prime by Peter Montgomery, Sangil Nahm, Samuel Wagstaff Jr Center for Education
CERIAS Tech Reort 2010-01 The eriod of the Bell numbers modulo a rime by Peter Montgomery, Sangil Nahm, Samuel Wagstaff Jr Center for Education and Research Information Assurance and Security Purdue University,
More informationOn the Chvatál-Complexity of Knapsack Problems
R u t c o r Research R e o r t On the Chvatál-Comlexity of Knasack Problems Gergely Kovács a Béla Vizvári b RRR 5-08, October 008 RUTCOR Rutgers Center for Oerations Research Rutgers University 640 Bartholomew
More informationGraph the linear system and estimate the solution. Then check the solution algebraically.
(Chapters and ) A. Linear Sstems (pp. 6 0). Solve a Sstem b Graphing Vocabular Solution For a sstem of linear equations in two variables, an ordered pair (x, ) that satisfies each equation. Consistent
More information#A64 INTEGERS 18 (2018) APPLYING MODULAR ARITHMETIC TO DIOPHANTINE EQUATIONS
#A64 INTEGERS 18 (2018) APPLYING MODULAR ARITHMETIC TO DIOPHANTINE EQUATIONS Ramy F. Taki ElDin Physics and Engineering Mathematics Deartment, Faculty of Engineering, Ain Shams University, Cairo, Egyt
More informationNumerical Methods for Particle Tracing in Vector Fields
On-Line Visualization Notes Numerical Methods for Particle Tracing in Vector Fields Kenneth I. Joy Visualization and Grahics Research Laboratory Deartment of Comuter Science University of California, Davis
More informationSolved Problems. (a) (b) (c) Figure P4.1 Simple Classification Problems First we draw a line between each set of dark and light data points.
Solved Problems Solved Problems P Solve the three simle classification roblems shown in Figure P by drawing a decision boundary Find weight and bias values that result in single-neuron ercetrons with the
More informationAlgebra II Practice Semester Exam Specification Sheet
Algebra II Practice Semester Exam Specification Sheet 1. Properties of real numbers. Procedure (write procedure or process) 3. Concept development/linkage. Theorem/factual knowledge (of theorems and rules)
More informationRANDOM WALKS AND PERCOLATION: AN ANALYSIS OF CURRENT RESEARCH ON MODELING NATURAL PROCESSES
RANDOM WALKS AND PERCOLATION: AN ANALYSIS OF CURRENT RESEARCH ON MODELING NATURAL PROCESSES AARON ZWIEBACH Abstract. In this aer we will analyze research that has been recently done in the field of discrete
More informationBrownian Motion and Random Prime Factorization
Brownian Motion and Random Prime Factorization Kendrick Tang June 4, 202 Contents Introduction 2 2 Brownian Motion 2 2. Develoing Brownian Motion.................... 2 2.. Measure Saces and Borel Sigma-Algebras.........
More informationRational Expressions. Definition: P, is an algebraic expression that can be written as the quotient of two polynomials, P. A rational expression, Q
Rational Eressions What is a Rational Eression? A rational eression is siml a fraction so conseuentl the are sometimes called algebraic fractions To be more secific, a rational eression is an algebraic
More informationSOME NEW INEQUALITIES SIMILAR TO HILBERT TYPE INTEGRAL INEQUALITY WITH A HOMOGENEOUS KERNEL. 1. Introduction. sin(
Journal of Mathematical Ineualities Volume 6 Number 2 22 83 93 doi:.753/jmi-6-9 SOME NEW INEQUALITIES SIMILAR TO HILBERT TYPE INTEGRAL INEQUALITY WITH A HOMOGENEOUS KERNEL VANDANJAV ADIYASUREN AND TSERENDORJ
More informationMultiplicative group law on the folium of Descartes
Multilicative grou law on the folium of Descartes Steluţa Pricoie and Constantin Udrişte Abstract. The folium of Descartes is still studied and understood today. Not only did it rovide for the roof of
More informationPell's Equation and Fundamental Units Pell's equation was first introduced to me in the number theory class at Caltech that I never comleted. It was r
Pell's Equation and Fundamental Units Kaisa Taiale University of Minnesota Summer 000 1 Pell's Equation and Fundamental Units Pell's equation was first introduced to me in the number theory class at Caltech
More informationCMSC 425: Lecture 7 Geometric Programming: Sample Solutions
CMSC 425: Lecture 7 Geometric Programming: Samle Solutions Samles: In the last few lectures, we have been discussing affine and Euclidean geometr, coordinate frames and affine transformations, and rotations.
More informationUse of Transformations and the Repeated Statement in PROC GLM in SAS Ed Stanek
Use of Transformations and the Reeated Statement in PROC GLM in SAS Ed Stanek Introduction We describe how the Reeated Statement in PROC GLM in SAS transforms the data to rovide tests of hyotheses of interest.
More informationKeywords: pile, liquefaction, lateral spreading, analysis ABSTRACT
Key arameters in seudo-static analysis of iles in liquefying sand Misko Cubrinovski Deartment of Civil Engineering, University of Canterbury, Christchurch 814, New Zealand Keywords: ile, liquefaction,
More informationComputer arithmetic. Intensive Computation. Annalisa Massini 2017/2018
Comuter arithmetic Intensive Comutation Annalisa Massini 7/8 Intensive Comutation - 7/8 References Comuter Architecture - A Quantitative Aroach Hennessy Patterson Aendix J Intensive Comutation - 7/8 3
More informationLocal Extreme Points and a Young-Type Inequality
Alied Mathematical Sciences Vol. 08 no. 6 65-75 HIKARI Ltd www.m-hikari.com htts://doi.org/0.988/ams.08.886 Local Extreme Points a Young-Te Inequalit Loredana Ciurdariu Deartment of Mathematics Politehnica
More informationUniformly best wavenumber approximations by spatial central difference operators: An initial investigation
Uniformly best wavenumber aroximations by satial central difference oerators: An initial investigation Vitor Linders and Jan Nordström Abstract A characterisation theorem for best uniform wavenumber aroximations
More informationAssessing Slope Stability of Open Pit Mines using PCA and Fisher Discriminant Analysis
Assessing Sloe Stabilit of Oen Pit Mines using PCA and Fisher Discriminant Analsis Shiao Xiang College of Geoscience and Surveing Engineering, China Universit of Mining and echnolog (Beijing), Beijing
More informationarxiv: v1 [quant-ph] 3 Feb 2015
From reversible comutation to quantum comutation by Lagrange interolation Alexis De Vos and Stin De Baerdemacker 2 arxiv:502.0089v [quant-h] 3 Feb 205 Cmst, Imec v.z.w., vakgroe elektronica en informatiesystemen,
More informationAnalysis of some entrance probabilities for killed birth-death processes
Analysis of some entrance robabilities for killed birth-death rocesses Master s Thesis O.J.G. van der Velde Suervisor: Dr. F.M. Sieksma July 5, 207 Mathematical Institute, Leiden University Contents Introduction
More informationMath 4400/6400 Homework #8 solutions. 1. Let P be an odd integer (not necessarily prime). Show that modulo 2,
MATH 4400 roblems. Math 4400/6400 Homework # solutions 1. Let P be an odd integer not necessarily rime. Show that modulo, { P 1 0 if P 1, 7 mod, 1 if P 3, mod. Proof. Suose that P 1 mod. Then we can write
More informationMeshless Methods for Scientific Computing Final Project
Meshless Methods for Scientific Comuting Final Project D0051008 洪啟耀 Introduction Floating island becomes an imortant study in recent years, because the lands we can use are limit, so eole start thinking
More informationMODELING THE RELIABILITY OF C4ISR SYSTEMS HARDWARE/SOFTWARE COMPONENTS USING AN IMPROVED MARKOV MODEL
Technical Sciences and Alied Mathematics MODELING THE RELIABILITY OF CISR SYSTEMS HARDWARE/SOFTWARE COMPONENTS USING AN IMPROVED MARKOV MODEL Cezar VASILESCU Regional Deartment of Defense Resources Management
More informationKEY ISSUES IN THE ANALYSIS OF PILES IN LIQUEFYING SOILS
4 th International Conference on Earthquake Geotechnical Engineering June 2-28, 27 KEY ISSUES IN THE ANALYSIS OF PILES IN LIQUEFYING SOILS Misko CUBRINOVSKI 1, Hayden BOWEN 1 ABSTRACT Two methods for analysis
More informationAnalysis of cold rolling a more accurate method
Analysis of cold rolling a more accurate method 1.1 Rolling of stri more accurate slab analysis The revious lecture considered an aroximate analysis of the stri rolling. However, the deformation zone in
More informationOn the Maximum and Minimum of Multivariate Pareto Random Variables
ISSN 1392 124X (rint) ISSN 2335 884X (online) INFORMATION TECHNOLOGY AND CONTROL 213 Vol.42 No.3 On the Maximum Minimum of Multivariate Pareto Rom Variables Jungsoo Woo Deartment of Statistics Yeungnam
More informationUsing the Divergence Information Criterion for the Determination of the Order of an Autoregressive Process
Using the Divergence Information Criterion for the Determination of the Order of an Autoregressive Process P. Mantalos a1, K. Mattheou b, A. Karagrigoriou b a.deartment of Statistics University of Lund
More informationNUMERICAL AND THEORETICAL INVESTIGATIONS ON DETONATION- INERT CONFINEMENT INTERACTIONS
NUMERICAL AND THEORETICAL INVESTIGATIONS ON DETONATION- INERT CONFINEMENT INTERACTIONS Tariq D. Aslam and John B. Bdzil Los Alamos National Laboratory Los Alamos, NM 87545 hone: 1-55-667-1367, fax: 1-55-667-6372
More informationOn split sample and randomized confidence intervals for binomial proportions
On slit samle and randomized confidence intervals for binomial roortions Måns Thulin Deartment of Mathematics, Usala University arxiv:1402.6536v1 [stat.me] 26 Feb 2014 Abstract Slit samle methods have
More informationA Method of Setting the Penalization Constants in the Suboptimal Linear Quadratic Tracking Method
XXVI. ASR '21 Seminar, Instruments and Control, Ostrava, Aril 26-27, 21 Paer 57 A Method of Setting the Penalization Constants in the Subotimal Linear Quadratic Tracking Method PERŮTKA, Karel Ing., Deartment
More informationGeneralized Least-Squares Regressions II: Theory and Classication
Recent Advances in Intelligent Control, Modelling Comutational Science Generalized Least-Squares Regressions II Theor Classication NATANIEL GREENE Deartment of Mathematics Comuter Science Kingsorough Communit
More informationA Note on the Positive Nonoscillatory Solutions of the Difference Equation
Int. Journal of Math. Analysis, Vol. 4, 1, no. 36, 1787-1798 A Note on the Positive Nonoscillatory Solutions of the Difference Equation x n+1 = α c ix n i + x n k c ix n i ) Vu Van Khuong 1 and Mai Nam
More informationMulti-Operation Multi-Machine Scheduling
Multi-Oeration Multi-Machine Scheduling Weizhen Mao he College of William and Mary, Williamsburg VA 3185, USA Abstract. In the multi-oeration scheduling that arises in industrial engineering, each job
More informationSection 0.10: Complex Numbers from Precalculus Prerequisites a.k.a. Chapter 0 by Carl Stitz, PhD, and Jeff Zeager, PhD, is available under a Creative
Section 0.0: Comlex Numbers from Precalculus Prerequisites a.k.a. Chater 0 by Carl Stitz, PhD, and Jeff Zeager, PhD, is available under a Creative Commons Attribution-NonCommercial-ShareAlike.0 license.
More informationA Public-Key Cryptosystem Based on Lucas Sequences
Palestine Journal of Mathematics Vol. 1(2) (2012), 148 152 Palestine Polytechnic University-PPU 2012 A Public-Key Crytosystem Based on Lucas Sequences Lhoussain El Fadil Communicated by Ayman Badawi MSC2010
More informationf(r) = a d n) d + + a0 = 0
Math 400-00/Foundations of Algebra/Fall 07 Polynomials at the Foundations: Roots Next, we turn to the notion of a root of a olynomial in Q[x]. Definition 8.. r Q is a rational root of fx) Q[x] if fr) 0.
More informationLower Confidence Bound for Process-Yield Index S pk with Autocorrelated Process Data
Quality Technology & Quantitative Management Vol. 1, No.,. 51-65, 15 QTQM IAQM 15 Lower onfidence Bound for Process-Yield Index with Autocorrelated Process Data Fu-Kwun Wang * and Yeneneh Tamirat Deartment
More informationARITHMETIC PROGRESSIONS OF POLYGONAL NUMBERS WITH COMMON DIFFERENCE A POLYGONAL NUMBER
#A43 INTEGERS 17 (2017) ARITHMETIC PROGRESSIONS OF POLYGONAL NUMBERS WITH COMMON DIFFERENCE A POLYGONAL NUMBER Lenny Jones Deartment of Mathematics, Shiensburg University, Shiensburg, Pennsylvania lkjone@shi.edu
More informationTopic: Lower Bounds on Randomized Algorithms Date: September 22, 2004 Scribe: Srinath Sridhar
15-859(M): Randomized Algorithms Lecturer: Anuam Guta Toic: Lower Bounds on Randomized Algorithms Date: Setember 22, 2004 Scribe: Srinath Sridhar 4.1 Introduction In this lecture, we will first consider
More informationThe University of the State of New York REGENTS HIGH SCHOOL EXAMINATION COURSE III. Wednesday, August 16, :30 to 11:30 a.m.
The University of the State of New York REGENTS HIGH SCHOOL EXAMINATION THREE-YEAR SEQUENCE FOR HIGH SCHOOL MATHEMATICS COURSE III Wednesday, August 6, 000 8:0 to :0 a.m., only Notice... Scientific calculators
More informationFactor Rings and their decompositions in the Eisenstein integers Ring Z [ω]
Armenian Journal of Mathematics Volume 5, Number 1, 013, 58 68 Factor Rings and their decomositions in the Eisenstein integers Ring Z [ω] Manouchehr Misaghian Deartment of Mathematics, Prairie View A&M
More informationEstimation of the large covariance matrix with two-step monotone missing data
Estimation of the large covariance matrix with two-ste monotone missing data Masashi Hyodo, Nobumichi Shutoh 2, Takashi Seo, and Tatjana Pavlenko 3 Deartment of Mathematical Information Science, Tokyo
More informationarxiv: v2 [quant-ph] 2 Aug 2012
Qcomiler: quantum comilation with CSD method Y. G. Chen a, J. B. Wang a, a School of Physics, The University of Western Australia, Crawley WA 6009 arxiv:208.094v2 [quant-h] 2 Aug 202 Abstract In this aer,
More informationLinear diophantine equations for discrete tomography
Journal of X-Ray Science and Technology 10 001 59 66 59 IOS Press Linear diohantine euations for discrete tomograhy Yangbo Ye a,gewang b and Jiehua Zhu a a Deartment of Mathematics, The University of Iowa,
More information4. Score normalization technical details We now discuss the technical details of the score normalization method.
SMT SCORING SYSTEM This document describes the scoring system for the Stanford Math Tournament We begin by giving an overview of the changes to scoring and a non-technical descrition of the scoring rules
More informationElementary Analysis in Q p
Elementary Analysis in Q Hannah Hutter, May Szedlák, Phili Wirth November 17, 2011 This reort follows very closely the book of Svetlana Katok 1. 1 Sequences and Series In this section we will see some
More information2-D Analysis for Iterative Learning Controller for Discrete-Time Systems With Variable Initial Conditions Yong FANG 1, and Tommy W. S.
-D Analysis for Iterative Learning Controller for Discrete-ime Systems With Variable Initial Conditions Yong FANG, and ommy W. S. Chow Abstract In this aer, an iterative learning controller alying to linear
More informationJohn Weatherwax. Analysis of Parallel Depth First Search Algorithms
Sulementary Discussions and Solutions to Selected Problems in: Introduction to Parallel Comuting by Viin Kumar, Ananth Grama, Anshul Guta, & George Karyis John Weatherwax Chater 8 Analysis of Parallel
More informationPositive decomposition of transfer functions with multiple poles
Positive decomosition of transfer functions with multile oles Béla Nagy 1, Máté Matolcsi 2, and Márta Szilvási 1 Deartment of Analysis, Technical University of Budaest (BME), H-1111, Budaest, Egry J. u.
More informationMATH 115: Review for Chapter 6
MATH 115: Review for Chapter 6 In order to prepare for our test on Chapter 6, ou need to understand and be able to work problems involving the following topics: I SYSTEMS OF LINEAR EQUATIONS CONTAINING
More informationUnit 1 - Computer Arithmetic
FIXD-POINT (FX) ARITHMTIC Unit 1 - Comuter Arithmetic INTGR NUMBRS n bit number: b n 1 b n 2 b 0 Decimal Value Range of values UNSIGND n 1 SIGND D = b i 2 i D = 2 n 1 b n 1 + b i 2 i n 2 i=0 i=0 [0, 2
More informationSeries Handout A. 1. Determine which of the following sums are geometric. If the sum is geometric, express the sum in closed form.
Series Handout A. Determine which of the following sums are geometric. If the sum is geometric, exress the sum in closed form. 70 a) k= ( k ) b) 50 k= ( k )2 c) 60 k= ( k )k d) 60 k= (.0)k/3 2. Find the
More information10.2 The Unit Circle: Cosine and Sine
0. The Unit Circle: Cosine and Sine 77 0. The Unit Circle: Cosine and Sine In Section 0.., we introduced circular motion and derived a formula which describes the linear velocit of an object moving on
More informationShadow Computing: An Energy-Aware Fault Tolerant Computing Model
Shadow Comuting: An Energy-Aware Fault Tolerant Comuting Model Bryan Mills, Taieb Znati, Rami Melhem Deartment of Comuter Science University of Pittsburgh (bmills, znati, melhem)@cs.itt.edu Index Terms
More informationElliptic Curves and Cryptography
Ellitic Curves and Crytograhy Background in Ellitic Curves We'll now turn to the fascinating theory of ellitic curves. For simlicity, we'll restrict our discussion to ellitic curves over Z, where is a
More informationarxiv:cond-mat/ v2 25 Sep 2002
Energy fluctuations at the multicritical oint in two-dimensional sin glasses arxiv:cond-mat/0207694 v2 25 Se 2002 1. Introduction Hidetoshi Nishimori, Cyril Falvo and Yukiyasu Ozeki Deartment of Physics,
More informationDimensional perturbation theory for Regge poles
Dimensional erturbation theory for Regge oles Timothy C. Germann Deartment of Chemistry, University of California, Berkeley, California 94720 Sabre Kais Deartment of Chemistry, Purdue University, West
More informationOn the irreducibility of a polynomial associated with the Strong Factorial Conjecture
On the irreducibility of a olynomial associated with the Strong Factorial Conecture Michael Filaseta Mathematics Deartment University of South Carolina Columbia, SC 29208 USA E-mail: filaseta@math.sc.edu
More informationA continuous review inventory model with the controllable production rate of the manufacturer
Intl. Trans. in O. Res. 12 (2005) 247 258 INTERNATIONAL TRANSACTIONS IN OERATIONAL RESEARCH A continuous review inventory model with the controllable roduction rate of the manufacturer I. K. Moon and B.
More informationand INVESTMENT DECISION-MAKING
CONSISTENT INTERPOLATIVE FUZZY LOGIC and INVESTMENT DECISION-MAKING Darko Kovačević, č Petar Sekulić and dal Aleksandar Rakićević National bank of Serbia Belgrade, Jun 23th, 20 The structure of the resentation
More informationEfficient algorithms for the smallest enclosing ball problem
Efficient algorithms for the smallest enclosing ball roblem Guanglu Zhou, Kim-Chuan Toh, Jie Sun November 27, 2002; Revised August 4, 2003 Abstract. Consider the roblem of comuting the smallest enclosing
More informationDesign of NARMA L-2 Control of Nonlinear Inverted Pendulum
International Research Journal of Alied and Basic Sciences 016 Available online at www.irjabs.com ISSN 51-838X / Vol, 10 (6): 679-684 Science Exlorer Publications Design of NARMA L- Control of Nonlinear
More informationApplied Mathematics and Computation
Alied Mathematics and Comutation 218 (2012) 10548 10556 Contents lists available at SciVerse ScienceDirect Alied Mathematics and Comutation journal homeage: www.elsevier.com/locate/amc Basins of attraction
More informationA numerical implementation of a predictor-corrector algorithm for sufcient linear complementarity problem
A numerical imlementation of a redictor-corrector algorithm for sufcient linear comlementarity roblem BENTERKI DJAMEL University Ferhat Abbas of Setif-1 Faculty of science Laboratory of fundamental and
More informationProof Nets and Boolean Circuits
Proof Nets and Boolean Circuits Kazushige Terui terui@nii.ac.j National Institute of Informatics, Tokyo 14/07/04, Turku.1/44 Motivation (1) Proofs-as-Programs (Curry-Howard) corresondence: Proofs = Programs
More informationThe Role of Momentum Interpolation Mechanism of the Roe. Scheme in the Shock Instability
The Role of Momentum Interolation Mechanism of the Roe Scheme in the Shock Instabilit Xue-song Li Ke Laborator for Thermal Science and Power Engineering of Ministr of Education, Deartment of Thermal Engineering,
More informationAnalysis of execution time for parallel algorithm to dertmine if it is worth the effort to code and debug in parallel
Performance Analysis Introduction Analysis of execution time for arallel algorithm to dertmine if it is worth the effort to code and debug in arallel Understanding barriers to high erformance and redict
More informationMATHEMATICAL MODELLING OF THE WIRELESS COMMUNICATION NETWORK
Comuter Modelling and ew Technologies, 5, Vol.9, o., 3-39 Transort and Telecommunication Institute, Lomonosov, LV-9, Riga, Latvia MATHEMATICAL MODELLIG OF THE WIRELESS COMMUICATIO ETWORK M. KOPEETSK Deartment
More informationA Closed-Form Solution to the Minimum V 2
Celestial Mechanics and Dynamical Astronomy manuscrit No. (will be inserted by the editor) Martín Avendaño Daniele Mortari A Closed-Form Solution to the Minimum V tot Lambert s Problem Received: Month
More informationMachine Learning: Homework 4
10-601 Machine Learning: Homework 4 Due 5.m. Monday, February 16, 2015 Instructions Late homework olicy: Homework is worth full credit if submitted before the due date, half credit during the next 48 hours,
More informationOptimal Design of Truss Structures Using a Neutrosophic Number Optimization Model under an Indeterminate Environment
Neutrosohic Sets and Systems Vol 14 016 93 University of New Mexico Otimal Design of Truss Structures Using a Neutrosohic Number Otimization Model under an Indeterminate Environment Wenzhong Jiang & Jun
More informationAn Investigation on the Numerical Ill-conditioning of Hybrid State Estimators
An Investigation on the Numerical Ill-conditioning of Hybrid State Estimators S. K. Mallik, Student Member, IEEE, S. Chakrabarti, Senior Member, IEEE, S. N. Singh, Senior Member, IEEE Deartment of Electrical
More informationA CRITERION FOR POLYNOMIALS TO BE CONGRUENT TO THE PRODUCT OF LINEAR POLYNOMIALS (mod p) ZHI-HONG SUN
A CRITERION FOR POLYNOMIALS TO BE CONGRUENT TO THE PRODUCT OF LINEAR POLYNOMIALS (mod ) ZHI-HONG SUN Deartment of Mathematics, Huaiyin Teachers College, Huaian 223001, Jiangsu, P. R. China e-mail: hyzhsun@ublic.hy.js.cn
More informationThe Fekete Szegő theorem with splitting conditions: Part I
ACTA ARITHMETICA XCIII.2 (2000) The Fekete Szegő theorem with slitting conditions: Part I by Robert Rumely (Athens, GA) A classical theorem of Fekete and Szegő [4] says that if E is a comact set in the
More informationOn the Toppling of a Sand Pile
Discrete Mathematics and Theoretical Comuter Science Proceedings AA (DM-CCG), 2001, 275 286 On the Toling of a Sand Pile Jean-Christohe Novelli 1 and Dominique Rossin 2 1 CNRS, LIFL, Bâtiment M3, Université
More informationOptical Fibres - Dispersion Part 1
ECE 455 Lecture 05 1 Otical Fibres - Disersion Part 1 Stavros Iezekiel Deartment of Electrical and Comuter Engineering University of Cyrus HMY 445 Lecture 05 Fall Semester 016 ECE 455 Lecture 05 Otical
More informationOn generalizing happy numbers to fractional base number systems
On generalizing hay numbers to fractional base number systems Enriue Treviño, Mikita Zhylinski October 17, 018 Abstract Let n be a ositive integer and S (n) be the sum of the suares of its digits. It is
More informationRatio Estimators in Simple Random Sampling Using Information on Auxiliary Attribute
ajesh Singh, ankaj Chauhan, Nirmala Sawan School of Statistics, DAVV, Indore (M.., India Florentin Smarandache Universit of New Mexico, USA atio Estimators in Simle andom Samling Using Information on Auxiliar
More informationCMSC 425: Lecture 4 Geometry and Geometric Programming
CMSC 425: Lecture 4 Geometry and Geometric Programming Geometry for Game Programming and Grahics: For the next few lectures, we will discuss some of the basic elements of geometry. There are many areas
More informationSQUAREFREE VALUES OF QUADRATIC POLYNOMIALS COURSE NOTES, 2015
SQUAREFREE VALUES OF QUADRATIC POLYNOMIALS COURSE NOTES, 2015 1. Squarefree values of olynomials: History In this section we study the roblem of reresenting square-free integers by integer olynomials.
More informationResearch Article An Iterative Algorithm for the Reflexive Solution of the General Coupled Matrix Equations
he Scientific World Journal Volume 013 Article ID 95974 15 ages htt://dxdoiorg/101155/013/95974 Research Article An Iterative Algorithm for the Reflexive Solution of the General Couled Matrix Euations
More informationAlgebraic Parameter Estimation of Damped Exponentials
Algebraic Parameter Estimation of Damed Exonentials Aline Neves, Maria Miranda, Mamadou Mbou To cite this version: Aline Neves, Maria Miranda, Mamadou Mbou Algebraic Parameter Estimation of Damed Exonentials
More informationUNIVERSITY OF DUBLIN TRINITY COLLEGE. Faculty of Engineering, Mathematics and Science. School of Computer Science & Statistics
UNIVERSI OF DUBLIN RINI COLLEGE Facult of Engineering, Mathematics and Science School of Comuter Science & Statistics BA (Mod) Maths, SM rinit erm 04 SF and JS S35 Probabilit and heoretical Statistics
More informationPrimes - Problem Sheet 5 - Solutions
Primes - Problem Sheet 5 - Solutions Class number, and reduction of quadratic forms Positive-definite Q1) Aly the roof of Theorem 5.5 to find reduced forms equivalent to the following, also give matrices
More informationImplementation and Validation of Finite Volume C++ Codes for Plane Stress Analysis
CST0 191 October, 011, Krabi Imlementation and Validation of Finite Volume C++ Codes for Plane Stress Analysis Chakrit Suvanjumrat and Ekachai Chaichanasiri* Deartment of Mechanical Engineering, Faculty
More informationThe Arm Prime Factors Decomposition
The Arm Prime Factors Decomosition Arm Boris Nima arm.boris@gmail.com Abstract We introduce the Arm rime factors decomosition which is the equivalent of the Taylor formula for decomosition of integers
More informationGalois Fields, Linear Feedback Shift Registers and their Applications
Galois Fields, Linear Feedback Shift Registers and their Alications With 85 illustrations as well as numerous tables, diagrams and examles by Ulrich Jetzek ISBN (Book): 978-3-446-45140-7 ISBN (E-Book):
More informationANALYTIC APPROXIMATE SOLUTIONS FOR FLUID-FLOW IN THE PRESENCE OF HEAT AND MASS TRANSFER
Kilicman, A., et al.: Analytic Aroximate Solutions for Fluid-Flow in the Presence... THERMAL SCIENCE: Year 8, Vol., Sul.,. S59-S64 S59 ANALYTIC APPROXIMATE SOLUTIONS FOR FLUID-FLOW IN THE PRESENCE OF HEAT
More informationAn extension to the theory of trigonometric functions as exact periodic solutions to quadratic Liénard type equations
An extension to the theory of trigonometric functions as exact eriodic solutions to quadratic Liénard tye equations D. K. K. Adjaï a, L. H. Koudahoun a, J. Akande a, Y. J. F. Komahou b and M. D. Monsia
More information