Matters Computational

Ideas, Algorithms, Source Code

Authors: Arndt, Jörg

  • Complete solutions with source code, examples, and illustrations
  • Includes material that is either rarely covered elsewhere or completely new
  • Software is supplied online, including the examples
see more benefits

Buy this book

eBook n/a
  • ISBN 978-3-642-14764-7
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
Hardcover n/a
  • ISBN 978-3-642-14763-0
  • Free shipping for individuals worldwide
Softcover n/a
  • ISBN 978-3-662-50662-2
  • Free shipping for individuals worldwide
About this book

This book provides algorithms and ideas for computationalists. Subjects treated include low-level algorithms, bit wizardry, combinatorial generation, fast transforms like the Fourier transform, and fast arithmetic for both real numbers and finite fields. Various optimization techniques are described and the actual performance of many given implementations is examined. The focus is on material that does not usually appear in textbooks on algorithms. The implementations are done in C++ and the GP language, written for POSIX-compliant platforms such as the Linux and BSD operating systems.

About the authors

Jörg Arndt: born 1964 in Berlin, Germany. Study of theoretical physics at the University of Bayreuth, and the Technical University of Berlin, Diploma in 1995. PhD in Mathematics, supervised by Richard Brent, at the Australian National University, Canberra, in 2010.

Reviews

From the reviews:

“The book is a comprehensive compilation of well written software codes as well as short explanation texts for basic methods of computation. It fills a gap in the literature since most books in this area describe either the methods or the codes provided in specialized libraries.” (Dana Petcu, Zentralblatt MATH, Vol. 1210, 2011)

“It is thorough, and covers many algorithms that one does not often see in algorithmic texts. … This may be an invaluable reference to some people, since it does provide excellent coverage of algorithms that are not frequently compiled into a single volume. … In short, this is a wonderful compilation of many algorithms that don’t show up in other places, with reasonable … commentary and an abundance of code. … this is the kind of book libraries will put on their shelves … .” (Jeffrey Putnam, ACM Computing Reviews, July, 2011)


Table of contents (42 chapters)

  • Bit wizardry

    Arndt, Jörg

    Pages 2-101

  • Permutations and their operations

    Arndt, Jörg

    Pages 102-133

  • Sorting and searching

    Arndt, Jörg

    Pages 134-152

  • Data structures

    Arndt, Jörg

    Pages 153-170

  • Conventions and considerations

    Arndt, Jörg

    Pages 172-175

Buy this book

eBook n/a
  • ISBN 978-3-642-14764-7
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
Hardcover n/a
  • ISBN 978-3-642-14763-0
  • Free shipping for individuals worldwide
Softcover n/a
  • ISBN 978-3-662-50662-2
  • Free shipping for individuals worldwide
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Matters Computational
Book Subtitle
Ideas, Algorithms, Source Code
Authors
Copyright
2011
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-642-14764-7
DOI
10.1007/978-3-642-14764-7
Hardcover ISBN
978-3-642-14763-0
Softcover ISBN
978-3-662-50662-2
Edition Number
1
Number of Pages
XIV, 966
Topics