Everything about Grid method multiplication

🧭 Start here: a 6-step reading path

1. Read the overview: Grid method multiplicationA 5-minute orientation
2. Pick up a classic book: Java software solutionsThe most-reprinted book on the subject
3. Read the landmark paper: Fast Matrix-Vector Multiplication in the Sparse-Grid Galerkin MethodCited 29 times
4. Go sideways: Lehmer random number generatorA closely related topic
5. Go sideways: Multiply-with-carry pseudorandom number generatorA closely related topic

🏆 Landmark papers (most cited)

• Fast Matrix-Vector Multiplication in the Sparse-Grid Galerkin Method

  Andreas Zeiser · 2010 · Journal of Scientific Computing · 29 citations

📚 Books worth reading

• Java software solutionsLewis, John, John E. Lewis Ph. D. · 1997
• Communications, Signal Processing, and SystemsQilian Liang · 2012
• The U.S. Air Service in World War IMaurer Maurer · 1976
• Automate the Boring Stuff with PythonAl Sweigart · 2015
• Introduction to Computing Using PythonLjubomir Perkovic · 2011
• Emergent Web intelligenceYouakim Badr · 2010
• 📕Applied data miningGuandong Xu · 2013
• Direction and position finding by wirelessRonald Keen · 1920

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics

• Lehmer random number generator The Lehmer random number generator (named after D. H. Lehmer), sometimes also referred to as the Park–Miller random number generator (after Stephen K. Park…
• Multiply-with-carry pseudorandom number generator In computer science, multiply-with-carry (MWC) is a method invented by George Marsaglia for generating sequences of random integers based on an initial…
• Modular multiplicative inverse In mathematics, particularly in the area of arithmetic, a modular multiplicative inverse of an integer a is an integer x such that the product ax is congruent…
• Strength reduction In compiler construction, strength reduction is a compiler optimization where expensive operations are replaced with equivalent but less expensive operations…
• Permuted congruential generator A permuted congruential generator (PCG) is a pseudorandom number generation algorithm developed in 2014 by Dr. M.E. O'Neill which applies an output permutation…
• Multiplication algorithm A multiplication algorithm is an algorithm (or method) to multiply two numbers. Depending on the size of the numbers, different algorithms are more efficient…
• Hamming weight The Hamming weight of a string is the number of symbols that are different from the zero-symbol of the alphabet used. It is thus equivalent to the Hamming…
• Xorshift Xorshift random number generators, also called shift-register generators, are a class of pseudorandom number generators that were invented by George Marsaglia…