Auto-suggest helps you quickly narrow down your search results by suggesting possible matches as you type.

Showing results for

- Intel Community
- Software Development SDKs and Libraries
- Intel® oneAPI Math Kernel Library & Intel® Math Kernel Library
- Solution to the system of linear equations (Ax=b) with a tridiagonal matrix A

- Subscribe to RSS Feed
- Mark Topic as New
- Mark Topic as Read
- Float this Topic for Current User
- Bookmark
- Subscribe
- Mute
- Printer Friendly Page

Josue_L_

Beginner

- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Email to a Friend
- Report Inappropriate Content

11-27-2017
12:11 PM

36 Views

Solution to the system of linear equations (Ax=b) with a tridiagonal matrix A

Dear all,

I'm using ZGTSV routine in order to solve a system of linear equations (Ax=b), where A is a tridiagonal matrix which may not be diagonally dominant (depends on initial values). For a while now I have detected some errors regarding the method used in the ?GTSV routines. Specially I have found that Gauss elimination loses precision due to accumulated round-off errors. I believe that this is my case since the amplitude of the errors increases from x(N) to x(1) (maybe due to backsubstitution?). To test this I actually placed in the x array the data backwards x(N:1) and made the necessary changes to the A matrix and vector b.

Now I was thinking of using iterative methods (Jacobi or Gauss-Seidel) instead of direct method (Gauss elimination) but I couldn't find any routine that would do this for me. Is there one?

BTW: does anyone know any better method to solve my problem?

Thank you in advance for your help

Best regards

Josué Lopes

0 Replies

For more complete information about compiler optimizations, see our Optimization Notice.