Entry Jamieson:1989:SNR from compj1980.bib

Last update: Sat Jan 6 02:03:49 MST 2018                Valid HTML 3.2!

Index sections

Top | Symbols | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Jamieson:1989:SNR,
  author =       "M. J. Jamieson",
  title =        "Short Notes: Rapidly Converging Iterative Formulae for
                 Finding Square Roots and their Computational
                 Efficiencies",
  journal =      j-COMP-J,
  volume =       "32",
  number =       "1",
  pages =        "93--94",
  month =        feb,
  year =         "1989",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/32.1.93",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  MRclass =      "65H05",
  MRnumber =     "89k:65063",
  bibdate =      "Tue Dec 4 14:48:26 MST 2012",
  bibsource =    "Compendex database;
                 http://comjnl.oxfordjournals.org/content/32/1.toc;
                 http://www.math.utah.edu/pub/bibnet/authors/m/moler-cleve-b.bib;
                 http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
                 http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/",
  URL =          "http://comjnl.oxfordjournals.org/content/32/1/93.full.pdf+html;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/93.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/94.tif",
  abstract =     "A derivation is given of rapidly converging iterative
                 formulae for finding square roots which include, as
                 special cases, some recently published examples. Their
                 computational efficiencies are investigated for
                 sequential and parallel implementation. It is concluded
                 that the most efficient method is equivalent to
                 sequential application of the Newton Raphson formula; a
                 simple modification is suggested which brings the
                 advantage of root bracketing at little extra
                 computational cost.",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept. of Comput. Sci., Glasgow Univ., UK",
  affiliationaddress = "Glasgow, Scotl",
  classcodes =   "B0290F (Interpolation and function approximation);
                 C4130 (Interpolation and function approximation)",
  classification = "723; 921; B0290F (Interpolation and function
                 approximation); C4130 (Interpolation and function
                 approximation)",
  corpsource =   "Dept. of Comput. Sci., Glasgow Univ., UK",
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
  keywords =     "computational; Computational efficiencies;
                 Computational Efficiency; Computer Metatheory;
                 Convergence; convergence of numerical methods;
                 Converging iterative formulae; converging iterative
                 formulae; efficiencies; formula; function
                 approximation; Iterative Methods; iterative methods;
                 Newton Raphson; Newton Raphson formula, Mathematical
                 Techniques; Parallel implementation; parallel
                 implementation; Square Roots; Square roots; square
                 roots",
  thesaurus =    "Convergence of numerical methods; Function
                 approximation; Iterative methods",
  treatment =    "P Practical",
}

Related entries