An upper triangular matrix system with nonzero diagonal is solved from the last row upward. Once xi+1,…,xn are known, use xi=(bi−∑j>iaijxj)/aii. The nonzero diagonal guarantees a unique solution; this is the final solve after a QR factorization.
Ancestors (6)
Incoming links (45)
- Block elimination
- Block matrix inverse
- Dirichlet Poisson solution by tridiagonal elimination
- Forward substitution
- Gaussian elimination
- Gaussian elimination with a row swap
- Householder reduction of an overdetermined consistent system
- LU decomposition
- LU factorization and solve costs
- Matrix decomposition
- Matrix preconditioner
- Past exam of the mathematics course of the University of Cambridge / 2014 / ib / Paper 1 / 18C / Solution
- Past exam of the mathematics course of the year 1 of the natural sciences course of the University of Cambridge / 2013 / Paper 1 / 11 / a / i / Solution
- Past exam of the numerical analysis course of the University of Oxford / 2015 / 3 / b / Solution
- Past exam of the numerical analysis course of the University of Oxford / 2017 / 2 / a / Solution
- Past exam of the numerical analysis course of the University of Oxford / 2017 / 2 / c / Solution
- Past exam of the numerical linear algebra and approximation course of the University of Oxford / 2008 / 2 / a / Solution
- Past exam of the numerical linear algebra and continuous optimisation course of the University of Oxford / 2007 / A / 2 / a / Solution
- Past exam of the numerical linear algebra and continuous optimisation course of the University of Oxford / 2010 / A / 2 / a / Solution
- Past exam of the options I course of the University of Oxford / 2004 / P / P1 / Solution
- Past exam of the options I course of the University of Oxford / 2010 / P / P1 / Solution
- Past exam of the options II course of the University of Oxford / 2004 / P / P4 / Solution
- Past exam of the options II course of the University of Oxford / 2011 / P / P4 / d / Solution
- Past exam of the probability, statistics and options I course of the University of Oxford / 2010 / P / 1 / Solution
- Past exam of the Probability, statistics and options II course of the University of Oxford / 2011 / P / P4 / d / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2014 / Digital systems, linear algebra, introduction to formal proof / 6 / c / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2017 / Digital systems, linear algebra, introduction to formal proof / 4 / g / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2017 / Digital systems, linear algebra, introduction to formal proof / 5 / c / ii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2019 / Digital systems, linear algebra, introduction to formal proof / 4 / c / ii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2019 / Digital systems, linear algebra, introduction to formal proof resit / 6 / b / iii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2022 / Digital systems, linear algebra, introduction to formal proof / 5 / c / Solution
- Past exam of the year 2 of the earth sciences (geology) course of the University of Oxford / 2024 / Paper 3 / 6 / f / Solution
- Pivoted LU decomposition
- QR decomposition
- QR decomposition by Givens rotations
- Reduced QR least-squares solution
- Reusing LU factors for multiple right-hand sides
- Row echelon form
- Sparse Gaussian elimination
- Tiny-pivot roundoff in Gaussian elimination
- Triangular solves for LU decomposition
- Tridiagonal elimination recurrences
- Tridiagonal matrix algorithm
- Tridiagonal solve costs
- Zero-pivot failure of tridiagonal elimination
Discussion (0) New discussion
There are no discussions about this article yet.
Articles by others on the same topic (0)
There are currently no matching articles.