Technology Tips: Constructing the Square Root of a Complex Number

2011 ◽  
Vol 105 (1) ◽  
pp. 67-70
Author(s):  
John M. Livermore
Keyword(s):  
Real Number ◽  
Complex Number ◽  
Arbitrary Real Number ◽  
Square Root ◽  
Geometer's Sketchpad

The author uses The Geometer's Sketchpad first to construct the square root of an arbitrary real number and then to construct the square root of a complex number.

scholarly journals Finding of principle square root of a real number by using interpolation method

2018 ◽  
Vol 7 (1) ◽  
pp. 77-83
Author(s):  
Rajendra Prasad Regmi
Keyword(s):  
Real Number ◽  
Positive Real Number ◽  
Interpolation Method ◽  
Square Root ◽  
Real Numbers ◽  
Positive Real ◽  
Unknown Quantity ◽  
Square Roots

There are various methods of finding the square roots of positive real number. This paper deals with finding the principle square root of positive real numbers by using Lagrange’s and Newton’s interpolation method. The interpolation method is the process of finding the values of unknown quantity (y) between two known quantities.

scholarly journals A note on machine method for root extraction

2022 ◽  
Vol 40 ◽  
pp. 1-6
Author(s):  
Saroj Kumar Padhan ◽  
S. Gadtia
Keyword(s):  
Real Number ◽  
Newton’S Method ◽  
Newton's Method ◽  
Extraction Methods ◽  
Critical Study ◽  
Square Root ◽  
Machine Method ◽  
Iteration Formula ◽  
Root Extraction

The present investigation deals with the critical study of the works of Lancaster and Traub, who have developed $n$th root extraction methods of a real number. It is found that their developed methods are equivalent and the particular cases of Halley's and Householder's methods. Again the methods presented by them are easily obtained from simple modifications of Newton's method, which is the extension of Heron's square root iteration formula. Further, the rate of convergency of their reported methods are studied.

Encircling Graphs

2017 ◽  
Author(s):  
Arthur Benjamin ◽  
Gary Chartrand ◽  
Ping Zhang
Keyword(s):  
Nineteenth Century ◽  
Real Number ◽  
Traveling Salesman Problem ◽  
Complex Number ◽  
Traveling Salesman ◽  
Complex Numbers ◽  
Real Numbers ◽  
Hamiltonian Graphs ◽  
The World ◽  
The Traveling Salesman Problem

This chapter considers Hamiltonian graphs, a class of graphs named for nineteenth-century physicist and mathematician Sir William Rowan Hamilton. In 1835 Hamilton discovered that complex numbers could be represented as ordered pairs of real numbers. That is, a complex number a + b i (where a and b are real numbers) could be treated as the ordered pair (a, b). Here the number i has the property that i² = -1. Consequently, while the equation x² = -1 has no real number solutions, this equation has two solutions that are complex numbers, namely i and -i. The chapter first examines Hamilton's icosian calculus and Icosian Game, which has a version called Traveller's Dodecahedron or Voyage Round the World, before concluding with an analysis of the Knight's Tour Puzzle, the conditions that make a given graph Hamiltonian, and the Traveling Salesman Problem.

Markoff’s Theorem for Approximations

2018 ◽  
pp. 55-62
Author(s):  
Christophe Reutenauer
Keyword(s):  
Real Number ◽  
Continued Fraction ◽  
Golden Ratio ◽  
Periodic Pattern ◽  
Square Root ◽  
Error Terms

This chapter provesMarkoff’s theorem for approximations: if x is an irrational real number such that its Lagrange number L(x) is <3, then the continued fraction of x is ultimately periodic and has as periodic pattern a Christoffel word written on the alphabet 11, 22. Moreover, the bound is attained: this means that there are indeed convergents whose error terms are correctly bounded. For this latter result, one needs a lot of technical results, which use the notion of good and bad approximation of a real number x satisfying L(x) <3: the ranks of the good and bad convergents are precisely given. These results are illustrated by the golden ratio and the number 1 + square root of 2.

scholarly journals FUZZY INSTANTONS

2002 ◽  
Vol 17 (15) ◽  
pp. 2095-2111 ◽  
Author(s):  
HARALD GROSSE ◽  
MARCO MACEDA ◽  
JOHN MADORE ◽  
HAROLD STEINACKER
Keyword(s):  
Real Number ◽  
Matrix Model ◽  
Matrix Algebra ◽  
Quantization Condition ◽  
Constant Factor ◽  
Arbitrary Real Number ◽  
Self Duality ◽  
Duality Condition ◽  
The Matrix ◽  
Fixed Constant

