Explore >> Select a destination
|
You are here 
|
mcyoung.xyz | ||
| | | | |
susam.net
|
|
| | | | | [AI summary] This article explains why the product of two negative numbers is positive, using mathematical proofs and ring axioms to generalize the rule beyond basic arithmetic. | |
| | | | |
blog.mecheye.net
|
|
| | | | | [AI summary] The article provides an in-depth guide to matrix multiplication and ordering in computer graphics, focusing on column-vector and row-vector conventions, column-major and row-major packing, and the implications of these choices. It emphasizes the importance of consistency and clarity in matrix conventions, as well as the use of transposes to reconcile different representations. The key takeaways include the equivalence of A * B and transpose(B) * transpose(A), the ability to combine multiple transformations into a single matrix, and the impact of matrix packing on memory efficiency. | |
| | | | |
www.jeremykun.com
|
|
| | | | | The singular value decomposition (SVD) of a matrix is a fundamental tool in computer science, data analysis, and statistics. It's used for all kinds of applications from regression to prediction, to finding approximate solutions to optimization problems. In this series of two posts we'll motivate, define, compute, and use the singular value decomposition to analyze some data. (Jump to the second post) I want to spend the first post entirely on motivation and background. | |
| | | | |
mmhaskell.com
|
|
| | | [AI summary] This article compares Functional Programming and Object Oriented Programming paradigms, discussing their key differences, strengths, weaknesses, and how Haskell fits into the functional paradigm. | ||
