Evaluating a function using techniques for solving linear systems
1 回表示 (過去 30 日間)
古いコメントを表示
I really just need help on where to start with this problem. I know about LU decomposition and Cholesky decomposition as means of efficiently solving a linear system, but I'm unsure how to approach this problem.

0 件のコメント
回答 (1 件)
Carl
2017 年 10 月 11 日
An important part of solving a linear system efficiently is to avoid explicitly calculating the inverse, if possible. In MATLAB, this is often done using the mldivide (\) operator. See the page here for a high-level description of the various methods/optimizations it uses.
So in a function, something like:
inv(T)*inv(A)*x
can be replaced with:
T\(A\x)
On a related note, the transpose of a matrix or array x is written as x' in MATLAB.
0 件のコメント
参考
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!