Continue to Site

Welcome to EDAboard.com

Welcome to our site! EDAboard.com is an international Electronics Discussion Forum focused on EDA software, circuits, schematics, books, theory, papers, asic, pld, 8051, DSP, Network, RF, Analog Design, PCB, Service Manuals... and a whole lot more! To participate you need to register. Registration is free. Click here to register now.

characteristics of sparse matrix (need help)

Status
Not open for further replies.

confi999

Junior Member level 3
Junior Member level 3
Joined
Dec 12, 2005
Messages
25
Helped
0
Reputation
0
Reaction score
0
Trophy points
1,281
Activity points
1,503
sparce matrix solve

My work is on implicit FDTD method which allows time step (delta_t) above CFL limit. Implicit methods require one to solve a large sparse matrix. If delta_t is increased the the solution of this sparse matrix becomes slower. I can see this when I do the simulation with the implicit scheme.

But my query is about mathematical explanation of what happens when I increase delta_t. How the properties of the matrix change with the change of delta_t which ultimately lead to poor convergence. Identifying this is very important as by this I can attempt to do something (like using appropriate pre-conditioners etc ) to accelerate the solution. Can you advise me which properties of the sparse matrix do I actually need to look into.

Also any advice on some easy literature / books where I can get a good understanding on this would be highly appreciated. If this is not a suitable
forum for this can you please refer me to some other more appropriate forum
where I can get advice on mathematical issues like this. Thank you very much.
 

Status
Not open for further replies.

Similar threads

Part and Inventory Search

Welcome to EDABoard.com

Sponsor

Back
Top