Square and Square Root
Van Nostrand's Scientific Encyclopedia · 2005
Cited by 0
Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 10,000 papers for “Square root”
Van Nostrand's Scientific Encyclopedia · 2005
Cited by 0
Martin H. Weik · 2000
Cited by 0
Nilsson, David O. · Texas ScholarWorks (Texas Digital Library) · 2008
Cited by 0Open access
Fred Joseph Gruenberger · Mathematics Teacher Learning and Teaching PK-12 · 1951
The subject of square root cuts across the entire range of mathematics courses, from arithmetic to the calculus, and seems to cause trouble in every course.
Cited by 0
2000
Cited by 0
2006
Cited by 0
John G. Frederiksen · The Arithmetic Teacher · 1969
Most modern mathematics textbooks favor the approximation method for computing square roots. The so-called long division method is not often mentioned. The approximation method is sound in principle, and it finds favor with many students because of the logic of its continuing process. Less capable students, however, complain that the approximation method has “too much figuring” and “too many chances for error.”
Cited by 0
Laboratoire de l'informatique du parallélisme, Ercegovac, Milos, Imbert, Laurent et al. · LARA - Libre Acces aux Rapports scientifiques et techniques · 2006
(eng) The aim of this paper is to accelerate division, square root and square root reciprocal computations, when Goldschmidt method is used on a pipelined multiplier. This is done by replacing the last iteration by the addition of a correcting term that can be looked up during the early iterations. We describe several variants of the Goldschmidt algorithm assuming 4-cycle pipelined multiplier and discuss obtained number of cycles and error achieved. Extensions to other than 4-cycle multipliers are given.
Cited by 0
Suresh Babu, Balaji · Zenodo (CERN European Organization for Nuclear Research) · 2025
This paper presents a new non-iterative algorithm for computing square roots efficiently. The computation of square roots has been a fundamental mathematical operation for thousands of years, with numerous algorithms developed throughout history. From the Babylonian method to Newton-Raphson iteration and modern hardware implementations, mathematicians and computer scientists have continually sought faster and more accurate approaches. Despite this rich history, most square root algorithms share a common limitation: they require iterative processes to achieve high precision. This paper introduces a new non-iterative formula that calculates square roots with remarkable accuracy in a single computational step, offering potential advantages for applications where computational efficiency is paramount. Contact: https://www.linkedin.com/in/balaji-suresh-739a231a9/
Cited by 0Open access
Laurent Imbert, David Matula, Jean-Michel Muller et al. · 1999
: The aim of this paper is to accelerate division, square root and square root reciprocal computations, when Goldschmidt method is used on a pipelined multiplier. This is done by replacing the last iteration by the addition of a correcting term that can be looked up during the early iterations. We describe several variants of the Goldschmidt algorithm assuming 4-cycle pipelined multiplier and discuss obtained number of cycles and error achieved. Extensions to other than 4-cycle multipliers are given. Key-words: Division, Square root, Square root reciprocal, Convergence division, Computer Arithmetic, Goldschmidt iteration. (Rsum : tsvp) This work has been partially supported by a French CNRS and Ministre des Affaires trangres grant PICS-479, Vers des arithmtiques plus souples et plus prcises. University of California at Los Angeles, Los Angeles, USA y Laboratoire d'Informatique de Marseille, Marseille, France z Southern Methodist University, Dallas, USA # CNRS, projet CNRS-E...
Cited by 0
Vincenzo Manca · Studies in big data · 2024
Cited by 0
Saul I. Gass, Carl M. Harris · 2001
Cited by 0
Anne M. Collins, Steven R. Benson · 2023
Cited by 0
Keith Dowding · Encyclopedia of Power · 2011
Cited by 0
Tianfeng Chai · Encyclopedia of earth sciences series/Encyclopedia of earth sciences · 2023
Cited by 2
National Cancer Institute · Definitions · 2020
Ope n Pe e r Re v ie w on Qe ios
Cited by 0Open access
SpringerReference · 2011
Cited by 0
Mazzon, Andrea · AMS Degree Thesis (University of Bologna) · 2012
Sessione I Anno Accademico 2010
Cited by 0Open access
Martin H. Weik · 2000
Cited by 0
H. Houtman · Review of Scientific Instruments · 1995
A new type of valve is introduced, the square-root valve, in which the valve stem radius is machined to vary as the square root of the turn number N. The open area then varies in direct proportion to the turn number, and the measured flow rate Qs(N) was found to be adequate to allow this valve to be used in an automatic feedback control system. As the flow-rate function will generally depend on the source and load impedances, a systematic method to empirically obtain precise linear (or other) flow-rate functions is outlined.
Cited by 0