Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
If I have this:
A * f = g;
A: upper triangular matrix (n x n)
f: (n x 1)
g: (n x 1)
Need to solve for f using back substitution algorithm. I would say that it not really that hard to write one myself, but oh well, if there is a library out there, then why not.
Boost uBlas should work. At least if I understand your question correctly, you probably want to start by looking at
lu_substitute()andinplace_solve().