Dissertation > Excellent graduate degree dissertation topics show

The Method for Solving Symmetric Circulant Pentadiagonal Systems of Linear Equations

Author: HongQuanXing
Tutor: LuLinZuo
School: Xiamen University
Course: Computational Mathematics
Keywords: Five pairs of angles Symmetric cycle Numerical experiments Fast Algorithm Linear Equations Structure Matrix Pursuit method Computational problems Xiamen University Sparse matrix
CLC: O241.6
Type: Master's thesis
Year: 2009
Downloads: 92
Quote: 0
Read: Download Dissertation

Abstract


It is well known that many problems in engineering computation and practical application are the problem of matrix calculus in nature.As we all know,there are many issues in engineering computation and practical application that ultimately boil down to a matrix computation.And different applications will lead to some of the special sparse structure of the matrix computation.In the process of dealing with the sparse matrix structure of the matrix computation(for example,eigenvalue calculation,solving linear equations,and so on), if the matrix is small,usually the classic method is feasible(for example,LU decomposition,QR algorithm,etc.).However,in many practical applications,the matrices are large and sparser,or a system of linear equations need to calculate several times until to get a satisfactory result(for example,when iteration),which will get the large loss of real significance because of the cost of the classic algorithms.As a result,to design the rapid and stable numerical algorithm by making use of some of their structure according to these sparse matrix structure features will be of great significance.Some researchers proposed an effective way to solve real symmetric tridiagonal cycle of linear equations,the article introduces a new stable and effective way to solve real symmetric pentadiagonal circulant of linear equations.Our method apply the LU decomposition,and its computing complexity is 0(n).The method has more advantages in the cost of calculating and storage than Gauss elimination.Theory and numerical experiments show that our algorithm is effective.In the first chapter,we briefly introduced the research significance to solve real symmetric pentadiagonal circulant of linear equations,structure of the article,as well as the lemma of the article.In the second chapter,we explore with the three parameters of linear equations of the solution,and analyze the different situations.In the third chapter,we use the results of the second chapter and the Woodbury formula to put forward the way of solving five TOEPLITZ angle symmetric linear equations.In the forth Chapter,we proposed a way to solve the pentadiagonal circulant symmetry of linear equations by using the lemma Woodbury formula.In the fifth Chapter,through using the optimal LU decomposition,numerical experiments show that this is an effective and stable algorithm.Compared with other methods,our method of solution in the circulation system of linear equations has a larger advantage.

Related Dissertations

  1. Design of Fast Template Matching Algorithm Based on Hartley Transform,TP391.41
  2. SURF algorithm based on improved electronic image stabilization technology,TP391.41
  3. Based on differential equations laser resonator mode Fast Algorithm and Its Application,TN248
  4. Analyzing for Couping Feature and Optimization for the Complex Product Configuration Model and Its Application in High-End CNC Industry,TG659
  5. GPU-based acceleration techniques EDA,TP391.41
  6. DISPLACEMENT representation of the inverse of the matrix of BlOCK TOEPLITZ,O151.21
  7. The Theory of Generalized Permutation Circulant Matrix,O151.21
  8. Research on Key Technologies on Intelligent CAD Platform of Feedwater Heaters for Power Plant,TP391.72
  9. Methodology of Process Planning of Collaborative Product Development,TB497
  10. Research on Accelerating Krylov Subspace Method with GPU,TP391.41
  11. Collaborative Product Development Process Management of Optoelectronic Enterprises Supporting Process Optimization,F273.2
  12. The Calculation of Heimitian Toeplitz Matrix-vector Product,O241.6
  13. Smoothing Newton Method for Nonlinear Programming Problem and SQP-Filter Method for Constrained Minimax Problem,O221.2
  14. Evaluation of the level of the building of a resource-saving and environment-friendly enterprises,F425;X322
  15. Process Management Technology Research with Unforced Decoupling and Adaptive Granularity Control on Product Concurrent Development,TB497
  16. Design and implementation of pretreatment system based on the long-haul design structure matrix,TP311.52
  17. Digital Phase-locked Detection System Based on FPGA,TN911.8
  18. Design and Implementation of Out-of-core Parallel Solution of Linear Equations,O241.6
  19. Properties of One Kind of Linear Equations Over Finite Fields,O241.6
  20. The Study of Preconditioning Interative Methods for Large Sparse linear Systems,O241.6
  21. Optimization and Realization for Sparse Matrix-Vector Multiplication on FPGA,TP332

CLC: > Mathematical sciences and chemical > Mathematics > Computational Mathematics > Numerical Analysis > Linear algebra method of calculating
© 2012 www.DissertationTopic.Net  Mobile