Explore >> Select a destination
|
You are here 
|
www.ethanepperly.com | ||
| | | | |
hadrienj.github.io
|
|
| | | | | In this post, we will learn about the Moore Penrose pseudoinverse as a way to find an approaching solution where no solution exists. In some cases, a system ... | |
| | | | |
nhigham.com
|
|
| | | | | Iterative refinement is a method for improving the quality of an approximate solution $latex \widehat{x}$ to a linear system of equations $latex Ax = b$, where $LATEX A$ is an $latex n\times n$ nonsingular matrix. The basic iterative refinement algorithm is very simple. Compute the residual $latex r = b - A\widehat{x}$. Solve $latex Ad... | |
| | | | |
stephenmalina.com
|
|
| | | | | Matrix Potpourri # As part of reviewing Linear Algebra for my Machine Learning class, I've noticed there's a bunch of matrix terminology that I didn't encounter during my proof-based self-study of LA from Linear Algebra Done Right. This post is mostly intended to consolidate my own understanding and to act as a reference to future me, but if it also helps others in a similar position, that's even better! | |
| | | | |
www.velanstudios.com
|
|
| | | |||
