The primary goal of MATH 6644 is to provide students with a deep understanding of the mathematical foundations and practical implementations of iterative solvers. Unlike direct solvers (like Gaussian elimination), iterative methods are essential when dealing with "sparse" matrices—those where most entries are zero—common in the discretization of partial differential equations (PDEs). Key learning outcomes include:
Evaluating how fast a method approaches a solution and understanding why it might fail.
Foundational techniques such as Jacobi , Gauss-Seidel , and Successive Over-Relaxation (SOR) .
TERMS AND CONDITIONS OF USE
Important! PLEASE READ carefully these Terms and Conditions of Use. Using this website implies acceptance of these Terms and Conditions of Use AS WELL AS A CONTRACTUAL OBLIGATION OF YOUR PART.
WIKO SAS ('Wiko') is pleased to make certain source codes available for free download (excluding download costs) from the links on the wikogeek.com website. We invite you to read the following Terms and Conditions of Use carefully. To accept them click on 'I agree'. Access to the source codes implies full and unconditional acceptance of these Terms and Conditions. Wiko may be required to modify or delete source codes on this website.
In using the source code(s) at your disposal, you expressly acknowledge that you accept and assume all the risks and liabilities relating to the downloads.
You therefore agree to comply with all the relevant user agreements included with each source code.
Wiko provides the source codes and download service 'as is' without a warranty or guarantee of any kind. Wiko disclaims any liability and cannot be held liable for any damage resulting directly or indirectly from the use of the source code and / or the download service.
The use of source codes may cause the cancellation of the manufacturer's warranty. Wiko reserves the right to cancel the 24 month warranty if necessary.
Math 6644 [portable] -
The primary goal of MATH 6644 is to provide students with a deep understanding of the mathematical foundations and practical implementations of iterative solvers. Unlike direct solvers (like Gaussian elimination), iterative methods are essential when dealing with "sparse" matrices—those where most entries are zero—common in the discretization of partial differential equations (PDEs). Key learning outcomes include:
Evaluating how fast a method approaches a solution and understanding why it might fail.
Foundational techniques such as Jacobi , Gauss-Seidel , and Successive Over-Relaxation (SOR) .