We present a series of instanton-like solutions to a matrix model which satisfy a self-duality condition and possess an action whose value is, to within a fixed constant factor, an integer l2. For small values of the dimension n2 of the matrix algebra the integer resembles the result of a quantization condition but as n → ∞ the ratio l/n can tend to an arbitrary real number between zero and one.

Phased Bessel functions

2008 ◽  
Vol 86 (7) ◽  
pp. 863-870 ◽  
Author(s):  
X Hu ◽  
H Wang ◽  
D -S Guo
Keyword(s):  
Real Number ◽  
Number Field ◽  
Complex Number ◽  
Bessel Functions ◽  
Natural Extension ◽  
State Transitions ◽  
Photon State ◽  
Analytical Extension ◽  
Complex Number Field ◽  
Real Number Field

In the study of photon-state transitions, we found a natural extension of the first kind of Bessel functions that extends both the range and domain of the Bessel functions from the real number field to the complex number field. We term the extended Bessel functions as phased Bessel functions. This extension is completely different from the traditional “analytical extension”. The new complex Bessel functions satisfy addition, subtraction, and recurrence theorems in a complex range and a complex domain. These theorems provide short cuts in calculations. The single-phased Bessel functions are generalized to multiple-phased Bessel functions to describe various photon-state transitions.PACS Nos.: 02.30.Gp, 32.80.Rm, 42.50.Hz

scholarly journals A problem of coefficient determination in parabolic equations solved as moment problem

2017 ◽  
Vol 6 (4) ◽  
pp. 109
Author(s):  
Maria Beatriz Pintarelli
Keyword(s):  
Boundary Conditions ◽  
Real Number ◽  
Moment Problem ◽  
Parabolic Equations ◽  
Arbitrary Real Number ◽  
Initial Condition ◽  
Moments Problem ◽  
Inverse Moment

The problem is to find a(t) y w(x; t) such that wt = a(t) (wx)x+r(x; t) under the initial condition w(x; 0) =fi(x) and the boundary conditions w(0; t) = 0 ; wx(0; t) = wx(1; t)+alfa w(1; t) about a region D ={(x; t); 0 <x < 1; t >0}. In addition it must be fulfilled the integral of w (x, t) with respect to x is equal to E(t) where fi(x) , r(x; t) and E(t) are known functions and alfa is an arbitrary real number other than zero.The objective is to solve the problem as an application of the inverse moment problem. We will find an approximated solution and bounds for the error of the estimated solution using the techniques on moments problem. In addition, the method is illustrated with several examples.

scholarly journals On an integral operator for convex univalent functions

1986 ◽  
Vol 34 (2) ◽  
pp. 211-218
Author(s):  
Vinod Kumar ◽  
S. L. Shukla
Keyword(s):  
Integral Operator ◽  
Real Number ◽  
Complex Number ◽  
Univalent Functions ◽  
Corrected Version ◽  
Convex Univalent Functions ◽  
Class Of Functions

Let K (m,M) denote the class of functions regular and satisfying |1 + zf″(z)/f′(z)− m| < M in |z| < 1, where |m−1| < M ≤ m. Recently, R.K. Pandey and G. P. Bhargava have shown that if f ε K (m,M), then the function du also belongs to K (m,M) provided α is a complex number satisfying the inequality |α| ≤ (1−b)/2, where b = (m-1)/M. In this paper we show by a counterexample that their inequality is in general wrong, and prove a corrected version of their result. We show that F ε K (m,M) provided that α is a real number satisfying −φ ≤ α ≤1, φ = (M−|m−1|)/(M + |m−1|), or a complex number satisfying |α| ≤ φ. In both cases the bounds for α are sharp.

Vertex Connectivity of Fuzzy Graphs with Applications to Human Trafficking

2018 ◽  
Vol 14 (03) ◽  
pp. 457-485 ◽  
Author(s):  
Shanookha Ali ◽  
Sunil Mathew ◽  
John N. Mordeson ◽  
Hossein Rashmanlou
Keyword(s):  
Real Number ◽  
Human Trafficking ◽  
Dynamic Network ◽  
Arbitrary Real Number ◽  
Fuzzy Graph ◽  
Vertex Connectivity ◽  
The Past ◽  
Fuzzy Graphs ◽  
Number Formula ◽  
Fuzzy Vertex

Connectivity is the most important aspect of a dynamic network. It has been widely studied and applied in different perspectives in the past. In this paper, constructions of [Formula: see text]-connected fuzzy graphs for an arbitrary real number [Formula: see text] and average fuzzy vertex connectivity of fuzzy graphs are discussed. Average fuzzy vertex connectivity of fuzzy trees, fuzzy cycles and complete fuzzy graphs are studied. The concept of a uniformly [Formula: see text]-connected fuzzy graph is introduced and characterized towards the end. An application related to human trafficking is also discussed.

Sign in / Sign up

Export Citation Format

Share Document